Performance improvement in mobile ad-hoc networks.

The objective of this research is to enhance the network performance under realistic mobile ad-hoc networks environments without modification of the standard. Overview of this research is summarized as follows: First, a packet-fragmentation technique to improve network throughput under the worst channel conditions is proposed. While the conventional packet-fragmentation technique research focuses only on random-bit errors, the proposed technique employs both random bit errors and hidden-node collisions. The analytical models based on Markov-chain model shows that the optimal fragmentation technique can effectively reduce the number of retransmissions caused by both collisions from hidden nodes and corrupted packets by random bit errors, and eventually improving throughput in noisy VANETs channels. As a second contribution, a dynamic service-channel allocation (DSCA) scheme is proposed to maximize the network throughput by dynamically assigning different service channels to the users. The theoretical analysis in this thesis will consider wireless access in the vehicular environment (WAVE) protocol, which is the main characteristic of the vehicular ad-hoc networks standard (the IEEE 802.11p). To summarize, the main contribution of this research is that two schemes will improve the network throughput significantly without modification of the standard. Therefore, there is no implementation issue to deploy the proposed schemes in real devices.PhDCommittee Chair: Copeland, John; Committee Co-Chair: Chang, Yusun; Committee Member: Ammar, Mostafa; Committee Member: Beyah, Raheem; Committee Member: Owen, Henry; Committee Member: Taylor, Davi

Reliable Message Dissemination in Mobile Vehicular Networks

Les réseaux véhiculaires accueillent une multitude d’applications d’info-divertissement et de sécurité. Les applications de sécurité visent à améliorer la sécurité sur les routes (éviter les accidents), tandis que les applications d’info-divertissement visent à améliorer l'expérience des passagers. Les applications de sécurité ont des exigences rigides en termes de délais et de fiabilité ; en effet, la diffusion des messages d’urgence (envoyés par un véhicule/émetteur) devrait être fiable et rapide. Notons que, pour diffuser des informations sur une zone de taille plus grande que celle couverte par la portée de transmission d’un émetteur, il est nécessaire d’utiliser un mécanisme de transmission multi-sauts. De nombreuses approches ont été proposées pour assurer la fiabilité et le délai des dites applications. Toutefois, ces méthodes présentent plusieurs lacunes. Cette thèse, nous proposons trois contributions. La première contribution aborde la question de la diffusion fiable des messages d’urgence. A cet égard, un nouveau schéma, appelé REMD, a été proposé. Ce schéma utilise la répétition de message pour offrir une fiabilité garantie, à chaque saut, tout en assurant un court délai. REMD calcule un nombre optimal de répétitions en se basant sur l’estimation de la qualité de réception de lien dans plusieurs locations (appelées cellules) à l’intérieur de la zone couverte par la portée de transmission de l’émetteur. REMD suppose que les qualités de réception de lien des cellules adjacentes sont indépendantes. Il sélectionne, également, un nombre de véhicules, appelés relais, qui coopèrent dans le contexte de la répétition du message d’urgence pour assurer la fiabilité en multi-sauts. La deuxième contribution, appelée BCRB, vise à améliorer REMD ; elle suppose que les qualités de réception de lien des cellules adjacentes sont dépendantes ce qui est, généralement, plus réaliste. BCRB utilise les réseaux Bayésiens pour modéliser les dépendances en vue d’estimer la qualité du lien de réception avec une meilleure précision. La troisième contribution, appelée RICS, offre un accès fiable à Internet. RICS propose un modèle d’optimisation, avec une résolution exacte optimale à l'aide d’une technique de réduction de la dimension spatiale, pour le déploiement des passerelles. Chaque passerelle utilise BCRB pour établir une communication fiable avec les véhicules.Vehicular networks aim to enable a plethora of safety and infotainment applications. Safety applications aim to preserve people's lives (e.g., by helping in avoiding crashes) while infotainment applications focus on enhancing the passengers’ experience. These applications, especially safety applications, have stringent requirements in terms of reliability and delay; indeed, dissemination of an emergency message (e.g., by a vehicle/sender involved in a crash) should be reliable while satisfying short delay requirements. Note, that multi-hop dissemination is needed to reach all vehicles, in the target area, that may be outside the transmission range of the sender. Several schemes have been proposed to provide reliability and short delay for vehicular applications. However, these schemes have several limitations. Thus, the design of new solutions, to meet the requirement of vehicular applications in terms of reliability while keeping low end-to-end delay, is required. In this thesis, we propose three schemes. The first scheme is a multi-hop reliable emergency message dissemination scheme, called REMD, which guarantees a predefined reliability , using message repetitions/retransmissions, while satisfying short delay requirements. It computes an optimal number of repetitions based on the estimation of link reception quality at different locations (called cells) in the transmission range of the sender; REMD assumes that link reception qualities of adjacent cells are independent. It also adequately selects a number of vehicles, called forwarders, that cooperate in repeating the emergency message with the objective to satisfy multi-hop reliability requirements. The second scheme, called BCRB, overcomes the shortcoming of REMD by assuming that link reception qualities of adjacent cells are dependent which is more realistic in real-life scenarios. BCRB makes use of Bayesian networks to model these dependencies; this allows for more accurate estimation of link reception qualities leading to better performance of BCRB. The third scheme, called RICS, provides internet access to vehicles by establishing multi-hop reliable paths to gateways. In RICS, the gateway placement is modeled as a k-center optimisation problem. A space dimension reduction technique is used to solve the problem in exact time. Each gateway makes use of BCRB to establish reliable communication paths to vehicles

