Achieving MAC layer fairness in wireless packet networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Smooth is better than sharp: a random mobility model for simulation of wireless networks
MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Proceedings of the 11th annual international conference on Mobile computing and networking
Impact of interference on multi-hop wireless network performance
Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
Efficient load-balancing routing for wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multi-gateway association in wireless mesh networks
Ad Hoc Networks
Proposal and evaluation of multiple gateways distribution method for wireless mesh network
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
| Hi-index | 0.00 |
As Wireless Mesh Networks (WMNs) are typically used for Internet access, most traffic is routed through the gateways which connect WMN to the wired network. As a result, the gateways tend to get congested and balancing of the traffic load of gateways is critical. In this paper, we consider applications that require continuous provision of a certain bandwidth to a server located at the wired network. If a path that satisfies the bandwidth request cannot be found, the request will be rejected, so that load imbalance will result underutilization of the network capacity. We present a novel load balancing routing algorithm for maximizing the network utilization (i.e., accommodating service requests as many as possible) for multi-gateway WMNs. In the proposed scheme, a WMN is divided into domains. Each domain is served by one gateway, so that all traffic of a domain is served by the corresponding gateway. Our scheme determines routing to balance the traffic load among domains, and then performs load balancing routing within each domain. Simulation results show that in square grid topologies, our intra-domain routing achieves near optimal performance with about 70% less overhead than the existing schemes. Our inter-domain load balancing scheme outperforms the existing heuristics by up to 25% while achieving about 80% performance of the optimal solution.