基于TG-PF的LTE-A中继蜂窝网络下行分层调度方法Downlink.PDF

第34 卷第12 期 通 信 学 报 Vol.34 No. 12 2013 年12 月 Journa l on Communications December 2013 doi:10.3969/j .issn.1000-436x.2013.12.013 基于TG-PF 的LTE-A 中继蜂窝网络下行分层调度方法 1 1 2 1 曲桦 ，宋亚兰 ，赵季红 ，李熠伟 (1. 西安交通大学电信学院，陕西西安 710048；2. 南京邮电大学通信与信息工程学院，江苏南京 210023) 摘 要：设计了一种中继蜂窝网络的分层调度模型，将中继蜂窝小区的资源调度过程分为高层调度和低层调度两 部分，分别由基站和中继站完成。所设计模型中，高层调度和低层调度分别采用PF 算法和保障吞吐量的比例公 平（TG-PF 算法），该算法充分利用了最大载干比（Max C/I ）算法和比例公平（PF ）算法的优势，能够有效地提 升小区边缘的吞吐量，以满足中继蜂窝小区的系统吞吐量和调度公平性要求。仿真结果表明，所提方法能够以较 低的调度公平性牺牲换取小区边缘吞吐量的较大提升。 关键词：中继蜂窝网络；分层调度；保障吞吐量的比例公平；边缘吞吐量 中图分类号：TN929.5 文献标识码：B 文章编号：1000-436X(2013)12-0 113-07 Downlink hierarchical scheduling method for relay-enhanced cellular network based on TG-PF 1 1 2 1 QU Hua , SONG Ya-lan , ZHAO Ji-hong , LI Yi-wei (1. Electronic and Information Engineering Institute, Xi’an Jiaotong University, Xi’an 710048, China; 2. Communication and Information Engineering Institute, Nanjing University of Posts and Telecommunications, Nanjing 210023, China) Abstract: Hierarchical scheduling model for relay-enhanced cellular network was designed to divide the w e process of resource scheduling in relay-enhanced cell into two parts, which are high-level scheduling accomplished by eNode B and low-level scheduling accomplished by Relay Node. Based on this, a throughput guaranteed proportional fair (TG-PF) scheduling algorithm was also proposed. The algorithm fully takes the advantages of Max C/I algorithm and PF algorithm