Graph Theory Algorithm for Clustered Interference Alignment

Clustered interference alignment (IA) can reasonably divide the sets, where IA is applied in each cluster independently. This paper mainly pays attention to graph clustering algorithm and research IA algorithm. We treat weight matrix which reduces the amount of data before the clustering and the Prim’s algorithm which comes from graph theory is introduced to produce the maximum spanning tree. Through sorting and branches interrupted, we can obtain the combination result. The proposed clustered algorithm has advantages in terms of time complexity. In IA section, we apply two kinds of algorithm in each cluster to design the code of transmitter and receiver to study the system throughout performance.