Connectivity for wireless agents moving on a cycle or grid

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

doi:10.1007/978-3-540-31856-9_29

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 proceeding › Conference Paper › Research › peer-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 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	https://doi.org/10.1007/978-3-540-31856-9_29
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	Germany
City	Stuttgart
Period	24/02/05 → 26/02/05
Internet address	https://link.springer.com/book/10.1007%2Fb106485 (Proceedings)

Access to Document

10.1007/978-3-540-31856-9_29

Link to publication in Scopus

Cite this

Díaz, J., Pérez, X., Serna, M. J., & Wormald, N. C. (2005). Connectivity for wireless agents moving on a cycle or grid. In V. Diekert, & B. Durand (Eds.), STACS 2005: 22nd Annual Symposium on Theoretical Aspects of Computer Science Stuttgart, Germany, February 24-26, 2005 Proceedings (pp. 353-364). (Lecture Notes in Computer Science; Vol. 3404). Springer. https://doi.org/10.1007/978-3-540-31856-9_29

Díaz, Josep ; Pérez, Xavier ; Serna, Maria J. ; Wormald, Nicholas C. / Connectivity for wireless agents moving on a cycle or grid. STACS 2005: 22nd Annual Symposium on Theoretical Aspects of Computer Science Stuttgart, Germany, February 24-26, 2005 Proceedings. editor / Volker Diekert ; Bruno Durand. Berlin Germany : Springer, 2005. pp. 353-364 (Lecture Notes in Computer Science).

@inproceedings{9e644cad315846329ae4ccd19eef23e0,

title = "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.",

author = "Josep D{\'i}az and Xavier P{\'e}rez and Serna, {Maria J.} and Wormald, {Nicholas C.}",

year = "2005",

doi = "10.1007/978-3-540-31856-9_29",

language = "English",

isbn = "3540249982",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "353--364",

editor = "Volker Diekert and Bruno Durand",

booktitle = "STACS 2005",

note = "International Symposium on Theoretical Aspects of Computer Science 2005, STACS 2005 ; Conference date: 24-02-2005 Through 26-02-2005",

url = "https://link.springer.com/book/10.1007%2Fb106485",

}

Díaz, J, Pérez, X, Serna, MJ & Wormald, NC 2005, Connectivity for wireless agents moving on a cycle or grid. in V Diekert & B Durand (eds), STACS 2005: 22nd Annual Symposium on Theoretical Aspects of Computer Science Stuttgart, Germany, February 24-26, 2005 Proceedings. Lecture Notes in Computer Science, vol. 3404, Springer, Berlin Germany, pp. 353-364, International Symposium on Theoretical Aspects of Computer Science 2005, Stuttgart, Germany, 24/02/05. https://doi.org/10.1007/978-3-540-31856-9_29

Connectivity for wireless agents moving on a cycle or grid. / Díaz, Josep; Pérez, Xavier; Serna, Maria J.; Wormald, Nicholas C.

STACS 2005: 22nd Annual Symposium on Theoretical Aspects of Computer Science Stuttgart, Germany, February 24-26, 2005 Proceedings. ed. / Volker Diekert; Bruno Durand. Berlin Germany : Springer, 2005. p. 353-364 (Lecture Notes in Computer Science; Vol. 3404).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - Connectivity for wireless agents moving on a cycle or grid

AU - Díaz, Josep

AU - Pérez, Xavier

AU - Serna, Maria J.

AU - Wormald, Nicholas C.

N1 - Conference code: 22nd

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=24144437116&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-31856-9_29

DO - 10.1007/978-3-540-31856-9_29

M3 - Conference Paper

AN - SCOPUS:24144437116

SN - 3540249982

T3 - Lecture Notes in Computer Science

SP - 353

EP - 364

BT - STACS 2005

A2 - Diekert, Volker

A2 - Durand, Bruno

PB - Springer

CY - Berlin Germany

T2 - International Symposium on Theoretical Aspects of Computer Science 2005

Y2 - 24 February 2005 through 26 February 2005

ER -

Díaz J, Pérez X, Serna MJ, Wormald NC. Connectivity for wireless agents moving on a cycle or grid. In Diekert V, Durand B, editors, STACS 2005: 22nd Annual Symposium on Theoretical Aspects of Computer Science Stuttgart, Germany, February 24-26, 2005 Proceedings. Berlin Germany: Springer. 2005. p. 353-364. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-540-31856-9_29