Connectivity for wireless agents moving on a cycle or grid

Authors:
Josep Díaz;Xavier Pérez;Maria J. Serna;Nicholas C. Wormald
Affiliations:
Dept. Llenguatges i Sistemes, Universitat Politecnica de Catalunya;Dept. Llenguatges i Sistemes, Universitat Politecnica de Catalunya;Dept. Llenguatges i Sistemes, Universitat Politecnica de Catalunya;Dept. Combinatorics and Optimization, University of Waterloo
Venue:
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Year:
2005

Citing 4
Cited 0

On k-connectivity for a geometric random graph

Random Structures & Algorithms
Tutorial: mobile software agents for dynamic routing

ACM SIGMOBILE Mobile Computing and Communications Review
Algorithmic issues in modeling motion

ACM Computing Surveys (CSUR)
An Evaluation of Connectivity in Mobile Wireless Ad Hoc Networks

DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks

Quantified Score

Hi-index	0.00

Visualization

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.