A flexible resource allocation and scheduling framework for non-real-time polling service in IEEE 802.16 networks

Abstract

Abstract-This paper proposes an efficient yet simple design framework for achieving flexible resource allocation and packet scheduling for non-real-time polling service (nrtPS) traffic in IEEE 802.16 networks. By jointly considering the selective Automatic Repeat reQuest mechanism at the media access control layer as well as the adaptive modulation and coding technique at the physical layer, the proposed framework enables a graceful tradeoff between resource utilization and packet delivery delay while maintaining the minimum throughput requirements of nrtPS applications. An analytical model is developed for parameter manipulation in the proposed framework, where some important performance metrics, such as inter-service time, delivery delay, goodput, and resource utilization, are investigated for performance evaluation. Simulation results are given to demonstrate the efficiency of the proposed framework and verify the accuracy of the analytical model. Index Terms-Non-real-time polling service (nrtPS), scheduling, automatic repeat request, IEEE 802.16, adaptive modulation and coding.

Goodput Analysis of a Modified Cumulative ARQ

“…The general scheduling scheme proposed in [5] is considered in the mechaism, which is briefly described as follows. It is characterized by two parameters: h and L , where h is the number of SSs selected at each MAC frame, while L is the number of PDUs granted to an SS when it is served.…”

Resource allocation for downlink OFDMA in WiMAX systems

“…We utilize a combination of the approaches in [4,5] to develop the nature of the problem also we are trying to reduce complexity while preserving performance of the system. Following are the steps of proposed algorithm.…”

Performance analysis of the cumulative ARQ in IEEE 802.16 networks

“…The general scheduling scheme proposed in [19] is considered in the paper, which is briefly described as follows. It is characterized by two parameters: h and L, where h is the number of SSs selected at each MAC frame, while L is the number of PDUs granted to an SS when it is served.…”

“…In the Appendix, we discuss the service probability and inter-service time for SSs given that the general scheduling scheme proposed in [19] is adopted.…”