A new algorithm for backbone formation in ad hoc wireless networks of nodes with different transmission ranges

We consider the problem of backbone formation in ad hoc wireless networks composed of heterogeneous nodes. A virtual backbone in an ad hoc wireless network provides a hierarchical infrastructure that can be used to address important challenges such as efficient routing, multicasting/broadcasting, activity-scheduling, and energy efficiency. We model a wireless network in which nodes have different transmission ranges by a disk graph. A virtual backbone in such a network can be modeled by a Strongly Connected Dominating and Absorbent Set (SCDAS) in the associated disk graph. For practical reasons, it is desirable to minimize the size of this backbone. In this paper, we propose an efficient distributed algorithm for the construction of an SCDAS in ad hoc networks modeled by disk graphs. Extensive simulation results show that the SCDAS constructed by our algorithm is significantly smaller than those generated by the algorithms prior to our work.