On Greedy Construction of Connected Dominating Sets in Wireless Networks
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
On Greedy Construction of Connected Dominating Sets in Wireless Networks
Published Date
2004-12-16
Publisher
Type
Report
Abstract
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 the virtual backbone and plays an important role in the network. Constructing a minimum CDS is NP-hard. Many CDS construction algorithms have been designed. 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. The theoretical proof shows that our 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.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Li, Yingshu; Thai, My T.; Wang, Feng; Yi, Chih-Wei; Wan, Pengjun; Du, Ding-Zhu. (2004). On Greedy Construction of Connected Dominating Sets in Wireless Networks. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215642.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.