{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T09:15:50Z","timestamp":1783415750330,"version":"3.54.6"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T00:00:00Z","timestamp":1765324800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T00:00:00Z","timestamp":1765411200000},"content-version":"vor","delay-in-days":1,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Netw Distrib Comput"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s44227-025-00082-z","type":"journal-article","created":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T17:06:37Z","timestamp":1765386397000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Self-Stabilizing Algorithm for Multiple Disjoint Maximal Independent Sets"],"prefix":"10.1007","volume":"14","author":[{"given":"Abderafik","family":"Nezzar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Badreddine","family":"Benreguia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1986-7590","authenticated-orcid":false,"given":"Hamouma","family":"Moumen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ahc\u00e8ne","family":"Bounceur","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,12,10]]},"reference":[{"key":"82_CR1","first-page":"251 42","volume":"62-32","author":"O Arapoglu","year":"2019","unstructured":"Arapoglu O, Akram VK, Dagdeviren O (2019) An energy-efficient, self-stabilizing and distributed algorithm for maximal independent set construction in wireless sensor networks. Comput Stand Interface 62-32:251 42","journal-title":"Comput Stand Interface"},{"key":"82_CR2","doi-asserted-by":"crossref","unstructured":"Bein D, Datta AK, Jagganagari CR, Villain V (2005) A self-stabilizing link-cluster algorithm in mobile ad hoc networks. In 8th International Symposium on Parallel Architectures, Algorithms, and Networks, ISPAN, IEEE Computer Society, 436\u2013441","DOI":"10.1109\/ISPAN.2005.12"},{"issue":"2","key":"82_CR3","first-page":"81","volume":"7","author":"L Saadi","year":"2022","unstructured":"Saadi L, Benreguia B, Arar C, Moumen H (2022) Self-stabilizing algorithm for minimal (\u03b1, \u03b2)-dominating set. Int J Comput Math: Comput Syst Theory 7(2):81\u201394","journal-title":"Int J Comput Math: Comput Syst Theory"},{"key":"82_CR4","doi-asserted-by":"crossref","unstructured":"Larsson A, Tsigas P (2011) A self-stabilizing (k,r)-clustering algorithm with multiple paths for wireless ad-hoc networks. In 31 International Conference on Distributed Computing Systems, IEEE, 353\u2013362","DOI":"10.1109\/ICDCS.2011.75"},{"issue":"2","key":"82_CR5","doi-asserted-by":"publisher","first-page":"581","DOI":"10.18280\/isi.290219","volume":"29","author":"D Bouhata","year":"2024","unstructured":"Bouhata D, Bouam S, Moumen H, Benreguia B, Arar C (2024) Self-stabilizing algorithms for computing maximal distance-2 independent sets and minimal dominating sets in networks. Ing\u00e9nierie des Syst\u00e8mes d\u2019Inf 29(2):581\u2013590","journal-title":"Ing\u00e9nierie des Syst\u00e8mes d\u2019Inf"},{"key":"82_CR6","unstructured":"Shukla SK, Rosenkrantz DJ, Ravi SS (1995) Observations on self-stabilizing graph algorithms for anonymous networks. In 2nd Workshop on Self-Stabilizing Systems"},{"key":"82_CR7","doi-asserted-by":"publisher","unstructured":"Goddard W, Hedetniemi ST, Jacobs DP, Srimani PK (2003) Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks. In 5th IPDPS Workshop on Advances in Parallel and Distributed Computational Models, IEEE Computer Society, 162. https:\/\/doi.org\/10.1109\/IPDPS.2003.1213302","DOI":"10.1109\/IPDPS.2003.1213302"},{"issue":"56","key":"82_CR8","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1016\/S0898-1221(03)90143-X","volume":"46","author":"S Hedetniemi","year":"2003","unstructured":"Hedetniemi S, Hedetniemi S, Jacobs D, Srimani P (2003) Self-stabilizing algorithms for minimal dominating sets and maximal independent sets. Comput Math Appl 46(56):805\u2013811","journal-title":"Comput Math With Appl"},{"issue":"6","key":"82_CR9","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1142\/S0129054115500422","volume":"26","author":"B Neggazi","year":"2015","unstructured":"Neggazi B, Guellati N, Haddad M, Kheddouci H (2015) Efficient self-stabilizing algorithm for independent strong dominating sets in arbitrary graphs. Int J Found Comput Sci 26(6):751\u2013768","journal-title":"Int J Found Comput Sci"},{"issue":"3","key":"82_CR10","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.ipl.2007.02.013","volume":"103","author":"V Turau","year":"2007","unstructured":"Turau V (2007) Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler. Inf Process Lett 103(3):88\u201393","journal-title":"Inf Process Lett"},{"issue":"4","key":"82_CR11","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/j.jpdc.2009.11.006","volume":"70","author":"N Guellati","year":"2010","unstructured":"Guellati N, Kheddouci H (2010) A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs. J Parallel Distrib Comput 70(4):406\u2013415","journal-title":"J Parallel Distrib Comput"},{"key":"82_CR12","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/j.ipl.2014.04.013","volume":"114","author":"C Johnen","year":"2014","unstructured":"Johnen C (2014) Fast, silent self-stabilizing distance-k independent dominating set construction. Inf Process Lett 114:551\u2013555","journal-title":"Inf Process Lett"},{"key":"82_CR13","unstructured":"Ikeda M, Kamei S, Kakugawa H (2002) A space-optimal self-stabilizing algorithm for the maximal independent set problem. In 3rd International Conference on Parallel and Distributed Computing, Applications and Technologies, pp 70\u201374"},{"issue":"5","key":"82_CR14","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0020-0190(03)00299-0","volume":"87","author":"S Hedetniemi","year":"2003","unstructured":"Hedetniemi S, Jacobs D, Srimani P (2003) Linear time self-stabilizing colorings. Inf Process Lett 87(5):251\u2013255. https:\/\/doi.org\/10.1016\/S0020-0190(03)00299-0","journal-title":"Inf Process Lett"},{"issue":"11","key":"82_CR15","doi-asserted-by":"publisher","first-page":"1381","DOI":"10.1093\/comjnl\/bxs128","volume":"56","author":"ST Hedetniemi","year":"2013","unstructured":"Hedetniemi ST, Jacobs DP, Kennedy KE (2013) Linear-time self-stabilizing algorithms for disjoint Independent sets. The Comput J 56(11):1381\u20131387. https:\/\/doi.org\/10.1093\/comjnl\/bxs128","journal-title":"The Comput J"},{"key":"82_CR16","doi-asserted-by":"publisher","first-page":"247","DOI":"10.2197\/ipsjjip.29.247","volume":"29","author":"H Tanaka","year":"2021","unstructured":"Tanaka H, Sudo Y, Kakugawa H, Masuzawa T, Datta AK (2021) A Self-stabilizing 1-maximal Independent Set Algorithm. J Inf Process 29:247\u2013255. https:\/\/doi.org\/10.2197\/ipsjjip.29.247","journal-title":"J Inf Process"},{"key":"82_CR17","doi-asserted-by":"publisher","unstructured":"Kakugawa H, Kamei S, Shibata M, Ooshita F (2023) A self-stabilizing distributed algorithm for the 1-mis problem under the distance-3 model. In Eleventh International Symposium on Computing and Networking Workshops (CANDARW), Matsue, Japan, 100\u2013106. https:\/\/doi.org\/10.1109\/CANDARW60564.2023.00025","DOI":"10.1109\/CANDARW60564.2023.00025"},{"key":"82_CR18","doi-asserted-by":"publisher","unstructured":"Giakkoupis G, Turau V, Ziccardi I (2024) Brief announcement: self-stabilizing mis computation in the beeping model. In Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing (PODC\u201924). Association for Computing Machinery, New York, NY, USA, 87\u201390. https:\/\/doi.org\/10.1145\/3662158.3662811","DOI":"10.1145\/3662158.3662811"},{"key":"82_CR19","doi-asserted-by":"crossref","unstructured":"Giakkoupis G, Turau V, Ziccardi I (2025) Luby\u2019s MIS algorithms made self-stabilizing. Inf Process Lett 188, 106531","DOI":"10.1016\/j.ipl.2024.106531"},{"key":"82_CR20","doi-asserted-by":"publisher","unstructured":"Ghaffari M, Kuhn F (2022) Deterministic distributed vertex coloring: simpler, faster, and without network decomposition. In IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), Denver, CO, USA, 1009\u20131020. https:\/\/doi.org\/10.1109\/FOCS52979.2021.00101","DOI":"10.1109\/FOCS52979.2021.00101"},{"key":"82_CR21","doi-asserted-by":"crossref","unstructured":"Fu X, Yin Y, Zheng C (2023) Self-stabilizing coloring in sublinear (\u0394 + 1)-coloring (in \u03b4) rounds via locally-iterative algorithms. In: Wu W, Tong G (eds) Computing and combinatorics. cocoon. Lecture notes in computer science, vol 14422. Springer","DOI":"10.1007\/978-3-031-49190-0_17"},{"key":"82_CR22","doi-asserted-by":"publisher","first-page":"46","DOI":"10.2991\/ijndc.2013.1.1.6","volume":"1","author":"N Wang","year":"2013","unstructured":"Wang N, He H, Liu D (2013) A fault-tolerant schema for clock synchronization and data aggregation in WSN. Int J Networked Distrib Comput 1:46\u201352. https:\/\/doi.org\/10.2991\/ijndc.2013.1.1.6","journal-title":"Int J Networked Distrib Comput"},{"key":"82_CR23","doi-asserted-by":"publisher","first-page":"189","DOI":"10.2991\/ijndc.2014.2.3.8","volume":"2","author":"L McLauchlan","year":"2014","unstructured":"McLauchlan L, Saha S, Montiel C, Challoo R (2014) Comparative study of various wireless sensor network (WSN) topology construction protocols. Int J Networked Distrib Comput 2:189\u2013197. https:\/\/doi.org\/10.2991\/ijndc.2014.2.3.8","journal-title":"Int J Networked Distrib Comput"},{"key":"82_CR24","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s44227-025-00069-w","volume":"13","author":"A Shandilya","year":"2025","unstructured":"Shandilya A, Gupta V, Alapatt BP, Poonia RC (2025) VAST-GCN: an attention-driven graph convolutional network (GCN) for robust cluster head selection in vehicular ad-hoc networks. Int J Networked Distrib Comput 13:25. https:\/\/doi.org\/10.1007\/s44227-025-00069-w","journal-title":"Int J Networked Distrib Comput"},{"key":"82_CR25","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s44227-024-00020-5","volume":"12","author":"SS Agrawal","year":"2024","unstructured":"Agrawal SS, Rathi R (2024) Topology control using optimized clustering scheme in mobile ad hoc network. Int J Networked Distrib Comput 12:119\u2013130. https:\/\/doi.org\/10.1007\/s44227-024-00020-5","journal-title":"Int J Networked Distrib Comput"},{"key":"82_CR26","doi-asserted-by":"publisher","unstructured":"Hourani K, Pandurangan G, Robinson P (2022) Awake-efficient distributed algorithms for maximal independent set. In IEEE 42nd International Conference on Distributed Computing Systems (ICDCS), Bologna, Italy, 1338\u20131339. https:\/\/doi.org\/10.1109\/ICDCS54860.2022.00153","DOI":"10.1109\/ICDCS54860.2022.00153"},{"key":"82_CR27","doi-asserted-by":"publisher","unstructured":"Dufoulon F, Moses WK, Pandurangan G (2023) Distributed mis in O(log log n) awake complexity. In Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (PODC\u201923). Association for Computing Machinery, New York, NY, USA, 135\u2013145. https:\/\/doi.org\/10.1145\/3583668.3594574","DOI":"10.1145\/3583668.3594574"},{"key":"82_CR28","doi-asserted-by":"publisher","unstructured":"Ghaffari M, Grunau C (2023) Faster deterministic distributed MIS and approximate matching. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing (STOC 2023). Association for Computing Machinery, New York, NY, USA. pp 1777\u20131790. https:\/\/doi.org\/10.1145\/3564246.3585243","DOI":"10.1145\/3564246.3585243"},{"key":"82_CR29","unstructured":"Kawarabayashi K, Khoury S, Schild A (2020) Schwartzman G Improved distributed approximations for maximum independent set. In Proceedings of the 34th Symposium on Distributed Computing (DISC), pp 35:1\u201335:16"},{"key":"82_CR30","doi-asserted-by":"crossref","unstructured":"Bamberger P, Kuhn F, Maus Y (2020) Efficient deterministic distributed coloring with small bandwidth. In Proceedings of the 39th ACM Symposium on Principles of Distributed Computing (PODC), pp 243\u2013252","DOI":"10.1145\/3382734.3404504"},{"key":"82_CR31","doi-asserted-by":"crossref","unstructured":"Halldorsson MM, Kuhn F, Maus Y, Tonoyan T (2021) Efficient randomized distributed coloring in congest. In Proceedings of the 53rd ACM Symposium on Theory of Computing (STOC)","DOI":"10.1145\/3406325.3451089"},{"key":"82_CR32","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2991\/ijndc.2013.1.1.3","volume":"1","author":"I Amdouni","year":"2013","unstructured":"Amdouni I, Minet P, Adjih C (2013) OSERENA: a coloring algorithm optimized for dense wireless networks. Int J Networked Distrib Comput 1:9\u201324. https:\/\/doi.org\/10.2991\/ijndc.2013.1.1.3","journal-title":"Int J Networked Distrib Comput"},{"key":"82_CR33","doi-asserted-by":"crossref","unstructured":"Barenboim L, Elkin M, Goldenberg U (2018) Locally-iterative distributed (\u03b4+ 1)-coloring below Szegedy-Vishwanathan barrier, and applications to self-stabilization and to restricted-bandwidth models. In Proceedings 37th ACM Symposium on Principles of Distributed Computing (PODC), pp 437\u2013446","DOI":"10.1145\/3212734.3212769"},{"key":"82_CR34","unstructured":"Dubois S, Tixeuil S (2011) A taxonomy of daemons in self-stabilization, CoRR, abs\/1110.0334"},{"issue":"4","key":"82_CR35","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.jpdc.2011.12.008","volume":"72","author":"V Turau","year":"2012","unstructured":"Turau V (2012) Efficient transformation of distance-2 self-stabilizing algorithms. J Parallel Distrib Comput 72(4):603\u2013612","journal-title":"J Parallel Distrib Comput"},{"key":"82_CR36","first-page":"146","volume-title":"WALCOM: algorithms and computation. WALCOM 2013. Lecture notes in computer science","author":"W Goddard","year":"2013","unstructured":"Goddard W, Srimani PK (2013) Daemon conversions in distributed self-stabilizing algorithms. In: S.K. G, Tokuyama T (eds) WALCOM: algorithms and computation. WALCOM 2013. Lecture notes in computer science. Springer, Berlin, Heidelberg, pp 146\u2013157"}],"container-title":["International Journal of Networked and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44227-025-00082-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44227-025-00082-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44227-025-00082-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T08:37:26Z","timestamp":1783413446000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44227-025-00082-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,10]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["82"],"URL":"https:\/\/doi.org\/10.1007\/s44227-025-00082-z","relation":{},"ISSN":["2211-7938","2211-7946"],"issn-type":[{"value":"2211-7938","type":"print"},{"value":"2211-7946","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,10]]},"assertion":[{"value":"28 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 November 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Participate"}},{"value":"The authors declare that they have no competing interests.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"2"}}