Efficient and Resilient Backbones for Multihop Wireless Networks

We consider the problem of finding "backbones" in multihop wireless networks. The backbone provides end-toend connectivity, allowing non-backbone nodes to save energy since they do not have to route non-local data or participate in the routing protocol. Ideally, such a backbone would be small, consist primarily of high capacity nodes, and remain connected even when nodes are mobile or fail. Unfortunately, it is often infeasible to construct a backbone that has all of these properties; e.g., a small optimal backbone is often too sparse to handle node failures or high mobility. We present a parameterized backbone construction algorithm that permits explicit tradeoffs between backbone size, resilience to node movement and failure, energy consumption, and path lengths. We prove that our scheme can construct essentially best possible backbones (with respect to energy consumption and backbone size) when the network is relatively static. We generalize our scheme to build more robust...

• Type: Journal
• Year: 2008
• Where: TMC
• Authors: Seungjoon Lee, Bobby Bhattacharjee, Aravind Srinivasan, Samir Khuller
• Keywords: Backbone Size, Multihop Wireless Networks, Small Optimal Backbone, TMC 2008