TY - GEN
T1 - 2-step Graph Coloring Algorithm for Cluster-wise Distributed MU-MIMO in Ultra-dense RAN
AU - Ge, Chang
AU - Xia, Sijie
AU - Chen, Qiang
AU - Adachi, Fumiyuki
N1 - Funding Information:
A part of this work was conducted under "R&D for further advancement of the 5th generation mobile communication system" (JPJ000254) commissioned by Research and Development for Expansion of Radio Wave Resources of the Ministry of Internal Affairs and Communications in Japan.
Publisher Copyright:
© 2020 IEEE.
PY - 2020/10/19
Y1 - 2020/10/19
N2 - The ultra-dense radio access network with distributed MU-MIMO is considered as a promising approach to improve the coverage and the link capacity in 5G advanced systems. However, large-scale MU-MIMO requires prohibitively high computational complexity. Our previous work has proved that grouping neighborhood users/antennas into a number of clusters and performing cluster-wise MU-MIMO in parallel can alleviate the computational complexity problem, but the link capacity improvement is limited by the severe interference. In this paper, we propose a 2-step graph coloring algorithm that can eliminate both the inter-cell interferences and the inter-cluster interferences. The first step is to apply the graph coloring algorithm on the cell edge in order to reduce the inter-cell interferences. Once the color of the cell edge has been decided, the second step is to utilize the conditional graph coloring to the clusters within each BS cell. As a preliminary research, we focus on the second step and propose a Restricted Color Number (RCN) algorithm to mitigate the inter-cluster interferences. The computer simulation results show that our RCN algorithm can improve the link capacity compared with no coloring case.
AB - The ultra-dense radio access network with distributed MU-MIMO is considered as a promising approach to improve the coverage and the link capacity in 5G advanced systems. However, large-scale MU-MIMO requires prohibitively high computational complexity. Our previous work has proved that grouping neighborhood users/antennas into a number of clusters and performing cluster-wise MU-MIMO in parallel can alleviate the computational complexity problem, but the link capacity improvement is limited by the severe interference. In this paper, we propose a 2-step graph coloring algorithm that can eliminate both the inter-cell interferences and the inter-cluster interferences. The first step is to apply the graph coloring algorithm on the cell edge in order to reduce the inter-cell interferences. Once the color of the cell edge has been decided, the second step is to utilize the conditional graph coloring to the clusters within each BS cell. As a preliminary research, we focus on the second step and propose a Restricted Color Number (RCN) algorithm to mitigate the inter-cluster interferences. The computer simulation results show that our RCN algorithm can improve the link capacity compared with no coloring case.
KW - 2-Step graph coloring
KW - Delaunay triangulation
KW - Distributed antennas
KW - Interference coordination
KW - K-means algorithm
KW - Ultra-dense RAN
UR - http://www.scopus.com/inward/record.url?scp=85099568963&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85099568963&partnerID=8YFLogxK
U2 - 10.1109/WPMC50192.2020.9309477
DO - 10.1109/WPMC50192.2020.9309477
M3 - Conference contribution
AN - SCOPUS:85099568963
T3 - International Symposium on Wireless Personal Multimedia Communications, WPMC
BT - WPMC 2020 - 23rd International Symposium on Wireless Personal Multimedia Communications
PB - IEEE Computer Society
T2 - 23rd International Symposium on Wireless Personal Multimedia Communications, WPMC 2020
Y2 - 19 October 2020 through 26 October 2020
ER -