Subscribe
Issue No.11 - November (2008 vol.7)
pp: 1349-1362
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
ABSTRACT
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&#x2014;220% without adversely affecting network performance.
INDEX TERMS
Network Protocols, Algorithm/protocol design and analysis, Mobile Computing
CITATION
Seungjoon Lee, Bobby Bhattacharjee, Aravind Srinivasan, Samir Khuller, "Efficient and Resilient Backbones for Multihop Wireless Networks", IEEE Transactions on Mobile Computing, vol.7, no. 11, pp. 1349-1362, November 2008, doi:10.1109/TMC.2008.69
REFERENCES
 [1] D. Johnson and D. Maltz, Dynamic Source Routing in Ad Hoc Wireless Networks. Kluwer Academic, 2001. [2] T. Clausen and P. Jacquet, Optimized Link State Routing Protocol (OLSR '03), IETF RFC 3626, Oct. 2003. [3] B. Das and V. Bharghavan, “Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets,” Proc. IEEE Int'l Conf. Comm. (ICC '97), June 1997. [4] P. Wan, K.M. Alzoubi, and O. Frieder, “Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks,” Proc. IEEE INFOCOM, 2002. [5] D. Dubhashi, A. Mei, A. Panconesi, J. Radhakrishnan, and A. Srinivasan, “Fast Distributed Algorithms for (Weakly) Connected Dominating Sets and Linear-Size Skeletons,” J. Computer and System Sciences, vol. 71, 2005. [6] S. Guha and S. Khuller, “Approximation Algorithms for Connected Dominating Sets,” Proc. Fourth Ann. European Symp. Algorithms (ESA), 1996. [7] B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, “Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks,” Wireless Networks, vol. 8, no. 5, 2002. [8] Y. Xu, J. Heidemann, and D. Estrin, “Geography-Informed Energy Conservation for Ad Hoc Routing,” Proc. ACM MobiCom, 2001. [9] J. Wu, M. Gao, and I. Stojmenovic, “On Calculating Power-Aware Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks,” Proc. IEEE Int'l Conf. Parallel Processing (ICPP), 2001. [10] D. Aguayo, J. Bicket, S. Biswas, G. Judd, and R. Morris, “Link-Level Measurements from an 802.11b Mesh Network,” Proc. ACM SIGCOMM, 2004. [11] M. Gerla and J.T. Tsai, “Multicluster, Mobile, Multimedia Radio Network,” Wireless Networks, vol. 1, no. 3, pp. 255-265, 1995. [12] J. Gao, L. Guibas, J. Hershberger, L. Zhang, and A. Zhu, “Discrete Mobile Centers,” Proc. Symp. Computational Geometry (SoCG), 2001. [13] B. Bollobás, “Random Graphs,” Cambridge Studies in Advanced Math., Cambridge Univ. Press, 2001. [14] U. Feige, “A Threshold of $\ln n$ for Approximating Set Cover,” J. ACM, vol. 45, no. 4, pp. 634-652, 1998. [15] L. Jia, R. Rajaraman, and T. Suel, “An Efficient Distributed Algorithm for Constructing Small Dominating Sets,” Distributed Computing, vol. 15, no. 4, 2002. [16] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, second ed. MIT Press, 2001. [17] R.G. Gallager, P.A. Humblet, and P.M. Spira, “A Distributed Algorithm for Minimum-Weight Spanning Trees,” ACM Trans. Programming Languages and Systems, 1983. [18] R.E. Tarjan, “Data Structures and Network Algorithms,” CBMS-NSF Regional Conf. Series in Applied Math., SIAM, 1983. [19] F. Dai and J. Wu, “An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 10, pp. 908-920, Oct. 2004. [20] S. Basagni, M. Mastrogiovanni, A. Panconesi, and C. Petrioli, “Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison,” IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 4, Apr. 2006. [21] The VINT Project, The Network Simulator-ns-2, http://www.isi. edu/nsnamns, 2008. [22] IEEE 802.11 Standard, Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, IEEE, 1999. [23] J. Yoon, M. Liu, and B.D. Noble, “Random Waypoint Considered Harmful,” Proc. IEEE INFOCOM '03, Apr. 2003. [24] D.M. Blough and P. Santi, “Investigating Upper Bounds on Network Lifetime Extension for Cell-Based Energy Conservation Techniques in Stationary Ad Hoc Networks,” Proc. ACM MobiCom, 2002. [25] L.M. Feeney and M. Nilsson, “Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment,” Proc. IEEE INFOCOM, 2001. [26] D.S.J. De Couto, D. Aguayo, J. Bicket, and R. Morris, “A High-Throughput Path Metric for Multi-Hop Wireless Routing,” Proc. ACM MobiCom '03, pp. 134-146, 2003. [27] F. Kuhn, T. Moscibroda, and R. Wattenhofer, “Initializing Newly Deployed Ad Hoc and Sensor Networks,” Proc. ACM MobiCom, 2004. [28] O. Younis and S. Fahmy, “Distributed Clustering in Ad-Hoc Sensor Networks: A Hybrid, Energy-Efficient Approach,” Proc. IEEE INFOCOM, 2004. [29] S. Lee, D. Levin, V. Gopalakrishnan, and B. Bhattacharjee, “Backbone Construction in Selfish Wireless Networks,” Proc. ACM Int'l Conf. Measurement and Modeling of Computer Systems (Sigmetrics '07), June 2007. [30] W. Ye, J. Heidemann, and D. Estrin, “An Energy-Efficient MAC Protocol for Wireless Sensor Networks,” Proc. IEEE INFOCOM '02, June 2002. [31] S. Singh and C.S. Raghavendra, “PAMAS: Power Aware Multi-Access Protocol with Signalling for Ad Hoc Networks,” SIGCOMM Computer Comm. Rev., vol. 28, no. 3, pp. 5-26, July 1998. [32] R. Zheng and R. Kravets, “On-Demand Power Management for Ad Hoc Networks,” Proc. IEEE INFOCOM '03, Apr. 2003. [33] A. Cerpa and D. Estrin, “ASCENT: Adaptive Self-Configuring sensor Networks Topologies,” IEEE Trans. Mobile Computing, vol. 3, no. 3, 2004. [34] V. Rodoplu and T.H. Meng, “Minimum Energy Mobile Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 17, no. 8, Aug. 1999. [35] L. Li, J.Y. Halpern, P. Bahl, Y. Wang, and R. Wattenhofer, “Analysis of a Cone-Based Distributed Topology Control Algorithm for Wireless Multi-Hop Networks,” Proc. 20th ACM Symp. Principles of Distributed Computing (PODC), 2001. [36] N. Li and J.C. Hou, “FLSS: A Fault-Tolerant Topology Control Algorithm for Wireless Networks,” Proc. ACM MobiCom, 2004. [37] C.M. Fortuin, F. Ginibre, and P.N. Kasteleyn, “Correlational Inequalities for Partially Ordered Sets,” Comm. Math. Physics, 1971. [38] M. Hofri, Analysis of Algorithms. Oxford Univ. Press, 1995. [39] H. Shachnai and A. Srinivasan, “Finding Large Independent Sets in Graphs and Hypergraphs,” SIAM J. Discrete Math., vol. 18, pp. 488-500, 2004.