A New Performance Metric for Construction of Robust and Efficient Wireless Backbone Network

With the popularity of wireless devices and the increasing demand of network applications, it is emergent to develop more effective communications paradigm to enable new and powerful pervasive applications, and to allow services to be accessed anywhere, at anytime. However, it is extremely challenging to construct efficient and reliable networks to connect wireless devices due to the increasing communications need and the dynamic nature of wireless communications. In order to improve transmission throughput, many efforts have been made in recent years to reduce traffic and hence transmission collisions by constructing backbone networks with the minimum size. However, many other important issues need to be considered. Instead of simply minimizing the number of backbone nodes or supporting some isolated network features, in this work, we exploit the use of algebraic connectivity to control backbone network topology design for concurrent improvement of backbone network robustness, capacity, stability and routing efficiency. In order to capture other network features, we provide a general cost function and introduce a new metric, connectivity efficiency, to trade off algebraic connectivity and cost for backbone construction. We formally prove the problem of formulating a backbone network with the maximum connectivity efficiency that is NP-hard, and design both centralized and distributed algorithms to build more robust and efficient backbone infrastructure to better support the application needs. We have made extensive simulations to evaluate the performance of our work. Compared to literature studies on constructing wireless backbone networks, the incorporation of algebraic connectivity into the network performance metric could achieve much higher throughput and delivery ratio, and much lower end-to-end delay and routing distances under all test scenarios. We hope our work could stimulate more future research in designing more reliable and efficient networks. Our performance studies demonstrate that, compared to peer work, the incorporation of algebraic connectivity into network performance metric could achieve much higher throughput and delivery ratio, and much lower end-to-end delay and routing distances under all test scenarios. We hope our work could stimulate more future research in designing more reliable and efficient networks.

[1]  Harry B. Hunt,et al.  Simple heuristics for unit disk graphs , 1995, Networks.

[2]  Yingshu Li,et al.  Construction algorithms for k-connected m-dominating sets in wireless sensor networks , 2008, MobiHoc '08.

[3]  Richard M. Murray,et al.  INFORMATION FLOW AND COOPERATIVE CONTROL OF VEHICLE FORMATIONS , 2002 .

[4]  Mario Gerla,et al.  Multicluster, mobile, multimedia radio network , 1995, Wirel. Networks.

[5]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[6]  Jie Wu,et al.  Iterative local solutions for connected dominating set in ad hoc wireless networks , 2005, IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005..

[7]  Christian Scheideler,et al.  An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model , 2008, MobiHoc '08.

[8]  G. Kirchhoff Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird , 1847 .

[9]  Xiaoyan Hong,et al.  Landmark routing in ad hoc networks with mobile backbones , 2003, J. Parallel Distributed Comput..

[10]  Stefano Basagni,et al.  Finding a Maximal Weighted Independent Set in Wireless Networks , 2001, Telecommun. Syst..

[11]  Xiang-Yang Li,et al.  Energy Efficient Target-Oriented Scheduling in Directional Sensor Networks , 2009, IEEE Transactions on Computers.

[12]  Yu-Chee Tseng,et al.  Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[13]  Peng-Jun Wan,et al.  New distributed algorithm for connected dominating set in wireless ad hoc networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[14]  Donghyun Kim,et al.  Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[15]  Izhak Rubin,et al.  Performance analysis and enhancement for backbone based wireless mobile ad hoc networks , 2005, 2nd International Conference on Broadband Networks, 2005..

[16]  Izhak Rubin,et al.  A distributed mobile backbone formation algorithm for wireless ad hoc networks , 2004, First International Conference on Broadband Networks.

[17]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2002, Wirel. Networks.

[18]  Ning Zhang,et al.  Trade-off scheme for fault tolerant connected dominating sets on size and diameter , 2008, FOWANC '08.

[19]  Piet Van Mieghem,et al.  Algebraic connectivity optimization via link addition , 2008, BIONETICS.

[20]  M. Fiedler Algebraic connectivity of graphs , 1973 .

[21]  Yu Zhou,et al.  Deployment of a Reinforcement Backbone Network with Constraints of Connection and Resources , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[22]  Alessandro Panconesi,et al.  Localized protocols for ad hoc clustering and backbone formation: a performance comparison , 2006, IEEE Transactions on Parallel and Distributed Systems.

[23]  Xiang-Yang Li,et al.  Efficient distributed low-cost backbone formation for wireless networks , 2006, IEEE Transactions on Parallel and Distributed Systems.

[24]  Xin Wang,et al.  Exploiting use of a new performance metric for construction of robust and efficient wireless backbone network , 2010, 2010 IEEE 18th International Workshop on Quality of Service (IWQoS).

[25]  Jiannong Cao,et al.  Design and Performance Evaluation of Efficient Consensus Protocols for Mobile Ad Hoc Networks , 2007, IEEE Transactions on Computers.

[26]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[27]  Damon Mosk-Aoyama,et al.  Maximum algebraic connectivity augmentation is NP-hard , 2008, Operations Research Letters.

[28]  Mahesh K. Marina,et al.  Virtual dynamic backbone for mobile ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[29]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[30]  Jie Wu,et al.  An extended localized algorithm for connected dominating set formation in ad hoc wireless networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

[31]  Mario Gerla,et al.  Adaptive Clustering for Mobile Wireless Networks , 1997, IEEE J. Sel. Areas Commun..

[32]  B. Mohar THE LAPLACIAN SPECTRUM OF GRAPHS y , 1991 .

[33]  V. Cerný Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[34]  Izhak Rubin,et al.  TBONE: A mobile-backbone protocol for ad hoc wireless networks , 2002, Proceedings, IEEE Aerospace Conference.

[35]  Tracy Camp,et al.  Stationary distributions for the random waypoint mobility model , 2004, IEEE Transactions on Mobile Computing.

[36]  H. Weinberger Variational Methods for Eigenvalue Approximation , 1974 .

[37]  Christian Bettstetter,et al.  Scenario-based stability anlysis of the distributed mobility-adaptive clustering (DMAC) algorithm , 2001, MobiHoc.

[38]  Noga Alon,et al.  lambda1, Isoperimetric inequalities for graphs, and superconcentrators , 1985, J. Comb. Theory, Ser. B.

[39]  Izhak Rubin,et al.  Mesh Backbone Topology Synthesis for Multi-Radio Interconnected Wireless LANs , 2006, 2006 IEEE International Conference on Communications.

[40]  Mauro Leoncini,et al.  The k-Neighbors Approach to Interference Bounded and Symmetric Topology Control in Ad Hoc Networks , 2006, IEEE Transactions on Mobile Computing.

[41]  Eytan Modiano,et al.  Mobile backbone networks --: construction and maintenance , 2006, MobiHoc '06.

[42]  Jie Wu,et al.  On constructing k-connected k-dominating set in wireless ad hoc and sensor networks , 2006, J. Parallel Distributed Comput..

[43]  Yuanyuan Yang,et al.  Stateless Multicasting in Mobile Ad Hoc Networks , 2010, IEEE Transactions on Computers.

[44]  Izhak Rubin,et al.  Backbone Topology Synthesis for Multi-Radio Meshed Wireless LANs , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.