关键词: 协同，分簇，小区间干扰，多基站联合处理

Abstract: Aiming at the objective of maximizing system sum-rate,a benefit tree clustering algorithm based on maximizing Cooperative Degree (CD) was proposed,where the clustering problem in base station (BS) cooperation system is modeled as constructing benefit trees of a connected graph with edge costs. The concept of CI)between every two benefit trees was defined, and based on this, the algorithm simultaneously generates some clusters of dynamic size by combining two trees with the maximum CD, which could solve the capacity-limited problem caused by conventional clustering scheme and enhance the system capacity. Results show this algorithm performs better than other existing clustering scheme in the system spectrum efficiency, and the computational complexity is linear.

Key words: Coopcration,Clustcr,Inter-cell interfcrcncc(ICI)，Multi-BS joint processing