Sciweavers

Share
115 search results - page 1 / 23
» Asymptotic Coverage and Detection in Randomized Scheduling A...
Sort
View
ICC
2007
IEEE
188views Communications» more  ICC 2007»
9 years 8 months ago
Asymptotic Coverage and Detection in Randomized Scheduling Algorithm in Wireless Sensor Networks
—In our previous work [11], we derived detection delay and detection probability for a randomized scheduling algorithm in wireless sensor networks. In this paper, we study asympt...
Yang Xiao, Ying Zhang, Xinyu Sun, Hui Chen
INFOCOM
2009
IEEE
9 years 8 months ago
Trap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks
—Tracking of movements such as that of people, animals, vehicles, or of phenomena such as fire, can be achieved by deploying a wireless sensor network. So far only prototype sys...
Paul Balister, Zizhan Zheng, Santosh Kumar, Prasun...
CN
2010
183views more  CN 2010»
9 years 1 months ago
A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
Mehdi Esnaashari, Mohammad Reza Meybodi
CISS
2007
IEEE
9 years 8 months ago
Coverage-Based Information Retrieval for Lifetime Maximization in Sensor Networks
—We consider information retrieval in a wireless sensor network deployed to monitor a spatially correlated random field. We address sensor scheduling in each data collection und...
Tong Zhao, Qing Zhao
JCO
2006
234views more  JCO 2006»
9 years 1 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
books