LIPIcs.SAND.2024.25.pdf
- Filesize: 0.51 MB
- 5 pages
Document
Brief Announcement: Crash-Tolerant Exploration of Trees by Energy Sharing Mobile Agents
Authors
Quentin Bramas 
,
Toshimitsu Masuzawa ,
Sébastien Tixeuil
-
Part of:
Volume:
3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Symposium on Algorithmic Foundations of Dynamic Networks (SAND) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2024-05-31
File
Document Identifiers
Author Details
Cite As Get BibTex
Quentin Bramas, Toshimitsu Masuzawa, and Sébastien Tixeuil. Brief Announcement: Crash-Tolerant Exploration of Trees by Energy Sharing Mobile Agents. In 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 292, pp. 25:1-25:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.SAND.2024.25
Abstract
We consider the problem of graph exploration by energy sharing mobile agents that are subject to crash faults. More precisely, we consider a team of two agents where at most one of them may fail unpredictably, and the considered topology is that of acyclic graphs (i.e. trees). We consider both the asynchronous and the synchronous settings, and we provide necessary and sufficient conditions about the energy in two settings: line-shaped graphs, and general trees.
Subject Classification
ACM Subject Classification
- Theory of computation → Distributed algorithms
- Computing methodologies → Mobile agents
Keywords
- Mobile Agents
- Distributed Algorithms
- Energy sharing
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- Quentin Bramas, Toshimitsu Masuzawa, and Sébastien Tixeuil. Brief announcement: Crash-tolerant exploration by energy sharing mobile agents. In Shlomi Dolev and Baruch Schieber, editors, Stabilization, Safety, and Security of Distributed Systems - 25th International Symposium, SSS 2023, Jersey City, NJ, USA, October 2-4, 2023, Proceedings, volume 14310 of Lecture Notes in Computer Science, pages 380-384. Springer, 2023. URL: https://doi.org/10.1007/978-3-031-44274-2_28.
- Jurek Czyzowicz, Dariusz Dereniowski, Robert Ostrowski, and Wojciech Rytter. Gossiping by energy-constrained mobile agents in tree networks. Theor. Comput. Sci., 861:45-65, 2021. URL: https://doi.org/10.1016/j.tcs.2021.02.009.
- Jurek Czyzowicz, Krzysztof Diks, Jean Moussi, and Wojciech Rytter. Communication problems for mobile agents exchanging energy. In Jukka Suomela, editor, Structural Information and Communication Complexity - 23rd International Colloquium, SIROCCO 2016, Helsinki, Finland, July 19-21, 2016, Revised Selected Papers, volume 9988 of Lecture Notes in Computer Science, pages 275-288, 2016. URL: https://doi.org/10.1007/978-3-319-48314-6_18.
- Jurek Czyzowicz, Stefan Dobrev, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov, and Sunil M. Shende. Graph exploration by energy-sharing mobile agents. In Tomasz Jurdzinski and Stefan Schmid, editors, Structural Information and Communication Complexity - 28th International Colloquium, SIROCCO 2021, Wrocław, Poland, June 28 - July 1, 2021, Proceedings, volume 12810 of Lecture Notes in Computer Science, pages 185-203. Springer, 2021. URL: https://doi.org/10.1007/978-3-030-79527-6_11.
-
X. Sun, N. Kitamura, T. Izumi, and T. Masuzawa. Circulating exploration of an arbitrary graph by energy-sharing agents. In Proc. of the 2023 IEICE General Conference, pages 1-2, 2023.
