Advertisement

Space-Efficient Uniform Deployment of Mobile Agents in Asynchronous Unidirectional Rings

  • Masahiro ShibataEmail author
  • Hirotsugu Kakugawa
  • Toshimitsu Masuzawa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11085)

Abstract

In this paper, we consider the uniform deployment problem of mobile agents in asynchronous unidirectional ring networks. This problem requires agents to spread uniformly in the network. In this paper, we focus on the memory space per agent required to solve the problem. We consider two problem settings. The first setting assumes that agents have no multiplicity detection, that is, agents cannot detect whether another agent is staying at the same node or not. In this case, we show that each agent requires \(\varOmega (\log n)\) memory space to solve the problem, where n is the number of nodes. In addition, we propose an algorithm to solve the problem with \(O(k + \log n)\) memory space per agent, where k is the number of agents. The second setting assumes that each agent is equipped with the weak multiplicity detection, that is, agents can detect another agent staying at the same node, but cannot learn the exact number. Then, we show that the memory space per agent can be reduced to \(O(\log k + \log \log n)\). To the best of our knowledge, this is the first research considering the effect of the multiplicity detection on memory space required to solve problems.

Keywords

Distributed system Mobile agent Uniform deployment Ring network Space-efficient 

References

  1. 1.
    Gray, R.S., Kotz, D., Cybenko, G., Rus, D.: D’agents: applications and performance of a mobile-agent system. Softw. Pract. Exper. 32(6), 543–573 (2002)CrossRefGoogle Scholar
  2. 2.
    Lange, D.B., Oshima, M.: Seven good reasons for mobile agents. CACM 42(3), 88–89 (1999)CrossRefGoogle Scholar
  3. 3.
    Kranakis, E., Krizanc, D.: An algorithmic theory of mobile agents. In: Montanari, U., Sannella, D., Bruni, R. (eds.) TGC 2006. LNCS, vol. 4661, pp. 86–97. Springer, Heidelberg (2007).  https://doi.org/10.1007/978-3-540-75336-0_6CrossRefGoogle Scholar
  4. 4.
    Cao, J., Sun, Y., Wang, X., Das, S.K.: Scalable load balancing on distributed web servers using mobile agents. JPDC 63(10), 996–1005 (2003)zbMATHGoogle Scholar
  5. 5.
    Flocchini, P., Prencipe, G., Santoro, N.: Self-deployment of mobile sensors on a ring. Theor. Comput. Sci. 402(1), 67–80 (2008)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Yotam, E., Alfred, B.M.: Uniform multi-agent deployment on a ring. Theor. Comput. Sci. 412(8), 783–795 (2011)MathSciNetzbMATHGoogle Scholar
  7. 7.
    Barriere, L., Flocchini, P., Mesa-Barrameda, E., Santoro, N.: Uniform scattering of autonomous mobile robots in a grid. Int. J. Found. Comput. Sci. 22(03), 679–697 (2011)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Shibata, M., Mega, T., Ooshita, F., Kakugawa, H., Masuzawa, T.: Uniform deployment of mobile agents in asynchronous rings. In: PODC, pp. 415–424 (2016)Google Scholar
  9. 9.
    Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press, Cambridge (2000)CrossRefGoogle Scholar
  10. 10.
    Amos, O.R., Benjamin, P.: Residue Number Systems: Theory and Implementation, vol. 2. World Scientific, Singapore (2007)zbMATHGoogle Scholar
  11. 11.
    Pei, D., Salomaa, A., Ding, C.: Chinese Remainder Theorem: Applications in Computing, Coding, Cryptography. World Scientific, Singapore (1996)zbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Masahiro Shibata
    • 1
    Email author
  • Hirotsugu Kakugawa
    • 2
  • Toshimitsu Masuzawa
    • 2
  1. 1.Department of Computer Science and ElectronicsKyushu Institute of TechnologyIizuka, FukuokaJapan
  2. 2.Graduate School of Information Science and TechnologyOsaka UniversitySuita, OsakaJapan

Personalised recommendations