Efficient load-balancing routing for wireless mesh networks

Wireless mesh networks (WMNs) consist of static wireless routers, some of which, called gateways, are directly connected to the wired infrastructure. User stations are connected to the wired infrastructure via wireless routers. This paper presents a simple and effective management architecture for WMNs, termed configurable access network (CAN). Under this architecture, the control function is separated from the switching function, so that the former is performed by an network operation center (NOC) which is located in the wired infrastructure. The NOC monitors the network topology and user performance requirements, from which it computes a path between each wireless router and a gateway, and allocates fair bandwidth for carrying the associated traffic along the selected route. By performing such functions in the NOC, we offload the network management overhead from wireless routers, and enable the deployment of simple/low-cost wireless routers. Our goal is to maximize the network utilization by balancing the traffic load, while providing fair service and quality of service (QoS) guarantees to the users. Since, this problem is NP-hard, we devise approximation algorithms that provide guarantees on the quality of the approximated solutions against the optimal solutions. The simulations show that the results of our algorithms are very close to the optimal solutions.

[1]  Tzi-cker Chiueh,et al.  Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[2]  Abtin Keshavarzian,et al.  Load balancing in ad hoc networks: single-path routing vs. multi-path routing , 2004, IEEE INFOCOM 2004.

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Michel X. Goemans,et al.  On the Single-Source Unsplittable Flow Problem , 1999, Comb..

[5]  Oliver C. Ibe,et al.  Converged Network Architectures: Delivering Voice and Data over IP, ATM, and Frame Relay , 2001 .

[6]  Yakov Rekhter,et al.  Mpls: Technology and Applications , 2000 .

[7]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[8]  Robert Tappan Morris,et al.  a high-throughput path metric for multi-hop wireless routing , 2003, MobiCom '03.

[9]  Roger Karrer,et al.  Enabling large-scale wireless broadband , 2004, Comput. Commun. Rev..

[10]  Murali S. Kodialam,et al.  Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels , 2005, IEEE/ACM Transactions on Networking.

[11]  Jian Tang,et al.  Interference-aware topology control and QoS routing in multi-channel wireless mesh networks , 2005, MobiHoc '05.

[12]  Lili Qiu,et al.  Impact of Interference on Multi-Hop Wireless Network Performance , 2003, MobiCom '03.

[13]  Jitendra Padhye,et al.  Routing in multi-radio, multi-hop wireless mesh networks , 2004, MobiCom '04.

[14]  Jingyi He,et al.  Extending WLAN coverage using infrastructureless access points , 2005, HPSR. 2005 Workshop on High Performance Switching and Routing, 2005..

[15]  S. Ramanathan,et al.  A survey of routing techniques for mobile communications networks , 1996, Mob. Networks Appl..

[16]  David E. McDysan,et al.  ATM: Theory and Application , 1994 .

[17]  H. T. Kung,et al.  Load-balancing routing for wireless access networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[18]  Peter P. Pham,et al.  Performance analysis of reactive shortest path and multipath routing mechanism with load balance , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[19]  Edward W. Knightly,et al.  End-to-end performance and fairness in multihop wireless backhaul networks , 2004, MobiCom '04.

[20]  Gil Zussman,et al.  Energy efficient routing in ad hoc disaster recovery networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[21]  Oliver C. Ibe.  Converged Network Architectures: Delivering Voice over IP, ATM, and Frame Relay , 2001 .

[22]  Marco Conti,et al.  Mesh networks: commodity multihop ad hoc networks , 2005, IEEE Communications Magazine.

[23]  Nitin H. Vaidya,et al.  Routing and interface assignment in multi-channel multi-interface wireless networks , 2005, IEEE Wireless Communications and Networking Conference, 2005.

[24]  Clifford Stein,et al.  Improved approximation algorithms for unsplittable flow problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[25]  Murali S. Kodialam,et al.  Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem , 2003, MobiCom '03.

[26]  Ian F. Akyildiz,et al.  Wireless mesh networks: a survey , 2005, Comput. Networks.

[27]  Carsten Bormann,et al.  RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressed , 2001, RFC.