Document Open Access Logo

Gathering in Carrier Graphs: Meeting via Public Transportation System

Authors Haozhi Zheng , Ryota Eguchi , Fukuhito Ooshita , Michiko Inoue

PDF
Thumbnail PDF

File

LIPIcs.SAND.2024.21.pdf
  • Filesize: 0.71 MB
  • 17 pages

Document Identifiers

Author Details

Haozhi Zheng
  • Graduate School of Science and Technology, Nara Institute of Science and Technology, Japan
Ryota Eguchi
  • Graduate School of Science and Technology, Nara Institute of Science and Technology, Japan
Fukuhito Ooshita
  • Faculty of Engineering, Fukui University of Technology, Japan
Michiko Inoue
  • Graduate School of Science and Technology, Nara Institute of Science and Technology, Japan

Funding

This work was supported by JSPS KAKENHI Grant Numbers 22K11903, 23H03347. The second author was supported by JSPS KAKENHI Grant Number 22H03569.

Cite As Get BibTex

Haozhi Zheng, Ryota Eguchi, Fukuhito Ooshita, and Michiko Inoue. Gathering in Carrier Graphs: Meeting via Public Transportation System. In 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 292, pp. 21:1-21:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.SAND.2024.21

Abstract

The gathering problem requires multiple mobile agents in a network to meet at a single location. This paper investigates the gathering problem in carrier graphs, a subclass of recurrence of edge class of time-varying graphs. By focusing on three subclasses of single carrier graphs - circular, simple, and arbitrary - we clarify the conditions under which the problem can be solved, considering prior knowledge endowed to agents and obtainable online information, such as the count and identifiers of agents or sites. We propose algorithms for solvable cases and analyze the complexities and we give proofs for the impossibility for unsolvable cases. We also consider general carrier graphs with multiple carriers and propose an algorithm for arbitrary carrier graphs. To the best of our knowledge, this is the first work that investigates the gathering problem in carrier graphs.

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
Keywords
  • Gathering
  • Carrier Graph
  • Time-varying Graph
  • Mobile agent

Metrics

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

