Convex Voronoi space-partitioning for coverage purposes in heterogeneous sensor networks

John Stergiopoulos, Anthony Tzes

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

Abstract

This article addresses the problem of space-partitioning in heterogeneous sensor networks, where the nodes have uniform symmetric sensing patterns, though their maximum sensing distance differs. Inappropriateness of classical spatial Voronoi tessellation for coverage purposes is denoted, compared to the proposed space-partitioning technique, which takes into account this heterogeneity. Unlike weighted-Voronoi techniques, the latter's definition is reflected in a way that the assigned regions are convex sets, their construction is computationally-efficient, while special properties of Voronoi diagrams, which hold for homogeneous networks, are kept active. Simulation results confirm the efficacy of the proposed region-assignment scheme when dealing with heterogeneous networks, in contrast with classical Voronoi tessellation.

Original languageEnglish (US)
Title of host publication2009 European Control Conference, ECC 2009
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2361-2366
Number of pages6
ISBN (Electronic)9783952417393
DOIs
StatePublished - Mar 26 2014
Event2009 10th European Control Conference, ECC 2009 - Budapest, Hungary
Duration: Aug 23 2009Aug 26 2009

Publication series

Name2009 European Control Conference, ECC 2009

Other

Other2009 10th European Control Conference, ECC 2009
CountryHungary
CityBudapest
Period8/23/098/26/09

Keywords

  • Heterogeneous networks
  • Space-partitioning
  • Voronoi diagrams

ASJC Scopus subject areas

  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'Convex Voronoi space-partitioning for coverage purposes in heterogeneous sensor networks'. Together they form a unique fingerprint.

Cite this