A centralized scheduling algorithm for WiMAX mesh network

This paper handles the issues related to centralized scheduling in multi-channel WiMAX mesh network. We have used the clique partitioning approach for scheduling. The scheduling algorithm optimizes the length of the scheduling cycle, as well as the buffer size requirement of each node. If sufficient number of channels is present to avoid secondary interference in the network, the static channel assignment strategy is followed whereby each link is assigned a channel that remains fixed throughout the scheduling. If not, channels will be allocated dynamically, i.e., channels for links may change during scheduling. The simulation result shows that our scheduling algorithm minimizes the length of the schedule as well as requires unit buffer in case sufficient number of channels is available.