229 search results - page 15 / 46 » A Distributed Greedy Algorithm for Connected Sensor Cover in... |
150
Voted
DCOSS
2006
Springer
15 years 6 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...
145
Voted
UIC
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The coverage problem in wireless sensor networks (WSNs) is to determine the number of active sensor nodes needed to cover the sensing area. The purpose is to extend the l...
129
Voted
MOBICOM
2006
ACM
15 years 8 months ago
2006
ACM
Mobile sensors cover more area over a period of time than the same number of stationary sensors. However, the quality of coverage achieved by mobile sensors depends on the velocit...
153
Voted
ICPP
2009
IEEE
15 years 9 months ago
2009
IEEE
—Wireless sensor networks have become a promising technology in monitoring physical world. In many applications with wireless sensor networks, it is essential to understand how w...
147
Voted
WSNA
2003
ACM
15 years 8 months ago
2003
ACM
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...