本文選題：空間信息網(wǎng)　切入點：覆蓋率　出處：《北京理工大學(xué)》2014年碩士論文　論文類型：學(xué)位論文

【摘要】：在闡述空間信息網(wǎng)的基本概念和技術(shù)原理的基礎(chǔ)上，研究了空間信息網(wǎng)分層網(wǎng)絡(luò)的構(gòu)成，分別對LEO層衛(wèi)星和GEO層衛(wèi)星的特性進(jìn)行了分析，并提出了GEO/LEO雙層星座的系統(tǒng)模型，結(jié)合中國的地理區(qū)域，對星座覆蓋率進(jìn)行了仿真分析，進(jìn)而對相應(yīng)的LEO星座和GEO星座進(jìn)行了設(shè)計，提出了一種適用于中國的空間信息網(wǎng)體系結(jié)構(gòu)方案。 分析了地面移動自組網(wǎng)路由協(xié)議，同衛(wèi)星節(jié)點進(jìn)行了對比，針對空間信息網(wǎng)中衛(wèi)星節(jié)點移動速度快，延時大，鏈路連通時間短，抗毀性差的特點，提出了在空間信息網(wǎng)中采用動態(tài)源路由協(xié)議的方案。之后將地面自組網(wǎng)典型的動態(tài)源路由協(xié)議DSR協(xié)議應(yīng)用到空間信息網(wǎng)衛(wèi)星路由中，對仿真結(jié)果進(jìn)行了分析，發(fā)現(xiàn)直接利用地面自組網(wǎng)的協(xié)議，出現(xiàn)了路由流量過大，尤其是路由發(fā)現(xiàn)階段的流量過大，鏈路生存時間短，路由鏈路不穩(wěn)定，鏈路擁塞概率大等問題。 針對地面協(xié)議直接應(yīng)用到衛(wèi)星路由出現(xiàn)的問題，提出了一種適用于空間信息網(wǎng)的衛(wèi)星自組織路由協(xié)議，算法包含兩個部分，分別是單路徑路由算法和多路徑路由算法。在單路徑算法中對一般動態(tài)源路由協(xié)議路由發(fā)現(xiàn)時的泛洪路由進(jìn)行了優(yōu)化，可以在一定程度上指導(dǎo)路由廣播過程的渠道，進(jìn)而降低路由流量，同時對緩存路由回復(fù)和路由維護(hù)進(jìn)行了改進(jìn)；在多路徑算法中對多路徑尋找、多路徑選擇和多路徑權(quán)重分配都進(jìn)行了設(shè)計，為了保證端到端延時抖動小，選擇利用延時作為多路徑選擇的主要判斷準(zhǔn)則。為了保證鏈路流量可以得到合理的分配，選擇利用不同軌道間的星際鏈路的個數(shù)作為多路徑權(quán)重分配的主要法則，因為不同軌道間的星際鏈路同鏈路的生存時間和鏈路的穩(wěn)定性有較大的關(guān)系。 仿真結(jié)果表明，跟傳統(tǒng)的地面移動自組網(wǎng)DSR路由協(xié)議相比，衛(wèi)星自組網(wǎng)路由協(xié)議的單路徑算法在保證路由流量降低的同時，保證了鏈路的連通時間更長，，所選路由的鏈路更加穩(wěn)定。衛(wèi)星自組網(wǎng)路由協(xié)議的多路徑算法相比于單路徑算法網(wǎng)絡(luò)發(fā)生擁塞的概率更低，排隊延遲的時間更短，分組投遞率隨著業(yè)務(wù)的增加下降的速度更慢。
[Abstract]:On the basis of expounding the basic concept and technical principle of space information network, the structure of layered network of space information network is studied, the characteristics of LEO layer satellite and GEO layer satellite are analyzed, and the system model of GEO/LEO bilevel constellation is put forward. Combined with the geographical region of China, the constellation coverage is simulated and analyzed, and the corresponding LEO constellation and GEO constellation are designed, and a spatial information network architecture scheme suitable for China is proposed. In this paper, the routing protocol of ground mobile ad hoc network is analyzed and compared with satellite node. Aiming at the characteristics of fast moving speed, large delay, short link connection time and poor survivability of satellite nodes in space information network, the routing protocol of ground mobile ad hoc network is analyzed. This paper proposes a scheme of dynamic source routing protocol in spatial information network, and then applies DSR protocol, a typical dynamic source routing protocol, to satellite routing in spatial information network. The simulation results are analyzed. It is found that the routing traffic is too large, especially in the route discovery stage, the link lifetime is short, the routing link is unstable, and the probability of link congestion is large. In order to solve the problem that ground protocol is directly applied to satellite routing, a satellite self-organizing routing protocol for spatial information network is proposed. The algorithm consists of two parts. Single path routing algorithm and multipath routing algorithm. In the single path algorithm, the flooding routing of general dynamic source routing protocol is optimized, which can guide the routing broadcast process to a certain extent. Then the routing traffic is reduced, and the cache routing recovery and route maintenance are improved. In the multipath algorithm, multipath search, multipath selection and multipath weight allocation are designed to ensure small end-to-end delay jitter. In order to ensure the reasonable allocation of link traffic, the number of interstellar links between different orbits is chosen as the main rule of multipath weight allocation. Because the interstellar link between different orbits has a great relationship with the lifetime and stability of the link. The simulation results show that compared with the traditional DSR routing protocol, the single-path algorithm of satellite ad hoc network can guarantee the decrease of routing traffic and the longer link connectivity time. Compared with the single path algorithm, the multipath algorithm of satellite ad hoc network has lower probability of congestion, shorter time of queue delay, and slower rate of packet delivery with the increase of traffic.
【學(xué)位授予單位】：北京理工大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TN927.2

【參考文獻(xiàn)】

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

1 宋學(xué)貴;劉凱;張軍;程連貞;;一種適于LEO衛(wèi)星網(wǎng)絡(luò)的動態(tài)源路由算法[J];北京航空航天大學(xué)學(xué)報;2006年12期

2 劉軍;劉向軍;葉寧;沙毅;;一種空間信息網(wǎng)多徑路由算法[J];東北大學(xué)學(xué)報(自然科學(xué)版);2011年06期

3 王遠(yuǎn);姚艷軍;王爍;;我國天基信息網(wǎng)未來發(fā)展設(shè)想[J];信息通信;2014年01期

4 閔士權(quán);;我國天基綜合信息網(wǎng)構(gòu)想[J];航天器工程;2013年05期

5 王海濤;宋麗華;楊濤;;Ad Hoc網(wǎng)絡(luò)的關(guān)鍵技術(shù)分析[J];數(shù)據(jù)通信;2007年03期

6 吳永輝;馬沖;潘巍;梁濤;;多層衛(wèi)星網(wǎng)絡(luò)研究概述[J];數(shù)字通信世界;2009年06期

7 李U

本文編號：1613838