A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph

In this paper we propose a new self-stabilizing distributed algorithm for minimal domination protocol in an arbitrary network graph using the synchronous model; the proposed protocol is general in the sense that it can stabilize with every possible minimal dominating set of the graph.

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

[2]  Dhiraj K. Pradhan,et al.  Modified tree structure for location management in mobile environments , 1995, Comput. Commun..

[3]  Marilyn Bohl,et al.  Information processing , 1971 .

[4]  Marcin Paprzycki,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 2001, Scalable Comput. Pract. Exp..

[5]  D. Rosenkrantz,et al.  Developing self - stabilizing coloring algorithms via systematic randomization , 1994 .

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

[7]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[8]  Pradip K. Srimani,et al.  Fault tolerant distributed coloring algorithms that stabilize in linear time , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

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

[10]  Brian A. Coan,et al.  Self-stabilizing topology maintenance protocols for high-speed networks , 1996, TNET.

[11]  Edsger W. Dijkstra.  A belated proof of self-stabilization , 2005, Distributed Computing.

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

[13]  Shing-Tsaan Huang,et al.  A Self-Stabilizing Algorithm for Maximal Matching , 1992, Inf. Process. Lett..

[14]  Jennifer L. Welch,et al.  Crash Resilient Communication in Dynamic Networks , 1997, IEEE Trans. Computers.

[15]  Sandeep K. S. Gupta,et al.  Self-Stabilizing Protocol for Shortest Path Tree for Multi-cast Routing in Mobile Networks (Research Note) , 2000, Euro-Par.

[16]  Sandeep K. S. Gupta,et al.  Using self-stabilization to design adaptive multicast protocols for mobile ad hoc networks , 1999, Mobile Networks and Computing.

[17]  Wayne Goddard,et al.  Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[18]  Satoshi Fujita,et al.  A Resource Assignment Problem on Graphs , 1995, ISAAC.

[19]  Yehuda Afek,et al.  Local stabilizer , 1997, PODC '97.

[20]  Wolfgang Karl,et al.  Euro-Par 2000 Parallel Processing , 2000, Lecture Notes in Computer Science.