Base Station Planning Based on Region Division and Mean Shift Clustering

Jian Chen, Yongkun Shi, Jiaquan Sun, Jiangkuan Li and Jing Xu ()
Additional contact information
Jian Chen: School of Mechanical Engineering, Yangzhou University, Huayang West Road 196, Yangzhou 225127, China
Yongkun Shi: College of Electrical, Energy and Power Engineering, Yangzhou University, Huayang West Road 196, Yangzhou 225127, China
Jiaquan Sun: College of Electrical, Energy and Power Engineering, Yangzhou University, Huayang West Road 196, Yangzhou 225127, China
Jiangkuan Li: School of Information Engineering (School of Artificial Intelligence), Yangzhou University, Huayang West Road 196, Yangzhou 225127, China
Jing Xu: School of Mechanical Engineering, Yangzhou University, Huayang West Road 196, Yangzhou 225127, China

Mathematics, 2023, vol. 11, issue 8, 1-22

Abstract: The problem of insufficient signal coverage of 5G base stations can be solved by building new base stations in areas with weak signal coverage. However, due to construction costs and other factors, it is not possible to cover all areas. In general, areas with high traffic and weak coverage should be given priority. Although many scientists have carried out research, it is not possible to make the large-scale calculation accurately due to the lack of data support. It is necessary to search for the central point through continuous hypothesis testing, so there is a large systematic error. In addition, it is difficult to give a unique solution. In this paper, the weak signal coverage points were divided into three categories according to the number of users and traffic demand. With the lowest cost as the target, and constraints such as the distance requirement of base station construction, the proportion of the total signal coverage business, and so on, a single objective nonlinear programming model was established to solve the base station layout problem. Through traversal search, the optimal threshold of the traffic and the number of base stations was obtained, and then, a kernel function was added to the mean shift clustering algorithm. The center point of the new macro station was determined in the dense area, the location of the micro base station was determined from the scattered and abnormal areas, and finally the unique optimal planning scheme was obtained. Based on the assumptions made in this paper, the minimum total cost is 3752 when the number of macro and micro base stations were determined to be 31 and 3442 respectively, and the signal coverage rate can reach 91.43%. Compared with the existing methods, such as K-means clustering, K-medoids clustering, and simulated annealing algorithms, etc., the method proposed in this paper can achieve good economic benefits; when the traffic threshold and the number of base stations threshold are determined, the unique solution can be obtained.

Keywords: base station planning; mean shift clustering; region division; single objective nonlinear programming; unique solution (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/8/1971/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/8/1971/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:8:p:1971-:d:1129728

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().