article

How to meet in anonymous network

Authors:

Dariusz R. Kowalski,

Adam MalinowskiAuthors Info & Claims

Theoretical Computer Science, Volume 399, Issue 1-2

Pages 141 - 156

https://doi.org/10.1016/j.tcs.2008.02.010

Published: 01 June 2008 Publication History

Abstract

A set of k mobile agents with distinct identifiers and located in nodes of an unknown anonymous connected network, have to meet at some node. We show that this gathering problem is no harder than its special case for k=2, called the rendezvous problem, and design deterministic protocols solving the rendezvous problem with arbitrary startups in rings and in general networks. The measure of performance is the number of steps since the startup of the last agent until the rendezvous is achieved. For rings we design an oblivious protocol with cost O(nlog@?), where n is the size of the network and @? is the minimum label of participating agents. This result is asymptotically optimal due to the lower bound showed by [A. Dessmark, P. Fraigniaud, D. Kowalski, A. Pelc, Deterministic rendezvous in graphs, Algorithmica 46 (2006) 69-96]. For general networks we show a protocol with cost polynomial in n and log@?, independent of the maximum difference @t of startup times, which answers in the affirmative the open question by [A. Dessmark, P. Fraigniaud, D. Kowalski, A. Pelc, Deterministic rendezvous in graphs, Algorithmica 46 (2006) 69-96].

References

[1]

M. Adler, H. Racke, C. Sohler, N. Sivadasan, B. Voecking, Randomized pursuit-evasion in graphs, in: Proc. 29th Int. Colloquium on Automata, Languages and Programming, ICALP¿2002, pp. 901¿912

Digital Library

[2]

R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovász, C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, in: Proc. 20th Symposium on Foundations of Computer Science, FOCS¿1979, pp. 218¿223

[3]

Alpern, S., The rendezvous search problem. SIAM Journal on Control and Optimization. v33. 673-683.

Digital Library

[4]

Alpern, S., Rendezvous search on labelled networks. Naval Research Logistics. v49. 256-274.

[5]

Alpern, S. and Gal, S., . In: Int. Series in Operations Research and Management Science, Kluwer Academic Publisher.

[6]

Alpern, J., Baston, V. and Essegaier, S., Rendezvous search on a graph. Journal of Applied Probability. v36. 223-231.

[7]

Anderson, E. and Weber, R., The rendezvous problem on discrete locations. Journal of Applied Probability. v28. 839-851.

[8]

Anderson, E. and Fekete, S., Two-dimensional rendezvous search. Operation Research. v49. 107-118.

Digital Library

[9]

Baston, V. and Gal, S., Rendezvous search when marks are left at the starting points. Naval Research Logistics. v48. 722-731.

[10]

M. Cielibak, P. Flocchini, G. Prencipe, N. Santoro, Solving the robots gathering problem, in: Proc. 30th International Colloquium on Automata, Languages and Programming, ICALP¿2003, LNCS 2719, pp. 1181¿1196

Digital Library

[11]

Cook, S.A. and McKenzie, P., Problems complete for deterministic logarithmic space. Journal of Algorithms. v8 i5. 385-394.

Digital Library

[12]

Coppersmith, D., Tetali, P. and Winkler, P., Collisions among random walks on a graph. SIAM Journal on Discrete Mathematics. v6. 363-374.

Digital Library

[13]

G. De Marco, L. Gargano, E. Kranakis, D. Krizanc, A. Pelc, U. Vaccaro, Asynchronous deterministic rendezvous in graphs, in: Proc. 30th Int. Symp. on Math. Found. of Comp. Science, MFCS¿2005, LNCS 3618, pp. 271¿282

Digital Library

[14]

Dessmark, A., Fraigniaud, P., Kowalski, D. and Pelc, A., Deterministic rendezvous in graphs. Algorithmica. v46. 69-96.

[15]

P. Flocchini, G. Prencipe, N. Santoro, P. Widmayer, Gathering of asynchronous oblivious robots with limited visibility, in: Proc. 18th Ann. Symp. on Theoretical Aspects of Comp. Science, STACS¿2001, LNCS 2010, pp. 247¿258

Digital Library

[16]

Gal, S., Rendezvous search on the line. Operations Research. v47. 974-976.

Digital Library

[17]

A. Israeli, M. Jalfon, Token management schemes and random walks yield self stabilizing mutual exclusion, in: Proc. 9th ACM Symp. on Principles of Distributed Computing, PODC¿1990, pp. 119¿131

Digital Library

[18]

E. Kranakis, D. Krizanc, N. Santoro, C. Sawchuk, Mobile agent rendezvous in a ring, in: Proc. 23rd Int. Conference on Distributed Computing Systems, ICDCS¿2003, pp. 592¿599

Digital Library

[19]

Lim, W. and Alpern, S., Minimax rendezvous on the line. SIAM Journal on Control and Optimization. v34. 1650-1665.

Digital Library

[20]

A.J. Mayer, R. Ostrovsky, M. Yung, Self-stabilizing algorithms for synchronous unidirectional rings, in: Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA¿1996, pp. 564¿573

Digital Library

[21]

Motwani, R. and Raghawan, P., Randomized Algorithms. 1995. Cambridge University Press.

Digital Library

[22]

Schelling, T., The Strategy of Conflict. 1960. Oxford University Press, Oxford.

[23]

A. Ta-Shma, U. Zwick, Deterministic rendezvous, treasure hunts and strongly universal exploration sequences, in: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA¿2007

Digital Library

[24]

