本文關(guān)鍵詞： DTN 路由算法 節(jié)點位置 PLBR　出處：《廣西大學(xué)》2015年碩士論文　論文類型：學(xué)位論文

【摘要】：DTN (Delay Tolerant Network)即延遲容忍網(wǎng)絡(luò),是人們提出的一種新型網(wǎng)絡(luò)。主要是適用于消息傳輸延遲大、消息傳輸率低、傳輸過程中鏈路頻繁中斷、設(shè)備自身能力不強的網(wǎng)絡(luò),比如戰(zhàn)場上組建的動態(tài)網(wǎng)絡(luò),移動傳感器網(wǎng)絡(luò),汽車上自動組建網(wǎng)絡(luò)等。在對DTN網(wǎng)絡(luò)的研究工作中,路由算法研究一直是熱點。目前DTN路由算法研究取得了一些成果,目前主要有兩大類路由算法：基于多副本控制的路由算法和單消息副本的路由策略。其中直接鏈接和兩跳機制,流行性路由算法,最早傳遞算法等算法都存在著一些不足,有的是網(wǎng)絡(luò)負載太大,有的是選擇路由時沒有能根據(jù)實際情況靈活的改變路線。本文根據(jù)節(jié)點設(shè)備具有偏向于訪問某些地點,而且這種特征是普遍存在和穩(wěn)定的,本文提出基于節(jié)點位置的DTN路由算法協(xié)議PLBR。通過收集60位學(xué)生和員工的移動設(shè)備訪問地點的數(shù)量,訪問的頻繁度,訪問地點停留時間長度等信息,最后使用MIT Reality項目所提供的節(jié)點真實移動軌跡和節(jié)點間相遇記錄來進行實驗,實驗數(shù)據(jù)與冒泡和Label兩種路由算法協(xié)議進行了比較,在改變各種參數(shù)的條件下通過對比數(shù)據(jù)傳輸成功率,數(shù)據(jù)重傳次數(shù),和消息傳輸延遲三個方面的傳輸情況,最終實驗結(jié)果證明了PLBR比冒泡和Label兩種算法協(xié)議更加有效。
[Abstract]:DTN delay Tolerant Network (Delay-tolerant Network) is a new type of network proposed by people, which is mainly suitable for large delay of message transmission and low transmission rate of message. In the research work of DTN network, such as dynamic network on battlefield, mobile sensor network, auto forming network, etc. The research of routing algorithm has been a hot spot. At present, some achievements have been made in the research of DTN routing algorithm. At present, there are two main types of routing algorithms: multi-replication-based routing algorithm and single-message replica routing strategy, including direct link and two-hop mechanism, epidemic routing algorithm. The earliest transfer algorithm and other algorithms have some shortcomings, some of which are too heavy network load. Some of the routing can not be flexibly changed according to the actual situation. According to the node equipment has a bias to visit some locations, and this feature is universal and stable. This paper proposes DTN routing algorithm protocol based on node location. It collects the number of mobile device access sites of 60 students and employees and the frequency of access. Finally, using the MIT Reality project provided by the real movement path of the node and the record of the encounter between the nodes to carry out the experiment. The experimental data are compared with bubbling and Label routing protocols. Under the condition of changing various parameters, the data transmission success rate and data retransmission times are compared. Finally, the experimental results show that PLBR is more effective than bubbling and Label algorithms.
【學(xué)位授予單位】：廣西大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2015
【分類號】：TN929.5

【參考文獻】

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

1 鄭煒;延遲容忍網(wǎng)絡(luò)的相關(guān)問題研究及仿真[D];上海交通大學(xué);2007年

，

本文編號：1488727