On Heterogeneous Neighbor Discovery in Wireless Sensor Networks

Neighbor discovery plays a crucial role in the formation of wireless sensor networks and mobile networks where the power of sensors (or mobile devices) is constrained. Due to the difficulty of clock synchronization, many asynchronous protocols based on wake-up scheduling have been developed over the years in order to enable timely neighbor discovery between neighboring sensors while saving energy. However, existing protocols are not fine-grained enough to support all heterogeneous battery duty cycles, which can lead to a more rapid deterioration of long-term battery health for those without support. Existing research can be broadly divided into two categories according to their neighbor-discovery techniques---the quorum based protocols and the co-primality based protocols.In this paper, we propose two neighbor discovery protocols, called Hedis and Todis, that optimize the duty cycle granularity of quorum and co-primality based protocols respectively, by enabling the finest-grained control of heterogeneous duty cycles. We compare the two optimal protocols via analytical and simulation results, which show that although the optimal co-primality based protocol (Todis) is simpler in its design, the optimal quorum based protocol (Hedis) has a better performance since it has a lower relative error rate and smaller discovery delay, while still allowing the sensor nodes to wake up at a more infrequent rate.Comment: Accepted by IEEE INFOCOM 201

Randomized neighbor discovery protocols with collision detection for static multi-hop wireless ad hoc networks

[EN] Neighbor discovery represents a first step after the deployment of wireless ad hoc networks, since the nodes that form them are equipped with limited-range radio transceivers, and they typically do not know their neighbors. In this paper two randomized neighbor discovery approaches, called CDH and CDPRR, based on collision detection for static multi-hop wireless ad hoc networks, are presented. Castalia 3.2 simulator has been used to compare our proposed protocols against two protocols chosen from the literature and used as reference: the PRR, and the Hello protocol. For the experiments, we chose five metrics: the neighbor discovery time, the number of discovered neighbors, the energy consumption, the throughput and the number of discovered neighbors versus packets sent ratio. According to the results obtained through simulation, we can conclude that our randomized proposals outperform both Hello and PRR protocols in the presence of collisions regarding all five metrics, for both one-hop and multi-hop scenarios. As novelty compared to the reference protocols, both proposals allow nodes to discover all their neighbors with probability 1, they are based on collision detection and know when to terminate the neighbor discovery process. Furthermore, qualitative comparisons of the existing protocols and the proposals are available in this paper. Moreover, CDPRR presents better results in terms of time, energy consumption and number of discovered neighbors versus packets sent ratio. We found that both proposals achieve to operate under more realistic assumptions. Furthermore, CDH does not need to know the number of nodes in the network.This work has been partially supported by the "Ministerio de Economia y Competitividad" in the "Programa Estatal de Fomento de la Investigacion Cientifica y Tecnica de Excelencia, Subprograma Estatal de Generacion de Conocimiento" within the project under Grant TIN2017-84802-C2-1-P. This work has also been partially supported by European Union through the ERANETMED (Euromediterranean Cooperation through ERANET joint activities and beyond) project ERANETMED3-227 SMARTWATIR.Sorribes, JV.; Peñalver Herrero, ML.; Tavares De Araujo Cesariny Calafate, CM.; Lloret, J. (2021). Randomized neighbor discovery protocols with collision detection for static multi-hop wireless ad hoc networks. Telecommunication Systems. 77(3):577-596. https://doi.org/10.1007/s11235-021-00763-457759677

Energy-aware Randomized Neighbor Discovery Protocol based on Collision Detection in Wireless Ad Hoc Networks

