A Generic Distributed Algorithm for Computing by Random Mobile Agents

Authors:
Shehla Abbas;Mohamed Mosbah;Akka Zemmari
Affiliations:
LaBRI, Université Bordeaux 1, Talence, France 33405;LaBRI, Université Bordeaux 1, Talence, France 33405;LaBRI, Université Bordeaux 1, Talence, France 33405
Venue:
Agent Computing and Multi-Agent Systems
Year:
2009

Citing 3
Cited 0

The random walk construction of uniform spanning trees and uniform labelled trees

SIAM Journal on Discrete Mathematics
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
Generating random spanning trees

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we investigate the following problem: k mobile agents are placed in a network. The agents initially move in the network using random walks. They have unique identities and mark on the ${\mathcal WB}$ (memory location for nodes) on arriving at any node v . We give an algorithm for the agents to do random walk and mark nodes of the network. This has many applications such as constructing a spanning tree. The agents on entering a region of bigger identity agents transfer the knowledge and submit themselves to bigger identity agents hence reducing the number of agents in the network.