Research on Location Selection of Mobile Communication Weak Coverage Network Based on Hierarchical K-means Clustering Algorithm

Abstract

At present, the problem of weak coverage of mobile communication still exists. Firstly, this thesis determines the scale of the base station and the location of the network with the hierarchical clustering algorithm. Secondly, this thesis also determines the base station coverage with the sector area of the Archimedes screw, the location of the weak coverage point with the discriminative model of weak coverage point, and the angle of the sector with the coverage model of gradient descent method. Finally, this thesis provides better solutions to the weak coverage problem with the propagation model of cluster analysis, and optimizes the site selection with the correction model of the propagation pass loss. Within the certain cost, we aim to increase the volume of coverage business, decrease the time complexity of the model, and improve the efficiency of the site selection.