References

  1. Steve Alpern and Shmuel Gal. The theory of search games and rendezvous, volume 55 of International series in operations research and management science. Kluwer, 2003. URL: https://doi.org/10.1007/b10080.
  2. Marjorie Bournat, Swan Dubois, and Franck Petit. Gracefully degrading gathering in dynamic rings. In Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, volume 11201 of Lecture Notes in Computer Science, pages 349-364. Springer, 2018. URL: https://doi.org/10.1007/978-3-030-03232-6_23.
  3. Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, and Nicola Santoro. Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distributed Syst., 27(5):387-408, 2012. URL: https://doi.org/10.1080/17445760.2012.668546.
  4. Yoann Dieudonné, Andrzej Pelc, and David Peleg. Gathering despite mischief. ACM Trans. Algorithms, 11(1):1:1-1:28, 2014. URL: https://doi.org/10.1145/2629656.
  5. Paola Flocchini, Matthew Kellett, Peter C. Mason, and Nicola Santoro. Finding good coffee in paris. In Evangelos Kranakis, Danny Krizanc, and Flaminia L. Luccio, editors, Fun with Algorithms - 6th International Conference, volume 7288 of Lecture Notes in Computer Science, pages 154-165. Springer, 2012. URL: https://doi.org/10.1007/978-3-642-30347-0_17.
  6. Paola Flocchini, Bernard Mans, and Nicola Santoro. On the exploration of time-varying networks. Theoretical Computer Science, 469:53-68, 2013. URL: https://doi.org/10.1016/j.tcs.2012.10.029.
  7. Paola Flocchini, Nicola Santoro, Peter C. Mason, and Matthew Kellett. Black hole search in the network and subway models. Theoretical Computer Science, 50:158-184, 2012. URL: https://doi.org/10.1007/s00224-011-9341-8.
  8. Tsuyoshi Gotoh, Paola Flocchini, Toshimitsu Masuzawa, and Nicola Santoro. Tight bounds on distributed exploration of temporal graphs. In Pascal Felber, Roy Friedman, Seth Gilbert, and Avery Miller, editors, 23rd International Conference on Principles of Distributed Systems, volume 153 of LIPIcs, pages 22:1-22:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPICS.OPODIS.2019.22.
  9. Tsuyoshi Gotoh, Yuichi Sudo, Fukuhito Ooshita, and Toshimitsu Masuzawa. Dynamic ring exploration with (h, S) view. Algorithms, 13(6):141, 2020. URL: https://doi.org/10.3390/A13060141.
  10. Jion Hirose, Junya Nakamura, Fukuhito Ooshita, and Michiko Inoue. Gathering with a strong team in weakly byzantine environments. In Proceedings of the 22nd International Conference on Distributed Computing and Networking, ICDCN '21, pages 26-35. Association for Computing Machinery, 2021. URL: https://doi.org/10.1145/3427796.3427799.
  11. David Ilcinkas and Ahmed M. Wade. Exploration of carrier-based time-varying networks: The power of waiting. Theoretical Computer Science, 841:50-61, 2020. URL: https://doi.org/10.1016/j.tcs.2020.07.003.
  12. Ari Keränen and Jörg Ott. DTN over aerial carriers. In Martin May, Gunnar Karlsson, and Ellen W. Zegura, editors, Proceedings of the 4th ACM workshop on Challenged networks, pages 67-76. ACM, 2009. URL: https://doi.org/10.1145/1614222.1614234.
  13. Cong Liu and Jie Wu. Scalable routing in cyclic mobile networks. IEEE Trans. Parallel Distributed Syst., 20(9):1325-1338, 2009. URL: https://doi.org/10.1109/TPDS.2008.218.
  14. Giuseppe Antonio Di Luna, Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, and Giovanni Viglietta. Gathering in dynamic rings. Theor. Comput. Sci., 811:79-98, 2020. URL: https://doi.org/10.1016/J.TCS.2018.10.018.
  15. Othon Michail, Paul G. Spirakis, and Michail Theofilatos. Beyond rings: Gathering in 1-interval connected graphs. Parallel Process. Lett., 31(4):2150020:1-2150020:31, 2021. URL: https://doi.org/10.1142/S0129626421500201.
  16. Fukuhito Ooshita and Ajoy K. Datta. Brief announcement: Feasibility of weak gathering in connected-over-time dynamic rings. In Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, volume 11201 of Lecture Notes in Computer Science, pages 393-397. Springer, 2018. URL: https://doi.org/10.1007/978-3-030-03232-6_27.
  17. Andrzej Pelc. Deterministic rendezvous algorithms. In Paola Flocchini, Giuseppe Prencipe, and Nicola Santoro, editors, Distributed Computing by Mobile Entities, Current Research in Moving and Computing, volume 11340 of Lecture Notes in Computer Science, pages 423-454. Springer, 2019. URL: https://doi.org/10.1007/978-3-030-11072-7_17.
  18. Masahiro Shibata, Yuichi Sudo, Junya Nakamura, and Yonghwan Kim. Partial gathering of mobile agents in dynamic rings. In Colette Johnen, Elad Michael Schiller, and Stefan Schmid, editors, Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, volume 13046 of Lecture Notes in Computer Science, pages 440-455. Springer, 2021. URL: https://doi.org/10.1007/978-3-030-91081-5_29.
  19. Shin-Ywan Wang, J. Leigh Torgerson, Joshua Schoolcraft, and Yan Brenman. The deep impact network experiment operations center monitor and control system. In 2009 Third IEEE International Conference on Space Mission Challenges for Information Technology, pages 34-40, 2009. URL: https://doi.org/10.1109/SMC-IT.2009.13.
  20. Xiaolan Zhang, Jim Kurose, Brian Neil Levine, Donald F. Towsley, and Honggang Zhang. Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing. In Evangelos Kranakis, Jennifer C. Hou, and Ram Ramanathan, editors, Proceedings of the 13th Annual International Conference on Mobile Computing and Networking, pages 195-206. ACM, 2007. URL: https://doi.org/10.1145/1287853.1287876.
  21. Wenrui Zhao and M.H. Ammar. Message ferrying: proactive routing in highly-partitioned wireless ad hoc networks. In The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems, pages 308-314, 2003. URL: https://doi.org/10.1109/FTDCS.2003.1204352.
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
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact