Convex Voronoi-inspired space partitioning for heterogeneous networks: A coverage-oriented approach

Y. Stergiopoulos, A. Tzes

Research output: Contribution to journalArticlepeer-review

Abstract

This study addresses the problem of space-partitioning in heterogeneous sensor networks, where the nodes have uniform symmetric sensing patterns, although their maximum distance differs. Emphasis is given in the inappropriateness of classical spatial Voronoi tessellation for coverage purposes, compared to the proposed space-partitioning technique, which takes into account this heterogeneity. The latter's definition is reflected in a way that the assigned regions are convex sets (contrary to weighted Voronoi diagrams), their construction is computationally efficient, while special properties of Voronoi diagrams, which hold for homogeneous networks, are kept active. The proposed Voronoi definition degenerates into the classical one when the sensing radii of the nodes are equal. Examples are provided in order to emphasise in the efficacy of the proposed region-assignment scheme when dealing with heterogeneous networks, in contrast with classical Voronoi tessellation.

Original languageEnglish (US)
Pages (from-to)2802-2812
Number of pages11
JournalIET Control Theory and Applications
Volume4
Issue number12
DOIs
StatePublished - Dec 2010

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Human-Computer Interaction
  • Computer Science Applications
  • Control and Optimization
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Convex Voronoi-inspired space partitioning for heterogeneous networks: A coverage-oriented approach'. Together they form a unique fingerprint.

Cite this