Coverage in heterogeneous sensor networks

Loukas Lazos, Radha Poovendran

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

30 Scopus citations

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

Publication series

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

Other

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

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Modeling and Simulation

Fingerprint

Dive into the research topics of 'Coverage in heterogeneous sensor networks'. Together they form a unique fingerprint.

Cite this