English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Improved Approximation Algorithms for Connected Sensor Cover

MPS-Authors
/persons/resource/persons44464

Funke,  Stefan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44763

Kesselmann,  Alexander
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44944

Lotker,  Zvi
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Funke, S., Kesselmann, A., Lotker, Z., & Segal, M. (2004). Improved Approximation Algorithms for Connected Sensor Cover. In Ad-hoc, mobil and wireless networks: Third International Conference, ADHOC-NOW 2004 (pp. 56-69). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2935-C
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 that maintains sensing coverage and network connectivity. We study different variations of this problem. The main contribution of this paper is a thorough investigation of algorithms for covering an area with sensors that have fixed locations.