Efficient load-balancing routing for wireless mesh networks

被引:51
作者
Bejerano, Yigal
Han, Seung-Jae [1 ]
Kumar, Amit
机构
[1] Yonsei Univ, Dept Comp Sci, Seoul 120749, South Korea
[2] Indian Inst Technol, Dept Comp Sci & Engn, New Delhi 110016, India
关键词
wireless mesh network; load-balancing routing; fairness; approximation algorithms;
D O I
10.1016/j.comnet.2006.09.018
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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. (C) 2006 Published by Elsevier B.V.
引用
收藏
页码:2450 / 2466
页数:17
相关论文
共 28 条
[1]   Wireless mesh networks: a survey [J].
Akyildiz, IF ;
Wang, XD ;
Wang, WL .
COMPUTER NETWORKS, 2005, 47 (04) :445-487
[2]  
[Anonymous], 2004, MobiCom'04'- Proceedings of the 10th annual international conference on Mobile computing and networking
[3]  
BORMANN C, 2000, 3095 RFC
[4]   Mesh networks: Commodity multihop ad hoc networks [J].
Bruno, R ;
Conti, M ;
Gregori, E .
IEEE COMMUNICATIONS MAGAZINE, 2005, 43 (03) :123-131
[5]  
DAVIE BS, 2000, MPLS TECNOLOGY APPL
[6]  
De Couto D. S. J., 2003, P 9 ANN INT C MOBILE, P134, DOI [10.1145/938985.939000, DOI 10.1145/938985.939000]
[7]   On the single-source unsplittable flow problem [J].
Dinitz, Y ;
Garg, N ;
Goemans, MX .
39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, :290-299
[8]  
Gambiroza V., 2004, MOBICOM 04, P287, DOI DOI 10.1145/1023720.1023749.ISBN
[9]  
GANJALI Y, 2004, P IEEE INFOCOM 03 HO
[10]  
Garey MR, 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness