On k-coverage in a mostly sleeping sensor network

Santosh Kumar, Ten H. Lai, Jozsef Balog

Research output: Contribution to conferencePaper

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 life-time. 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πr 2log(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 for the grid deployment model. Finally, we use simulation to show the usefulness of our analysis in real deployment scenarios.

Original languageEnglish (US)
Pages144-158
Number of pages15
StatePublished - Dec 1 2004
Externally publishedYes
EventMobiCom 2004 - Proceedings of the Tenth Annual International Conference on Mobile Computing and Networking - Philadelphia, PA, United States
Duration: Sep 26 2004Oct 1 2004

Other

OtherMobiCom 2004 - Proceedings of the Tenth Annual International Conference on Mobile Computing and Networking
CountryUnited States
CityPhiladelphia, PA
Period9/26/0410/1/04

Keywords

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

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

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

  • Cite this

    Kumar, S., Lai, T. H., & Balog, J. (2004). On k-coverage in a mostly sleeping sensor network. 144-158. Paper presented at MobiCom 2004 - Proceedings of the Tenth Annual International Conference on Mobile Computing and Networking, Philadelphia, PA, United States.