• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • 1
  • Tagged with
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Resilience Routing in AdHoc Networks. A decision based routing tree mechanism that can establish routes in adhoc network, which may than be configured into logical dual ring. Also a system is proposed to embed the QoS mechanisms, resilience and reliability features from RPR.

Khan, Tehmina Karamat January 2008 (has links)
As the number of people using wireless networks is increasing, the need to reduce the vulnerability of wireless networks from node or link failures that cause loss of data is becoming a priority. Also the present techniques and topologies used for wireless networking are not sufficient to handle the traffic load even if we solve the issues of reliability and resilience. Packet loss or delay is increasingly likely due to the increase in the number of packets as technology is evolving and more video and voice packets along with the data packets are being transmitted. Only the efficient and intelligent use of the shared medium can solve the problem and help in avoiding the collision or delay among the packets using a newly proposed intelligent topology. Wireless technology offers the potential to replace wires from many applications, particularly for the rapid deployment of networks for permanent or temporary use. Fiber_ optic metropolitan area networks (WAN) provide security and resilience. A target of the research was to match this in the wireless environment. This research investigates the suitability if using wireless technology for the establishment of a MAN by adding features to enhance resilience. We proposed a mechanism that may be rapidly deployed and provide automatic configuration. Research work and simulation design has been used to develop a new wireless network topology for an efficient and intelligent packet transmission by identifying reliable routes. This novel idea will help give wireless as well as mobile technology a clear edge over wired technology, not only in the case of mobility but also in the case of security of data and other services. A decision based routing tree mechanism has been developed, that can establish routes in an ad-hoc network which may than be configured into a logical dual ring. At the same time the proposed system proposes to embed the quality of service mechanisms, resilience, and reliability features from RPR. The simulations were created using Microsoft Visual Studio.Net for the Decision based routing algorithm. The results were compared with an existing LAR algorithm. We have obtained 95% confidence intervals on all the performance analysis results to indicate accuracy.
2

Approches cross-layer pour l'optimisation de la latence des communications dans les réseaux de capteurs sans fil / Approches cross-layer pour l’optimisation de la latence des communications dans les réseaux de capteurs sans fil

Louail, Lemia 09 December 2016 (has links)
Pour assurer les communications dans un réseau de capteurs sans fil, les capteurs utilisent un modèle simplifié de protocoles en couches inspiré du modèle OSI. Ce modèle comporte cinq couches, chaque couche devant assurer des fonctionnalités indépendantes et particulières. Nous nous intéressons à deux couches qui sont impliquées directement dans les décisions assurant les communications, la couche Liaison de données dans laquelle le protocole MAC assure la coordination des communications entre voisins directs, et la couche Réseau dans laquelle le protocole de routage est responsable de trouver une route entre un émetteur et un récepteur. Chacune des deux couches vise à améliorer certaines métriques, comme la latence, mais les décisions incohérentes venant de différents protocoles peuvent ne pas le permettre. Par conséquent, les décisions spatiales du protocole de routage et les décisions temporelles du protocole MAC doivent être corrélées pour optimiser la latence des communications. Les protocoles cross-layer résolvent ce problème soit en assurant des communications entre des protocoles des deux couches, soit en combinant les deux couches en une nouvelle couche. Dans ce contexte, cette thèse étudie les protocoles cross-layer existants entre MAC et routage et propose de nouvelles approches ayant comme but de minimiser la latence des communications. Dans un premier temps, nous avons proposé un protocole de routage qui utilise des informations du protocole MAC qu’est un TDMA pour trouver un chemin entre le noeud qui capte les données et la station de base tout en minimisant la latence des communications [1]. Ensuite, nous nous sommes intéressés au cas inverse, i.e. des approches MAC qui utilisent des informations de routage pour établir des ordonnancements TDMA de communication pour les nœuds du réseau, ces ordonnancements visant toujours à optimiser la latence des communications [2, 3, 5].Enfin, dans [4], nous avons proposé une approche qui combine un protocole MAC et un protocole de routage en un seul protocole. / Traditionally, in Wireless Sensor Networks, protocols are designed independently in the layered protocol stack, and metrics involved in several layers can be affected. Communication latency is one metric example, impacted by both the routing protocol in the network layer and the MAC protocol in the data link layer. Cross-layer protocols are known to be more efficient when exploiting the dependencies between these layers.In this context, and aiming to minimize the communication latency, we propose different cross-layer approaches concerning routing trees and TDMA schedules. First, we propose a routing approach using information of the TDMA schedule. Then, we propose different TDMA scheduling approaches which use information of the routing tree. Finally, we propose an approach that combines MAC and routing to produce a routing tree and a TDMA schedule simultaneously. Extensive simulations have shown better results of our contributions compared to the state of the art in terms of latency. Other metrics such as the energy consumption, the duty cycle of the nodes and the number of hops in the routing paths were also considered during the evaluation of our contributions.

Page generated in 0.0749 seconds