279 search results - page 5 / 56 » Randomized k-Coverage Algorithms For Dense Sensor Networks |
VTC
2010
IEEE
13 years 5 months ago
2010
IEEE
—In wireless sensor networks (WSN), stochastic node dropping and unpredictable node failure greatly impair coverage, creating sensing holes, while locally redundant sensors exist...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
—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...
IPSN
2007
Springer
14 years 1 months ago
2007
Springer
This paper considers the problem of blindly calibrating sensor response using routine sensor network measurements. We show that as long as the sensors slightly oversample the sign...
TSP
2008
13 years 7 months ago
2008
We study the problem of tracking an object that is moving randomly through a dense network of wireless sensors. We assume that each sensor has a limited range for detecting the pr...
WSNA
2003
ACM
14 years 21 days ago
2003
ACM
We consider the problem of synchronization of all clocks in a sensor network, in the regime of asymptotically high node densities. We formulate this problem as one in which all cl...