Sciweavers

113 search results - page 5 / 23
» Asymptotic Coverage and Detection in Randomized Scheduling A...
Sort
View
ICCCN
2008
IEEE
14 years 20 days ago
p-Percent Coverage Schedule in Wireless Sensor Networks
—We investigate the p-percent coverage problem in this paper and propose two algorithms to prolong network lifetime based on the fact that for some applications full coverage is ...
Shan Gao, Xiaoming Wang, Yingshu Li
ISCIS
2004
Springer
13 years 11 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...
HYBRID
2009
Springer
14 years 1 months ago
Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem
In this paper, we analyze the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network that optimizes the coverage of the region...
Daniele Fontanelli, Luigi Palopoli, Roberto Passer...
TMC
2011
108views more  TMC 2011»
13 years 1 months ago
Spatial-Temporal Coverage Optimization in Wireless Sensor Networks
—Mission-driven sensor networks usually have special lifetime requirements. However, the density of the sensors may not be large enough to satisfy the coverage requirement while ...
Changlei Liu, Guohong Cao
ICC
2007
IEEE
138views Communications» more  ICC 2007»
14 years 17 days ago
Optimal Observation Scheduling for connected target coverage problem in Wireless Sensor Networks
— In this paper, we consider the problem of scheduling sensor activity to maximize network lifetime while maintaining both discrete targets coverage and network connectivity. We ...
Qun Zhao, Mohan Gurusamy