Issue No. 11 - November (2008 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2008.69
Seungjoon Lee , University of Maryland, College Park
Bobby Bhattacharjee , University of Maryland, College Park
Aravind Srinivasan , University of Maryland, College Park
Samir Khuller , University of Maryland, College Park
We consider the problem of finding "backbones" in wireless networks. The backbone provides end-to-end connectivity, allowing non-backbone nodes to save energy since they do not route or forward non-local data. Ideally, such a backbone would be small, consist primarily of high capacity nodes, and remain connected even when nodes move 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 structures better suited to high-mobility scenarios. We present a distributed protocol based upon our algorithm and show that this protocol builds and maintains a connected backbone in dynamic networks. Finally, we present detailed packet-level simulations to evaluate and compare our scheme against existing energy-saving techniques. Depending on the network environment, our scheme increases network lifetimes by 20—220% without adversely affecting network performance.
Network Protocols, Algorithm/protocol design and analysis, Mobile Computing
A. Srinivasan, S. Khuller, S. Lee and B. Bhattacharjee, "Efficient and Resilient Backbones for Multihop Wireless Networks," in IEEE Transactions on Mobile Computing, vol. 7, no. , pp. 1349-1362, 2008.