Improving the performance of wireless sensor networks using directional antennas

Over the last decades, lots of new applications have emerged thanks to the availability of small devices capable of wireless communications that form Wireless Sensor Networks (WSNs). These devices allow sensing, processing, and communication of multiple physical variables while keeping a low power consumption. During the last years, most of the research efforts were spent on the development and optimization of wireless communication protocols, aiming to maximize the reliability of the network while achieving the lowest possible power consumption. In this thesis, we study how to improve the performance of these WSNs by using directional antennas. Directional antennas can provide a higher gain and reduce the interference with other nodes by concentrating the radiated power in a certain direction. We present the different kinds of directional antennas available for WSNs, and we select the 6-element SPIDA antenna as a case of study. We present an electromagnetic model of this antenna, and we incorporate it into the COOJA network simulator. We report the first complete characterization of this antenna, including the radiation pattern and S11 parameters. The characterization shows that the antenna has a maximum gain of 6.8 dBi, a Half-Power Beamwidth (HPBW) of 113° and a module of S11 parameter of -7.5 dB at the central frequency (fc = 2.4525 GHz). We also present a novel way to optimize the antenna without changing its design by isolating multiple director elements. We show that with this technique, the performance of the antenna can be improved in terms of maximum gain, narrower HPBW, and a lower module of the S11 parameter without making any changes in the antenna itself. We evaluate the impact of supporting directional communications in the different layers of the network stack. We analyze the different challenges that arise and propose optimizations to overcome them in order to take advantage of the benefits of directional communication. We present an analysis of the state-of-the-art in neighbor discovery protocols for WSNs with directional antennas, and we propose, implement end evaluate two novel fully directional protocols: Q-SAND and DANDi. We compare both of them with SAND, a fully directional neighbor discovery protocol. DANDi is a fully directional asynchronous and dynamic neighbor discovery protocol where the contention resolution relies on a collision detection mechanism. To the best of our knowledge, DANDi is the fastest neighbor discovery protocol for WSN with directional antennas, with the additional advantage of being able to discover every reliable communication link in a network without requiring any prior information of the network topology. We combine the directional neighbor discovery protocol with MAC and routing optimizations in order fully take advantage of the benefits of using directional antennas. We focus on convergecast, a typical data collection application where every node sends packets periodically to a sink node. We present DirMAC, a novel MAC protocol that fully supports directional communication, together with four different heuristics to optimize the performance of the protocols. One of these heuristics has the added major benefit of being completely distributed and with no need for offline processing. Our evaluation shows that optimizations at both the MAC and routing layers are needed in order to reap the benefits of using directional antennas for convergecast. Our results show that the performance of the network can be greatly improved in terms of packet delivery rate, energy consumption, and energy per received packet, and that we obtain the largest performance improvements in networks with dense traffic. Simulations with different node densities show that when using directional antennas the PDR increases up to 29%, while energy consumption and energy per received packet decreases by up to 55% and 46% respectively. Experiments with real nodes validate these results showing a significant performance increase when using directional antennas in our scenarios, with a reduction in the RDC and EPRP of 25% and 15% respectively, while maintaining a PDR of 100%.Durante las últimas décadas, la disponibilidad de pequeños dispositivos con comunicación inalámbrica ha permitido el desarrollo de muchas nuevas aplicaciones. Estos dispositivos forman Redes de Sensores Inalámbricos (RSI, o WSN por sus siglas en inglés) que permiten sensar, procesar y comunicar datos provenientes de variables físicas, mientras que mantienen un bajo consumo energético. En los últimos años, la mayor parte de los esfuerzos de la comunidad científica estuvieron concentrados en el desarrollo y optimización de los protocolos de comunicación inalámbricos, buscando maximizar la confiabilidad de la red y minimizar el consumo energético. En esta tesis estudiamos cómo mejorar el rendimiento de las RSI usando antenas direccionales. Las antenas direccionales pueden proporcionar una mayor ganancia y reducir la interferencia con otros nodos al concentrar la potencia radiada en una cierta dirección. Comenzamos presentando los distintos tipos de antenas direccionales disponibles para las RSI, y seleccionamos la antena SPIDA de 6 elementos como caso de estudio. Luego presentamos un modelo electromagnético de la antena, que incorporamos al simulador de red COOJA. Construimos un primer prototipo con el que realizamos la primera caracterización completa de ésta antena, incluyendo el patrón de radiación y el parámetro S11. La caracterización muestra que la antena tiene una ganancia máxima de 6,8 dBi, un ancho de haz a mitad de potencia (HPBW por sus siglas en inglés) de 113° y un módulo del parámetro S11 de -7,5 dB en la frecuencia central (fc = 2,4525 GHz). También mostramos una forma innovadora de optimizar la antena sin cambiar su diseño utilizando varios elementos directores al mismo tiempo. Mostramos que con esta técnica se puede mejorar el rendimiento de la antena en términos de ganancia máxima, ancho de haz a mitad de potencia, y módulo del parámetro S11. Luego evaluamos el impacto de usar comunicaciones direccionales en las diferentes capas del stack de red. Analizamos los diferentes desafíos que surgen y proponemos optimizaciones para sortearlos. Presentamos un análisis del estado del arte en protocolos de descubrimiento de vecinos en RSI con antenas direccionales, y proponemos, implementamos y evaluamos dos protocolos direccionales : Q-SAND y DANDi. DANDi es un protocolo de descubrimiento de vecinos direccional, asíncrono y dinámico, donde la contienda por el canal se resuelve con un mecanismo basado en la detección de colisiones. Hasta donde sabemos, DANDi es el protocolo de descubrimiento de vecinos más rápido para RSI con antenas direccionales, con la ventaja adicional de que permite descubrir todos los enlaces de comunicación confiables de una red sin requerir ningún conocimiento previo de la topología. Luego combinamos los protocolos de descubrimiento de vecinos con optimizaciones en las capas de ruteo y acceso al medio para construir una aplicación de recolección de datos, donde cada nodo envía paquetes periódicamente a un nodo centralizador. Presentamos DirMAC, un protocolo de acceso al medio innovador que soporta comunicaciones direccionales, junto con cuatro heurísticas que permiten optimizar el rendimiento de los protocolos (una de ellas con la ventaja adicional que es totalmente distribuida). Los resultados muestran que usar antenas direccionales en este tipo de aplicaciones permite mejorar sustancialmente el rendimiento de la red, mostrando las mayores mejoras en redes con alto tráfico. Las simulaciones con diferentes densidades de nodos muestran que al usar antenas direccionales se puede aumentar el ratio de entrega de paquetes en hasta 29%, mientras que el consumo energético y la energía por paquete recibido bajan en hasta 55% y 46% respectivamente. Los experimentos en nodos reales validan estos resultados, mostrando una reducción en el consumo energético y en la energía por paquete recibido de 25% y 15% respectivamente, mientras que mantienen un ratio de entrega de paquetes de 100%

