A self-stabilizing protocol for minimal weighted dominating sets in arbitrary networks

A lot of self-stabilizing algorithms for computing dominating sets problem have been proposed in the literature due to many real-life applications. Most of the proposed algorithms either work for dominating sets with a uniform weight or find approximation solutions to weighted dominating sets. However, for non-uniform weighted dominating sets (WDS) problem, there is no self-stabilizing algorithm for the WDS. Furthermore, how to find the minimal weighted dominating set is a challenge. In this paper, we propose a self-stabilizing algorithm for the minimal weighted dominating set (MWDS) under a central daemon model when operating in any general network. We further prove that the worst case convergence time of the algorithm from any arbitrary initial state is O(n2) steps where n is the number of nodes in the network.

[1]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[2]  Wayne Goddard,et al.  Self-Stabilizing Graph Protocols , 2008, Parallel Process. Lett..

[3]  Wayne Goddard,et al.  A self-stabilizing distributed algorithm for minimal total domination in an arbitrary system graph , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[4]  Wei Wang,et al.  A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs , 2012, J. Comb. Optim..

[5]  Sébastien Tixeuil,et al.  A new self-stabilizing maximal matching algorithm , 2007, Theor. Comput. Sci..

[6]  Anish Arora,et al.  Stabilization-Preserving Atomicity Refinement , 2002, J. Parallel Distributed Comput..

[7]  Ajoy Kumar Datta,et al.  Self-Stabilizing Local Mutual Exclusion and Daemon Refinement , 2000, Chic. J. Theor. Comput. Sci..

[8]  Pradip K. Srimani,et al.  Self-stabilizing Algorithms for Minimal Dominating Sets and Maximal Independent Sets , 2003 .

[9]  Alok Singh,et al.  Hybrid metaheuristic algorithms for minimum weight dominating set , 2013, Appl. Soft Comput..

[10]  Chih-Yuan Chen,et al.  A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model , 2007, Comput. Math. Appl..

[11]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[12]  Sayaka Kamei,et al.  A self-stabilizing algorithm for the distributed minimal k-redundant dominating set problem in tree networks , 2003, Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies.

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Stephen T. Hedetniemi,et al.  Total domination in graphs , 1980, Networks.

[15]  Pradip K. Srimani,et al.  Linear time self-stabilizing colorings , 2003, Inf. Process. Lett..

[16]  Weili Wu,et al.  New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs , 2011, Theor. Comput. Sci..

[17]  Shlomi Dolev,et al.  Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..

[18]  S. Hedetniemi,et al.  Domination in graphs : advanced topics , 1998 .

[19]  A. J. M. van Gasteren,et al.  A simple fixpoint argument without the restriction to continuity , 2004, Acta Informatica.

[20]  Chih-Yuan Chen,et al.  A Linear-Time Self-Stabilizing Algorithm for the Minimal 2-Dominating Set Problem in General Networks , 2008, J. Inf. Sci. Eng..