Skip to main content
SpringerLink
Log in

Local Maps: New Insights into Mobile Agent Algorithms

  • Conference paper
Distributed Computing (DISC 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5218))

Included in the following conference series:

  • 851 Accesses

Abstract

We address the problem of computing with mobile agents having small local maps. Several trade-offs concerning the radius of the local maps, the number of agents, the time complexity and the number of agent moves are proven. Our results are based on a generic simulation scheme allowing to transform any message passing algorithm into a mobile agent one. For instance, we show that using a near linear (resp. sublinear) number of agents having local maps of polylogarithmic (resp. sublinear) radius allows us to obtain a polylogarithmic (resp. sublinear) ratio between the time complexity of a message passing algorithm and its mobile agent counterpart. As a fundamental application, we show that there exists a universal algorithm that computes, from scratch, any global labeling function of any graph using n mobile agents knowing their o(n ε)-neighborhood (resp. without any neighborhood knowledge) in \(\widetilde{O}(D)\) time (resp. \(\widetilde{O}(\Delta+ D)\) expected time), where n,D,Δ are respectively the size, the diameter, the maximum degree of the graph and ε is an arbitrary small constant. For the leader election problem (resp. BFS tree construction), we obtain \(\widetilde{O}(D)\) time algorithms under the additional restriction of using mobile agents having only logO(1) n (resp. \(\widetilde{O}(n)\)) memory bits.

