Sciweavers

2190 search results - page 3 / 438
» Distributed algorithms for dynamic coverage in sensor networ...
Sort
View
SUTC
2006
IEEE
13 years 11 months ago
Self-organization Strategies for Dynamic Context Coverage in Capability-Constrained Mobile Sensor Networks
We propose and formally characterize a new problem named the dynamic context coverage problem in capabilityconstrained mobile sensor network environments. The goal is to move and ...
Shiow-yang Wu, Chao-Hong Liu, Chen-Kuang Tzeng
INFOCOM
2007
IEEE
13 years 11 months ago
Randomized k-Coverage Algorithms For Dense Sensor Networks
— 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...
Mohamed Hefeeda, M. Bagheri
DATE
2005
IEEE
176views Hardware» more  DATE 2005»
13 years 7 months ago
LORD: A Localized, Reactive and Distributed Protocol for Node Scheduling in Wireless Sensor Networks
The lifetime of wireless sensor networks can be increased by minimizing the number of active nodes that provide complete coverage, while switching off the rest. In this paper, we ...
Arijit Ghosh, Tony Givargis
ISCIS
2004
Springer
13 years 10 months ago
Finding Breach Paths Using the Watershed Segmentation Algorithm in Surveillance Wireless Sensor Networks
Considering wireless sensor networks for border surveillance, one of the major concerns is sensing coverage. Breach probability can be used as a measure to analyze the tradeoffs a...
Ertan Onur, Cem Ersoy, Hakan Deliç, Lale Ak...