Abstract
In this paper, we are interested in the computational power of a mobile agent system and, more particularly, in the comparison with a message passing system. First we give formal definitions. Then we explain how a mobile agent algorithm can be simulated by a message passing algorithm.We also prove that any message passing algorithm can be implemented by a mobile agent algorithm. As a consequence of this result, known characterisations of solvable tasks by message passing algorithms can be translated into characterisations of solvable tasks by mobile agent algorithms. We illustrate this result with the election problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Attiya, H., Welch, J.: Distributed computing: fundamentals, simulations, and advanced topics. McGraw-Hill, New York (1998)
Awerbuch, B., Betke, M., Rivest, R., Singh, M.: Piecemeal graph exploration by a mobile robot (extended abstract). In: Proc. of the eighth annual conference on Computational Learning Theory, COLT 1995, pp. 321–328. ACM Press, New York (1995)
Barrière, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Can we elect if we cannot compare? In: Proc. of the fifteenth annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2003, pp. 324–332. ACM Press, New York (2003)
Barriére, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Election and rendezvous in fully anonymous systems with sense of direction. In: Proc. of the 10th International Colloquium on Structural Information Complexity, SIROCCO 2003, vol. 17, pp. 17–32. Carleton Scientific (2003)
Barriére, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Rendezvous and election of mobile agents: impact of sense of direction. Theory of Computing Systems (to appear)
Bender, M., Slonim, D.: The power of team exploration: Two robots can learn unlabeled directed graphs. In: Proc. of the 35th annual Symposium on Foundations of Computer Science, FOCS 1994, pp. 75–85 (1994)
Boldi, P., Codenotti, B., Gemmell, P., Shammah, S., Simon, J., Vigna, S.: Symmetry breaking in anonymous networks: Characterizations. In: Proc. 4th Israeli Symposium on Theory of Computing and Systems, pp. 16–26. IEEE Press, Los Alamitos (1996)
Braun, P., Rossak, W.: Mobile agents: basic concepts, mobility models and the tracy toolkit. Morgan Kaufman, San Francisco (2005)
Chalopin, J., Métivier, Y.: A bridge between the asynchronous message passing model and local computations in graphs (extended abstract). In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 212–223. Springer, Heidelberg (2005)
Das, S., Flocchini, P., Nayak, A., Santoro, N.: Distributed exploration of an unknown graph. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol. 3499, pp. 99–114. Springer, Heidelberg (2005)
Deng, X., Kameda, T., Papadimitriou, C.: How to learn an unknown environment. i: the rectilinear case. J. ACM 45(2), 215–245 (1998)
Dessmark, A., Fraigniaud, P., Pelc, A.: Deterministic rendezvous in graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 184–195. Springer, Heidelberg (2003)
Flocchini, P., Roncato, A., Santoro, N.: Computing on anonymous networks with sense of direction. Theoretical Computer Science 301, 355–379 (2003)
LeLann, G.: Distributed systems: Towards a formal approach. In: Gilchrist, B. (ed.) Information processing 1977, pp. 155–160. North-Holland, Amsterdam (1977)
Norris, N.: Universal covers of graphs: isomorphism to depth n − 1 implies isomorphism to all depths. Discrete Applied Math. 56, 61–74 (1995)
Tel, G.: Introduction to distributed algorithms. Cambridge University Press, Cambridge (2000)
Yamashita, M., Kameda, T.: Computing on anonymous networks: Part i - characterizing the solvable cases. IEEE Transactions on parallel and distributed systems 7(1), 69–89 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chalopin, J., Godard, E., Métivier, Y., Ossamy, R. (2006). Mobile Agent Algorithms Versus Message Passing Algorithms. In: Shvartsman, M.M.A.A. (eds) Principles of Distributed Systems. OPODIS 2006. Lecture Notes in Computer Science, vol 4305. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11945529_14
Download citation
DOI: https://doi.org/10.1007/11945529_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49990-9
Online ISBN: 978-3-540-49991-6
eBook Packages: Computer ScienceComputer Science (R0)