Efficient distributed low-cost backbone formation for wireless networks

Yu Wang, Weizhao Wang, Xiang-Yang Li
2006 IEEE Transactions on Parallel and Distributed Systems  
Backbone has been used extensively in various aspects (e.g., routing, route maintenance, broadcast, scheduling) for wireless ad hoc or sensor networks recently. Previous methods are mostly designed to minimize the size of the backbone. However, in many applications, it is desirable to construct a backbone with small cost when each wireless node has a cost of being in the backbone. In this paper, we first show that previous methods specifically designed to minimize the backbone size may produce
more » ... backbone with large cost. Then an efficient distributed method to construct a weighted backbone with low cost is proposed. We prove that the total cost of the constructed backbone is within a small constant factor of the optimum for homogeneous networks when either the nodes' costs are smooth (i.e. the maximum ratio of costs of adjacent nodes is bounded) or the network maximum node degree is bounded. We also show that with a small modification the constructed backbone is efficient for unicast: the total cost (or hop) of the least cost (or hop) path connecting any two nodes using backbone is no more than 3 (or 4) times of the least cost (or hop) path in the original communication graph. Our theoretical results are corroborated by our simulation studies. Finally, we discuss several possible ad hoc network applications of our proposed backbone formation algorithms.
doi:10.1109/tpds.2006.86 fatcat:gt66vipu3jct3kj77f44nmnyna