To the extent of our knowledge, the impact of local maps on mobile agent algorithms has not been studied in previous works. Our results prove that small local maps can have a strong global impact on the power of computing with mobile agents. Thus, we believe that the local map concept is likely to play an important role to a better understanding of the locality nature of mobile agent algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Afek, Y., Ricklin, M.: Sparser: a paradigm for running distributed algorithms. Journal of Algorithms 14, 316–328 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  2. Awerbuch, B.: Complexity of network synchronization. Journal of the ACM 32, 804–823 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  3. Awerbuch, B., Goldberg, A.V., Luby, M., Poltkin, S.A.: Network decomposition and locality in distributed computation. In: 30th Symposium on Foundations of Computer Science (FOCS), pp. 364–369 (1989)

    Google Scholar 

  4. Awerbuch, B., Goldreich, O., Vainish, R., Peleg, D.: A trade-off between information and communication in broadcast protocols. Journal of the ACM 37, 238–256 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  5. Awerbuch, B., Peleg, D.: Sparse partitions. In: 31st Symposium on Foundations of Computer Science (FOCS), pp. 503–513 (1990)

    Google Scholar 

  6. Barrière, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Can we elect if we cannot compare? In: 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 324–332 (2003)

    Google Scholar 

  7. Barriere, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Rendezvous and Election of Mobile Agents: Impact of Sense of Direction. Theory of Computing Systems (ToCS) 40, 143–162 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  8. Chalopin, J., Godard, E., Métivier, Y., Ossamy, R.: Mobile agent algorithms versus message passing algorithms. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 187–201. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Cooper, C., Klasing, R., Radzik, T.: Searching for black-hole faults in a network using multiple agents. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 320–332. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  10. 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)

    Google Scholar 

  11. Das, S., Flocchini, P., Santoro, N., Yamashita, M.: Fault-tolerant simulation of message-passing algorithms by mobile agents. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol. 4474, pp. 289–303. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. Derbel, B.: Local maps: New insights into mobile agent algorithms, Tech. Report RR-6511, INRIA - LIFL - USTL (April 2008), http://hal.inria.fr/

  13. Derbel, B., Gavoille, C.: Fast deterministic distributed algorithms for sparse spanners. In: Flocchini, P., Gąsieniec, L. (eds.) SIROCCO 2006. LNCS, vol. 4056, pp. 100–114. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  14. Flocchini, P., Nayak, A., Schulz, A.: Decontamination of arbitrary networks using a team of mobile agents with limited visibility. In: 6th IEEE/ACIS International Conference on Computer and Information Science, pp. 469–474 (2007)

    Google Scholar 

  15. Flocchini, P., Santoro, N.: Distributed security algorithms by mobile agents. In: 8th Conference on Distributed Computing and Networking, pp. 1–14 (2006)

    Google Scholar 

  16. Fraigniaud, P., Gavoille, C., Ilcinkas, D., Pelc, A.: Distributed computing with advice: Information sensitivity of graph coloring. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 231–242. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  17. Fraigniaud, P., Ilcinkas, D., Pelc, A.: Oracle size: a new measure of difficulty for communication tasks. In: 25th Symposium on Principles of Distributed Computing (PODC), pp. 179–187 (2006)

    Google Scholar 

  18. Fraigniaud, P., Ilcinkas, D., Pelc, A.: Tree exploration with an oracle. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 24–37. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  19. Fraigniaud, P., Korman, A., Lebhar, E.: Local mst computation with short advice. In: 19th Symp. on Parallel Algo. and Arch (SPAA), pp. 154–160 (2007)

    Google Scholar 

  20. Fukuda, M., Bic, L.F., Dillencourt, M.B., Cahill, J.M.: Messages versus messengers in distributed programming. Journal of Parallel and Distributed Computing 57, 188–211 (1999)

    Article  MATH  Google Scholar 

  21. Isler, V., Kannan, S., Khanna, S.: Randomized pursuit-evasion with limited visibility. In: 15th Symp. on Discrete algorithms (SODA), pp. 1053–1063 (2004)

    Google Scholar 

  22. Kazazakis, G.D., Argyros, A.A.: Fast positioning of limited-visibility guards for the inspection of 2d workspaces. In: IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 2843–2848 (2002)

    Google Scholar 

  23. Korman, A.: General compact labeling schemes for dynamic trees. Distributed Computing 20, 179–193 (2007)

    Article  Google Scholar 

  24. Korman, A., Kutten, S.: Labeling schemes with queries. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol. 4474, pp. 109–123. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  25. Korman, A., Kutten, S., Peleg, D.: Proof labeling schemes. In: 24th Symp. on Principles of distributed computing (PODC), pp. 9–18 (2005)

    Google Scholar 

  26. Korman, A., Peleg, D., Rodeh, Y.: Labeling schemes for dynamic tree networks. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 76–87. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  27. Kutten, S., Peleg, D.: Fast distributed construction of small k-dominating sets and applications. Journal of Algorithms 28, 40–66 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  28. Linial, N.: Locality in distributed graphs algorithms. SIAM Journal on Computing 21, 193–201 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  29. Moran, S., Snir, S.: Simple and efficient network decomposition and synchronization. Theoretical Computer Science 243, 217–241 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  30. Naor, M., Stockmeyer, L.: What can be computed locally? SIAM Journal on Computing 24, 1259–1277 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  31. Nisse, N., Soguet, D.: Graph searching with advice. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol. 4474, pp. 51–65. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  32. Pan, L., Bic, L.F., Dillencourt, M.B., Huseynov, J.J., Lai, M.K.: Distributed parallel computing using navigational programming. Journal of Parallel Programming 32, 1–37 (2004)

    Article  MATH  Google Scholar 

  33. Panconesi, A., Srinivasan, A.: On the complexity of distributed network decomposition. J. Algo. 20, 356–374 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  34. Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications (2000)

    Google Scholar 

  35. Souissi, S., Défago, X., Yamashita, M.: Using eventually consistent compasses to gather oblivious mobile robots with limited visibility. In: 8th Symposium on Stabilization, Safety, and Security of Distributed Systems, pp. 484–500 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique Fondamentale de Lille (LIFL), Université des Sciences et Technologies de Lille, France

    Bilel Derbel

Authors
  1. Bilel Derbel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gadi Taubenfeld

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Derbel, B. (2008). Local Maps: New Insights into Mobile Agent Algorithms. In: Taubenfeld, G. (eds) Distributed Computing. DISC 2008. Lecture Notes in Computer Science, vol 5218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87779-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87779-0_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87778-3

  • Online ISBN: 978-3-540-87779-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation