Interference reduction method based on overlapping clustering in UDN

Abstract

The invention discloses an interference reduction method based on overlapping clustering, which is suitable for an ultra-dense network adopting multi-point cooperative transmission. The method comprises the following steps: constructing a path loss map according to the path loss between small base stations, finding the shortest side in the path loss map in sequence, if a triangle or a quadrangle using the side as one side exists, placing the small base stations corresponding to a plurality of vertexes of one triangle or quadrangle in a cluster, otherwise, placing the small base stations corresponding to two vertexes of the side in a cluster, for each user, calculating an average value of the path loss of the user and the small base stations in the cluster, clustering the user according tothe average value, and finally, allocating a sub-band to each cluster on the path loss map by using a map coloring method, wherein the small base station in each cluster interacts data with the user in the present cluster by using the allocated sub-band.

Description

technical field [0001] The invention relates to the communication field, in particular to an interference reduction method based on overlapping clustering in an ultra-dense network. Background technique [0002] Ultra Dense Network (UDN, Ultra Dense Network) is one of the key technologies of the next generation mobile communication. Deploying a large number of low-power small base stations in UDN can increase system capacity, enhance indoor coverage, and improve spectrum utilization. Since the distance between small base stations is very close, if they use the same frequency band, there will be serious interference, so effective interference reduction methods are a hot research topic. [0003] Existing interference mitigation methods in the UDN are divided into clustering, resource allocation, Coordinated Multiple Point transmission (CoMP, Coordinated Multiple Point) and the like. [0004] By clustering, the entire network is divided into several small networks, and each s...

AI Technical Summary

Problems solved by technology

This document assumes that each cell is a regular hexagon, and the distribution of small base stations is regular. However, in the actual system, the distribution of small base stations is random and irregular, and it is impossible for all small base stations to have regular coverage. hexagon, so the method proposed in this document cannot be used in practical systems

Images