Brief Announcement: Self-Stabilizing MIS Computation in the Beeping Model
Pages 87 - 90
Abstract
We consider self-stabilizing algorithms to compute a Maximal Independent Set (MIS) in the extremely weak beeping communication model. The model consists of an anonymous network with synchronous rounds. In each round, each vertex can optionally transmit a signal to all its neighbors (beep). After the transmission of a signal, each vertex can only differentiate between no signal received, or at least one signal received. We assume that vertices have some knowledge about the topology of the network.
We revisit the not self-stabilizing algorithm proposed by Jeavons, Scott, and Xu (2013), which computes an MIS in the beeping model. We enhance this algorithm to be self-stabilizing, and explore two different variants, which differ in the knowledge about the topology available to the vertices. In the first variant, every vertex knows an upper bound on the maximum degree Δ of the graph. For this case, we prove that the proposed self-stabilizing version maintains the same run-time as the original algorithm, i.e. it stabilizes after O(log n) rounds w.h.p. on any n-vertex graph. In the second variant, each vertex only knows an upper bound on its own degree. For this case, we prove that the algorithm stabilizes after O(log n · log log n) rounds on any n-vertex graph, w.h.p.
References
[1]
Yehuda Afek, Noga Alon, Ziv Bar-Joseph, Alejandro Cornejo, Bernhard Haeupler, and Fabian Kuhn. 2013. Beeping a maximal independent set. Distributed Comput. 26, 4 (2013), 195--208.
[2]
Yehuda Afek, Noga Alon, Omer Barad, Eran Hornstein, Naama Barkai, and Ziv Bar-Joseph. 2011. A biological solution to a fundamental distributed computing problem. Science 331, 6014 (2011), 183--185.
[3]
Noga Alon, László Babai, and Alon Itai. 1986. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. J. Algorithms 7, 4 (1986), 567--583.
[4]
Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, and Jukka Suomela. 2021. Lower Bounds for Maximal Matchings and Maximal Independent Sets. J. ACM 68, 5 (2021), 39:1--39:30.
[5]
Alejandro Cornejo and Fabian Kuhn. 2010. Deploying Wireless Networks with Beeps. In Proc. 24th International Symposium on Distributed Computing, DISC. 148--162.
[6]
Edsger W. Dijkstra. 1974. Self-stabilizing Systems in Spite of Distributed Control. Commun. ACM 17, 11 (1974), 643--644.
[7]
Shlomi Dolev. 2000. Self-Stabilization. MIT Press. http://www.cs.bgu.ac.il/%7Edolev/book/book.html
[8]
Yuval Emek and Eyal Keren. 2021. A Thin Self-Stabilizing Asynchronous Unison Algorithm with Applications to Fault Tolerant Biological Networks. In Proc. ACM Symposium on Principles of Distributed Computing, PODC. ACM, 93--102.
[9]
Yuval Emek and Jara Uitto. 2020. Dynamic networks of finite state machines. Theor. Comput. Sci. 810 (2020), 58--71.
[10]
Yuval Emek and Roger Wattenhofer. 2013. Stone age distributed computing. In Proc. ACM Symposium on Principles of Distributed Computing, PODC. 137--146.
[11]
Salwa Faour, Mohsen Ghaffari, Christoph Grunau, Fabian Kuhn, and Václav Rozhon. 2023. Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond. In Proc. ACM-SIAM Symposium on Discrete Algorithms, SODA. SIAM, 4409--4447.
[12]
Mohsen Ghaffari. 2016. An Improved Distributed Algorithm for Maximal Independent Set. In Proc. Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA. SIAM, 270--277.
[13]
Mohsen Ghaffari. 2017. Distributed MIS via All-to-All Communication. In Proc. ACM Symposium on Principles of Distributed Computing, PODC. 141--149.
[14]
Mohsen Ghaffari. 2019. Distributed Maximal Independent Set using Small Messages. In Proc. Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA. SIAM, 805--820.
[15]
Mohsen Ghaffari, Christoph Grunau, and Václav Rozhon. 2021. Improved Deterministic Network Decomposition. In Proc. ACM-SIAM Symposium on Discrete Algorithms, SODA. SIAM, 2904--2923.
[16]
George Giakkoupis, Volker Turau, and Isabella Ziccardi. 2024. Self-Stabilizing MIS Computation in the Beeping Model. Technical Report 2405.04266. arXiv.
[17]
George Giakkoupis and Isabella Ziccardi. 2023. Distributed Self-Stabilizing MIS with Few States and Weak Communication. In Proc. ACM Symposium on Principles of Distributed Computing, PODC. 310--320.
[18]
Peter Jeavons, Alex Scott, and Lei Xu. 2016. Feedback from nature: Simple randomised distributed algorithms for maximal independent set selection and greedy colouring. Distributed Comput. 29, 5 (2016), 377--393.
[19]
Nathan Linial. 1987. Distributive Graph Algorithms-Global Solutions from Local Data. In Proc. 28th Annual Symposium on Foundations of Computer Science, FOCS. 331--335.
[20]
Zvi Lotker, Elan Pavlov, Boaz Patt-Shamir, and David Peleg. 2003. MST construction in O(log log n) communication rounds. In Proc. Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA. 94--100.
[21]
Michael Luby. 1986. A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM J. Comput. 15, 4 (1986), 1036--1053.
[22]
Thomas Moscibroda and Roger Wattenhofer. 2005. Maximal independent sets in radio networks. In Proc. Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC. 148--157.
[23]
David Peleg. 2000. Distributed computing: A locality-sensitive approach. SIAM.
Index Terms
- Brief Announcement: Self-Stabilizing MIS Computation in the Beeping Model
Recommendations
Distributed Self-Stabilizing MIS with Few States and Weak Communication
PODC '23: Proceedings of the 2023 ACM Symposium on Principles of Distributed ComputingWe study a simple random process that computes a maximal independent set (MIS) on a general n-vertex graph. Each vertex has a binary state, black or white, where black indicates inclusion into the MIS. The vertex states are arbitrary initially, and ...
Brief Announcement: Using Read-k Inequalities to Analyze a Distributed MIS Algorithm
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingUntil recently, the fastest distributed MIS algorithm, even for simple graphs, e.g., unoriented trees, has been the simple randomized algorithm discovered in the 80s. This algorithm (commonly called Luby's algorithm) computes an MIS in O(log n) rounds (...
A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks
The maximum planarization problem is to find a spanning planar subgraph having the largest number of edges for a given graph. In this paper, we propose a self-stabilizing algorithm to solve this problem for complete bipartite networks. The proposed ...
Comments
Information & Contributors
Information
Published In
June 2024
570 pages
ISBN:9798400706684
DOI:10.1145/3662158
- Chair:
- Ran Gelles,
- Proceedings Chair:
- Dennis Olivetti,
- Program Chair:
- Petr Kuznetsov
Copyright © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 17 June 2024
Check for updates
Author Tags
Qualifiers
- Short-paper
Funding Sources
Conference
Acceptance Rates
Overall Acceptance Rate 740 of 2,477 submissions, 30%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 32Total Downloads
- Downloads (Last 12 months)32
- Downloads (Last 6 weeks)3
Reflects downloads up to 18 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in