Abstract
In this paper we propose a new strategy for tracking mobile agents in a network. Our proposal is based on a semi-cooperative approach: while performing its own prescribed task, a mobile agent moves keeping in mind that a searching agent might be looking for it. In doing so we want a fully distributed solution that does not rely on a central server, and we also want to avoid the use of long forwarding pointers. Our proposal is based on appropriate delays that the mobile agents must perform while moving on the network so to facilitate its tracking, should it be needed. The searching agent computes a particular searching path that will guarantee the tracking within one traversal of the network. The delays to be computed depend on structural properties of the network. We perform several experiments following different strategies for computing the searching path and we compare our results.
Chapter PDF
Similar content being viewed by others
References
Adler, M., Racke, H., Sivadasan, N., Sohler, C., Vocking, B.: Randomized pursuit-evasion in graphs. In: Int. Colloquium on Automata, Languages and Programming, pp. 901–912 (2002)
Alouf, S., Huet, F., Nain, P.: Forwarders vs. centralized server: An evaluation of two approaches for locating mobile agents. Performance Evaluation 49(1-4), 299–319 (2002)
Alpern, S., Gal, S.: The theory of search games and rendezvous. Kluwer Academic Publishers, Dordrecht (2003)
Baumann, J.: Mobile Agents: Control Algorithms. LNCS, vol. 1658. Springer, Heidelberg (2000)
Demirbas, M., Arora, A., Gouda, M.G.: A pursuer-evader game for sensor networks. In: Pro. 6th Symposium on Self-Stabilizing Systems, pp. 1–16 (2003)
Diaz, J., Petit, B.J., Serna, M.: A survey of graph layout problems. ACM Computing Surveys 34(3), 313–356 (2002)
Fowler, R.J.: The complexity of using forwarding addresses for decentralized object finding. In: 5th ACM Symp. on Principles of Distributed Computing, pp. 108–120. ACM Press, New York (1986)
Jung: Java Universal Network/Graph Framework, http://jung.sourceforge.net/
Lien, Y., Leng, C.W.R.: On the search of mobile agents. In: 7th IEEE Int. Symposium on Personal, Indoor, and Mobile Radio Communications, pp. 703–707. IEEE Computer Society Press, Los Alamitos (1996)
Kranakis, E., Krizanc, D., Rajsbaum, S.: Mobile agent rendezvous. In: 13th Int. Coll. on Structural Information and Communication Complexity, pp. 1–9 (2006)
Parsons, T.D.: Pursuit-evasion in a graph. In: Jantke, K.P. (ed.) AII 1992. LNCS, vol. 642, pp. 426–441. Springer, Heidelberg (1992)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flocchini, P., Xie, M. (2007). A Decentralized Solution for Locating Mobile Agents. In: Kermarrec, AM., Bougé, L., Priol, T. (eds) Euro-Par 2007 Parallel Processing. Euro-Par 2007. Lecture Notes in Computer Science, vol 4641. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74466-5_65
Download citation
DOI: https://doi.org/10.1007/978-3-540-74466-5_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74465-8
Online ISBN: 978-3-540-74466-5
eBook Packages: Computer ScienceComputer Science (R0)