一种多状态空间信息网络拓扑生成算法的优化  

An Optimization Method in Multi-State Spatial Information Network Topology Generation

作　　者：杨鹏 张嘉颖 周世杰 周湘阳 YANG Peng;ZHANG Jiaying;ZHOU Shijie;ZHOU Xiangyang(School of Mathematical Sciences,University of Electronic Science and Technology of China,Chengdu 610000,China)

机构地区：[1]电子科技大学数学科学学院,成都611731

出　　处：《电子科技大学学报》2024年第1期92-101,共10页Journal of University of Electronic Science and Technology of China

基　　金：四川省科技计划重点研发项目(2023YFG0155)。

摘　　要：空间信息网络是一种具有节点运转高速性、周期性的网络。随着近地轨道卫星日益增多,空间信息网络拓扑动态性极强,网络拓扑抗毁优化问题将具有研究意义。在考虑卫星组网的可视性、卫星节点的连接度、以及整个网络通信链路数等多种状态情况下,以最小化网络中卫星节点间的端到端时延为优化目标,构建一个满足多种约束条件的网络拓扑优化模型,提出一种优化后的模拟退火算法对模型进行求解,在模拟退火过程中创新性的提出了网络流算法进行邻域求解。实验表明,模拟退火混合求邻域算法显著优于模拟退火随机求邻域算法。Spatial information network is a kind of network with high-speed and periodically running nodes.With the increasing number of low Earth orbit satellites,the topology of spatial information networks is highly dynamic,and the problem of network topology survivability optimization will be of great research significance.Considering the visibility of satellite networking,the connectivity of satellite nodes,and the number of communication links in the entire network,a network topology optimization model satisfying multiple constraints is constructed to minimize the end-to-end delay among satellite nodes in the network,and then an optimized simulated annealing algorithm is proposed to solve the model.In the simulated annealing process,the network flow algorithm is innovatively proposed to solve the neighborhood.The experimental results show that the simulated annealing hybrid neighborhood algorithm is significantly better than the simulated annealing random neighborhood algorithm.

关 键 词：空间信息网络 网络拓扑动态优化 网络流算法 模拟退火算法 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]