Brief Announcement: Self-Stabilizing Graph Exploration by a Single Agent

Authors Yuichi Sudo , Fukuhito Ooshita , Sayaka Kamei



PDF
Thumbnail PDF

File

LIPIcs.DISC.2024.55.pdf
  • Filesize: 0.58 MB
  • 7 pages

Document Identifiers

Author Details

Yuichi Sudo
  • Hosei University, Tokyo, Japan
Fukuhito Ooshita
  • Fukui University of Technology, Fukui, Japan
Sayaka Kamei
  • Hiroshima University, Hiroshima, Japan

Cite As Get BibTex

Yuichi Sudo, Fukuhito Ooshita, and Sayaka Kamei. Brief Announcement: Self-Stabilizing Graph Exploration by a Single Agent. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 55:1-55:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.DISC.2024.55

Abstract

In this paper, we present two self-stabilizing algorithms that enable a single (mobile) agent to explore graphs. The agent visits all nodes starting from any configuration, i.e., regardless of the initial state of the agent, the initial states of all nodes, and the initial location of the agent. We evaluate the algorithms using two metrics: cover time, which is the number of moves required to visit all nodes, and memory usage, which includes the storage needed for the state of the agent and the state of each node. The first algorithm is randomized. Given an integer c = Ω(n), the cover time of this algorithm is optimal, i.e., O(m) in expectation, and the memory requirements for the agent and each node v are O(log c) and O(log (c+δ_v)) bits, respectively, where n and m are the numbers of nodes and edges, respectively, and δ_v is the degree of v. The second algorithm is deterministic. It requires an input integer k ≥ max(D,δ_max), where D and δ_max are the diameter and the maximum degree of the graph, respectively. The cover time of this algorithm is O(m + nD), and it uses O(log k) bits both for agent memory and each node.

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
Keywords
  • mobile agents
  • self-stabilization
  • graph exploration

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Romas Aleliunas, Richard M Karp, Richard J Lipton, Laszlo Lovasz, and Charles Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. In 20th Annual Symposium on Foundations of Computer Science (sfcs 1979), pages 218-223. IEEE, 1979. Google Scholar
  2. Lélia Blin, Maria Gradinariu Potop-Butucaru, and Sébastien Tixeuil. On the self-stabilization of mobile robots in graphs. In International Conference On Principles Of Distributed Systems, pages 301-314. Springer, 2007. URL: https://doi.org/10.1007/978-3-540-77096-1_22.
  3. Ajoy K Datta, Colette Johnen, Franck Petit, and Vincent Villain. Self-stabilizing depth-first token circulation in arbitrary rooted networks. Distributed Computing, 13(4):207-218, 2000. URL: https://doi.org/10.1007/PL00008919.
  4. Edsger W Dijkstra. Self-stabilization in spite of distributed control. In Selected writings on computing: a personal perspective, pages 41-46. Springer, 1982. Google Scholar
  5. Shlomi Dolev, Amos Israeli, and Shlomo Moran. Uniform dynamic self-stabilizing leader election. IEEE Transactions on Parallel and Distributed Systems, 8(4):424-440, 1997. URL: https://doi.org/10.1109/71.588622.
  6. Shing-Tsaan Huang and Nian-Shing Chen. Self-stabilizing depth-first token circulation on networks. Distributed Computing, 7(1):61-66, 1993. URL: https://doi.org/10.1007/BF02278857.
  7. Satoshi Ikeda, Izumi Kubo, and Masafumi Yamashita. The hitting and cover times of random walks on finite graphs using local degree information. Theoretical Computer Science, 410(1):94-100, 2009. URL: https://doi.org/10.1016/J.TCS.2008.10.020.
  8. Toshimitsu Masuzawa and Sébastien Tixeuil. Quiescence of self-stabilizing gossiping among mobile agents in graphs. Theoretical computer science, 411(14-15):1567-1582, 2010. URL: https://doi.org/10.1016/J.TCS.2010.01.006.
  9. Peter Matthews. Covering problems for markov chains. The Annals of Probability, 16(3):1215-1228, 1988. Google Scholar
  10. Fukuhito Ooshita, Ajoy K Datta, and Toshimitsu Masuzawa. Self-stabilizing rendezvous of synchronous mobile agents in graphs. In International Symposium on Stabilization, Safety, and Security of Distributed Systems, pages 18-32. Springer, 2017. URL: https://doi.org/10.1007/978-3-319-69084-1_2.
  11. P. Panaite and A. Pelc. Exploring unknown undirected graphs. Journal of Algorithms, 33(2):281-295, 1999. URL: https://doi.org/10.1006/JAGM.1999.1043.
  12. Franck Petit. Fast self-stabilizing depth-first token circulation. In International Workshop on Self-Stabilizing Systems, pages 200-215. Springer, 2001. URL: https://doi.org/10.1007/3-540-45438-1_14.
  13. Vyatcheslav B Priezzhev, Deepak Dhar, Abhishek Dhar, and Supriya Krishnamurthy. Eulerian walkers as a model of self-organized criticality. Physical Review Letters, 77(25):5079, 1996. Google Scholar
  14. O Reingold. Undirected connectivity in log-space. Journal of the ACM (JACM), 55(4):1-24, 2008. URL: https://doi.org/10.1145/1391289.1391291.
  15. Yuichi Sudo, Daisuke Baba, Junya Nakamura, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa. A single agent exploration in unknown undirected graphs with whiteboards. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 98(10):2117-2128, 2015. URL: https://doi.org/10.1587/TRANSFUN.E98.A.2117.
  16. Yuichi Sudo, Fukuhito Ooshita, and Sayaka Kamei. Self-stabilizing graph exploration by a single agent, 2020. URL: https://arxiv.org/abs/2010.08929.
  17. Amnon Ta-Shma and Uri Zwick. Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences. ACM Transactions on Algorithms (TALG), 10(3):1-15, 2014. URL: https://doi.org/10.1145/2601068.
  18. Vladimir Yanovski, Israel A Wagner, and Alfred M Bruckstein. A distributed ant algorithm for efficiently patrolling a network. Algorithmica, 37(3):165-186, 2003. URL: https://doi.org/10.1007/S00453-003-1030-9.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail