A preemption-based scheduling algorithm for WiMAX networks

Several scheduling techniques were designed for the base station BS of IEEE 802.16e wireless interoperability of microwave access networks. However, depending on the BS scheduler alone to determine the servicing order of each connection might affect the accuracy of the scheduling process because the BS does not necessarily have enough up-to-date information about the current state of the connections at the subscriber station. In this paper, we propose a preemption-based scheduling algorithm that focuses on improving the quality of service requirements of real-time service flow classes. The proposed algorithm incorporates two schedulers, one at the BS and another one at the subscriber station. We have implemented and integrated the proposed algorithm with the network simulator NS2 using the Network and Distributed Systems Laboratory wireless interoperability of microwave access module. Simulation results have shown that the proposed approach outperforms other scheduling algorithms in terms of enhancing the throughput and the average delay of real-time quality of service classes. Copyright © 2013 John Wiley & Sons, Ltd.

[1]  Timo Hämäläinen,et al.  Scheduling solution for the IEEE 802.16 base station , 2008, Comput. Networks.

[2]  David W. Petr,et al.  Quality of service scheduling in cable and broadband wireless access systems , 2002, IEEE 2002 Tenth IEEE International Workshop on Quality of Service (Cat. No.02EX564).

[3]  Raj Jain,et al.  A Deficit Round Robin with Fragmentation scheduler for IEEE 802.16e Mobile WiMAX , 2009, 2009 IEEE Sarnoff Symposium.

[4]  Defne Aktas,et al.  A Low-Complexity Transmission and Scheduling Scheme for WiMAX Systems with Base Station Cooperation , 2010, EURASIP J. Wirel. Commun. Netw..

[5]  Saadan Zokaei,et al.  Introducing an Adaptive Method to Tune Initial Backoff Window (-ATM) in IEEE 802.11 Wireless Networks , 2010, EURASIP J. Wirel. Commun. Netw..

[6]  Izhak Rubin,et al.  Message Delays for TDMA Scheme Under a Nonpreemptive Priority Discipline , 1984, IEEE Trans. Commun..

[7]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[8]  Luciano Lenzini,et al.  Performance Evaluation of the IEEE 802.16 MAC for QoS Support , 2007, IEEE Transactions on Mobile Computing.

[9]  Abhay Parekh,et al.  Optimal multiplexing on a single link: delay and buffer requirements , 1997, IEEE Trans. Inf. Theory.

[10]  Antonio Capone,et al.  Performance evaluation of utility-based scheduling schemes with QoS guarantees in IEEE 802.16-WiMAX systems , 2010, CMC 2010.

[11]  E. L. Hahne,et al.  Round robin scheduling for fair flow control in data communication networks , 1986, ICC.

[12]  Jianfeng Chen,et al.  A service flow management strategy for IEEE 802.16 broadband wireless access systems in TDD mode , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[13]  Jenhui Chen,et al.  The design and implementation of WiMAX module for ns-2 simulator , 2006 .

[14]  Hassan Artail,et al.  New Scheduling Architecture for IEEE 802.16 Wireless Metropolitan Area Network , 2007, 2007 IEEE/ACS International Conference on Computer Systems and Applications.

[15]  Samar Khayat,et al.  A distributed scheduling algorithm for mobile WiMAX networks , 2011, 2011 International Conference on Selected Topics in Mobile and Wireless Networking (iCOST).

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

[17]  Todd R. Andel,et al.  On the credibility of manet simulations , 2006, Computer.

[18]  Hossam S. Hassanein,et al.  A performance study of uplink scheduling algorithms in point-to-multipoint WiMAX networks , 2009, Comput. Commun..