Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks

Multihop infrastructure wireless mesh networks offer increased reliability, coverage, and reduced equipment costs over their single-hop counterpart, wireless local area networks. Equipping wireless routers with multiple radios further improves the capacity by transmitting over multiple radios simultaneously using orthogonal channels. Efficient channel assignment and routing is essential for throughput optimization of mesh clients. Efficient channel assignment schemes can greatly relieve the interference effect of close-by transmissions; effective routing schemes can alleviate potential congestion on any gateways to the Internet, thereby improving per-client throughput. Unlike previous heuristic approaches, we mathematically formulate the joint channel assignment and routing problem, taking into account the interference constraints, the number of channels in the network, and the number of radios available at each mesh router. We then use this formulation to develop a solution for our problem that optimizes the overall network throughput subject to fairness constraints on allocation of scarce wireless capacity among mobile clients. We show that the performance of our algorithms is within a constant factor of that of any optimal algorithm for the joint channel assignment and routing problem. Our evaluation demonstrates that our algorithm can effectively exploit the increased number of channels and radios, and it performs much better than the theoretical worst case bounds

[1]  Qi Zhang,et al.  Maximum flow-life curve for a wireless ad hoc network , 2001, MobiHoc '01.

[2]  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..

[3]  Yigal Bejerano Efficient integration of multihop wireless and wired networks with QoS constraints , 2004, IEEE/ACM Transactions on Networking.

[4]  Tzi-cker Chiueh,et al.  Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks , 2004, MOCO.

[5]  Randeep Bhatia,et al.  Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks , 2005, IEEE Journal on Selected Areas in Communications.

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

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

[8]  Ranveer Chandra,et al.  Optimizing the placement of Internet TAPs in wireless neighborhood networks , 2004, Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004..

[9]  Murali S. Kodialam,et al.  On power efficient communication over multi-hop wireless networks: joint routing, scheduling and power control , 2004, IEEE INFOCOM 2004.

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

[11]  Aravind Srinivasan,et al.  End-to-end packet-scheduling in wireless ad-hoc networks , 2004, SODA '04.

[12]  Nitin H. Vaidya,et al.  Capacity of multi-channel wireless networks: impact of number of channels and interfaces , 2005, MobiCom '05.

[13]  Seung-Jae Han,et al.  Fairness and Load Balancing in Wireless LANs Using Association Control , 2004, IEEE/ACM Transactions on Networking.

[14]  S. Kravitz Packing Cylinders into Cylindrical Containers , 1967 .

[15]  Aravind Srinivasan,et al.  Algorithmic aspects of capacity in wireless networks , 2005, SIGMETRICS '05.

[16]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[17]  P. Bahl,et al.  SSCH: slotted seeded channel hopping for capacity improvement in IEEE 802.11 ad-hoc wireless networks , 2004, MobiCom '04.