On k−coverage in a mostly sleeping sensor network

Abstract

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, event monitoring 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πr 2 / 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 sharper bounds for the random deployments than the grid deployment, which occurs due to the boundary condition. In this paper, we also provide corrections to previously published results. Finally, we use simulation to show the usefulness of our analysis in real deployment scenarios.

Robustness and Performance Analysis of a Dynamic Sensor Network Scheduling Algorithm

“…The decision of each node is based on an estimation of the number of the neighboring sensors. In [11] the authors propose a simple randomized scheduling for dense and mostly sleeping sensor networks. They suppose that there are many redundant sensors and one can compute an identical duty cycle for individual sensors.…”

Dynamic Coverage Verification in Mobile Sensor Networks Via Switched Higher Order Laplacians

“…Several constructive schemes have been proposed by various researchers [11,12,31,32,33,34]. In order to verify these schemes in real time, we run the dynamical system (6) as a cheap distributed verification method.…”

Prediction-Based Proactive Cluster Target Tracking Protocol for Binary Sensor Networks

“…It is well known that when sensors are in the sleeping mode, they consume only 0.1% of the energy consumed in the active mode. Experimental data shows that sensors can last for more than a year on a 1% duty cycle [12].…”