Performance Review of Selected Topology-Aware Routing Strategies for Clustering Sensor Networks

In this paper, cluster-based routing (CBR) protocols for addressing issues pertinent to energy consumption, network lifespan, resource allocation and network coverage are reviewed. The paper presents an indepth  performance analysis and critical review of selected CBR algorithms. The study is domain-specific and simulation-based with emphasis on the tripartite trade-off between coverage, connectivity and lifespan. The rigorous statistical analysis of selected CBR schemes was also presented. Network simulation was conducted with Java-based Atarraya discrete-event simulation toolkit while statistical analysis was carried out using MATLAB. It was observed that the Periodic, Event-Driven and Query-Based Routing (PEQ) schemes performs better than Low-Energy Adaptive Clustering Hierarchy (LEACH), Threshold-Sensitive Energy-Efficient Sensor Network (TEEN) and Geographic Adaptive Fidelity (GAF) in terms of network lifespan, energy consumption and network throughput.Keywords: Wireless sensor network, Hierarchical topologies, Cluster-based routing, Statistical analysis, Network simulatio

An Energy Model Using Sleeping Algorithms for Wireless Sensor Networks under Proactive and Reactive Protocols: A Performance Evaluation

The continuous evolution of the Internet of Things (IoT) makes it possible to connect everyday objects to networks in order to monitor physical and environmental conditions, which is made possible due to wireless sensor networks (WSN) that enable the transfer of data. However, it has also brought about many challenges that need to be addressed, such as excess energy consumption. Accordingly, this paper presents and analyzes wireless network energy models using five different communication protocols: Ad Hoc On-Demand Distance Vector (AODV), Multi-Parent Hierarchical (MPH), Dynamic Source Routing (DSR), Low Energy Adaptive Clustering Hierarchy (LEACH) and Zigbee Tree Routing (ZTR). First, a series of metrics are defined to establish a comparison and determine which protocol exhibits the best energy consumption performance. Then, simulations are performed and the results are compared with real scenarios. The energy analysis is conducted with three proposed sleeping algorithms: Modified Sleeping Crown (MSC), Timer Sleeping Algorithm (TSA), and Local Energy Information (LEI). Thereafter, the proposed algorithms are compared by virtue of two widely used wireless technologies, namely Zigbee and WiFi. Indeed, the results suggest that Zigbee has a better energy performance than WiFi, but less redundancy in the topology links, and this study favors the analysis with the simulation of protocols with different nature. The tested scenario is implemented into a university campus to show a real network running

Enhanced Clustering Routing Protocol for Power-Efficient Gathering in Wireless Sensor Network

Wireless sensor network (WSN) is a new and fast advancing technology, which is opening up many opportunities in the field of remote sensing and data monitoring. In spite of the numerous applications of WSN, issues related to determining a suitable and accurate radio model that will foster energy conservation in the network limit the performance of WSN routing protocols. A number of radio models have been proposed to address this issue. However, the underlying assumptions and inaccurate configuration of these radio models make them impractical and often lead to mismanagement of scarce energy and computational resources. This paper addresses this problem by proposing an enhanced radio model that adapts to the frequent changes in the location of the sensor nodes and is robust enough to report reliable data to the base station despite fluctuations due to interference. The impact of incorporating stepwise energy level and specialized data transmission schemes in the proposed radio model is also investigated in this paper. The performance of the proposed radio model is evaluated using OMNET++ and MATLAB and the results obtained is benchmarked against PEGASIS. It is shown by simulation that the novel LEACH-IMP performs better with respect to energy consumption, number of links faults, number of packets received, signal attenuation, and network lifetime

A study into prolonging Wireless Sensor Network lifetime during disaster scenarios

