Abstract
We analyze the impact of transient and Byzantine faults on the construction of a maximal independent set in a general network. We adapt the self-stabilizing algorithm presented by Turau [15] for computing such a vertex set. Our algorithm is self-stabilizing, and also works under the more difficult context of arbitrary Byzantine faults.
Byzantine nodes can prevent nodes close to them from taking part in the independent set for an arbitrarily long time.
We give boundaries to their impact using a variation on the notion of containment radius. As far as we know, we present the first algorithm tolerating both transient and Byzantine faults under the fair distributed daemon. We prove that this algorithm converges in \( \mathcal O(\Delta n)\) rounds with high probability. Additionally, we present a modified version of this algorithm for anonymous systems under the adversarial distributed daemon that converges in \( \mathcal O(n^{2})\) expected number of steps.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms 7(4), 567–583 (1986)
Cournier, A., Devismes, S., Villain, V.: Snap-stabilizing PIF and useless computations. In: ICPADS, pp. 39–48 (2006)
Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643–644 (1974)
Dolev, S., Israeli, A., Moran, S.: Uniform dynamic self-stabilizing leader election. IEEE Trans. Parallel Distrib. Syst. 8(4), 424–440 (1997)
Gao, X., et al.: A novel approximation for multi-hop connected clustering problem in wireless networks. IEEE/ACM Trans. Netw. 25(4), 2223–2234 (2017)
Goddard, W., Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks. In: IPDPS, p. 14-p. IEEE (2003)
Guellati, N., Kheddouci, H.: A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs. JPDC 70, 406–415 (2010)
Hedetniemi, S.T.: Self-stabilizing domination algorithms. In: Structures of Dominationin Graphs, pp. 485–520 (2021)
Ikeda, M., Kamei, S., Kakugawa, H.: A space-optimal self-stabilizing algorithm for the maximal independent set problem. In: PDCAT, pp. 70–74 (2002)
Lamport, L., Shostak, R.E., Pease, M.C.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382–401 (1982)
Linial, N.: Distributive graph algorithms global solutions from local data. In: 28th Annual Symposium on Foundations of Computer Science, pp. 331–335 (1987)
Liu, T., Wang, X., Zheng, L.: A cooperative SWIPT scheme for wirelessly powered sensor networks. IEEE Trans. Commun. 65(6), 2740–2752 (2017)
Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15(4), 1036–1053 (1986)
Shukla, S.K., Rosenkrantz, D.J., Ravi, S.S., et al.: Observations on self-stabilizing graph algorithms for anonymous networks. In: Proceedings of the Second Workshop on Self-stabilizing Systems, vol. 7, p. 15 (1995)
Turau, V.: Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler. Inf. Process. Lett. 103(3), 88–93 (2007)
Turau, V.: Making randomized algorithms self-stabilizing. In: Censor-Hillel, K., Flammini, M. (eds.) SIROCCO 2019. LNCS, vol. 11639, pp. 309–324. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-24922-9_21
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Cohen, J., Pilard, L., Sénizergues, J. (2021). Self-stabilization and Byzantine Tolerance for Maximal Independent Set. In: Johnen, C., Schiller, E.M., Schmid, S. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2021. Lecture Notes in Computer Science(), vol 13046. Springer, Cham. https://doi.org/10.1007/978-3-030-91081-5_33
Download citation
DOI: https://doi.org/10.1007/978-3-030-91081-5_33
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-91080-8
Online ISBN: 978-3-030-91081-5
eBook Packages: Computer ScienceComputer Science (R0)