电讯技术2025，Vol.65Issue(8)：1256-1264,9.DOI:10.20079/j.issn.1001-893x.240401002
卫星网络地面中继站优化部署研究
Research on Optimization Deployment of Satellite Network Ground Relay Stations
摘要
Abstract
To address the optimal deployment of ground relay stations in satellite networks,the Okumura-Hata model and log-normal shadowing model are used to simulate signal fading,and a three-dimensional coverage model is constructed based on randomly sampled ASTER Global Digital Elevation Map v3(GDEM v3)data.The problem of deploying ground relay stations is transformed into the Maximum Covering Location Problem(MCLP)and the Set Covering Problem(SCP).The Vincenty formula is utilized to calculate the distance between ground relay stations and terminals,incorporating terrain constraints such as height and obstacles.Greedy,genetic,and particle swarm algorithms are designed to solve the optimal deployment locations of ground relay stations.Deployment experiments are conducted in the three autonomous regions of Aba,Ganzi,and Liangshan in Sichuan Province.Simulation results indicate that for the SCP problem,the greedy algorithm achieves the highest deployment efficiency,requiring only 34,58,and 28 ground relay stations respectively for full coverage.However,for the MCLP problem,the genetic algorithm shows the highest coverage rates,achieving 92.64%,72.58%,and 98.58%coverage with 20 ground relay stations in each region,respectively.The proposed method comprehensively considers factors such as terrain,signal attenuation,deployment difficulty,and cost,demonstrating good portability and the ability to efficiently optimize the deployment of ground relay stations in different provinces.关键词
地面中继站/三维优化部署/贪心算法/遗传算法/粒子群算法Key words
ground relay stations/three-dimensional optimization deployment/greedy algorithm/genetic algorithm/particle swarm optimization algorithm分类
信息技术与安全科学引用本文复制引用
杨泞豪,李伊陶..卫星网络地面中继站优化部署研究[J].电讯技术,2025,65(8):1256-1264,9.基金项目
科技部重大专项(2022YFE03050004) （2022YFE03050004）
人工智能四川省重点实验室基金项目(2021RZJ01) （2021RZJ01）
