超密集网络中基于分簇的干扰管理方案

摘要

在超密集网络中,全频复用能够提升网络的吞吐量,但是导致了严重的基站间干扰.为了降低基站间干扰,首先通过干扰权重值描述小基站间的干扰程度,建立合理的干扰图;然后将分簇问题转化为Max K-Cut问题,利用改进的次优化启发式算法对小基站进行分簇;最后通过信道分配算法为每个簇中的用户分配子信道.仿真表明,本文的干扰管理方案在降低小基站间干扰的同时,能够提升系统的频谱效率和平均吞吐量.%In ultra dense networks,full-frequency multiplexing can improve the throughput of the network,but lead to serious inter-base station interference.In order to reduce the inter-base station interference,the interference degree between the small base stations was firstly described by interfering with the weight value,and establishes a reasonable interference map.Then the clustering problem is transformed into Max K-Cut problem, and the small substation is clustered by the improved suboptimal heuristic algorithm.Finally,the sub-channel is assigned to the users in each cluster by the channel assignment algorithm.The simulation results show that the interference man-agement scheme can improve the spectral efficiency and average throughput of the system while reducing the inter -ference between the small base stations.