A self-stabilizing algorithm for the minimal $\alpha$-dominating set is
proposed in this paper. The $\alpha$-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