中圖分類號： TN927 文獻標識碼： A DOI：10.16157/j.issn.0258-7998.200422 中文引用格式： 朱鋒，銀皓，周淦. 面向星間鏈路高動態網絡的路由規劃算法[J].電子技術應用，2020，46(11)：18-22. 英文引用格式： Zhu Feng，Yin Hao，Zhou Gan. Routing planning algorithm for high dynamic inter satellite link networks[J]. Application of Electronic Technique，2020，46(11)：18-22.
Routing planning algorithm for high dynamic inter satellite link networks
Zhu Feng1，Yin Hao1，Bai Haitong2，Zhou Gan1
1.National Computer System Engineering Research Institute of China，Beijing 100083，China； 2.The Staff Department of People′s Liberation Army，Beijing 100044，China
Abstract： 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.
Key words : inter-satellite link；route planning algorithm；high dynamic network；breadth-first-search
