Re-match: A Two-Stage Dynamic Scheduling Algorithm on Wireless Mesh Network

In highly dynamic wireless mesh networks, channel quality variations will affect network performance seriously. Channel assignment and scheduling algorithms have been applied in wireless mesh networks (WMN), so as to maximize network resource utilization. However, existing seminar works are mainly focusing on given set of channel quality values, which have not considered the channel quality variations in time scale. With highly dynamic channel quality, scheduling algorithm might possibly executed time to time, which will eventually deteriorate network performance. In this paper, we propose a stochastic programming model in order to reduce highly dynamic scheduling overhead and improve network utilization in heterogeneous wireless mesh networks. Since it has been proved that, achieving the optimal result is NP-hard. A heuristic solution with two-stage maximum rematching algorithm is proposed, and simulation results show that, our two-stage dynamic scheduling algorithm is efficient as channels in network are highly dynamic on communication quality.