计算机应用研究2011，Vol.28Issue(4)：1502-1504,1508,4.DOI:10.3969/j.issn.1001-3695.2011.04.083
中继网络一种改进的QAPF调度算法研究
Improved QAPF scheduling algorithm in relay networks
摘要
Abstract
In order to solve the conflict between throughput and fairness for QAPF scheduling algorithm, this paper proposed a modified QAPF scheduling rules which called relative queue aware proportional fairness scheduling (RQAPF). The RQAPF could reduce the impact of the queue status information by setting the queue threshold, and ensured the fairness of the user.However, compared with QAPF scheduling algorithm,the RQAPF reduced the throughput. To overcome this shortcoming, this paper further proposed RQAPF algorithm based on subcarrier pair method(SubPairRQAPF). Simulation results show that the algorithm can meet the requirements of fairness and can improve the spectrum efficiency at the same time.关键词
中继系统/资源调度/正交频分多址/队列状态信息Key words
relay system/ radio resource scheduling/ OFDMA/ queue state information分类
信息技术与安全科学引用本文复制引用
陈波,杜长平,唐伦..中继网络一种改进的QAPF调度算法研究[J].计算机应用研究,2011,28(4):1502-1504,1508,4.基金项目
重庆市自然科学基金重点资助项目(CSTC2009BA2090) （CSTC2009BA2090）
