A Novel Cross-layer Resource Allocation Algorithm for Heterogeneous Services in OFDMA Systems

摘要

A new cross-layer urgent bit first (CLUBF) scheduling mechanism is proposed and analyzed in the paper. The proposed algorithm focuses on cross-layer resource allocation scheme for heterogeneous services in Orthogonal Frequency Division Multiplexing Access (OFDMA) downlink systems. And the CLUBF scheduling mechanism is operated over four steps: (1) traffic mapping: dividing traffic into UB (urgent bit) part, which represents the quality of service (QoS) and has service differentiation, and non-UB part, which means that no QoS is required and doesn't have service differentiation. (2) Resource allocation procedures for traffics' UB part and non-UB part, which aims to satisfy traffic QoS, maximize the system throughput and keep fairness among users. (3) Power and bit adjustment jointly to improve further performance. Besides, as fully indicated by simulation results, the proposed algorithm can improve system throughput and can reduce the compute complexity, which means that the proposed algorithm is a better choice for downlink scheduling.