Virtual Backbone-Based Routing in Multihop Ad Hoc Wireless Networks

Thumbnail Image

View/Download File

Persistent link to this item

View Statistics

Journal Title

Journal ISSN

Volume Title


Virtual Backbone-Based Routing in Multihop Ad Hoc Wireless Networks

Published Date






Recent research shows that the flooding mechanism (for topology update or route request) used in existing protocols for ad hoc wireless networks greatly degrades the network capacity. If we force the effective broadcasts of control packets happen in a small subset of hosts in thenetwork, the protocol overhead caused by global flooding can be substantially reduced. This is the basic idea of virtual backbone-based routing in ad hoc wireless networks, in which all hosts forming the virtual backbone are in charge of control packets dissemination. This strategy works quite effectively in decreasing message overhead. However, constructing a virtual backbone is not trivial. In our study, the virtual backbone is approximated by minimum connected dominating set (MCDS) in unit-disk graphs, which is NP-hard. We propose two distributed time/message efficient approximation algorithms to compute MCDS. Both algorithms have linear message complexities. Algorithm I is cost-aware, which accommodates the strict network resources in virtual backbone construction. Algorithm II is degree-aware, which generates the best result in literature so far to our knowledge. We not only give theoretical performance analysis for both algorithms, but also conduct extensive simulation to compare our algorithms with those in literature. Simulation results and theoretical analysis showthat both algorithms perform very well.



Related to



Series/Report Number

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Suggested citation

Cheng, Xiuzhen; Du, Ding-Zhu. (2002). Virtual Backbone-Based Routing in Multihop Ad Hoc Wireless Networks. Retrieved from the University Digital Conservancy,

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.