Expected k-coverage in wireless sensor networks

Li-Hsing Yen*, Chang Wu Yu, Yang Min Cheng

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

81 Scopus citations

Abstract

We are concerned with wireless sensor networks where n sensors are independently and uniformly distributed at random in a finite plane. Events that are within a fixed distance from some sensor are assumed to be detectable and the sensor is said to cover that point. In this paper, we have formulated an exact mathematical expression for the expected area that can be covered by at least k out of n sensors. Our results are important in predicting the degree of coverage a sensor network may provide and in determining related parameters (sensory range, number of sensors, etc.) for a desired level of coverage. We demonstrate the utility of our results by presenting a node scheduling scheme that conserves energy while retaining network coverage. Additional simulation results have confirmed the accuracy of our analysis.

Original languageEnglish
Pages (from-to)636-650
Number of pages15
JournalAd Hoc Networks
Volume4
Issue number5
DOIs
StatePublished - 1 Sep 2006

Keywords

  • Border effect
  • Coverage
  • Node scheduling
  • Sensor network
  • Uniform distribution

Fingerprint Dive into the research topics of 'Expected k-coverage in wireless sensor networks'. Together they form a unique fingerprint.

Cite this