A probabilistic model for distributed merging of mobile agents

Authors:
Shehla Abbas;Mohamed Mosbah;Akka Zemmari
Affiliations:
LaBRI, University of Bordeaux, Talence, France;LaBRI, University of Bordeaux, Talence, France;LaBRI, University of Bordeaux, Talence, France
Venue:
VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
Year:
2008

Citing 6
Cited 1

Meeting times of random walks on graphs

Information Processing Letters
Random Leaders and Random Spanning Trees

Proceedings of the 3rd International Workshop on Distributed Algorithms
Gathering of Asynchronous Oblivious Robots with Limited Visibility

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks

Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
Searching for black-hole faults in a network using multiple agents

OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Mobile agent rendezvous: a survey

SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity

Mobile agent systems and cellular automata

Autonomous Agents and Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a probabilistic algorithm for mobile agents which roam around in the network following a random walk. We consider the following problem: when two or more agents meet at a node, they merge into a single agent. As the graph is connected, the agents meet in finite time. We are interested in the time it takes for all agents to merge. More precisely, we study a probabilistic model and we analyse the time complexity of a distributed algorithm for all the agents to merge into a single one.