面向星间链路高动态网络的路由规划算法

Routing planning algorithm for high dynamic inter satellite link networks

伴随着航天技术的发展,卫星导航系统的技术也在不断提高。星间链路是在导航卫星之间建立具有精密测量和数据传输功能的无线网络,作为提高导航系统生存能力的重要手段,对卫星导航系统的建设至关重要。其中,星间链路路由规划算法作为星间链路技术的重要组成部分,也成为了星间链路技术的主要研究领域和方向之一。根据星间链路系统实际运行场景,结合了星间链路网络的特点,综合考虑数据传输时延和卫星节点负载等多种评价指标,基于广度优先算法思想,辅以多种剪枝策略,提出了一种基于多评价因子的路由规划算法。该算法能够在应用于高动态时变网络下寻找前N条最优路径。同时,对从节点间建链路径条数、节点建链情况、路径的开销代价等多种角度对于路由算法的规划结果进行分析验证,为星间链路路由规划中路径的筛选提供理论依据。

With the development of space technology,the technology of satellite navigation system is also improving.Inter satellite link is a wireless network with precise measurement and data transmission functions between navigation satellites.As an important means to improve the survivability of navigation system,it is very important for the construction of satellite navigation system.As an important part of inter satellite link technology,inter satellite link routing algorithm has become one of the main research fields and directions of inter satellite link technology.According to the actual operation scenario of the inter satellite link system,combined with the characteristics of the inter satellite link network,considering a variety of evaluation indexes such as data transmission delay and satellite node load,based on the idea of breadth first algorithm,supplemented by a variety of pruning strategies,this paper proposes a multi evaluation factor based routing planning algorithm.The algorithm can find the first N optimal paths in high dynamic time-varying networks.At the same time,this paper analyzes and validates the planning results of routing algorithm from many aspects,such as the number of paths between nodes,the situation of nodes building chains,the cost of path overhead and so on,so as to provide a theoretical basis for the selection of paths in the inter satellite link routing planning.