.png){kind=icon}
返回
Reduced-Complexity User Scheduling Algorithms for Coordinated Heterogeneous MIMO Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2015.2477309.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, the downlink of a clustered coordinated multicell multiuser multiple-input multiple-output (MIMO) system is considered, and various low-complexity user scheduling algorithms to maximize the sum rate are proposed. The users' data signals are transmitted cooperatively via the base stations (BSs) of a cluster within the sectorized multicell heterogeneous cellular network. Exhaustive search as the optimal scheduling method is extremely complex, particularly for large numbers of users requesting service. We therefore propose suboptimal scheduling algorithms based on the lower complexity metaheuristic stochastic optimization techniques of simulated annealing (SA) and particle swarm (PS). Moreover, a hybrid algorithm combining the traits of PS and a greedy scheduler is also proposed. The performance and complexity of these algorithms are evaluated for a heterogeneous system model employing different precoding methods. Assessing the algorithms' performance via computer simulations, the effectiveness of the proposed schemes in terms of sum rate is demonstrated, yielding performance very close to that of the exhaustive search at much lower complexity. For each precoding method used in the employed system model, the best corresponding approach to scheduling from our proposed algorithms is determined.
Keyword:
Clustered coordinated multipoint (CoMP) transmission
heterogeneous cellular networks
network multiple-input multiple-output (MIMO) downlink
particle swarm (PS)
precoding
simulated annealing (SA)
reduced-complexity user scheduling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.1
论文数:
1.8W
被引数:
6.6W
机构
引用论文
Exploring Residents’ Communication Learning Process in the Workplace: A Five-Phase Model.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏分享收藏
分享收藏
查看更多内容