TY - GEN
T1 - Load balancing routing for wireless mesh networks
T2 - 2008 5th IEEE Consumer Communications and Networking Conference, CCNC 2008
AU - Choi, Hyoung Gyu
AU - Han, Seung Jae
N1 - Copyright:
Copyright 2008 Elsevier B.V., All rights reserved.
PY - 2008
Y1 - 2008
N2 - In this paper, we propose a novel load balancing routing algorithm for wireless mesh networks (WMNs) with multiple gateways, i.e., sink routers. As most traffic occurring in WMNs is relayed to these gateways through wireless links in a multi-hop fashion, the sink routers are easily overloaded. In such a situation, when a user initiates a communication session and the corresponding route toward the sink router cannot provide the required level of services, the session is rejected. Our objective is to achieve load balancing routing that minimizes such rejections. To this end, we take an adaptive partitioning approach, which heuristically divides the entire network into partitions and applies load balancing to between partitions and within partitions. To cope with user mobility, partitions and routes are adaptively managed. Evaluation via simulations indicates up to 25% performance gains over existing schemes in rejected requests, while the overhead in route computation costs drops by up to 27%.
AB - In this paper, we propose a novel load balancing routing algorithm for wireless mesh networks (WMNs) with multiple gateways, i.e., sink routers. As most traffic occurring in WMNs is relayed to these gateways through wireless links in a multi-hop fashion, the sink routers are easily overloaded. In such a situation, when a user initiates a communication session and the corresponding route toward the sink router cannot provide the required level of services, the session is rejected. Our objective is to achieve load balancing routing that minimizes such rejections. To this end, we take an adaptive partitioning approach, which heuristically divides the entire network into partitions and applies load balancing to between partitions and within partitions. To cope with user mobility, partitions and routes are adaptively managed. Evaluation via simulations indicates up to 25% performance gains over existing schemes in rejected requests, while the overhead in route computation costs drops by up to 27%.
UR - http://www.scopus.com/inward/record.url?scp=51949118467&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51949118467&partnerID=8YFLogxK
U2 - 10.1109/ccnc08.2007.7
DO - 10.1109/ccnc08.2007.7
M3 - Conference contribution
AN - SCOPUS:51949118467
SN - 1424414571
SN - 9781424414574
T3 - 2008 5th IEEE Consumer Communications and Networking Conference, CCNC 2008
SP - 1
EP - 5
BT - 2008 5th IEEE Consumer Communications and Networking Conference, CCNC 2008
Y2 - 10 January 2008 through 12 January 2008
ER -