Decentralized communication range adjustment issues in multi-agent mobile networks

John Stergiopoulos, Anthony Tzes

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

Abstract

This article addresses the problem of spatial information exchange among the nodes of a mobile network from a communication point of view. The nodes are considered to evolve in discrete time, while one agent moves at each time-step. Given that possible motion of a node is to be performed in a subspace of its Voronoi cell, a lower bound on its communication radius is derived in order to guarantee connectivity with its current, along with all its possible future Delaunay neighbors for any admissible motion. Algorithmic implementations are provided from a decentralized aspect, while results are related to coverage optimization issues in mobile sensor networks.

Original languageEnglish (US)
Title of host publicationProceedings of the 2010 American Control Conference, ACC 2010
PublisherIEEE Computer Society
Pages1629-1634
Number of pages6
ISBN (Print)9781424474264
DOIs
StatePublished - 2010

Publication series

NameProceedings of the 2010 American Control Conference, ACC 2010

Keywords

  • Area coverage
  • Delaunay neighbors
  • Mobile networks
  • Network connectivity
  • Voronoi diagrams

ASJC Scopus subject areas

  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'Decentralized communication range adjustment issues in multi-agent mobile networks'. Together they form a unique fingerprint.

Cite this