279 search results - page 22 / 56 » Randomized k-Coverage Algorithms For Dense Sensor Networks |
ADHOCNOW
2004
Springer
14 years 28 days ago
2004
Springer
We consider a wireless sensor network in which each sensor is able to transmit within a disk of radius one. We show with elementary techniques that there exists a constant c such t...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract –In this paper, a variational message passing framework is proposed for Markov random fields, which is computationally more efficient and admits wider applicability comp...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Assumptions about node density in the Sensor Networks literature are frequently too strong or too weak. Neither absolutely arbitrary nor uniform deployment seem feasible ...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
—Many sensor network protocols in the literature implicitly assume that sensor nodes are deployed uniformly inside a simple geometric region. When the real deployment deviates fr...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract—It may not be feasible for sensor networks monitoring nature and inaccessible geographical regions to include powered sinks with Internet connections. We consider the sc...