中继网中基于QoS保证和比例公平的资源分配  

QoS-guaranteed and proportional fairness-based resource allocation in relay networks

作　　者：刘冰华[1] 李校林[1,2] 徐旭东[1] 

机构地区：[1]重庆邮电大学通信新技术应用研究中心,重庆400065 [2]重庆信科设计有限公司,重庆400065

出　　处：《光通信研究》2015年第3期66-70,共5页Study on Optical Communications

基　　金：重庆市自然科学基金资助项目(CSTC2012jjA40054)

摘　　要：中继系统下的众多资源分配策略很少同时考虑多用户情形下的子载波配对和不同用户需求。针对这一问题,提出了一种基于QoS(服务质量)保证和比例公平的多用户子载波配对和功率分配算法,该算法既能保证QoS用户的最小速率要求,又能满足BE(尽力而为)用户之间速率比例公平的准则。该算法首先根据不同用户需求分配第二跳的子载波,然后利用匈牙利配对算法得到两跳子载波的最佳配对,最后用类似注水算法进行功率分配。仿真结果表明,所提算法在满足用户QoS保证和比例公平准则的同时有效提升了系统的吞吐量。As few of resource allocation strategies for relay systems simultaneously consider both subcarrier pairing for multiple users and the requirements of different users, this paper proposes a multiuser subcarrier pairing and power allocation algorithm on the basis of QoS-guaranteed and proportional fairness, which guarantees both the minimum rate requirements of the QoS us- ers and satisfies the criterion of rate proportional fairness among the Best Effort （BE） users. It first allocates the subcarriers of the second hop according to the requirements of different users, then uses the Hungarian pairing algorithm to obtain the opti- mum pairing of the two-hop subcarriers and finally allocates power by using the similar water-filling algorithm. Simulation re- sults show that the proposed algorithm effectively improves the system throughput while meeting the user requirements for QoS guaranteeing and proportional fairness criterion.

关 键 词：中继 匈牙利算法 子载波配对 比例公平 

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