A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
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.arXiv:2006.01311v1 fatcat:hzsapey3xva3taxes7hrt7d5yy