Bi-frame scheduling algorithm for IEEE802.16 wireless networks

This paper proposes a new scheduling algorithm for IEEE 802.16-2005 Broadband Wireless Metropolitan Area Networks in TDD mode. The proposed algorithm focuses on solving the problem of handling high priority traffic in congested networks while minimizing starvation conditions for other served classes. In this work, a detailed simulation study is carried out for the proposed scheduling algorithm as well as comparing its performance with some known algorithms such as Proportional Fairness (PF), Round Robin (RR), and Strict-Priority. Analyses and evaluation of the performance of the scheduler to support the different QoS classes is given as well. The simulation is carried out via the Opnet modeler simulator. The results show the proposed algorithm is capable to handle different users´ requirements under congestion conditions.