Abstract
We study the rendezvous search problem for k ≥ 2 mobile agents in an n node ring. Rather than using randomized algorithms or different deterministic algorithms to break the symmetry that often arises in this problem, we investigate how the mobile agents can use identical stationary tokens to break symmetry and solve the rendezvous problem. After deriving the conditions under which identical stationary tokens can be used to break symmetry, we present several solutions to the rendezvous search problem. We derive the lower bounds of the memory required for mobile agent rendezvous and discuss the relationship between rendezvous and leader election for mobile agents.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alpern, S.: Rendezvous Search: A Personal Perspective. Operations Research 50(5), 772–795 (2002)
Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer Academic Publishers, London (2003)
Barriere, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Election and Rendezvous of Anonymous Mobile Agents in Anonymous Networks with Sense of Direction. In: Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 17–32 (2003)
Barriere, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Can We Elect If We Cannot Compare? In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 324–332 (2003)
Baston, V., Gal, S.: Rendezvous Search When Marks are Left at the Starting Points. Naval Research Logistics 47(6), 722–731 (2001)
Gal, S.: Rendezvous Search on the Line. Operations Research 47(6), 849–861 (1999)
Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Mobile Agent Rendezvous in the Ring. In: International Conference on Distributed Computing Systems (ICDCS 2003), Providence, RI, May 19-22, pp. 592–599 (2003)
Rendezvous Search on the Line with More than Two Players, Operations Research 45, 357–364 (1997)
Pikounis, M., Thomas, L.C.: Many Player Rendezvous Search: Stick Together or Split and Meet? University of Edinburgh, Management School (preprint, 1998)
Yu, X., Yung, M.: Agent Rendezvous: A Dynamic Symmtery-Breaking Problem. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 610–621. Springer, Heidelberg (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flocchini, P., Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C. (2004). Multiple Mobile Agent Rendezvous in a Ring. In: Farach-Colton, M. (eds) LATIN 2004: Theoretical Informatics. LATIN 2004. Lecture Notes in Computer Science, vol 2976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24698-5_62
Download citation
DOI: https://doi.org/10.1007/978-3-540-24698-5_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21258-4
Online ISBN: 978-3-540-24698-5
eBook Packages: Springer Book Archive