论文部分内容阅读
现有的低轨卫星星座路由算法在选择星间路径时,根据算法特征分别选用最短传输延时路径(LDP)和最小跳数路径(LHP),但是对选用LHP的合理性缺乏详细分析。针对低轨卫星星座系统中LDP与LHP的关系问题,该文通过遍历仿真验证,LDP属于LHP集合,且LHP集合中各条路径传输延时差别不大,可以用LHP代替LDP以降低计算复杂度,便于路由算法的分布式实现。此外,基于LHP传输延时的变化特征,提出了星间路径选择的策略,减少了路由切换次数,为进一步优化分布式路由算法奠定了基础。
The existing LEO satellite constellation routing algorithm selects the shortest propagation delay path (LDP) and the minimum hop path (LHP) according to the characteristics of the algorithm when choosing the inter-satellite path, but lacks the detailed analysis on the rationality of the LHP selection. Aiming at the relationship between LDP and LHP in LEO satellite constellation system, through traversing simulation, LDP belongs to LHP set, and the transmission delay of each path in LHP set is not different. LHP can be used instead of LDP to reduce the computational complexity , To facilitate the distributed routing algorithm. In addition, based on the variation characteristics of LHP transmission delay, a strategy of inter-satellite path selection is proposed, which reduces the number of routing handovers and lays the foundation for further optimization of distributed routing algorithms.