Sciweavers

Share
MOBICOM
2004
ACM

On k-coverage in a mostly sleeping sensor network

9 years 2 months ago
On k-coverage in a mostly sleeping sensor network
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their lifetime. On the other hand, surveillance kind of applications require guaranteed k-coverage of the protected region at all times. As a result, determining the appropriate number of sensors to deploy that achieves both goals simultaneously becomes a challenging problem. In this paper, we consider three kinds of deployments for a sensor network on a unit square - a √ n × √ n grid, random uniform (for all n points), and Poisson (with density n). In all three deployments, each sensor is active with probability p, independently from the others. Then, we claim that the critical value of the function npπr2 / log(np) is 1 for the event of k-coverage of every point. We also provide an upper bound on the window of this phase transition. Although the conditions for the three deployments are similar, we obtain sha...
Santosh Kumar, Ten-Hwang Lai, József Balogh
Added 30 Jun 2010
Updated 30 Jun 2010
Type Conference
Year 2004
Where MOBICOM
Authors Santosh Kumar, Ten-Hwang Lai, József Balogh
Comments (0)
books