Interference-aware Fair Bandwidth Demand Allocation and Routing in Wireless Mesh Network

Abstract In this paper, we consider the problems of routing, end-to-end bandwidth demand allocation and throughput maximization for multi-channel multi-hop wireless mesh network. We assume the end-to-end bandwidth demands of multi-commodity (a set of source-destination pairs) are satisfied by a set of flows in the network. With that objective, we show that routing and end-to-end bandwidth allocation can be formulated under the interference and the well-known max-min fairness model constrains, where the throughput of commodities is to be improved. We propose two alternative algorithms to solve variants of this problem and we use the numerical results to show the fairness enhancement and throughput improvement after applying our algorithms. 1