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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2918, Issue , 2004, Pages 26-32

  Xu, Z ^a   Hedetniemi, S T ^a   Goddard, W ^a   Srimani, P K ^a  

^a Clemson University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

ARBITRARY NETWORKS; MINIMAL DOMINATING SETS; SELF-STABILIZING DISTRIBUTED ALGORITHM; SYNCHRONOUS MODELS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 35048870092     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (17)

1. H. Abu-Amara, B.Coan, S.Dolev, A. Kanevsky, and J. L. Welch, "Self-stabilizing topology maintenance protocols for high-speed networks", IEEE/ACM Transactions on Networking, 4(6):902-912, 1996.
2. Y. Afek and S. Dolev, "Local stabilizer", In Proceedings of the 5th Israeli Symposium on Theory of Computing and Systems, pages 74-84, 1997.
3. H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics, McGraw Hill, 1998.
4. J. Beauquier, A. K. Datta, M.Gradinariu, and F. Magniette, "Self-stabilizing local mutual exclusion and daemon refinement". In DISC00 Distributed Computing 14th International Symposium, Springer LNCS:1914, pages 223-237, 2000.
5. E. W. Dijkstra, "Self-stabilizing systems in spite of distributed control", Communications of the ACM, 17(11):643-644, November 1974.
6. E. W. Dijkstra. "A belated proof of self-stabilization", Distributed Computing, 1(1):5-6, 1986.
7. S. Dolev. Self-Stabilization. MIT Press, 2000.
8. S. Dolev, D. K. Pradhan, and J. L. Welch., "Modified tree structure for location management in mobile environments", Computer Communications, 19:335-345, 1996.
9. S. Dolev and J. L. Welch, "Crash resilient communication in dynamic networks", IEEE Transactions on Computers, 46:14-26, 1997.
10. S. Fujita, T. Kameda, and M. Yamashita, "A resource assignment problem on graphs", In Proceedings of the 6th International Symposium on Algorithms and Computation, pages 418-427, Caims, Australia, December 1995.
11. S. K. S Gupta, A.Bouabdallah, and P. K.Srimani., "Self-stabilizing protocol for shortest path tree for multi-cast routing in mobile networks", In Euro-Par'00 Parallel Processing, Proceedings LNCS: 1900, pages 600-604, 2000.
12. S. K. S. Gupta and P.K. Srimani, "Using self-stabilization to design adaptive multicast protocol for mobile ad hoc networks", Proceedings of the DIMACS Workshop on Mobile Networks and Computing, pages 67-84, Rutgers University, NJ, 1999.
13. S. Hsu and S.T. Huang, "A self-stabilizing algorithm for maximal matching", Information Processing. Letters, 43:77-81, 1992.
14. T.W. Haynes, S.T.Hedetniemi, and P.J. Slater. Fundamentals of Domination in Graphs, Marcel Dekker, 1998.
15. S. T. Hedetniemi, D. P. Jacobs, and P. K. Srimani, "Fault tolerant distributed coloring algorithms that stabilize in linear time", Proceedings of the IPDPS-2002 Workshop on Advances in Parallel and Distributed Computational Models, pages 1-5, 2002.
16. S. Shukla, D. Rosenkrantz, and S. Ravi, "Developing self-stabilizing coloring algorithms via systematic randomization", In Proceedings of International. Workshop on Parallel Processing, pages 668-673, 1994.
17. W. Goddard, S. T. Hedetniemi, D. P. Jacobs, and P. K. Srimani, "Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks", Proceedings of the Fifth IPDPS Workshop on Advances in Parallel and Distributed Computational Models, Nice, France, April 22-26, 2003.