Connected dominating sets in disk graphs with bidirectional links
作者： My T. Thai , Ding-Zhu Du
DOI: 10.1109/LCOMM.2006.1603363
关键词:
摘要: In this paper, we study the connected dominating set (CDS) problem in disk graphs. The CDS problem has a significant impact on an efficient design of routing protocols in wireless networks. This problem has been studied extensively in unit disk graphs, in which each node has the same transmission range. However, in wireless ad hoc networks, the transmission ranges of all nodes are not necessary equal. In this paper, we introduce the CDS problem in disk graphs and present a constant approximation algorithm which can be …
ufl.edu
sci-hub.se 
researchgate.net 参考文章(3)
Peng-Jun Wan, Khaled M. Alzoubi, Ophir Frieder, Distributed construction of connected dominating set in wireless ad hoc networks Mobile Networks and Applications. ,vol. 9, pp. 141- 149 ,(2004) , 10.1023/B:MONE.0000013625.87793.13
Brent N. Clark, Charles J. Colbourn, David S. Johnson, Unit disk graphs Discrete Mathematics. ,vol. 86, pp. 165- 177 ,(1991) , 10.1016/0012-365X(90)90358-O
Yingshu Li, My T. Thai, Feng Wang, Chih-Wei Yi, Peng-Jun Wan, Ding-Zhu Du, On greedy construction of connected dominating sets in wireless networks Wireless Communications and Mobile Computing. ,vol. 5, pp. 927- 932 ,(2005) , 10.1002/WCM.356