Performance Evaluation of Scheduling Algorithm for Wimax Networks

 Abstract—This paper proposes a new scheduling algorithm for IEEE802.16 Broadband wireless Metropolitan Area Networks in TDD mode. The proposed algorithm focuses on an efficient mechanism to serve high priority traffic in congested networks. A detailed simulation study is carried out for the proposed scheduling algorithm and its performance has been compared with some known algorithms such as Proportional Fairness (PF), Adaptive Proportional Fairness (APF) and Round Robin (RR). For performance evaluation and comparison with existing algorithms, we used OPNET 14.5 modeler simulator. The results show that the proposed algorithm is capable of dealing with different users' requirements under congestion conditions.

[1]  George Varghese,et al.  Efficient fair queueing using deficit round-robin , 1996, TNET.

[2]  Roger Marks.  Working Group on Broadband Wireless Access , 2001 .

[3]  Loutfi Nuaymi,et al.  Wimax Technology for Broadband Wireless Access , 2007 .

[4]  Cédric Gueguen,et al.  Weighted fair opportunistic scheduling for multimedia QoS support in multiuser OFDM wireless networks , 2008, 2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications.

[5]  Meng Xiaojing.  An efficient scheduling for diverse QoS requirements in WiMAX , 2007 .

[6]  Ashraf H. Badawi,et al.  Two-step scheduling algorithm for IEEE802.16 wireless networks , 2010, 2010 IEEE 12th International Conference on Communication Technology.

[7]  Loutfi Nuaymi,et al.  Comparison of WiMAX scheduling algorithms and proposals for the rtPS QoS class , 2008, 2008 14th European Wireless Conference.

[8]  Raj Jain,et al.  Scheduling in IEEE 802.16e mobile WiMAX networks: key issues and a survey , 2009, IEEE Journal on Selected Areas in Communications.

[9]  George Varghese,et al.  Efficient fair queueing using deficit round robin , 1995, SIGCOMM '95.