A graph coloring-based interference coordination algorithm for cluster-wise ultra-dense RAN

Abstract

Ultra-dense radio access network (RAN) with distributed multi-user multi-input multi-output (MU-MIMO) is considered as a promising approach to improve the coverage and link capacity. However, its prohibitively high computational complexity impacts its further extension and application. Our previous work has proved that forming users/antennas clusters can greatly alleviate the computational complexity, but the inter-cluster interference is produced, thereby reducing the spectrum efficiency. In this paper, we propose a graph coloring algorithm-based inter-cluster interference coordination for ultra-dense RAN with distributed MU-MIMO. It is confirmed by computer simulation that our proposed algorithm can improve both the sum capacity and the user capacity compared with no coloring case.