Coverage in heterogeneous sensor networks

Loukas Lazos, Radha Poovendran

Research output: Chapter in Book/Report/Conference proceedingConference contribution

27 Citations (Scopus)

Abstract

In this paper we study problem of coverage in heterogeneous planar sensor networks. Coverage as a performance metric, quantifies quality of monitoring provided by sensor network. We formulate problem of coverage as a set intersection problem arising in Integral Geometry, and derive analytical expressions for stochastic coverage. Our formulation allows us to consider a heterogeneous sensing model, where sensors need not have an identical sensing capability. In addition, our approach is applicable to scenarios where sensing area of each sensor has arbitrary shape and sensors are deployed according to any distribution. We present analytical expressions only for convex sensing areas, however, our results can be generalized to non-convex areas. validity of our expressions is verified by extensive simulations.

Original languageEnglish (US)
Title of host publication2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2006
DOIs
StatePublished - 2006
Externally publishedYes
Event2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2006 - Boston, MA, United States
Duration: Feb 26 2006Mar 2 2006

Other

Other2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2006
CountryUnited States
CityBoston, MA
Period2/26/063/2/06

Fingerprint

Heterogeneous networks
Heterogeneous Networks
Sensor networks
Sensor Networks
Coverage
Sensing
Sensors
Sensor
Integral Geometry
Performance Metrics
Quantify
Geometry
Monitoring
Intersection
Scenarios
Formulation
Arbitrary
Simulation
Model

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Modeling and Simulation

Cite this

Lazos, L., & Poovendran, R. (2006). Coverage in heterogeneous sensor networks. In 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2006 [1666447] https://doi.org/10.1109/WIOPT.2006.1666447

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

2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2006. 2006. 1666447.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lazos, L & Poovendran, R 2006, Coverage in heterogeneous sensor networks. in 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2006., 1666447, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2006, Boston, MA, United States, 2/26/06. https://doi.org/10.1109/WIOPT.2006.1666447
Lazos L, Poovendran R. Coverage in heterogeneous sensor networks. In 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2006. 2006. 1666447 https://doi.org/10.1109/WIOPT.2006.1666447
Lazos, Loukas ; Poovendran, Radha. / Coverage in heterogeneous sensor networks. 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2006. 2006.
@inproceedings{81f1b3168884438cbff8f0c678a39f40,
title = "Coverage in heterogeneous sensor networks",
abstract = "In this paper we study problem of coverage in heterogeneous planar sensor networks. Coverage as a performance metric, quantifies quality of monitoring provided by sensor network. We formulate problem of coverage as a set intersection problem arising in Integral Geometry, and derive analytical expressions for stochastic coverage. Our formulation allows us to consider a heterogeneous sensing model, where sensors need not have an identical sensing capability. In addition, our approach is applicable to scenarios where sensing area of each sensor has arbitrary shape and sensors are deployed according to any distribution. We present analytical expressions only for convex sensing areas, however, our results can be generalized to non-convex areas. validity of our expressions is verified by extensive simulations.",
author = "Loukas Lazos and Radha Poovendran",
year = "2006",
doi = "10.1109/WIOPT.2006.1666447",
language = "English (US)",
isbn = "0780395492",
booktitle = "2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2006",

}

TY - GEN

T1 - Coverage in heterogeneous sensor networks

AU - Lazos, Loukas

AU - Poovendran, Radha

PY - 2006

Y1 - 2006

N2 - In this paper we study problem of coverage in heterogeneous planar sensor networks. Coverage as a performance metric, quantifies quality of monitoring provided by sensor network. We formulate problem of coverage as a set intersection problem arising in Integral Geometry, and derive analytical expressions for stochastic coverage. Our formulation allows us to consider a heterogeneous sensing model, where sensors need not have an identical sensing capability. In addition, our approach is applicable to scenarios where sensing area of each sensor has arbitrary shape and sensors are deployed according to any distribution. We present analytical expressions only for convex sensing areas, however, our results can be generalized to non-convex areas. validity of our expressions is verified by extensive simulations.

AB - In this paper we study problem of coverage in heterogeneous planar sensor networks. Coverage as a performance metric, quantifies quality of monitoring provided by sensor network. We formulate problem of coverage as a set intersection problem arising in Integral Geometry, and derive analytical expressions for stochastic coverage. Our formulation allows us to consider a heterogeneous sensing model, where sensors need not have an identical sensing capability. In addition, our approach is applicable to scenarios where sensing area of each sensor has arbitrary shape and sensors are deployed according to any distribution. We present analytical expressions only for convex sensing areas, however, our results can be generalized to non-convex areas. validity of our expressions is verified by extensive simulations.

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

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

U2 - 10.1109/WIOPT.2006.1666447

DO - 10.1109/WIOPT.2006.1666447

M3 - Conference contribution

AN - SCOPUS:84886517527

SN - 0780395492

SN - 9780780395497

BT - 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2006

ER -