Mobile agent rendezvous in a ring
In the rendezvous search problem, two mobile agents must move along the n nodes of a network so as to minimize the time required to meet or rendezvous. When the mobile agents are identical and the network is anonymous. however, the resulting symmetry can make the problem impossible to solve. Symmetry is typically broken by having the mobile agents run either a randomized algorithm or different deterministic algorithms. We investigate the use of identical tokens to break symmetry so that the two mobile agents can run the same deterministic algorithm. After deriving the explicit conditions under which identical tokens can be used to break symmetry on the n node ring, we derive the lower and upper bounds for the time and memory complexity of the rendezvous search problem with various parameter sets. While these results suggest a possible tradeoff between the mobile agents' memory and the time complexity of the rendezvous search problem, we prove that this tradeoff is limited.
|Conference||23th IEEE International Conference on Distributed Computing Systems|
Kranakis, E, Santoro, N, Sawchuk, C. (Cindy), & Krizanc, D. (Danny). (2003). Mobile agent rendezvous in a ring. Presented at the 23th IEEE International Conference on Distributed Computing Systems.