TY - GEN
T1 - Routing method for gateway load balancing in wireless mesh networks
AU - Tokito, Hiroshi
AU - Sasabe, Masahiro
AU - Hasegawa, Go
AU - Nakano, Hirotaka
PY - 2009
Y1 - 2009
N2 - Wireless mesh networks have been attracting many users in recent years to achieve a wide-area wireless environment with flexible-configuration and low-cost properties by connecting base stations (mesh nodes) with each other via wireless connections. When the wireless mesh networks are used as an infrastructure for Internet access, all network traffic from mobile nodes go through a gateway node which is directly connected to the wired network. Therefore, we need to distribute the entire traffic load by deploying multiple gateway nodes and each mesh node should select a gateway node to access the Internet according to its traffic load, processing power, and access link capacity. In this paper, we propose a routing method that distributes the traffic load on the gateway nodes. Through several simulations, we show that the proposed method can uniformly distribute the traf-fic load on gateway nodes, keeping the time complexity and suppressing an increase in the path length at most 15 % compared to the conventional shortest path routing.
AB - Wireless mesh networks have been attracting many users in recent years to achieve a wide-area wireless environment with flexible-configuration and low-cost properties by connecting base stations (mesh nodes) with each other via wireless connections. When the wireless mesh networks are used as an infrastructure for Internet access, all network traffic from mobile nodes go through a gateway node which is directly connected to the wired network. Therefore, we need to distribute the entire traffic load by deploying multiple gateway nodes and each mesh node should select a gateway node to access the Internet according to its traffic load, processing power, and access link capacity. In this paper, we propose a routing method that distributes the traffic load on the gateway nodes. Through several simulations, we show that the proposed method can uniformly distribute the traf-fic load on gateway nodes, keeping the time complexity and suppressing an increase in the path length at most 15 % compared to the conventional shortest path routing.
UR - http://www.scopus.com/inward/record.url?scp=67650697634&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=67650697634&partnerID=8YFLogxK
U2 - 10.1109/ICN.2009.21
DO - 10.1109/ICN.2009.21
M3 - Conference contribution
AN - SCOPUS:67650697634
SN - 9780769535524
T3 - Proceedings of the 8th International Conference on Networks, ICN 2009
SP - 127
EP - 132
BT - Proceedings of the 8th International Conference on Networks, ICN 2009
T2 - 8th International Conference on Networks, ICN 2009
Y2 - 1 March 2009 through 6 March 2009
ER -