Graph Based User Clustering for HAP Massive MIMO Systems With Two-stage Beamforming

We propose a user clustering algorithm based on graph theory with two-stage beamforming for high-altitude platform (HAP) massive multiple-input multiple-output (MIMO) systems. First, we construct a conflict graph, where each vertex is the user and each edge is measured by the similarity of correlation matrix distance (CMD) between users. Then, in the aim of alleviating the self-cluster interference (SCI), a novel low-complexiy user clustering method is introduced, where the algorithm is Bron-Kerbosch to enumerate all the maximal cliques, and maximal clusters are obtained by the cluster formation algorithm. As shown in the numerical results, the performance of the proposed algorithm has a significant increase.

[1]  Giuseppe Caire,et al.  Joint Spatial Division and Multiplexing: Opportunistic Beamforming, User Grouping and Simplified Downlink Scheduling , 2014, IEEE Journal of Selected Topics in Signal Processing.

[2]  Giuseppe Caire,et al.  Special issue on Massive MIMO , 2013, Journal of Communications and Networks.

[3]  Shi Jin,et al.  Statistical 3-D Beamforming for Large-Scale MIMO Downlink Systems Over Rician Fading Channels , 2016, IEEE Transactions on Communications.

[4]  H. Ozcelik,et al.  Correlation matrix distance, a meaningful measure for evaluation of non-stationary MIMO channels , 2005, 2005 IEEE 61st Vehicular Technology Conference.

[5]  Abbas Mohammed,et al.  The Role of High-Altitude Platforms (HAPs) in the Global Wireless Connectivity , 2011, Proceedings of the IEEE.

[6]  Guosen Yue,et al.  User Grouping for Massive MIMO in FDD Systems: New Design Methods and Analysis , 2014, IEEE Access.

[7]  Xiaochen Xia,et al.  Three-Dimension Massive MIMO for Air-to-Ground Transmission: Location-Assisted Precoding and Impact of AoD Uncertainty , 2017, IEEE Access.

[8]  Michail Matthaiou,et al.  Statistical Eigenmode Transmission for the MU-MIMO Downlink in Rician Fading , 2015, IEEE Transactions on Wireless Communications.

[9]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[10]  Junyoung Nam,et al.  User Grouping of Two-Stage MU-MIMO Precoding for Clustered User Geometry , 2015, IEEE Communications Letters.

[11]  David Eppstein,et al.  Listing All Maximal Cliques in Large Sparse Real-World Graphs , 2011, JEAL.

[12]  Erik G. Larsson,et al.  Scaling Up MIMO: Opportunities and Challenges with Very Large Arrays , 2012, IEEE Signal Process. Mag..

[13]  Qian Zhang,et al.  User Clustered Opportunistic Beamforming for Stratospheric Communications , 2016, IEEE Communications Letters.

[14]  Giuseppe Caire,et al.  Joint Spatial Division and Multiplexing—The Large-Scale Array Regime , 2013, IEEE Transactions on Information Theory.

[15]  Geoffrey Ye Li,et al.  An Overview of Massive MIMO: Benefits and Challenges , 2014, IEEE Journal of Selected Topics in Signal Processing.