【摘要】：機(jī)會網(wǎng)絡(luò)的概念來自容遲網(wǎng)絡(luò),是一種新型的移動自組織網(wǎng)絡(luò),網(wǎng)絡(luò)中的節(jié)點利用彼此運動所創(chuàng)造的接觸機(jī)會進(jìn)行消息的傳遞,通信雙方無需事先創(chuàng)建完整的端到端的通信鏈路。網(wǎng)絡(luò)內(nèi)部節(jié)點的頻繁移動,致使臨時建立起的通信連接經(jīng)常性中斷。因此,針對機(jī)會網(wǎng)絡(luò)的特性,設(shè)計適用于該網(wǎng)絡(luò)的高效的路由算法顯得尤為重要。本文針對機(jī)會網(wǎng)絡(luò)廣泛使用的路由算法進(jìn)行了詳細(xì)的探討和研究工作,設(shè)計并實現(xiàn)了新的路由算法。以高效性作為路由算法設(shè)計的出發(fā)點,本文提出一種利用Prophet投遞預(yù)測函數(shù)和馬爾可夫模型改進(jìn)Spray and Wait的PMSF(Prophet and Markov model-based Spray and Forward)算法,該算法在Spray階段充分考慮中繼節(jié)點的傳遞潛能及傳輸可靠性,將消息副本根據(jù)Prophet算法中的投遞概率進(jìn)行相應(yīng)的分配,使消息的傳輸決策更為明智,在傳輸預(yù)測值的更新過程中引入路由可靠性的設(shè)計,使得消息能夠在最穩(wěn)定且高效的鏈路上進(jìn)行傳輸。PMSF算法將Wait階段改為主動路由的多跳轉(zhuǎn)發(fā)階段,并利用馬爾可夫模型對節(jié)點相遇時間間隔做出合理的預(yù)測,繼而把能在最短時間內(nèi)與目的節(jié)點相遇的節(jié)點作為下一跳轉(zhuǎn)發(fā)節(jié)點。在整個路由過程中,引入基于ACK確認(rèn)的緩存管理策略,在一定程度上有效緩解了網(wǎng)絡(luò)擁塞的問題。通過大量仿真實驗來驗證算法的有效性和效率,結(jié)果表明,該路由算法在消息投遞率,投遞延遲和路由開銷方面能夠表現(xiàn)出更好的性能。
[Abstract]:The concept of opportunistic network comes from delay-tolerant network, which is a new type of mobile ad hoc network, in which nodes make use of the contact opportunities created by each other's movements to deliver messages. There is no need for both parties to create a complete end-to-end communication link in advance. Frequent movement of nodes within the network results in frequent interruptions of temporarily established communications connections. Therefore, it is very important to design an efficient routing algorithm for opportunistic networks. In this paper, the widely used routing algorithms in opportunistic networks are discussed and studied in detail, and a new routing algorithm is designed and implemented. Taking high efficiency as the starting point of routing algorithm design, this paper proposes a new PMSF (Prophet and Markov model-based Spray and Forward) algorithm which uses Prophet delivery prediction function and Markov model to improve Spray and Wait. In the Spray stage, the transmission potential and transmission reliability of the relay node are fully considered, and the message replica is allocated according to the delivery probability in the Prophet algorithm, which makes the message transmission decision more intelligent. The design of routing reliability is introduced into the update process of transmission prediction value, which enables the message to be transmitted on the most stable and efficient link. The algorithm can change the Wait phase into the multi-jump phase of active routing. The Markov model is used to predict the time interval of the node meeting reasonably, and then the node that can meet the destination node in the shortest time is used as the next hop-forward node. In the whole routing process, the buffer management strategy based on ACK confirmation is introduced, which effectively alleviates the problem of network congestion to a certain extent. The effectiveness and efficiency of the algorithm are verified by a large number of simulation experiments. The results show that the routing algorithm has better performance in message delivery rate, delivery delay and routing overhead.
【學(xué)位授予單位】：哈爾濱工業(yè)大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2015
【分類號】：TN929.5

【參考文獻(xiàn)】

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

1 程剛;張云勇;張勇;宋梅;;基于人類真實場景的分時段的機(jī)會網(wǎng)絡(luò)移動模型[J];通信學(xué)報;2013年S1期

2 孫踐知;劉乃瑞;張迎新;韓忠明;陳丹;;機(jī)會網(wǎng)絡(luò)典型路由算法性能分析[J];計算機(jī)工程;2011年16期

3 蘇金樹;胡喬林;趙寶康;彭偉;;容延容斷網(wǎng)絡(luò)路由技術(shù)[J];軟件學(xué)報;2010年01期

4 熊永平;孫利民;牛建偉;劉燕;;機(jī)會網(wǎng)絡(luò)[J];軟件學(xué)報;2009年01期

5 董楠;朱林;段獻(xiàn)忠;;基于OPNET的變電站過程層網(wǎng)絡(luò)的仿真研究[J];繼電器;2006年21期

，

本文編號：2185110