Skip to Main Content
Link Scheduling plays an important role for the performance of TDMA based wireless mesh networks. Traditional algorithms merely aim at maximizing the overall network throughput, which may introduce the scheduling delay. Theoretically the model of relationship between link scheduling with the network throughput and end to end scheduling delay is analyzed. Then, a heuristic algorithm to solve the near optimal scheduling period and scheduling delay for link list with fixed schedule order is proposed. Furthermore, as the performance is much more effected by the scheduling sequence, the link scheduling scheme to sort the overall network link list based on NSGA-II is proposed. By choosing the optimal scheduling sequence, the ratio of the slot spatial reuse is enhanced, thus to increase the network throughput with the overall network scheduling delay is minimized. Simulation results are presented to verify these approaches.