本文選題：容遲網(wǎng)絡(luò) + 路由協(xié)議　； 參考：《青島大學(xué)》2017年碩士論文

【摘要】：容遲網(wǎng)絡(luò)作為一種新型無線移動(dòng)網(wǎng)絡(luò),其特點(diǎn)是節(jié)點(diǎn)移動(dòng)造成缺乏持久的端到端連接、動(dòng)態(tài)變化的網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)、有限的存儲(chǔ)空間等。為了解決鏈路缺失等問題,實(shí)現(xiàn)容遲網(wǎng)絡(luò)中不同網(wǎng)絡(luò)構(gòu)架之間的互聯(lián)和互操作,容遲網(wǎng)絡(luò)采用“存儲(chǔ)-攜帶-轉(zhuǎn)發(fā)”的消息傳輸機(jī)制。為此,如何做出高效準(zhǔn)確的路由決策是實(shí)現(xiàn)信息共享及高效傳輸?shù)年P(guān)鍵技術(shù)。本論文研究如何設(shè)計(jì)適用于容遲網(wǎng)絡(luò)的高效路由算法,主要內(nèi)容有以下三點(diǎn):(1)基于節(jié)點(diǎn)相似性的概率路由算法。通過研究節(jié)點(diǎn)的歷史相遇信息,挖掘節(jié)點(diǎn)社交范圍的相似性。利用統(tǒng)計(jì)學(xué)方法計(jì)算節(jié)點(diǎn)間的接觸頻率,在此基礎(chǔ)上預(yù)估節(jié)點(diǎn)在消息生存時(shí)間內(nèi)與目的節(jié)點(diǎn)的相遇概率,實(shí)現(xiàn)消息定向擴(kuò)散。(2)基于節(jié)點(diǎn)社交流行性路由。通過記錄節(jié)點(diǎn)的歷史移動(dòng)軌跡,獲取與給定節(jié)點(diǎn)的緊密連接鄰居節(jié)點(diǎn)�？朔戎行男灾豢紤]一跳連接的缺點(diǎn),從而提出啟發(fā)性函數(shù)節(jié)點(diǎn)流行性。(3)基于節(jié)點(diǎn)社交流行性的概率路由算法。提出節(jié)點(diǎn)社交群感知模型,并在此基礎(chǔ)上定義啟發(fā)式函數(shù)。綜合考慮消息傳輸時(shí)延及消息剩余生存周期,預(yù)估節(jié)點(diǎn)與目的節(jié)點(diǎn)直接與間接的相遇概率。以消息投遞率為優(yōu)化目標(biāo),把中繼節(jié)點(diǎn)選擇問題轉(zhuǎn)化為0-1背包的最優(yōu)化問題,通過回溯算法求解。該算法將路由策略分為基于目的節(jié)點(diǎn)社交群內(nèi)路由和基于目的節(jié)點(diǎn)社交群外路由兩個(gè)階段。通過大量仿真實(shí)驗(yàn),驗(yàn)證了論文工作的高效性及合理性。提出的三種路由算法分別在消息投遞率、網(wǎng)絡(luò)負(fù)載等方面取得較好的性能表現(xiàn),對(duì)容遲網(wǎng)絡(luò)中路由算法研究領(lǐng)域具有較高的理論價(jià)值及參考價(jià)值。
[Abstract]:As a new type of wireless mobile network, delay-tolerant network is characterized by the lack of end-to-end connection caused by node mobility, dynamic network topology, limited storage space and so on. In order to solve the problem of missing links and realize the interconnection and interoperation among different network architectures in delay-tolerant networks, the delay-tolerant networks adopt the mechanism of "store, carry and forward" message transmission. Therefore, how to make efficient and accurate routing decision is the key technology to realize information sharing and efficient transmission. This paper studies how to design an efficient routing algorithm for delay tolerant networks. The main contents are as follows: 1) probabilistic routing algorithm based on node similarity. By studying the historical encounter information of nodes, the similarity of social scope of nodes is mined. The frequency of contact between nodes is calculated by statistical method, and then the probability of the nodes meeting with the destination node within the message lifetime is estimated, and the message oriented diffusion. 2) based on the node social epidemic routing is realized. By recording the historical movement path of the node, the tightly connected neighbor node with a given node is obtained. To overcome the shortcoming of degree centrality considering only one-hop connection, a probabilistic routing algorithm based on node social popularity is proposed for heuristic function node epidemic. A nodal social group perception model is proposed and a heuristic function is defined on this basis. The probability of direct and indirect encounter between the node and the destination node is estimated by considering the residual life cycle of the message when the message is transmitted. With message delivery rate as the optimization objective, the relay node selection problem is transformed into the 0-1 knapsack optimization problem, which is solved by backtracking algorithm. The algorithm divides the routing strategy into two stages: the intra-group routing based on the destination node and the out-of-group routing based on the destination node. Through a large number of simulation experiments, the high efficiency and rationality of the paper work are verified. The proposed three routing algorithms have achieved better performance in message delivery rate and network load respectively, which is of high theoretical value and reference value to the research field of routing algorithms in delay-tolerant networks.
【學(xué)位授予單位】：青島大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TP393.02

【參考文獻(xiàn)】

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

1 周朝榮;徐小瓊;馬小霞;楊柳;;容遲網(wǎng)絡(luò)中基于社會(huì)自私性的路由算法[J];電子科技大學(xué)學(xué)報(bào);2016年03期

2 于海征;馬建峰;邊紅;;容遲網(wǎng)絡(luò)中基于社會(huì)網(wǎng)絡(luò)的可靠路由[J];通信學(xué)報(bào);2010年12期

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

1 朱義吉;社會(huì)容遲網(wǎng)絡(luò)中基于能效的消息轉(zhuǎn)發(fā)機(jī)制的研究[D];南京郵電大學(xué);2016年

，

本文編號(hào)：1946935