Routing in Multi-Radio Multi-Channel Multi-hop Wireless Mesh Networks with Bandwidth Guarantees
In this paper, the authors propose a new path metric for finding the maximum available bandwidth path in the multi-radio multi-channel wireless mesh networks. They formally prove that the path metric is isotonic, which is the necessary and sufficient condition for assuring the proper operation of the routing algorithm. Based on the metric, they develop a routing protocol which jointly considers the path selection and the channel assignment. The time complexity of their routing algorithm is polynomial. They conduct the simulation experiments to compare the proposed metric with the existing metrics for finding the maximum available bandwidth path.