TY - GEN
T1 - Utility-based adaptive multi-frame iterative algorithm for resource scheduling in OFDMA networks
AU - Ding, Zongrui
AU - Ding, Guopeng
AU - Qi, Yingjie
AU - Xiao, Limin
AU - Wang, Jing
PY - 2008
Y1 - 2008
N2 - This paper focuses on the downlink resource scheduling with quality-of-service (QoS) provisioning in orthogonal frequency-division multiplexing (OFDM) networks. In homogeneous networks, the multi-user diversity gain is achievable through exploiting the independent fading among users. However, in heterogeneous networks, the different priorities and QoS constraints of heterogeneous services, especially delay sensitive services, bring to inferior system performance. To solve this problem, a utility-based adaptive multi-frame iterative (AMI) algorithm aware of both channel and queue state information is proposed. The AMI algorithm contains two parts: the core and the iterative shell. In the core, the problem of dynamic subcarrier assignment (DSA) is modeled as the weighted independent set (WIS) problem in graph theory. Through joint optimization among subcarriers, a higher spectral efficiency is achieved. In the iterative shell, intra-frame and inter-frame iterations exploit the time diversity, thus a lower packet loss is achieved.
AB - This paper focuses on the downlink resource scheduling with quality-of-service (QoS) provisioning in orthogonal frequency-division multiplexing (OFDM) networks. In homogeneous networks, the multi-user diversity gain is achievable through exploiting the independent fading among users. However, in heterogeneous networks, the different priorities and QoS constraints of heterogeneous services, especially delay sensitive services, bring to inferior system performance. To solve this problem, a utility-based adaptive multi-frame iterative (AMI) algorithm aware of both channel and queue state information is proposed. The AMI algorithm contains two parts: the core and the iterative shell. In the core, the problem of dynamic subcarrier assignment (DSA) is modeled as the weighted independent set (WIS) problem in graph theory. Through joint optimization among subcarriers, a higher spectral efficiency is achieved. In the iterative shell, intra-frame and inter-frame iterations exploit the time diversity, thus a lower packet loss is achieved.
KW - Cross-layer
KW - Graph theory
KW - Resource scheduling
KW - Weighted independent set (WIS)
UR - https://www.scopus.com/pages/publications/67650230328
U2 - 10.1109/ICTEL.2008.4652646
DO - 10.1109/ICTEL.2008.4652646
M3 - 会议稿件
AN - SCOPUS:67650230328
SN - 9781424420360
T3 - 2008 International Conference on Telecommunications, ICT
BT - 2008 International Conference on Telecommunications, ICT
T2 - 2008 International Conference on Telecommunications, ICT
Y2 - 16 June 2008 through 19 June 2008
ER -