Congestion and medium access control in 6LoWPAN WSN

In computer networks, congestion is a condition in which one or more egressinterfaces are offered more packets than are forwarded at any given instant [1]. In wireless sensor networks, congestion can cause a number of problems including packet loss, lower throughput and poor energy efficiency. These problems can potentially result in a reduced deployment lifetime and underperforming applications. Moreover, idle radio listening is a major source of energy consumption therefore low-power wireless devices must keep their radio transceivers off to maximise their battery lifetime. In order to minimise energy consumption and thus maximise the lifetime of wireless sensor networks, the research community has made significant efforts towards power saving medium access control protocols with Radio Duty Cycling. However, careful study of previous work reveals that radio duty cycle schemes are often neglected during the design and evaluation of congestion control algorithms. This thesis argues that the presence (or lack) of radio duty cycle can drastically influence the performance of congestion control mechanisms. To investigate if previous findings regarding congestion control are still applicable in IPv6 over low power wireless personal area and duty cycling networks; some of the most commonly used congestion detection algorithms are evaluated through simulations. The research aims to develop duty cycle aware congestion control schemes for IPv6 over low power wireless personal area networks. The proposed schemes must be able to maximise the networks goodput, while minimising packet loss, energy consumption and packet delay. Two congestion control schemes, namely DCCC6 (Duty Cycle-Aware Congestion Control for 6LoWPAN Networks) and CADC (Congestion Aware Duty Cycle MAC) are proposed to realise this claim. DCCC6 performs congestion detection based on a dynamic buffer. When congestion occurs, parent nodes will inform the nodes contributing to congestion and rates will be readjusted based on a new rate adaptation scheme aiming for local fairness. The child notification procedure is decided by DCCC6 and will be different when the network is duty cycling. When the network is duty cycling the child notification will be made through unicast frames. On the contrary broadcast frames will be used for congestion notification when the network is not duty cycling. Simulation and test-bed experiments have shown that DCCC6 achieved higher goodput and lower packet loss than previous works. Moreover, simulations show that DCCC6 maintained low energy consumption, with average delay times while it achieved a high degree of fairness. CADC, uses a new mechanism for duty cycle adaptation that reacts quickly to changing traffic loads and patterns. CADC is the first dynamic duty cycle pro- tocol implemented in Contiki Operating system (OS) as well as one of the first schemes designed based on the arbitrary traffic characteristics of IPv6 wireless sensor networks. Furthermore, CADC is designed as a stand alone medium access control scheme and thus it can easily be transfered to any wireless sensor network architecture. Additionally, CADC does not require any time synchronisation algorithms to operate at the nodes and does not use any additional packets for the exchange of information between the nodes (For example no overhead). In this research, 10000 simulation experiments and 700 test-bed experiments have been conducted for the evaluation of CADC. These experiments demonstrate that CADC can successfully adapt its cycle based on traffic patterns in every traffic scenario. Moreover, CADC consistently achieved the lowest energy consumption, very low packet delay times and packet loss, while its goodput performance was better than other dynamic duty cycle protocols and similar to the highest goodput observed among static duty cycle configurations

