本文選題：空基網(wǎng) + 路由算法��； 參考：《哈爾濱工業(yè)大學(xué)》2017年碩士論文

【摘要】：隨著航空航天和空間探索領(lǐng)域的快速發(fā)展,空間信息的影響力變得越來(lái)越高,對(duì)空間信息的掌握程度,從某種程度上會(huì)影響一個(gè)國(guó)家綜合國(guó)力的提升和社會(huì)經(jīng)濟(jì)的發(fā)展�？仗斓匾惑w化網(wǎng)絡(luò)由深空網(wǎng)絡(luò)、近地空間網(wǎng)絡(luò)、地面網(wǎng)絡(luò)構(gòu)成,其中近地空間部分由飛機(jī)、直升機(jī)、戰(zhàn)斗機(jī)、無(wú)人機(jī)等低空飛行器構(gòu)成,也被稱(chēng)為空基網(wǎng)。空基網(wǎng)中的各種飛行器節(jié)點(diǎn)都具有實(shí)時(shí)移動(dòng)性,且節(jié)點(diǎn)運(yùn)動(dòng)速度很高,導(dǎo)致網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)頻繁變化,因此,空基網(wǎng)的路由技術(shù)面臨著很大的問(wèn)題,包括路由有效時(shí)間短、通信路由頻繁斷開(kāi)、數(shù)據(jù)包傳輸時(shí)延長(zhǎng)等。要采取適應(yīng)空基網(wǎng)特征的路由算法,要求路由算法收斂速度快,路由建立時(shí)間短,平均路由跳數(shù)小,路徑優(yōu)化速度快。本文主要研究空基網(wǎng)飛行器之間基于智能優(yōu)化算法的路由算法。首先,針對(duì)空基網(wǎng)節(jié)點(diǎn)移動(dòng)性高、拓?fù)渥兓l繁的特點(diǎn),將蟻群算法、粒子群算法、遺傳算法應(yīng)用到網(wǎng)絡(luò)中,建立智能優(yōu)化路由算法。將三種智能優(yōu)化路由算法與AODV協(xié)議仿真對(duì)比,結(jié)果表明蟻群優(yōu)化路由算法在路由建立成功率、平均路由跳數(shù)性能上表現(xiàn)最好,粒子群優(yōu)化路由算法和遺傳優(yōu)化路由算法次之,而AODV協(xié)議最差。接著,考慮網(wǎng)絡(luò)的簇頭節(jié)點(diǎn)不再位于網(wǎng)絡(luò)中心位置或者失效、毀壞、突然退出網(wǎng)絡(luò)的場(chǎng)景,設(shè)計(jì)基于圖論的簇頭節(jié)點(diǎn)選擇和更新算法,并使用概率圖模型知識(shí)對(duì)其進(jìn)行改進(jìn),以得到更加符合空基網(wǎng)場(chǎng)景的結(jié)果,提出基于概率圖模型的簇頭節(jié)點(diǎn)選擇和更新算法。分析表明基于概率圖模型的簇頭節(jié)點(diǎn)選擇和更新算法盡管比基于圖論的方法算法復(fù)雜度略高,但是其簇頭與網(wǎng)絡(luò)內(nèi)節(jié)點(diǎn)的平均路由跳數(shù)更少。最后,對(duì)有新節(jié)點(diǎn)加入網(wǎng)絡(luò)的情形,利用概率圖模型理論,綜合考慮遲入節(jié)點(diǎn)與其鄰接點(diǎn)的相互關(guān)系,為遲入節(jié)點(diǎn)選擇最佳的接入節(jié)點(diǎn)。仿真結(jié)果表明,該方法選擇的接入節(jié)點(diǎn)與按照距離最近原則選出的接入節(jié)點(diǎn)有所不同。
[Abstract]:With the rapid development of aerospace and space exploration, the influence of space information becomes more and more high. To some extent, the mastery of space information will affect the promotion of a country's comprehensive national strength and the development of social economy. The integrated network is composed of deep space network, near-earth space network and ground network, in which the near-Earth space is composed of aircraft, helicopters, fighter planes, drones and other low-altitude aircraft, also known as space-based network. All kinds of aircraft nodes in space-based networks have real-time mobility, and the speed of node movement is very high, which leads to frequent changes in network topology. Therefore, the routing technology of space-based networks faces great problems, including the short effective time of routing. The communication route frequently disconnects, the packet transmission time lengthens and so on. In order to adopt the routing algorithm which adapts to the characteristics of space-based network, it is necessary for the routing algorithm to converge fast, to set up the route in a short time, to reduce the average number of hops, and to optimize the route quickly. In this paper, the routing algorithm based on intelligent optimization algorithm is studied. Firstly, the ant colony algorithm, particle swarm optimization algorithm and genetic algorithm are applied to the network to establish an intelligent optimal routing algorithm. The simulation results show that the ant colony optimization routing algorithm has the best performance on the average number of hops, the particle swarm optimization routing algorithm and the genetic optimization routing algorithm are the second, compared with the simulation of AODV protocol, the ant colony optimization routing algorithm has the best performance in routing establishment, and the performance of the average number of hops is the best. AODV protocol is the worst. Then, considering the cluster head node is no longer located in the center of the network or failure, destroy, suddenly quit the network scene, design a graph based cluster head node selection and update algorithm, and use the probability graph model knowledge to improve it. Based on probability graph model, a cluster head node selection and update algorithm is proposed in order to obtain the results that are more consistent with the space-based network scenario. The analysis shows that the clustering head selection and updating algorithm based on probabilistic graph model is a little more complex than the one based on graph theory, but the average number of routing hops between cluster heads and nodes in the network is less. Finally, in the case of adding new nodes to the network, the theory of probabilistic graph model is used to comprehensively consider the relationship between late entry nodes and their adjacent points to select the best access nodes for late entry nodes. The simulation results show that the access nodes selected by this method are different from those selected according to the principle of distance nearest.
【學(xué)位授予單位】：哈爾濱工業(yè)大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類(lèi)號(hào)】：V443.1;TP18;TN915.0

