Sciweavers

297 search results - page 3 / 60
» On a stochastic sensor selection algorithm with applications...
Sort
View
ISCAPDCS
2007
13 years 6 months ago
Distributed algorithms for dynamic coverage in sensor networks
The coverage problem is of great interest for many sensor network applications, for example, detection of intruders in the sensor field. Topological changes in sensor networks ma...
Lan Lin, Hyunyoung Lee
ICC
2007
IEEE
138views Communications» more  ICC 2007»
13 years 11 months 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
CISS
2007
IEEE
13 years 11 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
ICC
2007
IEEE
188views Communications» more  ICC 2007»
13 years 11 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
JCO
2006
153views more  JCO 2006»
13 years 5 months ago
Efficient point coverage in wireless sensor networks
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
Jie Wang, Ning Zhong