Abstract
Consider a collection of r identical asynchronous mobile agents dispersed on an arbitrary anonymous network of size n. The agents all execute the same protocol and move from node to neighboring node. At each node there is a whiteboard where the agents can write and read from. The topology of the network is unknown to the agents. We examine the problems of rendezvous (i.e., having the agents gather in the same node) and election (i.e., selecting a leader among those agents). These two problems are computationally equivalent in the context examined here. We study conditions for the existence of deterministic generic solutions, i.e., algorithms that solve the two problems regardless of the network topology and the initial placement of the agents. In particular, we study the impact of edge-labeling on the existence of such solutions. Rendezvous and election are unsolvable (i.e., there are no deterministic generic solutions) if gcd(r,n) > 1, regardless of whether or not the edge-labeling has sense of direction. On the other hand, if gcd(r,n) = 1 then the initial placement of the robots in the network creates topological asymmetries that could be exploited to solve the problems. We prove that these asymmetries can be exploited if the edge-labeling has sense of direction, but cannot if the edge-labeling is arbitrary. The possibility proof is constructive: we present a solution protocol and prove its correctness. The protocol, among other features, uses a dynamic naming mechanism based on sense of direction to overcome the complete anonymity of the system.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Barriere, L., Flocchini, P., Fraigniaud, P. et al. Rendezvous and Election of Mobile Agents: Impact of Sense of Direction. Theory Comput Syst 40, 143–162 (2007). https://doi.org/10.1007/s00224-005-1223-5
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-005-1223-5