Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Backbone Construction for Heterogeneous Wireless Ad Hoc Networks



Yi Qian, Hui Guo, Nader Moayeri, Kejie Lu


In this paper, we propose a backbone construction scheme over heterogeneous ad hoc networks, where the network nodes have different characteristics such as communication capacity, processing power and energy resource. Most of the wireless backbone construction techniques focus on minimizing the number of backbone nodes. In our proposed scheme, we not only minimize the backbone size, but also take the characteristics of nodes into account when building a backbone. In the scheme, the more capable nodes have higher probability to serve as backbone nodes and provide a wireless highway over which end-to-end communication can take place. The proposed scheme includes two major steps, which can be solved by formulating as a Dominating Set (DS) problem and a Steiner Tree Problem with Minimum Number of Steiner Points (STP-MSP) respectively. We focus on the two subproblems and present a number of polynomial time approximation algorithms. Simulation results show that the proposed scheme achieves higher average backbone node performance, while has approximately the same backbone size comparing with other schemes.
Proceedings Title
Conference Dates
June 14-18, 2009
Conference Location
Dresden, DE


backbone construction scheme, dominating set, heterogeneous, Steiner points, wireless ad hoc networks


Qian, Y. , Guo, H. , Moayeri, N. and Lu, K. (2009), Backbone Construction for Heterogeneous Wireless Ad Hoc Networks, IEEE ICC 2009, Dresden, DE, [online], (Accessed May 21, 2024)


If you have any questions about this publication or are having problems accessing it, please contact

Created June 10, 2009, Updated February 19, 2017