Connectivity for Wireless Agents Moving on a Cycle or Grid

Abstract. We present a mathematical model to analyse the establishment and maintenance of communication between mobile agents. We assume that the agents move through a fixed environment modelled by a motion graph, and are able to communicate if they are at distance at most d. As the agents move randomly, we analyse the evolution in time of the connectivity between a set of w agents, asymptotically for a large number N of nodes, when w also grows large, and for different values of d. The particular topologies of the environment we study in this paper are the cycle and the toroidal grid.

• Type: Conference
• Year: 2005
• Where: STACS
• Authors: Josep Díaz-Giménez, Xavier Pérez, Maria J. Serna, Nicholas C. Wormald
• Keywords: Mathematical Model, Mobile Agents, Motion Graph, STACS 2005, Theoretical Computer Science