On greedy construction of connected dominating sets in wireless networks

Yingshu Li*, My T. Thai, Feng Wang, Tsi-Ui Ik, Peng Jun Wan, Ding Zhu Du

*此作品的通信作者

研究成果: Review article同行評審

166 引文 斯高帕斯(Scopus)

摘要

Since no fixed infrastructure and no centralized management present in wireless networks, a connected dominating set (CDS) of the graph representing the network is widely used as a virtual backbone. Constructing a minimum CDS is NP-hard. In this paper, we propose a new greedy algorithm, called S-MIS, with the help of Steiner tree that can construct a CDS within a factor of 4.8 + ln5 from the optimal solution. We also introduce the distributed version of this algorithm. We prove that the proposed algorithm is better than the current best performance ratio which is 6.8. A simulation is conducted to compare S-MIS with its variation which is rS-MIS. The simulation shows that the sizes of the CDSs generated by S-MIS and rS-MIS are almost the same.

原文English
頁(從 - 到)927-932
頁數6
期刊Wireless Communications and Mobile Computing
5
發行號8
DOIs
出版狀態Published - 12月 2005

指紋

深入研究「On greedy construction of connected dominating sets in wireless networks」主題。共同形成了獨特的指紋。

引用此