Efficient load-balancing routing for wireless mesh networks

被引:50
|
作者
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
相关论文
共 50 条
  • [41] Local load balancing for globally efficient routing in wireless sensor networks
    Raicu, I
    Schwiebert, L
    Fowler, S
    Gupta, SKS
    INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2005, 1 (02) : 163 - 185
  • [42] Cost-Sensitive and Load-Balancing Gateway Placement in Wireless Mesh Networks with QoS Constraints
    曾锋
    陈志刚
    Journal of Computer Science & Technology, 2009, 24 (04) : 775 - 785
  • [43] Cost-Sensitive and Load-Balancing Gateway Placement in Wireless Mesh Networks with QoS Constraints
    Feng Zeng
    Zhi-Gang Chen
    Journal of Computer Science and Technology, 2009, 24 : 775 - 785
  • [44] Adaptive load-balancing in WDM mesh networks with performance guarantees
    Dai, Rui
    Li, Lemin
    Wang, Sheng
    PHOTONIC NETWORK COMMUNICATIONS, 2011, 21 (03) : 215 - 227
  • [45] Adaptive load-balancing in WDM mesh networks with performance guarantees
    Rui Dai
    Lemin Li
    Sheng Wang
    Photonic Network Communications, 2011, 21 : 215 - 227
  • [46] Efficient Load-Aware Routing Scheme for Wireless Mesh Networks
    Choi, Kae Won
    Jeon, Wha Sook
    Jeong, Dong Geun
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2010, 9 (09) : 1293 - 1307
  • [47] Adaptive and Secure Load-Balancing Routing Protocol for Service-Oriented Wireless Sensor Networks
    Li, Shancang
    Zhao, Shanshan
    Wang, Xinheng
    Zhang, Kewang
    Li, Ling
    IEEE SYSTEMS JOURNAL, 2014, 8 (03): : 858 - 867
  • [48] A Game Theory based Load-Balancing Routing with Cooperation Stimulation for Wireless Ad hoc Networks
    Tian Hui
    Jiang Fan
    Cheng Weijun
    HPCC: 2009 11TH IEEE INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS, 2009, : 266 - +
  • [49] QoS based Fair Load-Balancing: Paradigm to IANRA Routing Algorithm for Wireless Networks (WNs)
    Moghanjoughi, Ayyoub Akbari
    Khatun, Sabira
    Ali, Borhanuddin M.
    Abdullah, Raja S. A. R.
    2008 11TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY: ICCIT 2008, VOLS 1 AND 2, 2008, : 437 - 442
  • [50] Load-balancing routing in software defined networks with multiple controllers
    Wang, Haibo
    Xu, Hongli
    Huang, Liusheng
    Wang, Jianxin
    Yang, Xuwei
    COMPUTER NETWORKS, 2018, 141 : 82 - 91