A Wireless Sensor Network (WSN) has wide potential for many applications. It can be employed for normal monitoring applications, for example, the monitoring of environmental conditions such as temperature, humidity, light intensity and pressure. A WSN is deployed in an area to sense these environmental conditions and send information about them to a sink. In certain locations, disasters such as forest fires, floods, volcanic eruptions and earth-quakes can happen in the monitoring area. During the disaster, the events being monitored have the potential to destroy the sensing devices; for example, they can be sunk in a flood, burnt in a fire, damaged in harmful chemicals, and burnt in volcano lava etc. There is an opportunity to exploit the energy of these nodes before they are totally destroyed to save the energy of the other nodes in the safe area. This can prolong WSN lifetime during the critical phase. In order to investigate this idea, this research proposes a new routing protocol called Maximise Unsafe Path (MUP) routing using Ipv6 over Low power Wireless Personal Area Networks (6LoWPAN). The routing protocol aims to exploit the energy of the nodes that are going to be destroyed soon due to the environment, by concentrating packets through these nodes. MUP adapts with the environmental conditions. This is achieved by classifying four different levels of threat based on the sensor reading information and neighbour node condition, and represents this as the node health status, which is included as one parameter in the routing decision. High priority is given to a node in an unsafe condition compared to another node in a safer condition. MUP does not allow packet routing through a node that is almost failed in order to avoid packet loss when the node fails. To avoid the energy wastage caused by selecting a route that requires a higher energy cost to deliver a packet to the sink, MUP always forwards packets through a node that has the minimum total path cost. MUP is designed as an extension of RPL, an Internet Engineering Task Force (IETF) standard routing protocol in a WSN, and is implemented in the Contiki Operating System (OS). The performance of MUP is evaluated using simulations and test-bed experiments. The results demonstrate that MUP provides a longer network lifetime during a critical phase of typically about 20\% when compared to RPL, but with a trade-off lower packet delivery ratio and end-to-end delay performances. This network lifetime improvement is crucial for the WSN to operate for as long as possible to detect and monitor the environment during a critical phase in order to save human life, minimise loss of property and save wildlife

Recent Advances in Wireless Communications and Networks

This book focuses on the current hottest issues from the lowest layers to the upper layers of wireless communication networks and provides "real-time" research progress on these issues. The authors have made every effort to systematically organize the information on these topics to make it easily accessible to readers of any level. This book also maintains the balance between current research results and their theoretical support. In this book, a variety of novel techniques in wireless communications and networks are investigated. The authors attempt to present these topics in detail. Insightful and reader-friendly descriptions are presented to nourish readers of any level, from practicing and knowledgeable communication engineers to beginning or professional researchers. All interested readers can easily find noteworthy materials in much greater detail than in previous publications and in the references cited in these chapters

Utilisation de l'échantillonnage compressif pour la détection des véhicules par un réseau de capteurs sans fil

Une nouvelle technique pour étudier le trafic routier, est la détection des véhicules par un réseau de capteurs sans fil installés dans la chaussée. Cette technologie se distingue de la plupart des systèmes classiques de détection de véhicules par son faible coût, son niveau élevé de flexibilité dans la configuration, sa multifonctionnalité par l'ajout d'autres modalités de détection et sa capacité à transmettre les informations via un réseau sans fil. Cependant, quand un capteur sans fil effectue l'acquisition du signal de champ magnétique terrestre dans l'optique de détecter le passage des véhicules, il l'échantillonne à une certaine fréquence, afin de ne pas rater le passage d'un véhicule. Lorsque la séquence de mesure dure plusieurs heures et qu'on a des dizaines ou des centaines de capteurs sans fil installés dans la chaussée, on se retrouve rapidement avec des données à stocker et à traiter qui peuvent être de taille importante. En outre, les communications sans fil de ces données sont très coûteuses en énergie et réduisent ainsi la durée de vie du capteur sans fil qui dispose des ressources limitées en énergie. Le compressive sensing (échantillonnage compressif), nouvelle méthode d'échantillonnage des signaux, tente justement de donner des solutions à ces problèmes, en réduisant significativement le nombre de mesures nécessaires et en utilisant par la suite des algorithmes d'optimisation convexe pour reconstruire tout le signal sans trop de perte perceptuel [i.e. perceptuelle]. À travers des simulations effectuées sur des signaux enregistrés par les capteurs sans fil de la compagnie allemande Coalesenses , nous montrons dans ce projet de recherche que l'échantillonnage compressif peut contribuer à maximiser considérablement la durée de vie d'un réseau de capteurs sans fil