2020/06/01 by Badreddine Benreguia, Benreguia, Badreddine, Hamouma Moumen +1
Computer Science · #Distributed #Distributed and Parallel Computing Systems #Distributed systems and fault tolerance #FOS: Computer and information sciences #Optimization and Search Problems #Parallel #and Cluster Computing (cs.DC) #cs.DC
paper · pdf · doi:10.48550/arxiv.2006.01311
arxiv created 2020/06/01 · openalex publication_date 2020/06/01 · arxiv updated 2020/06/03 · openalex created_date 2022/07/26 · openalex updated_date 2026/07/28
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.