Research on Site Planning of Mobile Communication Network  

作　　者：Jiahan He Guangjun Liang Meng Li KefanYao Bixia Wang Lu Li 

机构地区：[1]Department of Computer Information and Cyber Security,Jiangsu Police Institute,Nanjing,210000,China [2]Engineering Research Center of Electronic Data Forensics Analysis,Nanjing,210000,China [3]Key Laboratory of Digital Forensics,Department of Public Security of Jiangsu Province,Nanjing,210000,China [4]Basic Course Teaching and Research Department,Jiangsu Police Institute,Nanjing,210000,China [5]Communication and Signal College,Nanjing Railway Vocational and Technical,Nanjing,210000,China

出　　处：《Computers, Materials & Continua》2024年第8期3243-3261,共19页计算机、材料和连续体（英文）

基　　金：The work is supported by Jiangsu Higher Education“Qinglan Project”,an Open Project of Criminal Inspection Laboratory in Key Laboratories of Sichuan Provincial Universities(2023YB03);Major Project of Basic Science(Natural Science)Research in Higher Education Institutions in Jiangsu Province(23KJA520004);Jiangsu Higher Education Philosophy and Social Sciences Research General Project(2023SJYB0467);Action Plan of the National Engineering Research Center for Cybersecurity Level Protection and Security Technology(KJ-24-004);Jiangsu Province Degree and Postgraduate Education and Teaching ReformProject(JGKT24_B036);Digital Forensics Engineering Research Center of the Ministry of Education Open Project(DF20-010);the Youth Fund of Nanjing Railway Vocational and Technical College(Yq220012).

摘　　要：In this paper,considering the cost of base station,coverage,call quality,and other practical factors,a multi-objective optimal site planning scheme is proposed.Firstly,based on practical needs,mathematical modeling methods were used to establish mathematical expressions for the three sub-objectives of cost objectives,coverage objectives,and quality objectives.Then,a multi-objective optimization model was established by combining threshold and traffic volume constraints.In order to reduce the time complexity of optimization,a non-dominated sorting genetic algorithm(NSGA)is used to solve the multi-objective optimization problem of site planning.Finally,a strategy for clustering and optimizing weak coverage areas was proposed.In order to avoid redundant neighborhood retrieval during cluster expansion,the Fast Density-Based Spatial Clustering of Applications with Noise(FDBSCAN)clustering method was adopted.With different sub-objectives as the main objectives,this paper obtained the distribution map of weak coverage areas before and after the establishment of new base stations,as well as relevant site planning maps,and provided three planning schemes for different main objectives.The simulation results show that the traffic coverage of the three station planning schemes is above 90%.The change in the main optimization objective will result in a significant difference between the cost of the three solutions and the coverage of weak coverage points.

关 键 词：Siting of station multi-objective optimization genetic algorithm NSGA general greed FDBSCAN cluster 

分 类 号：TN929.5[电子电信—通信与信息系统]