A distributed self-stabilizing algorithm for finding a connected dominating set in a graph

Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings

Volumn 2005, Issue , 2005, Pages 615-619

  Jain, Ankur ^a   Gupta, Arobinda ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER APPLICATIONS; COMPUTER NETWORKS; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; MOBILE COMPUTING; ROUTERS;

ARBITRARY INITIAL STATE; DOMINATING SET IN A GRAPH; NODES; SELF-STABILIZING ALGORITHM;

GRAPH THEORY;

EID: 33745126290     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PDCAT.2005.10     Document Type: Conference Paper

References (8)

1. P.-J. Wan, K.M. Alzoubi, and O. Frieder, "Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks", IEEE Infocom, New York City, June 2002.
2. rd Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Washington, Aug. 1999.
3. B. Das, and V. Bharghavan, "Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets," IEEE Int. Conf. on Communications, Canada, June 1997.
4. B. Das, R. Sivakumar, and V. Bhargavan, "Routing in Ad-Hoc Networks Using a Spine", Int. Conf. on Computers and Communications Networks, Las Vegas, Sept. 1997.
5. R. Sivakumar, B. Das, and V. Bharghavan, "An Improved Spine-based Infrastructure for Routing in Ad Hoc Networks", IEEE Symposium on Computers and Communications, Greece, June 1998.
6. E.W. Dijkstra, "Self-stabilizing systems in spite of distributed control", Communications of the ACM, ACM Press, New York, Nov. 1974, pp.643-644.
7. E.W. Dijkstra, "Guarded commands, nondeterminacy and formal derivation of programs", Communications of the ACM, ACM Press, New York, Aug. 1975, pp.453-457
8. th Int. Workshop on Distributed Computing, India, Dec. 2003.