Energy-Efficient Protocol for Deterministic and Probabilistic Coverage in Sensor Networks
Authors:
- 10 July 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 21 (5) , 579-593
Abstract
Various sensor types, e.g., temperature, humidity, and acoustic, sense physical phenomena in different ways, and thus, are expected to have different sensing models. Even for the same sensor type, the sensing model may need to be changed in different environments. Designing and testing a different coverage protocol for each sensing model is indeed a costly task. To address this challenging task, we propose a new probabilistic coverage protocol (denoted by PCP) that could employ different sensing models. We show that PCP works with the common disk sensing model as well as probabilistic sensing models, with minimal changes. We analyze the complexity of PCP and prove its correctness. In addition, we conduct an extensive simulation study of large-scale sensor networks to rigorously evaluate PCP and compare it against other deterministic and probabilistic protocols in the literature. Our simulation demonstrates that PCP is robust, and it can function correctly in presence of random node failures, inaccuracies in node locations, and imperfect time synchronization of nodes. Our comparisons with other protocols indicate that PCP outperforms them in several aspects, including number of activated sensors, total energy consumed, and network lifetime.Keywords
This publication has 34 references indexed in Scilit:
- Energy-efficient coverage problems in wireless ad-hoc sensor networksComputer Communications, 2006
- Maintaining Sensing Coverage and Connectivity in Large Sensor Networks2005
- A Distributed Coverage- and Connectivity-Centric Technique for Selecting Active Nodes in Wireless Sensor NetworksIEEE Transactions on Computers, 2005
- Determining active sensor nodes for complete coverage without location informationInternational Journal of Ad Hoc and Ubiquitous Computing, 2005
- Probabilistic coverage in wireless sensor networks2005
- Sensor deployment and target localization in distributed sensor networksACM Transactions on Embedded Computing Systems, 2004
- Location and calculation-free node-scheduling schemes in large wireless sensor networksAd Hoc Networks, 2004
- Coverage problems in wireless ad-hoc sensor networks2002
- A coverage-preserving node scheduling scheme for large wireless sensor networks2002
- Dynamic fine-grained localization in Ad-Hoc networks of sensors2001