279 search results - page 1 / 56 » Randomized k-Coverage Algorithms For Dense Sensor Networks |
INFOCOM
2007
IEEE
13 years 10 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...
DCOSS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
DCOSS
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
IPSN
2004
Springer
13 years 10 months ago
2004
Springer