Improving sensor network robustness with multi-channel convergecast

Intenerg

CoReDac: Collision-Free Command-Response Data Collection

Intenerg

MAC protocols for wireless networks: Spatial-reuse and energy-efficiency

Master'sMASTER OF SCIENC

Congestion Avoidance Energy Efficient MAC Protocol for Wireless Sensor Networks

Wireless Sensor Network (WSNs) are generally energy-constrained and resource-constrained. When multiple simultaneous events occur in densely deployed WSNs, nodes near the base station can become congested, decreasing the network performance. Additionally, multiple nodes may sense an event leading to spatially-correlated contention, further increasing congestion. In order to mitigate the effects of congestion near the base station, an energy-efficient Media Access Control (MAC) protocol that can handle multiple simultaneous events and spatially-correlated contention is needed. Energy efficiency is important and can be achieved using duty cycles but they could degrade the network performance in terms of latency. Existing protocols either provide support for congestion near the base station or for managing spatially-correlated contention. To provide energy-efficiency while maintaining the networks performance under higher traffic load, we propose an energy-efficient congestion-aware MAC protocol. This protocol provides support for congestion near the base station and spatially-correlated contention by employing a traffic shaping approach to manage the arrival times of packets to the layers close to the base station. We implemented our protocol using the ns-2 simulator for evaluating its performance. Results show that our protocol has an improvement in the number of packets received at the base station while consuming less energy

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%

Convergecast with Unbounded Number of Channels

We consider a problem of minimum length scheduling for the conflict-free aggregation convergecast in wireless networks in a case when each element of a network uses its own frequency channel. This problem is equivalent to the well-known NP-hard problem of telephone broadcasting since only the conflicts between the children of the same parent are taken into account. We propose a new integer programming formulation and compare it with the known one by running the CPLEX software package. Based on the results of a numerical experiment, we concluded that our formulation is more preferable in practice to solve the considered problem by CPLEX than the known one. We also propose a novel heuristic algorithm, which is based on a genetic algorithm and a local search metaheuristic. The simulation results demonstrate the high quality of the proposed algorithm compared to the best known approaches

A Survey on Energy-Efficient Strategies in Static Wireless Sensor Networks

A comprehensive analysis on the energy-efficient strategy in static Wireless Sensor Networks (WSNs) that are not equipped with any energy harvesting modules is conducted in this article. First, a novel generic mathematical definition of Energy Efficiency (EE) is proposed, which takes the acquisition rate of valid data, the total energy consumption, and the network lifetime of WSNs into consideration simultaneously. To the best of our knowledge, this is the first time that the EE of WSNs is mathematically defined. The energy consumption characteristics of each individual sensor node and the whole network are expounded at length. Accordingly, the concepts concerning EE, namely the Energy-Efficient Means, the Energy-Efficient Tier, and the Energy-Efficient Perspective, are proposed. Subsequently, the relevant energy-efficient strategies proposed from 2002 to 2019 are tracked and reviewed. Specifically, they respectively are classified into five categories: the Energy-Efficient Media Access Control protocol, the Mobile Node Assistance Scheme, the Energy-Efficient Clustering Scheme, the Energy-Efficient Routing Scheme, and the Compressive Sensing--based Scheme. A detailed elaboration on both of the basic principle and the evolution of them is made. Finally, further analysis on the categories is made and the related conclusion is drawn. To be specific, the interdependence among them, the relationships between each of them, and the Energy-Efficient Means, the Energy-Efficient Tier, and the Energy-Efficient Perspective are analyzed in detail. In addition, the specific applicable scenarios for each of them and the relevant statistical analysis are detailed. The proportion and the number of citations for each category are illustrated by the statistical chart. In addition, the existing opportunities and challenges facing WSNs in the context of the new computing paradigm and the feasible direction concerning EE in the future are pointed out

IEEE 802.15.4e: a Survey

Several studies have highlighted that the IEEE 802.15.4 standard presents a number of limitations such as low reliability, unbounded packet delays and no protection against interference/fading, that prevent its adoption in applications with stringent requirements in terms of reliability and latency. Recently, the IEEE has released the 802.15.4e amendment that introduces a number of enhancements/modifications to the MAC layer of the original standard in order to overcome such limitations. In this paper we provide a clear and structured overview of all the new 802.15.4e mechanisms. After a general introduction to the 802.15.4e standard, we describe the details of the main 802.15.4e MAC behavior modes, namely Time Slotted Channel Hopping (TSCH), Deterministic and Synchronous Multi-channel Extension (DSME), and Low Latency Deterministic Network (LLDN). For each of them, we provide a detailed description and highlight the main features and possible application domains. Also, we survey the current literature and summarize open research issues

Edge-Computing-Based Channel Allocation for Deadline-Driven IoT Networks

Multichannel communication is an important means to improve the reliability of low-power Internet-of-Things (IoT) networks. Typically, data transmissions in IoT networks are often required to be delivered before a given deadline, making deadline-driven channel allocation an essential task. The existing works on time-division multiple access often fail to establish channel schedules to meet the deadline requirement, as they often assume that transmissions can be successful within one transmission slot. Besides, the allocation and link estimation incur considerable overhead for the IoT nodes. In this article, we propose an edge-based channel allocation (ECA) for unreliable IoT networks. In ECA, we explicitly consider the impact of allocation sequences and employ a recurrent-neural-network-based channel estimation scheme. We utilize link quality and retransmission opportunities to maximize the packet delivery ratio before deadline. The allocation algorithms are executed on edge servers such that: 1) the channel allocation can be updated more frequently to deal with the wireless dynamics; 2) the allocation results can be obtained in real time; and 3) channel estimation can be more accurate. Extensive evaluation results show that ECA can significantly improve the reliability of deadline-driven IoT networks