An Efficient Scheme for Solving Bandwidth Guaranteed Scheduling and Shortest path Routing Problem in Wireless Mesh Networks
Ziming Zeng, Yuanyuan Zeng · 2007
Summary The bandwidth problem is one of the most serious problems for multi-hop wireless mesh networks (WMNs) due to the influence of link interference. In this paper, we study joint problem of interference-aware bandwidth guaranteed scheduling and shortest path routing in IEEE 802.11-based multi-channel wireless mesh networks with dynamic traffic. We present distributed bandwidth guaranteed TDMA scheduling for given flow requests. And we propose a bandwidth guaranteed shortest path routing algorithm based on k-shortest path approach with admission control. The simulation results show our algorithm achieves good performance, and it can effectively provide bandwidth guaranteed path for connection request comparing with minimal hop-count routing algorithm.