An efficient fault-containing self-stabilizing algorithm for nding a maximal independent set

Abstract

In this paper, we design a fault-containing self-stabilizing algorithm that nds a maximal independent set for an asynchronuous distributed system. Our algorithm is an improvement on the self-stabilizing algorithm in Shukla, Rosenkrantz and Ravi [9]. In the single-fault situation, the worst-case stabilization time of Shukla's algorithm is (n), where n is the number of nodes in the system, whereas the worst-case stabilization time of our algorithm is O(n), where n is the maximum node degree in the system. Compared also with the fault- containing algorithm that is induced from applying the general transformer in Ghosh et al. [7] to Shukla's algorithm, our algorithm is also seen to be faster in stabilization time, in the single-fault situation. Therefore, our algorithm can be considered to be the most ecient fault-containing self-stabilizing algorithm for the maximal-independent-set nding up to this point.