Bandwidth Guaranteed Scheduling and Shortest Path Routing in Wireless Mesh Networks
Ziming Zeng, Liyi Zhang · 2007
The bandwidth problem is one of the most serious problems for multi-hop wireless mesh networks (WMNs) due to interference. We study joint problem of interference-aware bandwidth guaranteed scheduling and shortest path routing in IEEE 802.11-based multi-channel wireless mesh networks. We present distributed bandwidth guaranteed TDMA scheduling for given flow requests, and propose a shortest path routing based on k-shortest path with admission control. The results show our algorithm achieves good performance, and it effectively provides bandwidth guaranteed path for connection request.