Self-stabilizing algorithms of constructing spanning tree and weakly connected minimal dominating set

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2007, Pages 3-10

  Srimani, Pradip K ^a   Xu, Zhenyu ^a  

^a AMRL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; SET THEORY; TREES (MATHEMATICS);

MINIMAL DOMINATING SETS; SELF-STABILIZING ALGORITHMS;

ALGORITHMS;

EID: 35948960359     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCSW.2007.73     Document Type: Conference Paper

References (6)

1. S. Dolev, A. Israeli, and S. Moran. Self-stabilization of dynamic systems assuming only read/write atomicity. Distributed Computing, 7:3-16, 1993.
2. A. Arora and M. Gouda. Distributed reset. IEEE Trans. Comput., 43(9):1026-1038, September 1994.
3. S. Guha and S. Khuller. Approximation algorithms for connected domination sets. Algorithmica, 20(4):374-387, April 1998.
4. P.-J. Wan, K. Alzoubi, and O. Frieder. Distributed construction of connected dominating set in wireless ad hoc networks. In In proceedings of IEEE INFOCOM, volume 3, pages 1597-1604, June 2002.
5. F. Dai and J. Wu. An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems, 15(10):908-920, October 2004.
6. F. Dai and J. Wu. An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Trans. Parallel Distrib. Syst., 15(10):908-920, 2004.