【參考文獻(xiàn)】

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

1 鄒學(xué)玉;曹陽(yáng);劉徐迅;高洵;;基于離散粒子群的WSN分簇路由算法[J];武漢大學(xué)學(xué)報(bào)(理學(xué)版);2008年01期

2 李鐵柱;郭拯危;張瑞青;;一種基于節(jié)點(diǎn)度的LEACH改進(jìn)算法[J];計(jì)算機(jī)時(shí)代;2008年02期

3 湯宇時(shí);胡國(guó)錦;;基于適應(yīng)度的簇劃分算法研究[J];計(jì)算機(jī)仿真;2008年02期

4 王霄峻;陳曉曙;;一種半集中式低能耗自適應(yīng)無(wú)線傳感器網(wǎng)絡(luò)成簇算法[J];現(xiàn)代電子技術(shù);2007年24期

5 胡君;王雷;林亞平;;傳感器網(wǎng)絡(luò)中一種基于節(jié)點(diǎn)平均能耗的分布式簇頭選取算法[J];計(jì)算機(jī)應(yīng)用;2007年12期

6 張昱;;無(wú)線傳感器網(wǎng)絡(luò)的簇頭間距自適應(yīng)HDA-LEACH算法[J];計(jì)算機(jī)工程與應(yīng)用;2007年30期

7 張怡;李云;劉占軍;聶能;;無(wú)線傳感器網(wǎng)絡(luò)中基于能量的簇首選擇改進(jìn)算法[J];重慶郵電大學(xué)學(xué)報(bào)(自然科學(xué)版);2007年05期

8 楊峰;張德躍;;一種使用雙簇首的分簇路由協(xié)議的研究[J];山東師范大學(xué)學(xué)報(bào)(自然科學(xué)版);2007年03期

9 李晶;史杏榮;;無(wú)線傳感器網(wǎng)絡(luò)中改進(jìn)的HeeD路由協(xié)議[J];計(jì)算機(jī)工程與應(yīng)用;2007年25期

相關(guān)碩士學(xué)位論文 前2條

1 高妹;戰(zhàn)術(shù)AdHoc網(wǎng)絡(luò)群組移動(dòng)模型的研究[D];南昌航空大學(xué);2013年

2 李巖;移動(dòng)Ad Hoc網(wǎng)絡(luò)移動(dòng)模型的研究[D];太原理工大學(xué);2013年

，

本文編號(hào)：1776931