Improving the Performance of Wireless LANs

This book quantifies the key factors of WLAN performance and describes methods for improvement. It provides theoretical background and empirical results for the optimum planning and deployment of indoor WLAN systems, explaining the fundamentals while supplying guidelines for design, modeling, and performance evaluation. It discusses environmental effects on WLAN systems, protocol redesign for routing and MAC, and traffic distribution; examines emerging and future network technologies; and includes radio propagation and site measurements, simulations for various network design scenarios, numerous illustrations, practical examples, and learning aids

Multipath routing and QoS provisioning in mobile ad hoc networks

PhDA Mobile Ad Hoc Networks (MANET) is a collection of mobile nodes that can communicate with each other using multihop wireless links without utilizing any fixed based-station infrastructure and centralized management. Each mobile node in the network acts as both a host generating flows or being destination of flows and a router forwarding flows directed to other nodes. Future applications of MANETs are expected to be based on all-IP architecture and be capable of carrying multitude real-time multimedia applications such as voice and video as well as data. It is very necessary for MANETs to have an efficient routing and quality of service (QoS) mechanism to support diverse applications. This thesis proposes an on-demand Node-Disjoint Multipath Routing protocol (NDMR) with low broadcast redundancy. Multipath routing allows the establishment of multiple paths between a single source and single destination node. It is also beneficial to avoid traffic congestion and frequent link breaks in communication because of the mobility of nodes. The important components of the protocol, such as path accumulation, decreasing routing overhead and selecting node-disjoint paths, are explained. Because the new protocol significantly reduces the total number of Route Request packets, this results in an increased delivery ratio, smaller end-to-end delays for data packets, lower control overhead and fewer collisions of packets. Although NDMR provides node-disjoint multipath routing with low route overhead in MANETs, it is only a best-effort routing approach, which is not enough to support QoS. DiffServ is a standard approach for a more scalable way to achieve QoS in any IP network and could potentially be used to provide QoS in MANETs because it minimises the need for signalling. However, one of the biggest drawbacks of DiffServ is that the QoS provisioning is separate from the routing process. This thesis presents a Multipath QoS Routing protocol for iv supporting DiffServ (MQRD), which combines the advantages of NDMR and DiffServ. The protocol can classify network traffic into different priority levels and apply priority scheduling and queuing management mechanisms to obtain QoS guarantees

