A self-stabilizing algorithm for finding a minimal distance-2 dominating set in distributed systems

Journal of Information Science and Engineering

Volumn 24, Issue 6, 2008, Pages 1709-1718

  Lin, Ji Cherng ^a   Huang, Tetz C ^a   Wang, Cheng Pin ^a   Chen, Chih Yuan ^b  

^a YUAN ZE UNIVERSITY   (Taiwan)

^b NANYA INSTITUTE OF TECHNOLOGY   (Taiwan)

Author keywords

Dijkstra's central demon model; Distributed system; Legitimate configuration; Minimal distance 2 dominating set; Self stabilizing algorithm

Indexed keywords

GRAPH THEORY; POPULATION STATISTICS; TOPOLOGY;

DIJKSTRA'S CENTRAL DEMON MODEL; DISTRIBUTED SYSTEM; LEGITIMATE CONFIGURATION; MINIMAL DISTANCE-2 DOMINATING SET; SELF-STABILIZING ALGORITHM;

TURBO CODES;

EID: 57049084631     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (12)

1. E. W. Dijkstra, "Self-stabilizing systems in spite of distributed control," Communications of the ACM, Vol. 17, 1974, pp. 643-644.
2. E. W. Dijkstra, "Self-stabilization in spite of distributed control," Selected Writings on Computing: A Personal Perspective, Springer-Verlag, Berlin-Heidelberg, New York, 1982, pp. 41-46.
3. E. W. Dijkstra, "A belated proof of self-stabilization," Distributed Computing, Vol. 1, 1986, pp. 5-6.
4. S. Shukla, D. J. Rosenkrantz, and S. S. Ravi, "Observations on self-stabilizing graph algorithms on anonymous networks," in Proceedings of the Workshop on Self-Stabilizing Systems, 1995, pp. 7.1-7.15.
5. M. Ikeda, S. Kamei, and H. Kakugawa, "A space-optimal self-stabilizing algorithm for the maximal independent set problem," in Proceedings of the International Conference on Parallel and Distributed Computing, Applications and Technologies, 2002, pp. 70-74.
6. 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," in Proceedings of the International Parallel and Distributed Processing Symposium, Workshop on Advances in Parallel and Distributed Computational Models, 2003, pp. 22-26.
7. W. Goddard, S. T. Hedetniemi, D. P. Jacobs, and P. K. Srimani, "A self-stabilizing distributed algorithm for minimal total domination in an arbitrary system graph," in Proceedings of IEEE International Parallel and Distributed Processing Symposium, Workshop on Formal Methods for Parallel Programming, 2003, pp. 240-244.
8. S. M. Hedetniemi, S. T. Hedetniemi, D. P. Jacobs, and P. K. Srimani, "Self-stabilizing algorithms for minimal dominating sets and maximal independent sets," Computers and Mathematics with Applications, Vol, 46, 2003, pp. 805-811.
9. T. C. Huang, C. Y. Chen, and C. P. Wang, "A linear-time self-stabilizing algorithm for the minimal 2-dominating set in general networks," Journal of Information Science and Engineering, Vol. 24, 2008, pp. 175-187.
10. T. C. Huang, J. C. Lin, C. Y. Chen, and C. P. Wang, "A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model," Computers and Mathematics with Applications, Vol. 54, 2007, pp. 350-356.
11. S. Kamei and H. Kakugawa, "A self-stabilizing algorithm for the distributed minimal k-redundant dominating set problem in tree networks," in Proceedings of the International Conference on Parallel and Distributed Computing, Applications and Technologies, 2003, pp. 720-724.
12. Z. Xu, S. T. Hedetniemi, W. Goddard, and P. K. Srimani, "A synchronous self-stabilizing minimal domination protocol in an arbitrary network graph," in Proceedings of the International Workshop on Distributed Computing, 2003, pp. 26-32.