通信学报 ›› 2017, Vol. 38 ›› Issue (10): 1-9.doi: 10.11959/j.issn.1000-436x.2017193

• 学术论文 •    下一篇

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

谢显中1,卢华兵1,施赵媛2   

  1. 1 重庆邮电大学宽带接入网络研究所,重庆 400065
    2 安庆师范大学安徽省智能感知与计算重点实验室,安徽 安庆 246011
  • 修回日期:2017-03-22 出版日期:2017-10-01 发布日期:2017-11-16
  • 作者简介:谢显中(1966-),男,四川通江人,博士,重庆邮电大学教授、博士生导师,主要研究方向为干扰对齐、MIMO 传输、认知无线电等。|卢华兵(1987-),男,重庆人,重庆邮电大学博士生,主要研究方向为干扰对齐、绿色通信、5G等。|施赵媛(1987-),女,安徽安庆人,安庆师范大学讲师,主要研究方向为干扰对齐、联合传输、5G等。
  • 基金资助:
    国家自然科学基金资助项目(61271259);国家自然科学基金资助项目(61301123);国家自然科学基金资助项目(61471076);重庆市教委科学技术研究基金资助项目(KJ130536);长江学者和创新团队发展计划基金资助项目(IRT1299);重庆市科委重点实验室专项基金资助项目(CSTC);安徽省教育厅基金资助项目(AQKJ2015B008)

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

Xian-zhong XIE1,Hua-bing LU1,Zhao-yuan SHI2   

  1. 1 Institute of Broadband Access Network,Chongqing University of Posts and Telecommunications,Chongqing 400065,China
    2 Key Laboratory of Intelligent Perception and Computing of Anhui Province,Anqing Normal University,Anqing 246011,China
  • Revised:2017-03-22 Online:2017-10-01 Published:2017-11-16
  • Supported by:
    The National Natural Science Foundation of China(61271259);The National Natural Science Foundation of China(61301123);The National Natural Science Foundation of China(61471076);The Science and Technology Research Project of Chongqing Education Commission(KJ130536);The Changjiang Scholars and Innovative Research Team Plan(IRT1299);The Special Fund of Chongqing Key Laboratory(CSTC);The Project of Anhui Education Department(AQKJ2015B008)

摘要:

针对干扰对齐的实际应用提出的机会干扰对齐算法(OIA)存在通信资源分配不公平、所需用户基数大等问题。为此,提出一种基于轮询机制的公平高效机会干扰对齐算法。首先确定协作处理簇,并基于轮询机制在主小区中选择信道质量最优的通信用户,然后通过设计次基站的有用信号空间完全消除主小区用户对次基站的干扰,进一步在次小区中以干扰泄露最小化为原则选择通信用户,最后从理论上分析证明了公平性和最小传输块数等性能。仿真结果表明,与原始机会干扰对齐算法相比,所提算法在提升公平性的同时,有效降低干扰泄露和提升系统容量,并且可减少传输块数和实现用户通信接入快速响应。

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

Abstract:

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.

Key words: opportunistic interference alignment (OIA), round-robin scheduling, fairness, quick access, flexibility

中图分类号: 

[1] 王 晖,魏敦楷,沈 骏,蒋凤仙. 多泵浦反向激励的拉曼光纤放大器的实现[J]. 通信学报, 2006, 27(7): 18 -116 .
[2] 魏蛟龙,岑朝辉. 基于蚁群算法的区域覆盖卫星星座优化设计[J]. 通信学报, 2006, 27(8): 11 -66 .
[3] 王 剑,张 权,唐朝京. 针对经典消息的高效量子签名协议[J]. 通信学报, 2007, 28(1): 10 -68 .
[4] 刘海鹏,廖建新,朱晓民. PoC中发言权控制机制的分布式改进[J]. 通信学报, 2012, 33(4): 6 -46 .
[5] 郭 锐,胡方宁,刘济林. H-ARQ信道上高性能全分集LDPC码的构造与性能分析[J]. 通信学报, 2012, 33(4): 10 -76 .
[6] 张晓军,崔 建,马 皓,张 蓓. 10 Gbit网络访问控制网关的设计与实现[J]. 通信学报, 2014, 35(Z1): 1 -4 .
[7] 傅洪亮,酆广增. 基于天线阵列的一种预处理LCLSCM多用户检测算法[J]. 通信学报, 2005, 26(8): 11 -71 .
[8] 陈山枝,时 岩,胡 博. 移动性管理理论与技术的研究[J]. 通信学报, 2007, 28(10): 18 -133 .
[9] 韩来权1,2,汪晋宽1,王兴伟1,2. 基于可编程路由技术的MPLS单标签分流传输算法[J]. 通信学报, 2014, 35(5): 20 -159 .
[10] 张 斌,徐秋亮,蒋 瀚. 新的可抵抗自适应敌手的可组合茫然传输协议[J]. 通信学报, 2011, 32(11A): 29 -203 .