Interference Management And Resource Allocation Algorithm Based On Cluster Partition In Ultra-Dense Networks

The new generation of wireless communication networks has developed rapidly with the increasing demand of users.The advent of the Internet of Things(IoT)has promoted the global total mobile data traffic to increase by 1,000 times compared to 2010 statistics.With the support of many key technologies,the fifth-generation mobile communication technology(5G)can meet the requirements of high speed,high reliability,low delay,and high security.Among them,UltraDense Network(UDN)technology can achieve a rapid increase in system capacity by densely deploying low-power base station nodes.However,the dense deployment of low-power nodes makes the network architecture more complex,the base station load is uneven,and the interference problem becomes more serious.In order to eliminate the impact on system throughput and service quality caused by strong interference in ultra-dense networks,this paper analyzes the network architecture of ultra-dense networks and the key performance index requirements in different application scenarios,and proposes a cluster-based Interference management and resource allocation algorithm,and verify the effectiveness of the algorithm through simulation.The main research contents include the following two aspects:First,this thesis propose a dynamic cluster allocation algorithm based on trade-off conditions.This algorithm weighs the three conditions including distance,inter-cell interference,and available resources to allocate clusters to base stations.Select a serving base station in each cluster to monitor the available resources,user connections,and interference in the cluster.Update cluster allocation results based on real-time network changes to ensure that the cells with the most interference are always in the same cluster.Simulation results show that the algorithm can significantly reduce interference and improve system throughput and spectrum utilization.Secondly,this thesis proposed a resource allocation algorithm based on interference graph coloring under the cooperation of F-NPC and F-SBS.This algorithm firstly completes the dynamic cluster allocation of cells according to the algorithm proposed above,and models the interference relationship as an interference weighted undirected graph.Secondly,the FBS is divided into three types: non-communication FBS,Inter-FBS,and Intra-FBS.The three FBSs are colored separately.Then,the non-communication FBS is colored white.A separate interference map is generated for the Intra-FBS,and the F-SBS is independently colored according to the priority list inside the cluster.A separate interference map is generated for the Inter-FBS,and the F-SBS is packaged and sent information to F-NPC,F-NPC and F-SBS coordinate to color InterFBS.Finally,the two parts of the interference graph are integrated to obtain the overall coloring graph of the network to complete resource allocation.Simulation results show that the algorithm proposed in this paper can reduce inter-cluster interference through reasonable resource allocation,improve spectrum resource utilization,and improve network throughput.