Bounds on contention management in radio networks

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2013.Cataloged from PDF version of thesis.Includes bibliographical references (p. 79-82).In this thesis, we study the local broadcast problem in two well-studied wireless network models. The local broadcast problem is a theoretical approach for capturing the contention management issue in wireless networks; it assumes that processes are provided messages, one by one, that must be delivered to their neighbors. We study this problem in two theoretical models of wireless networks, the classical radio network model and its more recent generalization, the dual graph model which includes the possibility of unreliable time-changing links. Both these models are synchronous; the execution proceeds in lock-step rounds and in each round, each node either transmits a message or listens. In each round of the dual graph model, each unreliable link might be active or inactive, whereas in the classical model, all the links are always active. In each round, each node receives a message if and only if it is listening and exactly one of its neighbors, with respect to the the active links of that round, transmits. The time complexity of the local broadcast algorithms is measured by two bounds, the acknowledgment bound and the progress bound. Roughly speaking, the former bounds the time it takes each broadcasting node to deliver its message to all its neighbors and the latter bounds the time it takes a node to receive at least one message, assuming it has a broadcasting neighbor. Typically these bounds depend on the maximum contention and the network size. The standard local broadcast strategy is the Decay protocol introduced by Bar-Yehuda et al. [19] in 1987. During the 25-years period in which this strategy has been used, it has remained an open question whether it is optimal. In this paper, we resolve this long-standing question. We present lower bounds on progress and acknowledgment bounds in both the classical and the dual graph model and we show that, with a slight optimization, the Decay protocol matches these lower bounds in both models. However, the tight progress bound of the dual graph model is exponentially larger than the progress bound in the classical model, in its dependence on the maximum contention. This establishes a separation between the two models, proving that progress in the dual graph model is strictly and exponentially harder than its classical predecessor. Combined, our results provide an essentially complete characterization of the local broadcast problem in these two important models.by Mohsen Ghaffari.S.M

Computer Science 2019 APR Self-Study & Documents

UNM Computer Science APR self-study report and review team report for Spring 2019, fulfilling requirements of the Higher Learning Commission

DESIGN OF MOBILE DATA COLLECTOR BASED CLUSTERING ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKS

Wireless Sensor Networks (WSNs) consisting of hundreds or even thousands of nodes, canbe used for a multitude of applications such as warfare intelligence or to monitor the environment. A typical WSN node has a limited and usually an irreplaceable power source and the efficient use of the available power is of utmost importance to ensure maximum lifetime of eachWSNapplication. Each of the nodes needs to transmit and communicate sensed data to an aggregation point for use by higher layer systems. Data and message transmission among nodes collectively consume the largest amount of energy available in WSNs. The network routing protocols ensure that every message reaches thedestination and has a direct impact on the amount of transmissions to deliver messages successfully. To this end, the transmission protocol within the WSNs should be scalable, adaptable and optimized to consume the least possible amount of energy to suite different network architectures and application domains. The inclusion of mobile nodes in the WSNs deployment proves to be detrimental to protocol performance in terms of nodes energy efficiency and reliable message delivery. This thesis which proposes a novel Mobile Data Collector based clustering routing protocol for WSNs is designed that combines cluster based hierarchical architecture and utilizes three-tier multi-hop routing strategy between cluster heads to base station by the help of Mobile Data Collector (MDC) for inter-cluster communication. In addition, a Mobile Data Collector based routing protocol is compared with Low Energy Adaptive Clustering Hierarchy and A Novel Application Specific Network Protocol for Wireless Sensor Networks routing protocol. The protocol is designed with the following in mind: minimize the energy consumption of sensor nodes, resolve communication holes issues, maintain data reliability, finally reach tradeoff between energy efficiency and latency in terms of End-to-End, and channel access delays. Simulation results have shown that the Mobile Data Collector based clustering routing protocol for WSNs could be easily implemented in environmental applications where energy efficiency of sensor nodes, network lifetime and data reliability are major concerns

Hierarchical Routing in Low-Power Wireless Networks