[EN] In wireless ad hoc networks, neighbor discovery is necessary as an initial step. In this work we present LECDH (Low Energy Collision Detection Hello), an energy-aware randomized handshake-based neighbor discovery protocol for static environments. We carried out simulations through Castalia 3.2 simulator and compared LECDH with an existing protocol EAH (Energy Aware Hello) used as reference. We conclude that the proposal outperforms the reference protocol both in one-hop and multi-hop environments in terms of Energy consumption, Discovery time, Number of discovered neighbors, Throughput, and Discoveries per packet sent, for high duty cycles. Moreover, for low number of nodes in LECDH, as the duty cycle is reduced the performance is better according to all 5 metrics in both environments. Overall, we found that our proposal follows more realistic assumptions and still allows nodes to succeed at discovering all their neighbors almost with probability 1. Moreover, a qualitative comparison of the reference solution and our proposal is included in this paper.This work has been partially supported by the "Ministerio de Economia y Competitividad" in the "Programa Estatal de Fomento de la Investigacion Cientifica y Tecnica de Excelencia, Subprograma Estatal de Generacion de Conocimiento" within the project under Grant TIN2017-84802-C2-1-P. This work has also been partially supported by European Union through the ERANETMED (Euromediterranean Cooperation through ERANET joint activities and beyond) project ERANETMED3-227 SMARTWATIR. This work has also been partially founded by the Universitat Politecnica de Valencia through the post-doctoral PAID-10-20 program.Sorribes, JV.; Peñalver Herrero, ML.; Jimenez, JM.; Sendra, S. (2022). Energy-aware Randomized Neighbor Discovery Protocol based on Collision Detection in Wireless Ad Hoc Networks. Mobile Networks and Applications (Online). 28:31-48. https://doi.org/10.1007/s11036-022-01995-731482

Collision Avoidance Based Neighbor Discovery in Ad Hoc Wireless Networks

[EN] Neighbor discovery is an important first step after the deployment of ad hoc wireless networks since they are a type of network that do not provide a communications infrastructure right after their deployment, the devices have radio transceivers which provide a limited transmission range, and there is a lack of knowledge of the potential neighbors. In this work two proposals to overcome the neighbor discovery in static one-hop environments in the presence of collisions, are presented. We performed simulations through Castalia 3.2, to compare the performance of the proposals against that for two protocols from the literature, i.e. PRR and Hello, and evaluate them according to six metrics. According to simulation results, the Leader-based proposal (O(N)) outperforms the other protocols in terms of neighbor discovery time, throughput, discoveries vs packets sent ratio, and packets received vs sent ratio, and the TDMA-based proposal is the slowest (O(N-2)) and presents the worst results regarding energy consumption, and discoveries vs packets sent ratio. However, both proposals follow a predetermined transmission schedule that allows them to discover all the neighbors with probability 1, and use a feedback mechanism. We also performed an analytical study for both proposals according to several metrics. Moreover, the Leader-based solution can only properly operate in one-hop environments, whereas the TDMA-based proposal is appropriate for its use in multi-hop environments.This work has been partially supported by the "Ministerio de Economia y Competitividad" in the "Programa Estatal de Fomento de la Investigacion Cientifica y Tecnica de Excelencia, Subprograma Estatal de Generacion de Conocimiento" within the project under Grant TIN2017-84802-C2-1-P. This work has also been partially supported by European Union through the ERANETMED (Euromediterranean Cooperation through ERANET joint activities and beyond) project ERANETMED3-227 SMARTWATIR.Sorribes, JV.; Peñalver Herrero, ML.; Lloret, J.; Tavares De Araujo Cesariny Calafate, CM. (2022). Collision Avoidance Based Neighbor Discovery in Ad Hoc Wireless Networks. Wireless Personal Communications. 125(2):987-1011. https://doi.org/10.1007/s11277-021-09091-x9871011125

Airborne Directional Networking: Topology Control Protocol Design

This research identifies and evaluates the impact of several architectural design choices in relation to airborne networking in contested environments related to autonomous topology control. Using simulation, we evaluate topology reconfiguration effectiveness using classical performance metrics for different point-to-point communication architectures. Our attention is focused on the design choices which have the greatest impact on reliability, scalability, and performance. In this work, we discuss the impact of several practical considerations of airborne networking in contested environments related to autonomous topology control modeling. Using simulation, we derive multiple classical performance metrics to evaluate topology reconfiguration effectiveness for different point-to-point communication architecture attributes for the purpose of qualifying protocol design elements

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%