Enhanced backbone net synthesis for mobile wireless ad hoc networks

In this paper, we present an enhanced mobile backbone network topology synthesis algorithm for constructing and maintaining a dynamic backbone structure in mobile wireless ad hoc networks. The scalability and efficiency of backbone-based routing in ad hoc networks depend on the overhead introduced by the formation of a connected backbone network and the size of the backbone network. We prove that the algorithm presented in this paper has time complexity of the order of 0(1), and yields a communication overhead factor of the order of 0(1) per node. Two rules are introduced for regulating the election of backbone nodes that are shown to enable an asynchronous, distributed and stable operation of the algorithm.