Optimal memory rendezvous of anonymous mobile agents in a unidirectional ring

L. Ga̧sieniec, E. Kranakis, D. Krizanc, X. Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Scopus citations

Abstract

We study the rendezvous problem with k≥2 mobile agents in a n-node ring. We present a new algorithm which solves the rendezvous problem for any non-periodic distribution of agents on the ring. The mobile agents require the use of O(log k)-bit-wise size of internal memory and one indistinguishable token each. In the periodic (but not symmetric) case our new procedure allows the agents to conclude that rendezvous is not feasible. It is known that in the symmetric case the agents cannot decide the feasibility of rendezvous if their internal memory is limited to ω(log log n) bits, see [15]. In this context we show new space optimal deterministic algorithm allowing effective recognition of the symmetric case. The algorithm is based on O(log k + log log n)-bit internal memory and a single token provided to each mobile agent. Finally, it is known that both in the periodic as well as in the symmetric cases the rendezvous cannot be accomplished by any deterministic procedure due to problems with breaking symmetry.

Original languageEnglish (US)
Title of host publicationSOFSEM 2006
Subtitle of host publicationTheory and Practice of Computer Science - 32nd Conference on Current Trends in Theory and Practice of Computer Science, Proceedings
PublisherSpringer Verlag
Pages282-292
Number of pages11
ISBN (Print)354031198X, 9783540311980
DOIs
StatePublished - 2006
Externally publishedYes
Event32nd Conference on Current Trends in Theory and Practice of Computer Science - Merin, Czech Republic
Duration: Jan 21 2006Jan 27 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3831 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference32nd Conference on Current Trends in Theory and Practice of Computer Science
CountryCzech Republic
CityMerin
Period1/21/061/27/06

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Optimal memory rendezvous of anonymous mobile agents in a unidirectional ring'. Together they form a unique fingerprint.

  • Cite this

    Ga̧sieniec, L., Kranakis, E., Krizanc, D., & Zhang, X. (2006). Optimal memory rendezvous of anonymous mobile agents in a unidirectional ring. In SOFSEM 2006: Theory and Practice of Computer Science - 32nd Conference on Current Trends in Theory and Practice of Computer Science, Proceedings (pp. 282-292). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3831 LNCS). Springer Verlag. https://doi.org/10.1007/11611257_26