Efficient transformation of distance-2 self-stabilizing algorithms

Self-stabilizing algorithms for optimization problems can often be solved more easily using the distance-two model in which each vertex can instantly see the state information of all vertices up to distance two. This paper presents a new technique to emulate algorithms for the distance-two model on the distance-one model using the distributed scheduler with a slowdown factor of O(m) moves. Up until now the best transformer had a slowdown factor of O(n^2m) moves. The technique is used to derive improved self-stabilizing algorithms for several graph domination problems. The paper also introduces a generalization of the distance-two model allowing a more space efficient transformer.

[1]  Volker Turau,et al.  Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler , 2007, Inf. Process. Lett..

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

[3]  Zhengnan Shi.  A Linear-time Self-stabilizing Algorithm for Maximal 2-packing under Synchronous Daemon with Restriction , 2010, PDPTA.

[4]  Jie Wu,et al.  On constructing k-connected k-dominating set in wireless ad hoc and sensor networks , 2006, J. Parallel Distributed Comput..

[5]  Maria Gradinariu Potop-Butucaru,et al.  Conflict Managers for Self-stabilization without Fairness Assumption , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).

[6]  Jean R. S. Blair,et al.  An Efficient Self-stabilizing Distance-2 Coloring Algorithm , 2009, SIROCCO.

[7]  Sayaka Kamei,et al.  A Self-Stabilizing Approximation Algorithm for the Distributed Minimum k-Domination , 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[8]  Ajoy Kumar Datta,et al.  A Self-Stabilizing O(k)-Time k-Clustering Algorithm , 2010, Comput. J..

[9]  Michael Q. Rieck,et al.  Constructing special k-dominating sets using variations on the greedy algorithm , 2009, Pervasive Mob. Comput..

[10]  Chih-Yuan Chen,et al.  A Self-Stabilizing Algorithm for Finding a Minimal Distance-2 Dominating Set in Distributed Systems , 2008, J. Inf. Sci. Eng..

[11]  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..

[12]  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..

[13]  Hamamache Kheddouci,et al.  Distance-2 Self-stabilizing Algorithm for a b-Coloring of Graphs , 2008, SSS.

[14]  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.

[15]  Wayne Goddard,et al.  Distance- k knowledge in self-stabilizing algorithms , 2008, Theor. Comput. Sci..

[16]  Wayne Goddard,et al.  Self-Stabilizing Maximal K-Dependent Sets In Linear Time , 2004, Parallel Processing Letters.

[17]  Michael Q. Rieck,et al.  Hierarchical routing in ad hoc networks using k-dominating sets , 2008, MOCO.

[18]  Zhengnan Shi,et al.  An Updated Self-stabilizing Algorithm to Maximal 2-packing and A Linear Variation under Synchronous Daemon , 2011 .

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

[20]  Wayne Goddard,et al.  Distance-two information in self-stabilizing algorithms , 2004, Parallel Process. Lett..