On k-coverage in a mostly sleeping sensor network

Santosh Kumar, Ten H. Lai, József Balogh

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish (US)
Pages (from-to)277-294
Number of pages18
JournalWireless Networks
Issue number3
StatePublished - Jun 2008


  • Connectivity
  • Coverage
  • Deterministic deployment
  • Power management
  • Random deployment
  • Sensor network

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'On k-coverage in a mostly sleeping sensor network'. Together they form a unique fingerprint.

Cite this