Exploring redundancy in sensor deployment to maximize network lifetime and coverage
- 1 June 2011
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Energy efficiency and fault tolerance are two important features required for sustained and reliable operations of wireless sensor networks deployed in unstructured environments. This paper investigates an approach to prolonging network lifetime and ensuring sensing reliability by organizing the sensors into several disjoint subsets, each of which takes shift to cover the entire region. This strategy is made possible by the enormous redundancy in large-scale sensor network applications where many small and inexpensive sensors are deployed to achieve quality through quantity. However, such energy savings through shift taking in time and fault tolerance via redundant coverage require an appropriate network partition in space: each on-duty subset must (i) cover the entire region, (ii) maintain its own connectivity, and (iii) cover every point with multiple sensors. Based on a general sensor network model, we formulate this problem as an NP-complete Connected M-SET k-Coverage problem. We rigorously derive a necessary and sufficient condition for checking the sensor coverage of a continuous two-dimensional space based on geometric reasoning, and analytically derive the upper bounds on both M and k for any given sensor network. We further propose a heuristic approach to this problem and evaluate its performance through extensive simulations.Keywords
This publication has 16 references indexed in Scilit:
- An Adaptive Localized Algorithm for Multiple Sensor Area Coverage21st International Conference on Advanced Networking and Applications (AINA '07), 2007
- Improved approximation algorithms for connected sensor coverWireless Networks, 2006
- Connected sensor cover: self-organization of sensor networks for efficient query executionIEEE/ACM Transactions on Networking, 2006
- Maintaining Sensing Coverage and Connectivity in Large Sensor NetworksPublished by Informa UK Limited ,2005
- Low-coordination topologies for redundancy in sensor networksPublished by Association for Computing Machinery (ACM) ,2005
- Connected K-coverage problem in sensor networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi DiagramsLecture Notes in Computer Science, 2005
- Set k-cover algorithms for energy efficient monitoring in wireless sensor networksPublished by Association for Computing Machinery (ACM) ,2004
- The coverage problem in a wireless sensor networkPublished by Association for Computing Machinery (ACM) ,2003
- Dynamic fine-grained localization in Ad-Hoc networks of sensorsPublished by Association for Computing Machinery (ACM) ,2001