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 language | English |
---|---|
Title of host publication | STACS 2005 |
Subtitle of host publication | 22nd Annual Symposium on Theoretical Aspects of Computer Science Stuttgart, Germany, February 24-26, 2005 Proceedings |
Editors | Volker Diekert, Bruno Durand |
Place of Publication | Berlin Germany |
Publisher | Springer |
Pages | 353-364 |
Number of pages | 12 |
ISBN (Print) | 3540249982 |
DOIs | |
Publication status | Published - 2005 |
Externally published | Yes |
Event | International Symposium on Theoretical Aspects of Computer Science 2005 - Stuttgart, Germany Duration: 24 Feb 2005 → 26 Feb 2005 Conference number: 22nd https://link.springer.com/book/10.1007%2Fb106485 (Proceedings) |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer |
Volume | 3404 |
ISSN (Print) | 0302-9743 |
Conference
Conference | International Symposium on Theoretical Aspects of Computer Science 2005 |
---|---|
Abbreviated title | STACS 2005 |
Country/Territory | Germany |
City | Stuttgart |
Period | 24/02/05 → 26/02/05 |
Internet address |
|