A Distributed Approximation for Minamum Connecting Dominated Sets in Wireless Networks
2003-05-02
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
A Distributed Approximation for Minamum Connecting Dominated Sets in Wireless Networks
Published Date
2003-05-02
Publisher
Type
Report
Abstract
A wireless ad-hoc network is a wireless, multihop network without an infrastructure. And due to the limited resources of hosts in the network, the resource utilization becomes more critical. As a result, construction of virtual backbones in wireless ad-hoc networks gets more attractive. In this paper, we present a distributed approximation scheme for minimum connected dominating sets in unit-disk graphs which can serve as a virtual backbone in the network. Our algorithm has the performance ratio of 7 and the message complexity of $O(n log n)$, which are the best among the schemes in the literature.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Min, Manki; Lanka, Raghuram; Huang, Xiao; Du, Ding-Zhu. (2003). A Distributed Approximation for Minamum Connecting Dominated Sets in Wireless Networks. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215564.
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.