Self-stabilizing Algorithm for Minimal α-Dominating Set
share
A self-stabilizing algorithm for the minimal α-dominating set is proposed in this paper. The α-domination parameter has not used before in self-stabilization paradigm. Using an arbitrary graph with n nodes and m edges, the proposed algorithm converges in O(nm) moves under distributed daemon. Simulation tests and mathematical proofs show the efficiency of the algorithm.
READ FULL TEXT