Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct
IEEE Transactions on Parallel and Distributed Systems
Discrete Mathematics
Agent Rendezvous: A Dynamic Symmetry-Breaking Problem
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Can we elect if we cannot compare?
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Map construction of unknown graphs by multiple agents
Theoretical Computer Science
Election and rendezvous with incomparable labels
Theoretical Computer Science
About the Termination Detection in the Asynchronous Message Passing Model
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Deterministic Rendezvous in Trees with Little Memory
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
How to meet asynchronously (almost) everywhere
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Mobile agent algorithms versus message passing algorithms
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Effective elections for anonymous mobile agents
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Gathering of robots on anonymous grids without multiplicity detection
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
How to gather asynchronous oblivious robots on anonymous rings
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Hi-index | 0.00 |
The exploration of a connected graph by multiple mobile agents has been previously studied under different conditions. A fundamental coordination problem in this context is the gathering of all agents at a single node, called the Rendezvous problem. To allow deterministic exploration, it is usually assumed that the edges incident to a node are locally ordered according to a fixed function called local orientation. We show that having a fixed local orientation is not necessary for solving rendezvous; Two or more agents having possibly distinct local orientation functions can rendezvous in all instances where rendezvous is solvable under a common local orientation function. This result is surprising and extends the known characterization of solvable instances for rendezvous and leader election in anonymous networks. On one hand, our model is more general than the anonymous port-to-port network model and on the other hand it is less powerful than qualitative model of Barrière et al. [4,9] where the agents have distinct labels. Our results hold even in the simplest model of communication using identical tokens and in fact, we show that using two tokens per agent is necessary and sufficient for solving the problem.