Sciweavers

461 search results - page 18 / 93
» p-Percent Coverage Schedule in Wireless Sensor Networks
Sort
View
ICC
2007
IEEE
123views Communications» more  ICC 2007»
15 years 3 months ago
Redundant Coverage in Wireless Sensor Networks
Abstract— Coverage is a fundamental problem in sensor networks. In this paper, we addressed the coverage problem from two different view points and refer to them as the worst and...
Can Fang, Chor Ping Low
87
Voted
ISPA
2005
Springer
15 years 3 months ago
Percentage Coverage Configuration in Wireless Sensor Networks
Abstract. Recent researches on energy efficient coverage configuration in wireless sensor networks mainly address the goal of 100% or near 100% coverage preserving. However, we fin...
Hongxing Bai, Xi Chen, Yu-Chi Ho, Xiaohong Guan
ISCIS
2004
Springer
15 years 2 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...
70
Voted
ALGOSENSORS
2007
Springer
15 years 3 months ago
Local Approximation Algorithms for Scheduling Problems in Sensor Networks
Patrik Floréen, Petteri Kaski, Topi Musto, ...
INFOCOM
2009
IEEE
15 years 4 months ago
Surface Coverage in Wireless Sensor Networks
—Coverage is a fundamental problem in Wireless Sensor Networks (WSNs). Existing studies on this topic focus on 2D ideal plane coverage and 3D full space coverage. In many real wo...
Ming-Chen Zhao, Jiayin Lei, Min-You Wu, Yunhuai Li...