A Low-Complexity QoS-Aware Proportional Fair Multicarrier Scheduling Algorithm for OFDM Systems

A Low-Complexity QoS-Aware Proportional Fair Multicarrier Scheduling Algorithm for OFDM Systems
复制标题

DOI:
10.1109/tvt.2008.2009874
复制
发表时间:
2009-06
影响因子:
6.8
通讯作者:
Z. Kong;Yu-Kwong Kwok;Jiangzhou Wang
Z. Kong;Yu-Kwong Kwok;Jiangzhou Wang
中科院分区:
计算机科学2区
文献类型:
--
作者:
Z. Kong;Yu-Kwong Kwok;Jiangzhou Wang

文献摘要

被引文献

相似文献

正交频分复用(OFDM)系统是支持无处不在的高速移动的应用的主要蜂窝平台。然而,一些研究挑战仍有待解决。最重要的挑战之一是设计一个明智的数据包调度器,将有效地利用频谱带宽。由于OFDM系统的多载波特性,通常针对单载波系统设计的传统无线分组调度算法的适用性和性能在很大程度上是未知的。在th.is的论文中,我们提出了一种新的服务质量(QoS)感知的比例公平(QPF)分组调度策略,用于多用户OFDM系统的下行链路,以在用户之间分配无线资源。我们提出的算法基于跨层设计,其中调度器知道信道(即,物理层)和队列状态(即,数据链路层)信息,以实现比例公平性,同时最大化每个用户的分组级QoS性能。仿真结果表明,所提出的QPF算法在平均系统吞吐量、丢包率和分组延迟方面都是有效的,同时在用户间保持了足够的公平性,调度开销相对较低。
Orthogonal frequency-division multiplexing (OFDM) systems are the major cellular platforms for supporting ubiquitous high-speed mobile applications. However, a number of research challenges remain to be tackled. One of the most important challenges is the design of a judicious packet scheduler that will make efficient use of the spectrum bandwidth. Due to the multicarrier nature of the OFDM systems, the applicability and performance of traditional wireless packet-scheduling algorithms, which are usually designed for single-carrier systems, are largely unknown. In th.is paper, we propose a new quality-of-service (QoS)-aware proportional fairness (QPF) packet-scheduling policy with low complexity for the downlink of multiuser OFDM systems to allocate radio resources among users. Our proposed algorithm is based on a cross-layer design in that the scheduler is aware of both the channel (i.e., physical layer) and the queue state (i.e., data link layer) information to achieve proportional fairness while maximizing each user's packet-level QoS performance. The simulation results show that the proposed QPF algorithm is efficient in terms of average system throughput, packet-dropping probability, and packet delay, while maintaining adequate fairness among users with relatively low scheduling overhead.