Abstract
Wireless sensor networks have recently posed many new system building challenges. One of the main problems is energy conservation since most of the sensors are devices with limited battery life and it is infeasible to replenish energy via replacing batteries. An effective approach for energy conservation is scheduling sleep intervals for some sensors, while the remaining sensors stay active providing continuous service. In this paper we consider the problem of selecting a set of active sensors of minimum cardinality so that sensing coverage and network connectivity are maintained. We show that the greedy algorithm that provides complete coverage has an approximation factor no better than Ω(log n), where n is the number of sensor nodes. Then we present algorithms that provide approximate coverage while the number of nodes selected is a constant factor far from the optimal solution. Finally, we show how to connect a set of sensors that already provides coverage.
Original language | English |
---|---|
Pages (from-to) | 153-164 |
Number of pages | 12 |
Journal | Wireless Networks |
Volume | 13 |
Issue number | 2 |
DOIs | |
State | Published - Apr 2007 |
Externally published | Yes |
Bibliographical note
Funding Information:S. Funke Max Planck Institut fur Informatik, Saarbrucken, Germany A. Kesselman Max Planck Institut fur Informatik, Saarbrucken, Germany. The author has done a part of this work while visiting the Dipartimento di Scienze dell’Informazione at Universita di Roma La Sapienza, Italy. Supported in part by EYES project and MIUR grant FIRB WebMinds
Funding
S. Funke Max Planck Institut fur Informatik, Saarbrucken, Germany A. Kesselman Max Planck Institut fur Informatik, Saarbrucken, Germany. The author has done a part of this work while visiting the Dipartimento di Scienze dell’Informazione at Universita di Roma La Sapienza, Italy. Supported in part by EYES project and MIUR grant FIRB WebMinds
Funders | Funder number |
---|---|
EYES | |
Ministero dell’Istruzione, dell’Università e della Ricerca |
Keywords
- Approximation algorithms
- Sensing connected coverage