基于轮询机制的公平高效机会干扰对齐算法  

Fair and efficient opportunistic interference alignment algorithm based on round-robin scheduling

作　　者：谢显中[1] 卢华兵[1] 施赵媛 

机构地区：[1]重庆邮电大学宽带接入网络研究所,重庆400065 [2]安庆师范大学安徽省智能感知与计算重点实验室,安徽安庆246011

出　　处：《通信学报》2017年第10期1-9,共9页Journal on Communications

基　　金：国家自然科学基金资助项目(No.61271259;No.61301123;No.61471076);重庆市教委科学技术研究基金资助项目(No.KJ130536);长江学者和创新团队发展计划基金资助项目(No.IRT1299);重庆市科委重点实验室专项基金资助项目(CSTC);安徽省教育厅基金资助项目(No.AQKJ2015B008)~~

摘　　要：针对干扰对齐的实际应用提出的机会干扰对齐算法(OIA)存在通信资源分配不公平、所需用户基数大等问题。为此,提出一种基于轮询机制的公平高效机会干扰对齐算法。首先确定协作处理簇,并基于轮询机制在主小区中选择信道质量最优的通信用户,然后通过设计次基站的有用信号空间完全消除主小区用户对次基站的干扰,进一步在次小区中以干扰泄露最小化为原则选择通信用户,最后从理论上分析证明了公平性和最小传输块数等性能。仿真结果表明,与原始机会干扰对齐算法相比,所提算法在提升公平性的同时,有效降低干扰泄露和提升系统容量,并且可减少传输块数和实现用户通信接入快速响应。Opportunistic interference alignment（OIA） algorithm was proposed for the practical implementation of interference alignment（IA）. A fair and efficient OIA algorithm was presented for the unfairness in resource allocation and high dependence of tremendous users in the existing OIA algorithms. Firstly, the users with the best channel was selected in the primary cell based on round-robin scheduling after the coordinate cluster was determined. Then, the interference from the primary users was eliminated by skillfully designing the useful signal spaces in the subordinate cells. Furthermore, the users with the minimum interference leakage was selected in the subordinate cells. Finally, the fairness performance was theoretically analyzed. Simulation results show that both the sum-rate and fairness of the proposed algorithm are significantly higher than that of the conventional algorithm with less interference leakage. Besides, the users can achieve a quick access.

关 键 词：机会干扰对齐 轮询机制 公平性 快速接入 灵活性 

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