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

doi:10.11959/j.issn.1000-436x.2017193

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

• 学术论文 • 下一篇

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

谢显中¹,卢华兵¹,施赵媛²

¹ 重庆邮电大学宽带接入网络研究所，重庆 400065
² 安庆师范大学安徽省智能感知与计算重点实验室，安徽安庆 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 XIE¹,Hua-bing LU¹,Zhao-yuan SHI²

¹ Institute of Broadband Access Network,Chongqing University of Posts and Telecommunications,Chongqing 400065,China
² 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)

摘要/Abstract

摘要：

针对干扰对齐的实际应用提出的机会干扰对齐算法（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

中图分类号:

TN929.5

谢显中,卢华兵,施赵媛. 基于轮询机制的公平高效机会干扰对齐算法[J]. 通信学报, 2017, 38(10): 1-9.

Xian-zhong XIE,Hua-bing LU,Zhao-yuan SHI. Fair and efficient opportunistic interference alignment algorithm based on round-robin scheduling[J]. Journal on Communications, 2017, 38(10): 1-9.

图/表 6

图1

图2

图3

图4

图5

图6

参考文献 18

[1]	CADAMBE V R , JAFAR S A . Interference alignment and degrees of freedom of the-user interference channel[J]. IEEE Transactions on Information Theory, 2008,54(8): 3425-3441.
[2]	MADDAH-ALI M A , MOTAHARI A S , KHANDANI A K . Communication over MIMO X channels:interference alignment,decomposition,and performance analysis[J]. IEEE Transactions on Information Theory, 2008,54(8): 3457-3470.
[3]	景振海, 白宝明, 马啸 . 频率选择性高斯干扰信道中的时频联合干扰对齐方案[J]. 通信学报, 2011,32(9): 161-166.
	JING Z H , BAI B M , MA X . Joint time-frequency interference alignment in the frequency-selective Gaussian interference channel[J]. Journal on Communications, 2011,32(9): 161-166.
[4]	朱世磊, 周游, 任修坤 ,等. 认知 MIMO 干扰网络的顽健干扰对齐算法[J]. 通信学报, 2016,37(3): 157-164.
	ZHU S L , ZHOU Y , REN X K ,et al. Robust interference alignment algorithm for cognitive MIMO interference network[J]. Journal on Communications, 2016,37(3): 157-164.
[5]	EL AYACH O , PETERS S W , HEATH R W . The practical challenges of interference alignment[J]. IEEE Wireless Communications, 2013,20(1): 35-42.
[6]	YU H . A review on interference alignment in multiuser interference channels[J]. Wireless Personal Communications, 2015,83(3): 1751-1764.
[7]	ZENG H , TIAN F , HOU Y T ,et al. Interference alignment for multihop wireless networks:challenges and research directions[J]. IEEE Network, 2016,30(2): 74-80.
[8]	LEE J H , CHOI W . Opportunistic interference aligned user selection in multiuser MIMO interference channels[C]// Global Telecommunications Conference (GLOBECOM 2010). 2010: 1-5.
[9]	LEE J H , CHOI W . Interference alignment by opportunistic user selection in 3-user MIMO interference channels[C]// 2011 IEEE International Conference on Communications (ICC). 2011: 1-5.
[10]	JUNG B C , SHIN W Y . Opportunistic interference alignment for interference-limited cellular TDD uplink[J]. IEEE Communications Letters, 2011,15(2): 148-150.
[11]	WANG L F , LI Q , LI S Q ,et al. A general algorithm for uplink opportunistic interference alignment in cellular network[C]// 2011 IEEE GLOBECOM Workshops. 2011: 436-440.
[12]	JUNG B C , PARK D , SHIN W Y . Opportunistic interference mitigation achieves optimal degrees-of-freedom in wireless multi-cell uplink networks[J]. IEEE Transactions on Communications, 2012,60(7): 1935-1944.
[13]	YANG H J , SHIN W Y , JUNG B C ,et al. Opportunistic interference alignment for MIMO interfering multiple-access channels[J]. IEEE Transactions on Wireless Communications, 2013,12(5): 2180-2192.
[14]	YANG H J , JUNG B C , SHIN W Y ,et al. Codebook-based opportunistic interference alignment[J]. IEEE Transactions on Signal Processing, 2014,62(11): 2922-2937.
[15]	YOON J , SHIN W Y , LEE H S . Energy-efficient opportunistic interference alignment[J]. IEEE Communications Letters, 2014,18(1): 30-33.
[16]	LIU G Q , SHENG M , WANG X J ,et al. Opportunistic interference alignment and cancellation for the uplink of cellular networks[J]. IEEE Communications Letters, 2015,19(4): 645-648.
[17]	JIN H , JEON S W , JUNG B C . Opportunistic interference alignment for random access networks[J]. IEEE Transactions on Vehicular Technology, 2015,64(12): 5947-5954.
[18]	REN Y , LV T J , GAO H ,et al. Wireless information and energy transfer in multi-cluster MIMO uplink networks through opportunistic interference alignment[J]. IEEE Access, 2016,4: 3100-3111.

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

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