Steen, M.R. van [Promotor

DESIGN OF MOBILE DATA COLLECTOR BASED CLUSTERING ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKS

Wireless Sensor Networks (WSNs) consisting of hundreds or even thousands of nodes, canbe used for a multitude of applications such as warfare intelligence or to monitor the environment. A typical WSN node has a limited and usually an irreplaceable power source and the efficient use of the available power is of utmost importance to ensure maximum lifetime of eachWSNapplication. Each of the nodes needs to transmit and communicate sensed data to an aggregation point for use by higher layer systems. Data and message transmission among nodes collectively consume the largest amount of energy available in WSNs. The network routing protocols ensure that every message reaches thedestination and has a direct impact on the amount of transmissions to deliver messages successfully. To this end, the transmission protocol within the WSNs should be scalable, adaptable and optimized to consume the least possible amount of energy to suite different network architectures and application domains. The inclusion of mobile nodes in the WSNs deployment proves to be detrimental to protocol performance in terms of nodes energy efficiency and reliable message delivery. This thesis which proposes a novel Mobile Data Collector based clustering routing protocol for WSNs is designed that combines cluster based hierarchical architecture and utilizes three-tier multi-hop routing strategy between cluster heads to base station by the help of Mobile Data Collector (MDC) for inter-cluster communication. In addition, a Mobile Data Collector based routing protocol is compared with Low Energy Adaptive Clustering Hierarchy and A Novel Application Specific Network Protocol for Wireless Sensor Networks routing protocol. The protocol is designed with the following in mind: minimize the energy consumption of sensor nodes, resolve communication holes issues, maintain data reliability, finally reach tradeoff between energy efficiency and latency in terms of End-to-End, and channel access delays. Simulation results have shown that the Mobile Data Collector based clustering routing protocol for WSNs could be easily implemented in environmental applications where energy efficiency of sensor nodes, network lifetime and data reliability are major concerns

Étude d'un réseau de capteur UWB pour la localisation et la communication dans un environnement minier

Le jour n'est peut-être pas très loin où une mine pourra compter sur un système de communication sans fil pour échanger des données, transmettre des informations ou localiser des travailleurs dans le cas d'une activité normale ou en cas d'urgence. Au point de vue de la sécurité, un système de communications sans fil aurait l'avantage de localiser en temps réel un travailleur ou un engin. Les travailleurs se déplacent sans cesse dans une mine. Avec une technologie sans fil permanente, on pourrait localiser les personnes de manière relativement précise. Même en cas d'éboulement, avec une technologie adaptée, il serait possible de savoir où se trouve la personne en détresse. Notre travail de recherche s'inscrit dans la perspective du développement d'un réseau de capteurs ultra large bande (UWB) pour deux applications : l'aide à la radiolocalisation et l'extension du réseau de capteurs sans fil dans la mine. Cette étude est focalisée sur trois aspects. La première partie de notre étude consiste à étudier tous les problèmes reliés à la radiolocalisation dans la mine. Vue l'importance de cette application, nous avons mis en oeuvre un réseau de capteurs en tenant compte d'un futur déploiement dans la mine. La technologie utilisée repose sur la technologie ultra large bande. Comme il n'existe pas de travaux qui traitent ce genre de problèmes, nous avons commencé notre étude par une caractérisation du canal UWB dans les mines souterraines. Pour atteindre ces objectifs, plusieurs campagnes de mesure sur site (mine expérimentale) ont été menées. Nous sommes parvenus à une modélisation du canal de propagation et à avancer des recommandations pour aider au dimensionnement d'un réseau de capteurs dans ce type d'environnement. Dans la première partie, le but est d'étudier le problème de radiolocalisation avec les réseaux de capteurs. Notre scénario proposé serait de placer des capteurs sur chaque agent (mineur, engin). On suppose que chaque noeud (agent) qui circule à travers un réseau d'ancre maillé (déjà déployé), va extraire des informations de distance (en utilisant le critère de temps d'arrivée), ensuite il va utiliser un algorithme de positionnement distribué afin de déterminer sa propre position. Lors de cette partie nous avons aussi étudié quelques estimateurs cohérents et non-cohérents du temps d'arrivée. La caractérisation de l'erreur de mesure utilisant le temps d'arrivée dans un environnement minier a été aussi évaluée. Enfin, dans la dernière partie, nous avons analysé par simulations un déploiement d'un réseau de capteurs UWB ad hoc dans la mine. Nous avons choisi d'adopter une approche théorique afin d'évaluer les performances de cette configuration. Une conception intercouche pour un routage optimal a été étudiée. Nous avons utilisé la couche physique/réseau afin de minimiser l'énergie consommée lors de l'acheminement du données