Mobile Ad-Hoc Networks

Being infrastructure-less and without central administration control, wireless ad-hoc networking is playing a more and more important role in extending the coverage of traditional wireless infrastructure (cellular networks, wireless LAN, etc). This book includes state-of the-art techniques and solutions for wireless ad-hoc networks. It focuses on the following topics in ad-hoc networks: vehicular ad-hoc networks, security and caching, TCP in ad-hoc networks and emerging applications. It is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks

Mobile Ad Hoc Networks

Guiding readers through the basics of these rapidly emerging networks to more advanced concepts and future expectations, Mobile Ad hoc Networks: Current Status and Future Trends identifies and examines the most pressing research issues in Mobile Ad hoc Networks (MANETs). Containing the contributions of leading researchers, industry professionals, and academics, this forward-looking reference provides an authoritative perspective of the state of the art in MANETs. The book includes surveys of recent publications that investigate key areas of interest such as limited resources and the mobility of mobile nodes. It considers routing, multicast, energy, security, channel assignment, and ensuring quality of service. Also suitable as a text for graduate students, the book is organized into three sections: Fundamentals of MANET Modeling and Simulation—Describes how MANETs operate and perform through simulations and models Communication Protocols of MANETs—Presents cutting-edge research on key issues, including MAC layer issues and routing in high mobility Future Networks Inspired By MANETs—Tackles open research issues and emerging trends Illustrating the role MANETs are likely to play in future networks, this book supplies the foundation and insight you will need to make your own contributions to the field. It includes coverage of routing protocols, modeling and simulations tools, intelligent optimization techniques to multicriteria routing, security issues in FHAMIPv6, connecting moving smart objects to the Internet, underwater sensor networks, wireless mesh network architecture and protocols, adaptive routing provision using Bayesian inference, and adaptive flow control in transport layer using genetic algorithms