Document Open Access Logo

Crash-Tolerant Exploration of Trees by Energy-Sharing Mobile Agents

Authors Quentin Bramas , Toshimitsu Masuzawa , Sébastien Tixeuil

PDF
Thumbnail PDF

File

LIPIcs.OPODIS.2024.9.pdf
  • Filesize: 0.75 MB
  • 16 pages

Document Identifiers

Author Details

Quentin Bramas
  • University of Strasbourg, ICUBE, CNRS, France
Toshimitsu Masuzawa
  • Graduate School of Information Science and Technology, Osaka University, Japan
Sébastien Tixeuil
  • Sorbonne University, CNRS, LIP6, Institut Universitaire de France, Paris, France

Funding

  • Masuzawa, Toshimitsu: This work is supported in part by JSPS KAKENHI 20KK0232.
  • Tixeuil, Sébastien: This work is supported in part by ANR SAPPORO (ANR-19-CE25-0005).

Cite As Get BibTex

Quentin Bramas, Toshimitsu Masuzawa, and Sébastien Tixeuil. Crash-Tolerant Exploration of Trees by Energy-Sharing Mobile Agents. In 28th International Conference on Principles of Distributed Systems (OPODIS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 324, pp. 9:1-9:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.OPODIS.2024.9

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 connected acyclic graphs (i.e. trees). We consider both the asynchronous and the synchronous settings, and we provide necessary and sufficient conditions about the energy.

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)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, and Yann Vaxès. Convergecast and broadcast by power-aware mobile agents. Algorithmica, 74(1):117-155, 2016. URL: https://doi.org/10.1007/s00453-014-9939-8.
  2. Andreas Bärtschi, Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Christina Karousatou, and Matús Mihalák. Near-gathering of energy-constrained mobile agents. Theor. Comput. Sci., 849:35-46, 2021. URL: https://doi.org/10.1016/j.tcs.2020.10.008.
  3. Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, and Paolo Penna. Energy-efficient delivery by heterogeneous mobile agents. In Heribert Vollmer and Brigitte Vallée, editors, 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, volume 66 of LIPIcs, pages 10:1-10:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. URL: https://doi.org/10.4230/LIPIcs.STACS.2017.10.
  4. 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.
  5. Jérémie Chalopin, Shantanu Das, Matús Mihalák, Paolo Penna, and Peter Widmayer. Data delivery by energy-constrained mobile agents. In Paola Flocchini, Jie Gao, Evangelos Kranakis, and Friedhelm Meyer auf der Heide, editors, Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers, volume 8243 of Lecture Notes in Computer Science, pages 111-122. Springer, 2013. URL: https://doi.org/10.1007/978-3-642-45346-5_9.
  6. Jérémie Chalopin, Riko Jacob, Matús Mihalák, and Peter Widmayer. Data delivery by energy-constrained mobile agents on a line. In Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias, editors, Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, volume 8573 of Lecture Notes in Computer Science, pages 423-434. Springer, 2014. URL: https://doi.org/10.1007/978-3-662-43951-7_36.
  7. 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.
  8. 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.
  9. Jurek Czyzowicz, Krzysztof Diks, Jean Moussi, and Wojciech Rytter. Energy-optimal broadcast and exploration in a tree using mobile agents. Theor. Comput. Sci., 795:362-374, 2019. URL: https://doi.org/10.1016/j.tcs.2019.07.018.
  10. 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.
  11. Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, and Sunil M. Shende. Time-energy tradeoffs for evacuation by two robots in the wireless model. Theor. Comput. Sci., 852:61-72, 2021. URL: https://doi.org/10.1016/j.tcs.2020.11.014.
  12. 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. Google Scholar
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