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
Pages1629-1634
Number of pages6
StatePublished - Oct 15 2010
Event2010 American Control Conference, ACC 2010 - Baltimore, MD, United States
Duration: Jun 30 2010Jul 2 2010

Publication series

NameProceedings of the 2010 American Control Conference, ACC 2010

Other

Other2010 American Control Conference, ACC 2010
CountryUnited States
CityBaltimore, MD
Period6/30/107/2/10

    Fingerprint

Keywords

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

ASJC Scopus subject areas

  • Control and Systems Engineering

Cite this

Stergiopoulos, J., & Tzes, A. (2010). Decentralized communication range adjustment issues in multi-agent mobile networks. In Proceedings of the 2010 American Control Conference, ACC 2010 (pp. 1629-1634). [5531616] (Proceedings of the 2010 American Control Conference, ACC 2010).