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.
This work has been supported by the french project “Agence Nationale de la Recherche ANR-06-SETI-015”.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
Abbas, S., Mosbah, M., Zemmari, A.: Collecte d’informations par des agents mobiles. In: Nouvelles Technolologies de la Repartition (NOTERE) (June 2007)
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)
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)
Broder, A.Z.: Generating random spanning trees. In: Proc. 30th Ann. IEEE Symp. on Foundations of Computer Science, pp. 442–453 (October 1989)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abbas, S., Mosbah, M., Zemmari, A. (2009). A Generic Distributed Algorithm for Computing by Random Mobile Agents. In: Ghose, A., Governatori, G., Sadananda, R. (eds) Agent Computing and Multi-Agent Systems. PRIMA 2007. Lecture Notes in Computer Science(), vol 5044. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01639-4_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-01639-4_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01638-7
Online ISBN: 978-3-642-01639-4
eBook Packages: Computer ScienceComputer Science (R0)