Advertisement

A Generic Distributed Algorithm for Computing by Random Mobile Agents

  • Shehla Abbas
  • Mohamed Mosbah
  • Akka Zemmari
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5044)

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.

Keywords

Mobile Agents Random Walks Distributed Algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abbas, S., Mosbah, M., Zemmari, A.: Distributed computation of a spanning tree in a dynamic graph by mobile agents. In: Proceedings of IEEE 1st International Conference on Engineering of Intelligent Systems, pp. 425–430 (April 2006)Google Scholar
  2. 2.
    Abbas, S., Mosbah, M., Zemmari, A.: Collecte d’informations par des agents mobiles. In: Nouvelles Technolologies de la Repartition (NOTERE) (June 2007)Google Scholar
  3. 3.
    Aldous, D.J.: The random walk construction of uniform spanning trees and uniform labelled trees. SIAM Journal on Discrete Mathematics 3(4), 450–465 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Baala, H., Flauzac, O., Gaber, J., Bui, M., El-Ghawani, T.: A self stabilizing distributed algorithm for spanning tree constructionin wireless ad hoc networks. J. Parallel Distributed Computation 63, 97–104 (2003)CrossRefzbMATHGoogle Scholar
  5. 5.
    Broder, A.Z.: Generating random spanning trees. In: Proc. 30th Ann. IEEE Symp. on Foundations of Computer Science, pp. 442–453 (October 1989)Google Scholar
  6. 6.
    Gruner, S., Metivier, Y., Mosbah, M., Wacrenier, P.A.: Distributed algorithm for computing a spanning tree in anonymous t-prime graphs. Studia Informatica Univesalis 2, 141–158 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Shehla Abbas
    • 1
  • Mohamed Mosbah
    • 1
  • Akka Zemmari
    • 1
  1. 1.LaBRI, Université Bordeaux 1TalenceFrance

Personalised recommendations