A generic distributed algorithm for computing by random mobile agents

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 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. © Springer-Verlag Berlin Heidelberg 2009.