Connectivity for wireless agents moving on a cycle or grid

Josep Díaz, Xavier Pérez, Maria J. Serna, Nicholas C. Wormald

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

3 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationSTACS 2005
Subtitle of host publication22nd Annual Symposium on Theoretical Aspects of Computer Science Stuttgart, Germany, February 24-26, 2005 Proceedings
EditorsVolker Diekert, Bruno Durand
Place of PublicationBerlin Germany
PublisherSpringer
Pages353-364
Number of pages12
ISBN (Print)3540249982
DOIs
Publication statusPublished - 2005
Externally publishedYes
EventInternational Symposium on Theoretical Aspects of Computer Science 2005 - Stuttgart, Germany
Duration: 24 Feb 200526 Feb 2005
Conference number: 22nd
https://link.springer.com/book/10.1007%2Fb106485 (Proceedings)

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume3404
ISSN (Print)0302-9743

Conference

ConferenceInternational Symposium on Theoretical Aspects of Computer Science 2005
Abbreviated titleSTACS 2005
CountryGermany
CityStuttgart
Period24/02/0526/02/05
Internet address

Cite this