本文選題：衛(wèi)星網(wǎng)絡(luò) + 星座結(jié)構(gòu)�。� 參考：《北京郵電大學(xué)》2014年博士論文

【摘要】：隨著衛(wèi)星通信技術(shù)的不斷發(fā)展,星上設(shè)備具備了在軌信息處理、數(shù)據(jù)轉(zhuǎn)發(fā)的能力,加上激光、微波等寬帶星間鏈路技術(shù)的應(yīng)用,使高帶寬衛(wèi)星網(wǎng)絡(luò)系統(tǒng)成為現(xiàn)實。衛(wèi)星網(wǎng)絡(luò)相較于傳統(tǒng)的地面網(wǎng)絡(luò),具有覆蓋范圍大、不受地理和自然條件限制、通信距離遠(yuǎn)、容量大的特點,逐漸成為未來網(wǎng)絡(luò)發(fā)展的趨勢。然而,衛(wèi)星作為網(wǎng)絡(luò)的骨干節(jié)點,在太空環(huán)境中高速繞地球轉(zhuǎn)動,導(dǎo)致衛(wèi)星網(wǎng)絡(luò)的拓?fù)浣Y(jié)構(gòu)變化迅速,星間鏈路切換頻繁等問題。同時,由于衛(wèi)星特殊的工作環(huán)境,對星上設(shè)備的體積、性能也有嚴(yán)格的限制。因此,設(shè)計一套合理有效的路由算法是衛(wèi)星網(wǎng)絡(luò)所面臨的一項技術(shù)挑戰(zhàn)。本文以LEO極軌道星座的衛(wèi)星網(wǎng)絡(luò)系統(tǒng)為研究對象,對應(yīng)用于此環(huán)境下的分布式路由算法進(jìn)行了詳細(xì)的研究,主要的研究成果如下： (1)提出了一種應(yīng)用于極軌道星座的衛(wèi)星網(wǎng)絡(luò)的選徑策略研究模型,得到在特定星座參數(shù)的情況下,網(wǎng)絡(luò)中最短延遲路徑一定屬于最短跳路徑的結(jié)論,從而證明以路徑跳數(shù)作為路由代價的分布式路由算法同樣能夠得到最短延遲路徑。在太空遠(yuǎn)距離通信的環(huán)境中,采取最短延遲策略的路由算法理應(yīng)是最合理的。分布式路由算法避免了節(jié)點之間的鏈路狀態(tài)信息交互,能夠更好的應(yīng)對頻繁的拓?fù)渥兓?簡化了算法實現(xiàn)的流程,但只能以短跳數(shù)作為路由代價。本文對最短延遲路徑與最短跳路徑的相互關(guān)系詳細(xì)分析,得到了在特定星座參數(shù)下,最短延遲路徑必定屬于最短跳路徑集合的結(jié)論。同時在理論分析的過程中,得到了路徑的延遲與橫向鏈路的緯度相關(guān),為后文提出的基于橫向傳輸優(yōu)先級的分布式路由算法奠定了基礎(chǔ)。通過仿真分析表明,在此模型基礎(chǔ)上理論分析得到的星座參數(shù)、最短延遲路徑和最短跳路徑的關(guān)系,與星間鏈路的實際情況是一致的。 (2)提出了一種基于橫向傳輸優(yōu)先級的衛(wèi)星網(wǎng)絡(luò)分布式流量均衡路由算法,進(jìn)一步簡化了衛(wèi)星網(wǎng)絡(luò)分布式路由算法的復(fù)雜程度,克服了衛(wèi)星網(wǎng)絡(luò)中流量分布不均勻的問題。通過對LEO極軌道星座衛(wèi)星網(wǎng)絡(luò)選徑策略的分析發(fā)現(xiàn),路徑的傳輸延遲與選擇的橫向路徑衛(wèi)星所在緯度有重要關(guān)系,而對經(jīng)度信息并不敏感。本文在傳統(tǒng)的曼哈頓網(wǎng)絡(luò)結(jié)構(gòu)基礎(chǔ)上,提出了一種改進(jìn)型的衛(wèi)星網(wǎng)絡(luò)拓?fù)淠Ｐ?該模型將動態(tài)的衛(wèi)星網(wǎng)絡(luò)拓?fù)鋭澐譃橐粋�靜態(tài)的網(wǎng)絡(luò)拓?fù)浜鸵粋�動態(tài)的橫向傳輸優(yōu)先級表兩種形式相結(jié)合。在此拓?fù)淠Ｐ偷幕A(chǔ)上所提出的分布式路由算法,極大的簡化了算法的復(fù)雜度。此外,針對衛(wèi)星網(wǎng)絡(luò)中,橫向路徑的流量會大量集中在高緯度區(qū)域的問題,在分布式路由算法的基礎(chǔ)上,提出了基于橫向傳輸優(yōu)先級和基于橫向轉(zhuǎn)發(fā)概率的流量均衡策略,避免了大量集中的現(xiàn)象。仿真結(jié)果表明,當(dāng)星座參數(shù)保證最短延遲路徑屬于最短跳路徑時,本文提出的分布式路由算法與傳統(tǒng)的集中式路由算法得到的路徑相同；在最短延遲路徑不屬于最短跳路徑的情況下,兩種路由算法的結(jié)果差異細(xì)微。此外,仿真數(shù)據(jù)證明本文提出的兩種流量均衡策略,均能夠有效的改善橫向傳輸流量集中在高緯度區(qū)域的問題。 (3)提出了一種基于衛(wèi)星網(wǎng)絡(luò)分布式路由算法的抗毀策略,克服了分布式路由算法在網(wǎng)絡(luò)拓?fù)鋼p壞后性能下降的問題。分布式路由算法通過避免交換鏈路狀態(tài)信息來應(yīng)對高速變化的網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu),簡化了算法的流程,更適合于星上設(shè)備執(zhí)行。而另一方面,算法缺乏對網(wǎng)絡(luò)拓?fù)湮粗獡p毀的應(yīng)對策略。針對分布式路由算法在抗毀性方面的弱點,提出了一種結(jié)合分布式路由算法和動態(tài)路由算法的抗毀路由策略。考慮到動態(tài)路由算法泛洪信息對路由算法自身性能的影響,提出了自愈區(qū)域的概念,以限制泛洪信息傳播范圍。通過仿真結(jié)果證明,在衛(wèi)星網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)受到一定程度損壞時,該策略能夠快速實現(xiàn)協(xié)議的收斂,保證路由算法的高效性。與傳統(tǒng)的分布式路由算法相比較,應(yīng)用了抗毀策略的分布式路由算法在網(wǎng)絡(luò)拓?fù)涫艿綋p壞的情況下有明顯的性能優(yōu)勢。
[Abstract]:With the continuous development of satellite communication technology, the satellite equipment has the ability of on orbit information processing, data forwarding, and the application of broadband intersatellite link technology such as laser and microwave, which makes the high bandwidth satellite network system become a reality. Compared with the traditional ground network, the satellite network has large coverage and is not restricted by geographical and natural conditions. However, as the backbone of the network, the satellite, as the backbone of the network, revolves around the earth at high speed in the space environment, which leads to the rapid change of the topology of the satellite network, the frequent switching of intersatellite links and so on. In the same time, the satellite equipment is due to the special working environment of the satellite. Therefore, the design of a reasonable and effective routing algorithm is a technical challenge facing the satellite network. This paper studies the satellite network system of the LEO polar orbit constellation, and studies the distributed routing algorithms applied in this environment. The main research results are as follows:
(1) a study model of the path selection strategy applied to the satellite network of polar orbit constellation is proposed. The conclusion is that the shortest delay path in the network must belong to the shortest hopping path in the case of the specific constellation parameters. Thus, it is proved that the distributed routing algorithm with the path hop as the routing cost can also get the shortest delay path. In space remote communication environment, the shortest delay strategy should be the most reasonable routing algorithm. The distributed routing algorithm avoids the link state information interaction between nodes. It can better cope with frequent topology changes and simplify the process of algorithm implementation, but it can only take the short hop number as the routing cost. This paper is the shortest delay. The relationship between the late path and the shortest hop path is analyzed in detail, and the conclusion is obtained that the shortest delay path must belong to the shortest hop path set under the specific constellation parameters. In the process of theoretical analysis, the delay of the path is related to the latitude of the lateral link, which is a distributed path based on the lateral transmission priority. The simulation analysis shows that the relationship between the parameters of the constellation, the shortest delay path and the shortest hop path, which is based on the model, is consistent with the actual situation of the inter satellite link.
(2) a satellite network distributed traffic equilibrium routing algorithm based on transversal transmission priority is proposed, which further simplifies the complexity of the distributed routing algorithm of satellite network and overcomes the problem of uneven distribution of traffic in the satellite network. Through the analysis of the path selection strategy of the satellite network of the LEO polar orbit constellation, the path transmission is found. In this paper, a modified satellite network topology model is proposed on the basis of the traditional Manhattan network structure. This model divides the dynamic satellite network topology into a static network topology and a dynamic lateral transmission. The distributed routing algorithm based on this topology model has greatly simplified the complexity of the algorithm. In addition, in the satellite network, the traffic of the lateral path will be concentrated in the high latitude region. Based on the algorithm, the distributed routing algorithm is based on the transversal transmission optimization. The first level and the traffic equilibrium strategy based on the lateral forwarding probability have avoided a large number of concentrated phenomena. The simulation results show that the distributed routing algorithm proposed in this paper is the same as that of the traditional centralized routing algorithm when the constellation parameters guarantee the shortest path, and the shortest path is not the shortest path. In the case of hopping path, the results of the two routing algorithms have little difference. In addition, the simulation data show that the two traffic equilibrium strategies proposed in this paper can effectively improve the problem of the horizontal transmission flow concentration in the high latitudes.
(3) an anti destruction strategy based on distributed routing algorithm based on satellite network is proposed to overcome the performance degradation of distributed routing algorithm after the network topology is damaged. The distributed routing algorithm avoids the exchange link state information to cope with the high speed changing network topology, simplifies the process of the algorithm and is more suitable for the satellite devices. On the other hand, the algorithm lacks the strategy to deal with the unknown damage of the network topology. Aiming at the weakness of the distributed routing algorithm in the aspect of destruction, this paper proposes a routing strategy which combines the distributed routing algorithm and the dynamic routing algorithm. Considering the impact of flood information on the performance of the routing algorithm, the dynamic routing algorithm is proposed. The concept of self healing region is presented to limit the spread of flood information. The simulation results show that the strategy can quickly achieve the convergence of the protocol and ensure the efficiency of the routing algorithm when the topology of the satellite network is damaged to a certain extent. Compared with the traditional distributed routing algorithm, the distributed routing of the anti destruction strategy is applied. The algorithm has obvious performance advantages when the network topology is damaged.

