Connected dominating sets in disk graphs with bidirectional links

IEEE Communications Letters

Volumn 10, Issue 3, 2006, Pages 138-140

  Thai, My T ^a   Du, Ding Zhu ^a  

^a University of Minnesota   (United States)

Author keywords

Connected dominating set; Disk graphs; Independent set; Wireless ad hoc networks

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; NETWORK PROTOCOLS; ROUTERS; TELECOMMUNICATION LINKS; THEOREM PROVING;

CONNECTED DOMINATING SET; DISK GRAPHS; DISTRIBUTED ALGORITHM; INDEPENDENT SET; WIRELESS AD HOC NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 33644928040     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2006.1603363     Document Type: Article

References (3)

1. B. Clack, C. Colbourn, and D. Johnson, "Unit disk graphs," Discrete Mathematics, vol. 86, pp. 165-177, Aug. 1990.
2. P.-J. Wan, K. M. Alzoubi, and O. Frieder, "Distributed construction on connected dominating set in wireless ad hoc networks," Mobile Networks and Application, vol. 9, pp. 141-149, Apr. 2002.
3. Y. Li, M. T. Thai, F. Wang, C.-W. Yi, P.-J. Wang, and D.-Z. Du, "On greedy construction of connected dominating sets in wireless networks," special issue of Wireless Communications and Mobile Computing (WCMC), 2005, to appear.