Bandwidth Guaranteed Shortest Path Routing in Wireless Mesh Networks
Yuanyuan Zeng, Bo Xi, Ziming Zeng, Hao Wang · 2006
The bandwidth problem is one of the most serious problems for wireless mesh networks due to the influence of interference. In this paper, we present a distributed interference-aware bandwidth guaranteed shortest path routing protocol in IEEE 802.11-based multichannel wireless mesh networks with admission control. We design an interference-free distributed TDMA schedule to guarantee enough link flow. The simulation results show our protocol achieves good performance that it can effectively provide bandwidth guaranteed path for connection request comparing with minimal hop-count routing protocol.