An Improved Method in Graph Coloring Algorithm for Interference Coordination in Cluster-wise Ultra-dense RAN

In our previous study, we proposed a Restricted Color Number (RCN) algorithm based on graph coloring for interference coordination in cluster-wise distributed MU-MIMO in ultra-dense RAN. In this algorithm, we applied Delaunay Triangulation to help decide the interference relationship, which is different from the common-used threshold setting method. In this paper, we will discuss about the advantages of the Delaunay Triangulation method over the threshold method in graph coloring algorithm for interference coordination.