一种适用于CoMP的改进MaxC/I算法  

An Improved Max C / I Algorithm for Co MP

作　　者：杨程轶[1] 周文安[1] 任晓涛[1] 张屹宇[1] 

机构地区：[1]北京邮电大学计算机学院,北京100876

出　　处：《无线电通信技术》2015年第1期8-12,共5页Radio Communications Technology

基　　金：国家"863"项目(2014AA01A701);华为创新研究项目(YJCB2011060WL)

摘　　要：Max C/I算法是LTE中一种常见的资源调度算法,致力于实现吞吐量的最大化。在非Co MP场景下将总吞吐量最大化的目标分解到各小区,使每个小区吞吐量最大,用此解法求得的解是全局最优解。但如果将这种解法直接引入到LTE-A的Co MP场景下使用时,协作小区间的调度结果可能会相互影响,最终得到的解是贪婪解,而且该贪婪解不太理想,不能发挥出Max C/I算法的性能。针对此问题,将原解法的子问题决策进行改进,对是否调度Co MP用户增加了条件判断,并在Full Buffer业务模型和FTP业务模型下进行仿真验证,结果表明该改进方案能在一定程度上提高系统吞吐量。Max C / I algorithm is a kind of typical resource scheduling algorithm in LTE system and it aims to maximize the throughput. In non-CoMP systems,the global optimal solution can be found by dividing the object into different cells and maximizing the throughput of each cell. But when the CoMP technology is directly used in LTE-A system without any modification,the scheduling results of different cells would have an influence on each other and a greedy solution with bad performance would be got. For this problem,the decision of the sub problem is modified,and the condition to judge CoMP users is added. Then,the simulation verification in Full Buffer model and FTP model is conducted,and the result shows that the modified scheme can enhance the throughput of system to some extent.

关 键 词：MAX C/I算法 无线资源调度 COMP LTE-A 贪婪算法 

分 类 号：TN92[电子电信—通信与信息系统]