LIPIcs.DISC.2024.50.pdf
- Filesize: 0.56 MB
- 7 pages
Document
Brief Announcement: Agent-Based Leader Election, MST, and Beyond
Authors
Ajay D. Kshemkalyani 
,
Manish Kumar ,
Anisur Rahaman Molla ,
Gokarna Sharma
-
Part of:
Volume:
38th International Symposium on Distributed Computing (DISC 2024)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Symposium on Distributed Computing (DISC) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2024-10-24
File
Document Identifiers
Author Details
- Department of Computer Science & Engineering Indian Institute of Technology, Madras, India
- R. C. Bose Centre for Cryptology and Security, Indian Statistical Institute, Kolkata, India
Cite As Get BibTex
Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, and Gokarna Sharma. Brief Announcement: Agent-Based Leader Election, MST, and Beyond. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 50:1-50:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.DISC.2024.50
Abstract
Leader election is one of the fundamental and well-studied problems in distributed computing. In this paper, we initiate the study of leader election using mobile agents. Suppose n agents are positioned initially arbitrarily on the nodes of an arbitrary, anonymous, n-node, m-edge graph G. The agents relocate themselves autonomously on the nodes of G and elect an agent as a leader such that the leader agent knows it is a leader and the other agents know they are not leaders. The objective is to minimize time and memory requirements. Following the literature, we consider the synchronous setting in which each agent performs its operations synchronously with others and hence the time complexity can be measured in rounds. The quest in this paper is to provide solutions without agents knowing any graph parameter, such as n, a priori. We first establish that, without agents knowing any graph parameter a priori, there exists a deterministic algorithm to elect an agent as a leader in O(m) rounds with O(nlog n) bits at each agent. Using this leader election result, we develop a deterministic algorithm for agents to construct a minimum spanning tree of G in O(m+nlog n) rounds using O(n log n) bits memory at each agent, without agents knowing any graph parameter a priori. Finally, using the same leader election result, we provide improved time/memory results for other fundamental distributed graph problems, namely, gathering, maximal independent set, and minimal dominating sets, removing the assumptions on agents knowing graph parameters a priori.
Subject Classification
ACM Subject Classification
- Theory of computation → Distributed algorithms
Keywords
- Distributed algorithms
- mobile agents
- local communication
- leader election
- MST
- MIS
- gathering
- minimal dominating sets
- time and memory complexity
- graph parameters
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- Prabhat Kumar Chand, Apurba Das, and Anisur Rahaman Molla. Agent-based triangle counting and its applications in anonymous graphs. In AAMAS, 2024. URL: https://doi.org/10.48550/arXiv.2402.03653.
- Prabhat Kumar Chand, Anisur Rahaman Molla, and Sumathi Sivasubramaniam. Run for cover: Dominating set via mobile agents. In ALGOWIN, pages 133-150. Springer, 2023. URL: https://doi.org/10.1007/978-3-031-48882-5_10.
- Yi-Jun Chang, Seth Pettie, and Hengjie Zhang. Distributed triangle detection via expander decomposition. In Timothy M. Chan, editor, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pages 821-840. SIAM, 2019. URL: https://doi.org/10.1137/1.9781611975482.51.
- Yi-Jun Chang and Thatchaphol Saranurak. Improved distributed expander decomposition and nearly optimal triangle enumeration. In Peter Robinson and Faith Ellen, editors, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019, pages 66-73. ACM, 2019. URL: https://doi.org/10.1145/3293611.3331618.
- Taisuke Izumi and François Le Gall. Triangle finding and listing in CONGEST networks. In Elad Michael Schiller and Alexander A. Schwarzmann, editors, Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, Washington, DC, USA, July 25-27, 2017, pages 381-389. ACM, 2017. URL: https://doi.org/10.1145/3087801.3087811.
- Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, and Gokarna Sharma. Agent-based MST construction. CoRR, abs/2403.13716, 2024. URL: https://doi.org/10.48550/arXiv.2403.13716.
- Ajay D. Kshemkalyani and Gokarna Sharma. Near-optimal dispersion on arbitrary anonymous graphs. In 25th International Conference on Principles of Distributed Systems, OPODIS, pages 8:1-8:19, 2021. URL: https://doi.org/10.4230/LIPICS.OPODIS.2021.8.
- Karolis Martinkus, Pál András Papp, Benedikt Schesch, and Roger Wattenhofer. Agent-based graph neural networks. In The Eleventh International Conference on Learning Representations, ICLR 2023, Kigali, Rwanda, May 1-5, 2023. OpenReview.net, 2023. URL: https://openreview.net/pdf?id=8WTAh0tj2jC.
-
Anisur Rahaman Molla, Kaushik Mondal, and William K. Moses Jr. Byzantine dispersion on graphs. In IPDPS, pages 1-10, 2021.
- Gopal Pandurangan, Peter Robinson, and Michele Scquizzato. On the distributed complexity of large-scale graph computations. In Christian Scheideler and Jeremy T. Fineman, editors, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, SPAA 2018, Vienna, Austria, July 16-18, 2018, pages 405-414. ACM, 2018. URL: https://doi.org/10.1145/3210377.3210409.
- Debasish Pattanayak, Subhash Bhagat, Sruti Gan Chaudhuri, and Anisur Rahaman Molla. Maximal independet set via mobile agents. In ICDCN, pages 74-83. ACM, 2024. URL: https://doi.org/10.1145/3631461.3631543.
- Yuichi Sudo, Masahiro Shibata, Junya Nakamura, Yonghwan Kim, and Toshimitsu Masuzawa. Near-linear time dispersion of mobile agents, 2023. https://arxiv.org/abs/2310.04376, URL: https://doi.org/10.48550/arXiv.2310.04376.
- Amnon Ta-Shma and Uri Zwick. Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences. ACM Trans. Algorithms, 10(3):12:1-12:15, 2014. URL: https://doi.org/10.1145/2601068.