Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
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
Computing on anonymous networks with sense of direction
Theoretical Computer Science
Mobile agent rendezvous in the ring
Mobile agent rendezvous in the ring
Asynchronous deterministic rendezvous in graphs
Theoretical Computer Science
Deterministic Rendezvous in Graphs
Algorithmica
Gathering asynchronous oblivious mobile robots in a ring
Theoretical Computer Science
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
Mobile agent rendezvous in a ring using faulty tokens
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Polynomial deterministic rendezvous in arbitrary graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Effective elections for anonymous mobile agents
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Mobile agent rendezvous in a synchronous torus
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Rendezvous of mobile agents in unknown graphs with faulty links
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Randomized rendezvous with limited memory
ACM Transactions on Algorithms (TALG)
Space-optimal rendezvous of mobile agents in asynchronous trees
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Deterministic network exploration by a single agent with Byzantine tokens
Information Processing Letters
Randomized rendezvous of mobile agents in anonymous unidirectional ring networks
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Linear time and space gathering of anonymous mobile agents in asynchronous trees
Theoretical Computer Science
| Hi-index | 0.00 |
We consider the problem of Rendezvous or gathering of multiple autonomous entities (called mobile agents) moving in an unlabelled environment (modelled as a graph). The problem is usually solved using randomization or assuming distinct identities for the agents, such that they can execute different protocols. When the agents are all identical and deterministic, and the environment itself is symmetrical (e.g. a ring) it is difficult to break the symmetry between them unless, for example, the agents are provided with a token to mark the nodes. We consider fault-tolerant protocols for the problem where the tokens used by the agents may disappear unexpectedly. If all tokens fail, then it becomes impossible, in general, to solve the problem. However, we show that with any number of failures (less than a total collapse), we can always solve the problem if the original instance of the problem was solvable. Unlike previous solutions, we can tolerate failures occurring at arbitrary times during the execution of the algorithm. Our solution can be applied to any arbitrary network even when the topology is unknown.