Sciweavers

279 search results - page 8 / 56
» Randomized k-Coverage Algorithms For Dense Sensor Networks
Sort
View
JCO
2006
234views more  JCO 2006»
13 years 7 months ago
Coverage by directional sensors in randomly deployed wireless sensor networks
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
Jing Ai, Alhussein A. Abouzeid
SENSYS
2004
ACM
14 years 27 days ago
Decentralized synchronization protocols with nearest neighbor communication
A class of synchronization protocols for dense, large-scale sensor networks is presented. The protocols build on the recent work of Hong, Cheow, and Scaglione [5, 6] in which the ...
Dennis Lucarelli, I-Jeng Wang
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 7 months ago
Dependable k-coverage algorithms for sensor networks
– 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...
Simon Gyula, Miklós Molnár, Lá...
EURONGI
2006
Springer
13 years 11 months ago
Randomized Self-stabilizing Algorithms for Wireless Sensor Networks
Wireless sensor networks (WSNs) pose challenges not present in classical distributed systems: resource limitations, high failure rates, and ad hoc deployment. The lossy nature of w...
Volker Turau, Christoph Weyer