Joint Scheduling and Channel Allocation in Wireless Mesh Networks

In wireless mesh network, efficient channel allocation and link scheduling is essential for throughput improvement. We investigate the problem of how to schedule a maximal set of feasible transmission under physical interference model by using the Spatial TDMA access scheme and channel allocation which relieves the interference effect between nearby transmissions. We also consider the fairness enhancement to prevent some border nodes of the network from starvation. By using Minimum Spanning Tree as network subgraph constructed from original network graph, we propose centralized algorithms for scheduling and channel allocation to maximize the aggregate throughput and to provide the fairness of the network. We also evaluate our algorithms through extensive simulations and the results show that our algorithms can achieve good performance.