Affiliation:
1. Faculty of Advanced Science and Technology Ryukoku University Otsu Shiga Japan
2. Graduate School of Advanced Science and Engineering Hiroshima University Higashihiroshima Hiroshima Japan
3. Graduate School of Computer Science and Systems Engineering Kyushu Institute of Technology Iizuka Fukuoka Japan
4. Faculty of Engineering Fukui University of Technology Fukui Fukui Japan
Abstract
SummaryFault‐tolerance and self‐organization are critical properties in modern distributed systems. Self‐stabilization is a class of fault‐tolerant distributed algorithms which has the ability to recover from any kind and any finite number of transient faults and topology changes. In this article, we propose a self‐stabilizing distributed algorithm for the 1‐MIS problem under the unfair central daemon assuming the distance‐3 model. Here, in the distance‐3 model, each process can refer to the values of local variables of processes within three hops. Intuitively speaking, the 1‐MIS problem is a variant of the maximal independent set (MIS) problem with improved local optimizations. The time complexity (convergence time) of our algorithm is steps and the space complexity is bits, where is the number of processes. Finally, we extend the notion of 1‐MIS to ‐MIS for each nonnegative integer , and compare the set sizes of ‐MIS () and the maximum independent set.
Reference12 articles.
1. Self-stabilizing systems in spite of distributed control
2. On generalised minimal domination parameters for paths;Bollobás B;Ann Discret Math,1990
3. ShuklaSK RosenkrantzDJ RaviSS.Observations on self‐stabilizing graph algorithms for anonymous networks. Proceedings of the Second Workshop on Self‐Stabilizing Systems (WSS); 1995; 7:15.
4. IkedaM KameiS KakugawaH.A space‐optimal self‐stabilizing algorithm for the maximal independent set problem. Proceedings of the 3rd International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT); 2002:70–74.
5. Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks