Mathematics (Jun 2022)

The Allocation of Base Stations with Region Clustering and Single-Objective Nonlinear Optimization

  • Jian Chen,
  • Jiajun Tian,
  • Shuheng Jiang,
  • Yunsheng Zhou,
  • Hai Li,
  • Jing Xu

DOI
https://doi.org/10.3390/math10132257
Journal volume & issue
Vol. 10, no. 13
p. 2257

Abstract

Read online

For the problem of 5G network planning, a certain number of locations should be selected to build new base stations in order to solve the weak coverage problems of the existing network. Considering the construction cost and some other factors, it is impossible to cover all the weak coverage areas so it is necessary to consider the business volume and give priority to build new stations in the weak coverage areas with high business volume. Aimed at these problems, the clustering of weak point data was carried out by using k-means clustering algorithm. With the objective function as the minimization of the total construction cost of the new base stations, as well as the constraints as the minimal distance between adjacent base stations and the minimal coverage of the communication traffic, the single-objective nonlinear programming models were established to obtain the layout of macro and micro base stations in order to illustrate the impact of the shape of the station coverage area, the circular and the “shamrock” shaped coverage areas were compared in this paper. For the “shamrock” base station, a secondary clustering was undertaken to judge the main directions of the three sector coverage areas. Then, an improved model taking the coverage overlapping into consideration was proposed to correct the coverage area of different sectors. Finally, the optimal layout was obtained by adjusting the distribution of all base stations globally. The results show that the optimal planning method proposed in this paper has good practicability, which also provides a very good reference for solving similar allocation problems of dynamic resources.

Keywords