Skip to Main Content
The optimization problem of maximizing the throughput of a regular multi-radio, multi-channel wireless mesh network is addressed in this paper. Given certain network topology and traffic demands, by jointly considering power control, channel assignment and scheduling, we study how to maximize the network throughput under fairness constraint. Based on graph theory, the problem is divided into several sub-problems, which can be formulated as linear programming. It is proved that the solutions of these sub-problems will lead to the global optimal solution to our problem. However, the computational complexity of the above algorithm is O(2n) as it needs to traverse all possible scenarios. Therefore, a suboptimal algorithm is proposed to achieve a complexity of O(n) at the cost of moderate performance degradation. Simulation results show that the suboptimal algorithm solves the problem much faster, while the performance degradation is less than 8%, in comparison with the optimal one.