147 search results - page 1 / 30 » Dependable k-coverage algorithms for sensor networks |
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
DCOSS
2006
Springer
13 years 8 months ago
2006
Springer
In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network wit...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
– Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same ti...
INFOCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
INFOCOM
2011
IEEE
12 years 8 months ago
2011
IEEE
Abstract—Triangulation serves as the basis for many geometrybased algorithms in wireless sensor networks. In this paper we propose a distributed algorithm that produces a triangu...