Lightweight deployment-aware scheduling for wireless sensor networks

  • Authors:

  • Kui Wu;Yong Gao;Fulu Li;Yang Xiao

  • Affiliations:

  • Computer Science Department, University of Victoria, BC, Canada;Irving K. Barber School of Arts and Sciences, UBC-Okanagan, BC, Canada;The Media Laboratory, M.I.T., Cambridge, MA;Computer Science Department, The University of Memphis, Memphis, TN

  • Venue:
  • Mobile Networks and Applications
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.