X. Yu, M. Yung, Agent rendezvous: A dynamic symmetry-breaking problem, in: Proc. International Colloquium on Automata, Languages, and Programming, ICALP¿1996, LNCS 1099, pp. 610¿621

Digital Library

Cited By

Saxena AMondal K(2024)A Further Study on Weak Byzantine Gathering of Mobile AgentsProceedings of the 25th International Conference on Distributed Computing and Networking10.1145/3631461.3631551(22-31)Online publication date: 4-Jan-2024
https://dl.acm.org/doi/10.1145/3631461.3631551
Das ABose KSau B(2023)Memory optimal dispersion by anonymous mobile robotsDiscrete Applied Mathematics10.1016/j.dam.2023.07.005340:C(171-182)Online publication date: 15-Dec-2023
https://dl.acm.org/doi/10.1016/j.dam.2023.07.005
Dieudonné YPelc APetit F(2023)Almost Universal Anonymous Rendezvous in the PlaneAlgorithmica10.1007/s00453-023-01122-285:10(3110-3143)Online publication date: 11-May-2023
https://dl.acm.org/doi/10.1007/s00453-023-01122-2
Show More Cited By

Index Terms

How to meet in anonymous network

Recommendations

How to meet in anonymous network
SIROCCO'06: Proceedings of the 13th international conference on Structural Information and Communication Complexity

A set of k mobile agents with distinct identifiers and located in nodes of an unknown anonymous connected network, have to meet at some node. We show that this gathering problem is no harder than its special case for k = 2, called the rendezvous problem,...
Anonymous networks: randomization = 2-hop coloring
PODC '14: Proceedings of the 2014 ACM symposium on Principles of distributed computing

This paper considers the computational power of anonymous message passing algorithms (henceforth, anonymous algorithms), i.e., distributed algorithms operating in a network of unidentified nodes. We prove that every problem that can be solved (and ...
Faster Leader Election and Its Applications for Mobile Agents with Parameter Advice
Distributed Computing and Intelligent Technology
Abstract
Leader election is a critical and extensively studied problem in distributed computing. This paper introduces the study of leader election using mobile agents. Consider n agents initially placed arbitrarily on the nodes of an arbitrary, n-node, m-...
$^{}$

Comments

Information & Contributors

Information

Published In

cover image Theoretical Computer Science

Theoretical Computer Science Volume 399, Issue 1-2

June, 2008

161 pages

ISSN:0304-3975

Issue’s Table of Contents

Copyright © Elsevier Ltd © 2008.

Publisher

Elsevier Science Publishers Ltd.

United Kingdom

Publication History

Published: 01 June 2008

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

34
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Saxena AMondal K(2024)A Further Study on Weak Byzantine Gathering of Mobile AgentsProceedings of the 25th International Conference on Distributed Computing and Networking10.1145/3631461.3631551(22-31)Online publication date: 4-Jan-2024
https://dl.acm.org/doi/10.1145/3631461.3631551
Das ABose KSau B(2023)Memory optimal dispersion by anonymous mobile robotsDiscrete Applied Mathematics10.1016/j.dam.2023.07.005340:C(171-182)Online publication date: 15-Dec-2023
https://dl.acm.org/doi/10.1016/j.dam.2023.07.005
Dieudonné YPelc APetit F(2023)Almost Universal Anonymous Rendezvous in the PlaneAlgorithmica10.1007/s00453-023-01122-285:10(3110-3143)Online publication date: 11-May-2023
https://dl.acm.org/doi/10.1007/s00453-023-01122-2
Bouchard SDieudonné YLamani A(2022)Byzantine gathering in polynomial timeDistributed Computing10.1007/s00446-022-00419-935:3(235-263)Online publication date: 1-Jun-2022
https://dl.acm.org/doi/10.1007/s00446-022-00419-9
Hirose JNakamura JOoshita FInoue M(2021)Gathering with a strong team in weakly Byzantine environmentsProceedings of the 22nd International Conference on Distributed Computing and Networking10.1145/3427796.3427799(26-35)Online publication date: 5-Jan-2021
https://dl.acm.org/doi/10.1145/3427796.3427799
Das ABose KSau B(2021)Memory Optimal Dispersion by Anonymous Mobile RobotsAlgorithms and Discrete Applied Mathematics10.1007/978-3-030-67899-9_34(426-439)Online publication date: 11-Feb-2021
https://dl.acm.org/doi/10.1007/978-3-030-67899-9_34
Pelc AYadav R(2020)Latecomers Help to MeetProceedings of the 21st International Conference on Distributed Computing and Networking10.1145/3369740.3369767(1-10)Online publication date: 4-Jan-2020
https://dl.acm.org/doi/10.1145/3369740.3369767
Bouchard SDieudonné YPelc APetit FScheideler CSpear M(2020)Almost Universal Anonymous Rendezvous in the PlaneProceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3350755.3400283(117-127)Online publication date: 6-Jul-2020
https://dl.acm.org/doi/10.1145/3350755.3400283
Pelc AYadav RScheideler CBerenbrink P(2019)Using Time to Break SymmetryThe 31st ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3323165.3323182(85-92)Online publication date: 17-Jun-2019
https://dl.acm.org/doi/10.1145/3323165.3323182
Bouchard SBournat MDieudonné YDubois SPetit F(2019)Asynchronous approach in the planeDistributed Computing10.1007/s00446-018-0338-232:4(317-337)Online publication date: 1-Aug-2019
https://dl.acm.org/doi/10.1007/s00446-018-0338-2
Show More Cited By

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents