A novel framework for energy-efficient data gathering with random coverage in wireless sensor networks
Authors:
Open Access
- 25 September 2012
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Sensor Networks
- Vol. 8 (4) , 1-30
Abstract
In wireless sensor networks, different applications feature different requirements in terms of such performance metrics as sensing coverage and data reporting latency. In most applications, it is usually sufficient to provide a Desired Sensing Coverage (DSC) lower than full coverage at any instance with the guarantee that the whole area will eventually be covered within a specified delay bound. Due to the fact that these applications are also expected to run for longer periods of time and at the same time battery recharging and replacement are costly, energy consumption in wireless sensor networks should be minimized while achieving the application goals. In this article, we propose a novel framework for application-specific data gathering which exploits a trade-off between coverage and latency, thereby minimizing energy consumption and extending the network lifetime. The proposed energy-efficient, constant-time, randomized scheme, called Coverage-Adaptive raNdom SEnsor sElection (CANSEE), selects a subset of k sensors to report at each round so as to fulfill the application-specific requirement of desired sensing coverage and bounded latency, instead of always guaranteeing full coverage and minimum latency. We present a probabilistic model to estimate: (i) the connectivity of those selected k sensors and the number of additional sensors needed to guarantee connectivity; (ii) a lower bound on k in each round; and (iii) the probability of almost surely having k data reporters using the Chernoff bound. The immediate event detection capability achieved by the proposed CANSEE scheme is also analyzed to compare the performance of our framework with other data gathering schemes that allow 100% coverage. Simulation results demonstrate that our framework leads to a significant conservation of energy (and thus extended network lifetime) with a small trade-off between coverage and data reporting latency, yet providing the required data reporting capability.Keywords
Funding Information
- Division of Information and Intelligent Systems (IIS-0326505, CNS-0916221, and CCF-0956438)
- Division of Computer and Network Systems (IIS-0326505, CNS-0916221, and CCF-0956438)
- Division of Computing and Communication Foundations (IIS-0326505, CNS-0916221, and CCF-0956438)
This publication has 32 references indexed in Scilit:
- Design and evaluation of a hybrid sensor network for cane toad monitoringACM Transactions on Sensor Networks, 2009
- Design and optimization of distributed sensing coverage in wireless sensor networksACM Transactions on Embedded Computing Systems, 2008
- Distributed protocols for ensuring both coverage and connectivity of a wireless sensor networkACM Transactions on Sensor Networks, 2007
- Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networksComputer Communications, 2006
- Integrated coverage and connectivity configuration for energy conservation in sensor networksACM Transactions on Sensor Networks, 2005
- ASCENT: adaptive self-configuring sensor networks topologiesIEEE Transactions on Mobile Computing, 2004
- Medium Access Control With Coordinated Adaptive Sleeping for Wireless Sensor NetworksIEEE/ACM Transactions on Networking, 2004
- An analytical model for information retrieval in wireless sensor networks using enhanced apteen protocolIEEE Transactions on Parallel and Distributed Systems, 2002
- A taxonomy of wireless micro-sensor network modelsACM SIGMOBILE Mobile Computing and Communications Review, 2002
- Wireless integrated network sensorsCommunications of the ACM, 2000