Lightweight Deployment-Aware Scheduling for Wireless Sensor Networks

Abstract

Abstract-Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain long network lifetime as well as sufficient sensing areas. To achieve this goal, a broadly-used method is to turn off redundant sensors. In this paper, the problem of estimating redundant sensing areas among neighbouring wireless sensors is analysed. We present simple methods to estimate the degree of redundancy without the knowledge of location or directional information. We also provide tight upper and lower bounds on the probability of complete redundancy and on the average partial redundancy. With random sensor deployment, our analysis shows that partial redundancy is more realistic for real applications, as complete redundancy is expensive, requiring up to 11 neighbouring sensors to provide a 90 percent chance of complete redundancy. Based on the analysis, we propose a scalable Lightweight Deployment-Aware Scheduling (LDAS) algorithm, which turns off redundant sensors without using accurate location information. Simulation study demonstrates that the LDAS algorithm can reduce network energy consumption and provide desired QoS requirement effectively.

Asynchronous multi-channel neighbour discovery for energy optimisation in wireless sensor networks

“…Industrial wireless sensor networks must not only be designed to handle the reliability and timeliness, but also need to extend the lifetime given the condition of the battery supply or other non-continuous power (Xiao, 2005;Xiao et al, 2004;Chen et al, 2006;Wang and Xiao, 2006;Wu et al, 2005).…”

Formal Analysis of a Scheduling Algorithm for Wireless Sensor Networks

“…Most of them take into account only one of the constraint i.e. coverage [1,34,36,38] or connectivity [5,35] but rarely both. Moreover, many works have studied different techniques to determine an eligibility rule for the activation of the next sub-network [26] and [30].…”

A New MAC Protocol for Moving Target in Distributed Wireless Sensor Networks

“…In recent researches, Traffic-Adaptive Medium Access protocol (TRAMA) [1] and WiseMAC protocol [2] solve node sleeping mechanism well and limit energy consumption of the node in a certain low value, but bring about a large packet loss rate after several mobile nodes being added into network. The Lightweight Deployment-Aware Scheduling (LDAS) algorithm proposed in [3] solves the problem of low coverage (including sensor coverage and communication coverage) which caused by nodes' sleeping mechanism; however, it doesn't have a mechanism to realize the reliable communication, so it doesn't accomplish dynamic communication between the different nodes. The Eavesdrop-And-Register (EAR) algorithm proposed in [4] which based on the Self-organizing Medium Access Control for Sensor networks (SMACS) algorithm can realize the reliable communication between mobile node and fixed node by depending on increasing the control head packets, but when adding the number of mobile nodes, it results in the packets collision with a high probability rate that leads to the node energy consumption much faster and it also doesn't guarantee high rate of coverage in the monitoring area.…”