TY - GEN
T1 - Cross layer scheduling algorithm for IEEE 802.16 broadband wireless networks
AU - Ali, Najah Abu
AU - Hayajneh, Mohammad
AU - Hassanein, Hossam
PY - 2008
Y1 - 2008
N2 - In order to support different types of user applications, the IEEE 802.16 standard defines different service classes together with their associated Quality of Service (QoS) parameters. However, the standard lacks a MAC scheduling architecture that guarantees these defined QoS requirements. The importance of efficient scheduling is crucial to QoS provisioning for multimedia flows. In this paper we propose an opportunistic and optimized downlink scheduler that pledges fairness among admitted connections. Our approach involves separating the scheduling problem into two sub-problems. In the first problem, the proposed scheduler calculates the number of time-slots in each time frame corresponding to the service classes with the objective minimizing the blocking probability of each class. In the second problem, time-slots for each class connection are allocated using an integrated cross-layer priority functions that guarantee proportional fairness. The simulation results reveal that the proposed scheduler realizes our objectives, and provides efficient QoS scheduling without starving the connections of the best effort class.
AB - In order to support different types of user applications, the IEEE 802.16 standard defines different service classes together with their associated Quality of Service (QoS) parameters. However, the standard lacks a MAC scheduling architecture that guarantees these defined QoS requirements. The importance of efficient scheduling is crucial to QoS provisioning for multimedia flows. In this paper we propose an opportunistic and optimized downlink scheduler that pledges fairness among admitted connections. Our approach involves separating the scheduling problem into two sub-problems. In the first problem, the proposed scheduler calculates the number of time-slots in each time frame corresponding to the service classes with the objective minimizing the blocking probability of each class. In the second problem, time-slots for each class connection are allocated using an integrated cross-layer priority functions that guarantee proportional fairness. The simulation results reveal that the proposed scheduler realizes our objectives, and provides efficient QoS scheduling without starving the connections of the best effort class.
UR - http://www.scopus.com/inward/record.url?scp=51249100166&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51249100166&partnerID=8YFLogxK
U2 - 10.1109/ICC.2008.724
DO - 10.1109/ICC.2008.724
M3 - Conference contribution
AN - SCOPUS:51249100166
SN - 9781424420742
T3 - IEEE International Conference on Communications
SP - 3858
EP - 3862
BT - ICC 2008 - IEEE International Conference on Communications, Proceedings
T2 - IEEE International Conference on Communications, ICC 2008
Y2 - 19 May 2008 through 23 May 2008
ER -