在线阅读

PDF下载

可视化

摘要/Abstract

引用本文

使用本文

图/表 6

参考文献 18

相关文章 15

Metrics

推荐阅读 0

[1]	孙彦景, 程枫陟, 周家思, 李松. 公平性驱动的RSMA-SDMA预编码设计[J]. 通信学报, 2022, 43(4): 177-185.
[2]	叶迎晖,施丽琴,卢光跃. 反向散射辅助的无线供能通信网络中用户能效公平性研究[J]. 通信学报, 2020, 41(7): 84-94.
[3]	王竹,袁青云,郝凡凡,房梁,李凤华. 基于链路容量的多路径拥塞控制算法[J]. 通信学报, 2020, 41(5): 59-71.
[4]	谭国真,韩国栋,张福新,丁男,刘明剑. 基于网络效用最大化理论的分布式车联网拥塞控制策略[J]. 通信学报, 2019, 40(2): 82-91.
[5]	张恩,耿魁,金伟,李勇俊,孙韵清,李凤华. 抗隐蔽敌手的云外包秘密共享方案[J]. 通信学报, 2017, 38(5): 57-65.
[6]	苏成龙,金光,江先亮,钮俊. 公平和低时延的主动队列管理算法研究[J]. 通信学报, 2017, 38(5): 199-206.
[7]	朱更明,王志强,李哲涛,李仁发. 信道公平分配的局部拥塞控制算法[J]. 通信学报, 2015, 36(4): 9-18.
[8]	王志军,胡封晔,尹颖奇,刘小兰. 基于无线体域网的传输功率控制和调度算法[J]. 通信学报, 2015, 36(10): 271-277.
[9]	卢笛，马建峰，王一川，习宁，孟宪佳. 面向云计算环境的动态公平性度量方法[J]. 通信学报, 2014, 35(7): 17-150.
[10]	卢笛,马建峰,王一川,习宁,孟宪佳. 面向云计算环境的动态公平性度量方法[J]. 通信学报, 2014, 35(7): 140-150.
[11]	叶青,杨赟,郑世慧,常利伟,肖达,杨义先. 公平的多方并发签名方案[J]. 通信学报, 2014, 35(3): 140-149.
[12]	叶青1,2，杨赟3，郑世慧2，常利伟2，肖达2，杨义先2,4. 公平的多方并发签名方案[J]. 通信学报, 2014, 35(3): 16-149.
[13]	田有亮1,2，彭长根1，马建峰2，林辉2，杨凯3. 通用可组合公平安全多方计算协议[J]. 通信学报, 2014, 35(2): 8-62.
[14]	田有亮,彭长根,马建峰,林辉,杨凯. 通用可组合公平安全多方计算协议[J]. 通信学报, 2014, 35(2): 54-62.
[15]	庞辽军1,2，高璐2，裴庆祺2，王育民2. 基于身份公平的匿名多接收者签密方案[J]. 通信学报, 2013, 34(8): 21-168.