Multiple Mobile Agent Rendezvous in a Ring

  • Paola Flocchini
  • Evangelos Kranakis
  • Danny Krizanc
  • Nicola Santoro
  • Cindy Sawchuk
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2976)

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.

References

  1. 1.
    Alpern, S.: Rendezvous Search: A Personal Perspective. Operations Research 50(5), 772–795 (2002)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer Academic Publishers, London (2003)MATHGoogle Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Baston, V., Gal, S.: Rendezvous Search When Marks are Left at the Starting Points. Naval Research Logistics 47(6), 722–731 (2001)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Gal, S.: Rendezvous Search on the Line. Operations Research 47(6), 849–861 (1999)CrossRefMathSciNetGoogle Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Rendezvous Search on the Line with More than Two Players, Operations Research 45, 357–364 (1997)Google Scholar
  9. 9.
    Pikounis, M., Thomas, L.C.: Many Player Rendezvous Search: Stick Together or Split and Meet? University of Edinburgh, Management School (preprint, 1998)Google Scholar
  10. 10.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Paola Flocchini
    • 1
  • Evangelos Kranakis
    • 2
  • Danny Krizanc
    • 3
  • Nicola Santoro
    • 2
  • Cindy Sawchuk
    • 2
  1. 1.SITE, University of OttawaOttawaCanada
  2. 2.School of Computer ScienceCarleton UniversityOttawaCanada
  3. 3.Department of Mathematics and Computer ScienceWesleyan UniversityMiddletownUSA

Personalised recommendations