Coverage by randomly deployed wireless sensor networks

Peng Jun Wan*, Tsì-Uí İk

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

180 Scopus citations

Abstract

One of the main applications of wireless sensor networks is to provide proper coverage of their deployment regions. A wireless sensor network k-covers its deployment region if every point in its deployment region is within the coverage ranges of at least k sensors. In this paper, we assume that the sensors are deployed as either a Poisson point process or a uniform point process in a square or disk region, and study how the probability of the k-coverage changes with the sensing radius or the number of sensors. Our results take the complicated boundary effect into account, rather than avoiding it by assuming the toroidal metric as done in the literature.

Original languageEnglish
Pages (from-to)2658-2669
Number of pages12
JournalIEEE Transactions on Information Theory
Volume52
Issue number6
DOIs
StatePublished - 1 Jun 2006
Event4th IEEE International Symposium on Network Computing and Applications, NCA 2005 - Cambridge, MA, United States
Duration: 27 Jul 200529 Jul 2005

Keywords

  • Asymptotics
  • Connectivity
  • Node density
  • Sensing radius
  • Wireless ad hoc sensor networks
  • k-coverage

Fingerprint Dive into the research topics of 'Coverage by randomly deployed wireless sensor networks'. Together they form a unique fingerprint.

Cite this