A self-stabilizing algorithm for constructing weakly connected minimal dominating sets

Information Processing Letters

Volumn 109, Issue 14, 2009, Pages 763-767

  Turau, Volker ^a   Hauck, Bernd ^a  

^a HAMBURG UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Distributed algorithms; Fault tolerance; Graph algorithms; Self stabilizing algorithms

Indexed keywords

BREADTH FIRSTS; DISTRIBUTED ALGORITHMS; DOMINATING SET PROBLEMS; DOMINATING SETS; EXPONENTIAL NUMBERS; GRAPH ALGORITHMS; SELF-STABILIZING ALGORITHMS;

FAULT TOLERANCE; PARALLEL ALGORITHMS;

QUALITY ASSURANCE;

EID: 67349099903     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2009.03.013     Document Type: Article

References (14)

1. Alzoubi K., Wan P.J., and Frieder O. Independent set, weakly-connected dominating set, and induced spanners in wireless ad hoc networks. Int. J. Found. Comput. Sci. 14 2 (2003) 287-303
2. Y.P. Chen, A.L. Liestman, Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks, in: Proc. 3rd Int. Symp. on Mobile Ad Hoc Networking Computing, 2002, pp. 165-172
3. Dolev S. Self-Stabilization (2000), MIT Press, Cambridge, USA
4. D. Dubhashi, A. Mei, A. Panconesi, J. Radhakrishnan, A. Srinivasan, Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons, in: Proc. 14th Annual ACM-SIAM Symp. on Discrete Algorithms, 2003, pp. 717-724
5. Dunbar J., Grossman J., Hedetniemi S., Hattingh J., and McRae A. On weakly-connected domination in graphs. Discrete Math. 167-168 (1997) 261-269
6. Gairing M., Goddard W., Hedetniemi S., Kristiansen P., and McRae A. Distance-two information in self-stabilizing algorithms. Parallel Process. Lett. 14 3-4 (2004) 387-398
7. Goddard W., Hedetniemi S., Jacobs D.P., and Trevisan V. Distance-k knowledge in self-stabilizing algorithms. Theoret. Comput. Sci. 399 1-2 (2008) 118-127
8. M. Gradinariu, S. Tixeuil, Conflict managers for self-stabilization without fairness assumption, in: Proc. 27th Int. Conf. on Distributed Computing Systems, 2007, p. 46
9. B. Hauck, Worst-case analysis of a self-stabilizing algorithm computing a WCMDS, Techn. Rep., Hamburg University of Technology, 2008. urn:nbn:de:gbv:830-tubdok-5126
10. Huang S.T., and Chen N.-S. A self-stabilizing algorithm for constructing breadth first trees. Inform. Process. Lett. 41 (1992) 109-117
11. A.K. Pathan, C.S. Hong, A key-predistribution-based weakly connected dominating set for secure clustering in DSN, in: HPCC, 2006, pp. 270-279
12. P.K. Srimani, Z. Xu, Self-stabilizing algorithms of constructing spanning tree and weakly connected minimal dominating set, in: Proc. 27th Int. Conf. on Distributed Computing Systems Workshops, 2007, p. 3
13. Sur S., and Srimani P.K. A self-stabilizing distributed algorithm to construct BFS spanning trees of a symmetric graph. Parallel Process. Lett. 2 (1992) 171-179
14. Turau V. Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler. Inform. Process. Lett. 103 (2007) 88-93