Stochastic coverage in heterogeneous sensor networks

Loukas Lazos, Radha Poovendran

Research output: Contribution to journalArticle

122 Citations (Scopus)

Abstract

We study the problem of coverage in planar heterogeneous sensor networks. Coverage is a performance metric that quantifies how well a field of interest is monitored by the sensor deployment. To derive analytical expressions of coverage for heterogeneous sensor networks, we formulate the coverage problem as a set intersection problem, a problem studied in integral geometry. Compared to previous analytical results, our formulation allows us to consider a network model where sensors are deployed according to an arbitrary stochastic distribution; sensing areas of sensors need not follow the unit disk model but can have any arbitrary shape; sensors need not have an identical sensing capability. Furthermore, our formulation does not assume deployment of sensors over an infinite plane and, hence, our derivations do not suffer from the border effect problem arising in a bounded field of interest. We compare our theoretical results with the spatial Poisson approximation that is widely used in modeling coverage. By computing the Kullback-Leibler and total variation distance between the probability density functions derived via our theoretical results, the Poisson approximation, and the simulation, we show that our formulas provide a more accurate representation of the coverage in sensor networks. Finally, we provide examples of calculating network parameters such as the network size and sensing range in order to achieve a desired degree of coverage.

Original languageEnglish (US)
Pages (from-to)325-358
Number of pages34
JournalACM Transactions on Sensor Networks
Volume2
Issue number3
DOIs
StatePublished - Aug 2006
Externally publishedYes

Fingerprint

Heterogeneous networks
Sensor networks
Sensors
Probability density function
Geometry

Keywords

  • Coverage
  • Heterogeneous
  • Sensor networks
  • Stochastic

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Stochastic coverage in heterogeneous sensor networks. / Lazos, Loukas; Poovendran, Radha.

In: ACM Transactions on Sensor Networks, Vol. 2, No. 3, 08.2006, p. 325-358.

Research output: Contribution to journalArticle

@article{9d638871fbc14e1b9f4b2c45c2db90e0,
title = "Stochastic coverage in heterogeneous sensor networks",
abstract = "We study the problem of coverage in planar heterogeneous sensor networks. Coverage is a performance metric that quantifies how well a field of interest is monitored by the sensor deployment. To derive analytical expressions of coverage for heterogeneous sensor networks, we formulate the coverage problem as a set intersection problem, a problem studied in integral geometry. Compared to previous analytical results, our formulation allows us to consider a network model where sensors are deployed according to an arbitrary stochastic distribution; sensing areas of sensors need not follow the unit disk model but can have any arbitrary shape; sensors need not have an identical sensing capability. Furthermore, our formulation does not assume deployment of sensors over an infinite plane and, hence, our derivations do not suffer from the border effect problem arising in a bounded field of interest. We compare our theoretical results with the spatial Poisson approximation that is widely used in modeling coverage. By computing the Kullback-Leibler and total variation distance between the probability density functions derived via our theoretical results, the Poisson approximation, and the simulation, we show that our formulas provide a more accurate representation of the coverage in sensor networks. Finally, we provide examples of calculating network parameters such as the network size and sensing range in order to achieve a desired degree of coverage.",
keywords = "Coverage, Heterogeneous, Sensor networks, Stochastic",
author = "Loukas Lazos and Radha Poovendran",
year = "2006",
month = "8",
doi = "10.1145/1167935.1167937",
language = "English (US)",
volume = "2",
pages = "325--358",
journal = "ACM Transactions on Sensor Networks",
issn = "1550-4859",
publisher = "Association for Computing Machinery (ACM)",
number = "3",

}

TY - JOUR

T1 - Stochastic coverage in heterogeneous sensor networks

AU - Lazos, Loukas

AU - Poovendran, Radha

PY - 2006/8

Y1 - 2006/8

N2 - We study the problem of coverage in planar heterogeneous sensor networks. Coverage is a performance metric that quantifies how well a field of interest is monitored by the sensor deployment. To derive analytical expressions of coverage for heterogeneous sensor networks, we formulate the coverage problem as a set intersection problem, a problem studied in integral geometry. Compared to previous analytical results, our formulation allows us to consider a network model where sensors are deployed according to an arbitrary stochastic distribution; sensing areas of sensors need not follow the unit disk model but can have any arbitrary shape; sensors need not have an identical sensing capability. Furthermore, our formulation does not assume deployment of sensors over an infinite plane and, hence, our derivations do not suffer from the border effect problem arising in a bounded field of interest. We compare our theoretical results with the spatial Poisson approximation that is widely used in modeling coverage. By computing the Kullback-Leibler and total variation distance between the probability density functions derived via our theoretical results, the Poisson approximation, and the simulation, we show that our formulas provide a more accurate representation of the coverage in sensor networks. Finally, we provide examples of calculating network parameters such as the network size and sensing range in order to achieve a desired degree of coverage.

AB - We study the problem of coverage in planar heterogeneous sensor networks. Coverage is a performance metric that quantifies how well a field of interest is monitored by the sensor deployment. To derive analytical expressions of coverage for heterogeneous sensor networks, we formulate the coverage problem as a set intersection problem, a problem studied in integral geometry. Compared to previous analytical results, our formulation allows us to consider a network model where sensors are deployed according to an arbitrary stochastic distribution; sensing areas of sensors need not follow the unit disk model but can have any arbitrary shape; sensors need not have an identical sensing capability. Furthermore, our formulation does not assume deployment of sensors over an infinite plane and, hence, our derivations do not suffer from the border effect problem arising in a bounded field of interest. We compare our theoretical results with the spatial Poisson approximation that is widely used in modeling coverage. By computing the Kullback-Leibler and total variation distance between the probability density functions derived via our theoretical results, the Poisson approximation, and the simulation, we show that our formulas provide a more accurate representation of the coverage in sensor networks. Finally, we provide examples of calculating network parameters such as the network size and sensing range in order to achieve a desired degree of coverage.

KW - Coverage

KW - Heterogeneous

KW - Sensor networks

KW - Stochastic

UR - http://www.scopus.com/inward/record.url?scp=33750304737&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33750304737&partnerID=8YFLogxK

U2 - 10.1145/1167935.1167937

DO - 10.1145/1167935.1167937

M3 - Article

AN - SCOPUS:33750304737

VL - 2

SP - 325

EP - 358

JO - ACM Transactions on Sensor Networks

JF - ACM Transactions on Sensor Networks

SN - 1550-4859

IS - 3

ER -