Rendezvous and Election of Mobile Agents: Impact of Sense of Direction

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 neighbouring 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-label...

• Type: Journal
• Year: 2007
• Where: MST
• Authors: Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro
• Keywords: Asynchronous Mobile Agents, Deterministic Generic Solutions, MST 2007, Node