.png){kind=icon}
返回
Queue-Aware Opportunistic Interference Alignment in Downlink MU-MIMO Cellular Systems
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2018.2869693.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Recently, attention has been paid to the integration of opportunistic communications, whether based on opportunistic user selection (OUS) or opportunistic antenna selection, with interference alignment (IA) in order to improve the performance of wireless networks. In OUS, users that have the best operational conditions are usually selected. However, fairness among users is another important aspect that should be considered in scheduling users. In this paper, a queue-aware two-stage opportunistic IA (OIA) algorithm is proposed for the downlink multicell multiuser multiple-input-multiple-output system. In the first stage, inter-cell interference is eliminated using one pair of precoding/postcoding matrices. Whereas in the second stage, two user selection polices are proposed namely, capacity-based selection (CBS) and queue-based scheduling (QBS), to select a group of users and minimize the inter-user interference among them using another pair of precoding/postcoding matrices. In the QBS-OIA case, a joint scheduling, resource allocation, and IA optimization problems are formulated, and a low complexity heuristic is proposed to solve it. Comparisons are conducted with other OIA algorithms in terms of achieved sum rate, achieved degrees-of-freedom (DoFs), number of served users, queue overflow probability, and computational complexity. Simulations show that the two proposed CBS-OIA and QBS-OIA algorithms outperform other schemes in terms of sum rate and DoFs. Moreover, the proposed QBS-OIA is capable of serving more users, in some cases, and achieves lower overflow probability with much reduced complexity on the expense of achieving a bit lower sum rate than the CBS-OIA in some cases.
Keyword:
Degrees of freedom
opportunistic interference alignment
opportunistic user selection
queue-aware scheduling
rank constrained rank minimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容