Decentralized communication range adjustment issues in multi-agent mobile networks

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.