《電子技術(shù)應(yīng)用》
您所在的位置:首頁(yè) > 通信与网络 > 设计应用 > 面向星间链路高动态网络的路由规划算法
面向星间链路高动态网络的路由规划算法
2020年电子技术应用第11期
朱 锋1,银 皓1,白海通2,周 淦1
1.华北计算机系统工程研究所,北京100083; 2.中国人民解放军陆军参谋部,北京100044
摘要: 伴随着航天技术的发展,卫星导航系统的技术也在不断提高。星间链路是在导航卫星之间建立具有精密测量和数据传输功能的无线网络,作为提高导航系统生存能力的重要手段,对卫星导航系统的建设至关重要。其中,星间链路路由规划算法作为星间链路技术的重要组成部分,也成为了星间链路技术的主要研究领域和方向之一。根据星间链路系统实际运行场景,结合了星间链路网络的特点,综合考虑数据传输时延和卫星节点负载等多种评价指标,基于广度优先算法思想,辅以多种剪枝策略,提出了一种基于多评价因子的路由规划算法。该算法能够在应用于高动态时变网络下寻找前N条最优路径。同时,对从节点间建链路径条数、节点建链情况、路径的开销代价等多种角度对于路由算法的规划结果进行分析验证,为星间链路路由规划中路径的筛选提供理论依据。
中圖分類號(hào): TN927
文獻(xiàn)標(biāo)識(shí)碼: A
DOI:10.16157/j.issn.0258-7998.200422
中文引用格式: 朱鋒,銀皓,周淦. 面向星間鏈路高動(dòng)態(tài)網(wǎng)絡(luò)的路由規(guī)劃算法[J].電子技術(shù)應(yīng)用,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

0 引言

    隨著衛(wèi)星導(dǎo)航系統(tǒng)不斷發(fā)展,利用星間鏈路技術(shù)實(shí)現(xiàn)導(dǎo)航系統(tǒng)的自主導(dǎo)航已經(jīng)成為了新一代導(dǎo)航系統(tǒng)的發(fā)展方向[1]。目前,全球四大導(dǎo)航系統(tǒng)除GPS已經(jīng)建成星間鏈路系統(tǒng)外,都在朝著融入星間鏈路技術(shù)的導(dǎo)航星座方向邁進(jìn)[2]。星間鏈路技術(shù)能夠極大提高全球衛(wèi)星導(dǎo)航系統(tǒng)的精度和自主運(yùn)行能力,減少對(duì)地面站的依賴,并進(jìn)一步縮短全網(wǎng)路由時(shí)延,提高全網(wǎng)傳輸容量[3]。有關(guān)星間鏈路的技術(shù)研究主要集中在星間鏈路的拓?fù)湓O(shè)計(jì)方案和星間鏈路路由算法兩方面[4]路由規(guī)劃算法基于導(dǎo)航星座網(wǎng)絡(luò)的拓?fù)浣ㄦ?,?duì)網(wǎng)絡(luò)中的數(shù)據(jù)傳輸進(jìn)行性能優(yōu)化,保證數(shù)據(jù)的高效傳輸。

    目前,關(guān)于導(dǎo)航星座網(wǎng)絡(luò)的路由算法規(guī)劃研究有很多。并從不同方向上給出多種研究成果。文獻(xiàn)[1]提出將DTN中的CGR啟發(fā)式算法應(yīng)用于星間鏈路網(wǎng)絡(luò),并進(jìn)行了可行性分析和驗(yàn)證。文獻(xiàn)[2]基于Dijkstra算法思想,提出一種綜合考慮等待時(shí)延、鏈路速率、傳輸距離等多因子的混合路由策略。文獻(xiàn)[3]將演化圖模型用于星間鏈路網(wǎng)絡(luò),并對(duì)演化圖最早到達(dá)路徑算法時(shí)延性能進(jìn)行仿真模擬。文獻(xiàn)[4]提出了最少跳數(shù)最早到達(dá)時(shí)間路由算法。文獻(xiàn)[5]則對(duì)文獻(xiàn)[4]中的CGR路由算法在星間鏈路網(wǎng)絡(luò)中的應(yīng)用進(jìn)行了改進(jìn),提高其適用性。文獻(xiàn)[6]提出了一種應(yīng)用于低軌星間鏈路中,基于自適應(yīng)調(diào)制編碼策略的QoS時(shí)延約束的前N條最短路徑算法。文獻(xiàn)[7]則從對(duì)星間鏈路評(píng)價(jià)因子權(quán)重參數(shù)的選取角度進(jìn)行了探究和驗(yàn)證。

    本文提出的路由規(guī)劃算法基于廣度優(yōu)先算法思想,以傳輸時(shí)延和衛(wèi)星負(fù)載等多種評(píng)價(jià)指標(biāo)為開(kāi)銷代價(jià),尋找衛(wèi)星節(jié)點(diǎn)之間通信開(kāi)銷代價(jià)最小的前N條最優(yōu)路徑。同時(shí),對(duì)路由算法的有效性和正確性進(jìn)行了多角度驗(yàn)證工作,為星間鏈路的路由算法中路徑篩選提供依據(jù)。




本文詳細(xì)內(nèi)容請(qǐng)下載:http://m.ihrv.cn/resource/share/2000003042




作者信息:

朱  鋒1,銀  皓1,白海通2,周  淦1

(1.華北計(jì)算機(jī)系統(tǒng)工程研究所,北京100083;

2.中國(guó)人民解放軍陸軍參謀部,北京100044)

此內(nèi)容為AET網(wǎng)站原創(chuàng),未經(jīng)授權(quán)禁止轉(zhuǎn)載。

相關(guān)內(nèi)容