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

Downlink hierarchical scheduling method for relay-enhanced cellular network based on TG-PF

作　　者：曲桦[1] 宋亚兰[1] 赵季红[2] 李熠伟 

机构地区：[1]西安交通大学电信学院,陕西西安710048 [2]南京邮电大学通信与信息工程学院,江苏南京210023

出　　处：《通信学报》2013年第12期113-119,共7页Journal on Communications

基　　金：国家自然科学基金资助项目(61071126)~~

摘　　要：设计了一种中继蜂窝网络的分层调度模型,将中继蜂窝小区的资源调度过程分为高层调度和低层调度两部分,分别由基站和中继站完成。所设计模型中,高层调度和低层调度分别采用PF算法和保障吞吐量的比例公平(TG-PF算法),该算法充分利用了最大载干比(Max C/I)算法和比例公平(PF)算法的优势,能够有效地提升小区边缘的吞吐量,以满足中继蜂窝小区的系统吞吐量和调度公平性要求。仿真结果表明,所提方法能够以较低的调度公平性牺牲换取小区边缘吞吐量的较大提升。Hierarchical scheduling model for relay-enhanced cellular network was designed to divide the whole 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 consideration, so that it can effectivelY improve cell edge throughput. In downlink hierarchical scheduling method for re- lay-enhanced cellular network based on TG-PF, PF algorithm and TG-PF algorithm are separately used in high-level and low-level scheduling process to satisfy the system throughput and scheduling fairness requirements of relay-enhanced cell. Simulation results suggest that the proposed method can tremendously improve cell edge throughput with a small size sacrifice in scheduling fairness.

关 键 词：中继蜂窝网络 分层调度 保障吞吐量的比例公平 边缘吞吐量 

分 类 号：TN929.5[电子电信—通信与信息系统]