【學(xué)位授予單位】：北京郵電大學(xué)
【學(xué)位級別】：博士
【學(xué)位授予年份】：2014
【分類號】：TN927.2

【參考文獻(xiàn)】

相關(guān)期刊論文 前10條

1 劉嚴(yán)靜;茍定勇;吳詩其;;低軌衛(wèi)星移動通信系統(tǒng)饋電鏈路切換方案[J];電子科技大學(xué)學(xué)報;2007年02期

2 段思睿;劉元安;胡鶴飛;李虎;;LEO衛(wèi)星網(wǎng)絡(luò)路徑選擇策略[J];國防科技大學(xué)學(xué)報;2014年01期

3 段思睿;劉元安;胡鶴飛;李虎;;LEO衛(wèi)星網(wǎng)絡(luò)中基于分布式路由算法的流量均衡策略[J];電子科技大學(xué)學(xué)報;2014年03期

4 王亮,張乃通,劉曉峰;低軌衛(wèi)星通信網(wǎng)絡(luò)星間鏈路幾何參數(shù)動態(tài)特性[J];哈爾濱工業(yè)大學(xué)學(xué)報;2003年02期

5 李冬妮;王光興;;LEO/MEO衛(wèi)星網(wǎng)絡(luò)中的一種抗毀動態(tài)路由算法[J];計算機(jī)科學(xué);2004年09期

6 任洪波;;LEO衛(wèi)星網(wǎng)絡(luò)中的一種分布式路由算法[J];計算機(jī)科學(xué);2007年04期

7 易先清;馮明月;趙陽;羅雪山;;一種基于GEO/MEO星層組網(wǎng)的衛(wèi)星網(wǎng)絡(luò)抗毀路由研究[J];計算機(jī)科學(xué);2007年08期

8 張濤;柳重堪;張軍;;移動衛(wèi)星網(wǎng)絡(luò)中的最短路徑算法研究[J];計算機(jī)工程;2006年08期

9 張濤;張軍;柳重堪;;基于MPLS的移動衛(wèi)星通信網(wǎng)絡(luò)體系構(gòu)架[J];計算機(jī)工程;2006年13期

10 凌永發(fā);徐宗本;;一種均衡網(wǎng)絡(luò)流量的遺傳算法[J];計算機(jī)工程;2007年07期

，

本文編號：1824782