本文選題：無線移動網(wǎng)絡 + 擁塞控制��； 參考：《中國礦業(yè)大學》2017年碩士論文

【摘要】：物聯(lián)網(wǎng)概念的提出,很大程度上加快了無線網(wǎng)絡的發(fā)展。Ad-Hoc網(wǎng)絡由分組無線網(wǎng)絡發(fā)展而來,之后國內(nèi)外掀起一陣研究Ad-Hoc網(wǎng)絡的熱潮。路由協(xié)議是網(wǎng)絡數(shù)據(jù)發(fā)送與接收的基礎(chǔ),國內(nèi)外學者已對Ad-Hoc網(wǎng)絡中路由協(xié)議進行多方面研究,并取得頗多成果,但并未有一項研究將擁塞控制、網(wǎng)絡安全及鏈路預測結(jié)合起來整體提升網(wǎng)絡性能。本文對Ad-Hoc網(wǎng)絡中AODV路由協(xié)議(Ad hoc On-demand Distance Vector Routing)進行研究,采取四種措施優(yōu)化AODV路由協(xié)議,提升分組投遞率、降低網(wǎng)絡時延、減少路由失敗的個數(shù)。本文的主要研究內(nèi)容及創(chuàng)新點如下:在Ad-Hoc網(wǎng)絡擁塞控制方面,一改以往AODV建立路由的過程不考慮網(wǎng)絡擁塞只選擇跳數(shù)最短的一條足夠新的路由,提出選擇緩沖區(qū)隊列利用率最低的一條路由代替跳數(shù)最短的路由做為最優(yōu)路由傳輸數(shù)據(jù)。該方法通過改變AODV中的路由請求、路由應答和路由維護過程實現(xiàn),方法中設置參數(shù)計算緩沖區(qū)隊列利用率,反映網(wǎng)絡的擁塞程度。在Ad-Hoc網(wǎng)絡AODV中,RREQ、RREP的不斷發(fā)送與接收是造成AODV開銷大的主要原因。文章通過減少路由分組發(fā)送的次數(shù)及降低路由過期時間兩種方法減少RREQ、RREP的發(fā)送次數(shù),以達到減小開銷,降低時延的目的。在Ad-Hoc網(wǎng)絡AODV的安全性方面,文章針對單節(jié)點的黑洞攻擊,提出一種有效檢測惡意節(jié)點的方法。該方法只修改源節(jié)點的工作方式,不改變中間節(jié)點和目的節(jié)點的工作方式,在路由發(fā)現(xiàn)階段識別出惡意節(jié)點,阻止其進一步的破壞活動。結(jié)合以上三個創(chuàng)新點提出NAODV路由協(xié)議,仿真實驗表明,Ad-Hoc網(wǎng)絡中NAODV路由協(xié)議的分組投遞率、時延、歸一化路由開銷、路由發(fā)起頻率等性能相比其他AODV路由協(xié)議都有明顯優(yōu)勢。在Ad-Hoc網(wǎng)絡鏈路預測方面,針對移動Ad-Hoc網(wǎng)絡AODV中節(jié)點不斷運動,鏈路頻繁斷開,路由不斷重建,造成延時和開銷過大、路由失敗個數(shù)過多等問題,提出一種新的LP-NAODV協(xié)議,進行鏈路時間預測與路由重建,建立預測鏈路穩(wěn)定性與備份機制結(jié)合的模型。首先使用牛頓均差插值多項式分別進行鏈路斷開時間和節(jié)點剩余時間預測;其次選擇鏈路斷開時間與節(jié)點剩余時間較小者為鏈路持續(xù)時間;最后當鏈路持續(xù)時間小于閾值時啟用設置好的備份路由,實現(xiàn)路由重建。仿真實驗表明,與AODV、NAODV和PB-AODV三種協(xié)議相比,LP-NAODV在發(fā)送分組速率改變時,路由失敗個數(shù)和端到端的延時明顯減少,分組投遞率明顯增大。
[Abstract]:The concept of Internet of things, to a large extent, accelerates the development of wireless networks. Ad-Hoc networks are developed from packet wireless networks. After that, there has been a wave of research on Ad-Hoc networks at home and abroad. Routing protocol is the basis of sending and receiving network data. Scholars at home and abroad have done many researches on routing protocols in Ad-Hoc networks, and achieved a lot of results, but there is not a single study on congestion control. Network security and link prediction are combined to improve overall network performance. In this paper, the AODV routing protocol Ad hoc On-demand Distance Vector Routing) in Ad-Hoc network is studied. Four measures are adopted to optimize the AODV routing protocol, to improve the packet delivery rate, to reduce the network delay and to reduce the number of routing failures. The main research contents and innovations of this paper are as follows: in the aspect of congestion control in Ad-Hoc networks, a new route with the shortest hops is chosen in the process of changing the previous AODV routing process without considering the network congestion. A route with the lowest buffer queue utilization is proposed to replace the shortest hop route as the optimal route to transmit data. The method is implemented by changing the routing request, routing response and route maintenance process in AODV, and setting parameters to calculate the buffer queue utilization rate to reflect the congestion degree of the network. In AODV of Ad-Hoc network, the continuous sending and receiving of RREP is the main reason for the high cost of AODV. In this paper, we reduce the number of RREQN RREP transmission by reducing the number of routing packets and the routing expiration time, so as to reduce the overhead and delay. In terms of the security of AODV in Ad-Hoc networks, this paper proposes an effective method for detecting malicious nodes in the case of black hole attacks on single nodes. The method only modifies the working mode of the source node, does not change the working mode of the intermediate node and the destination node, and identifies the malicious node in the phase of routing discovery to prevent its further destruction. Combined with the above three innovations, the NAODV routing protocol is proposed. The simulation results show that the performance of the NAODV routing protocol in Ad-Hoc network has obvious advantages over other AODV routing protocols, such as packet delivery rate, delay, normalized routing overhead and route initiation frequency. In the aspect of Ad-Hoc network link prediction, a new LP-NAODV protocol is proposed to solve the problems of continuous movement of nodes, frequent disconnection of links, continuous routing reconstruction, excessive delay and overhead, and excessive number of routing failures in mobile Ad-Hoc network AODV. The link time prediction and route reconstruction are carried out, and the model of predicting link stability and backup mechanism is established. First, the Newtonian mean difference interpolation polynomial is used to predict the link disconnection time and the node residual time, and then the link duration is chosen as the link break time and the node residual time is smaller. Finally, when the link duration is less than the threshold, the backup routing is enabled and the route reconstruction is realized. Simulation results show that compared with AODV NAODV and PB-AODV, LP-NAODV decreases the number of routing failures and end-to-end delay and increases packet delivery rate.
【學位授予單位】：中國礦業(yè)大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：TN929.5

【參考文獻】

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

1 雷樹濤;;基于穩(wěn)定性和能量損耗率的改進AODV路由協(xié)議[J];信息通信;2016年02期

2 吳大鵬;傅象玖;張洪沛;王汝言;;節(jié)點狀態(tài)感知的延遲容忍網(wǎng)絡擁塞控制策略[J];電子學報;2016年01期

3 黃興利;慕德俊;李哲;焦利濤;黃一杰;;WSN節(jié)能問題中基于曲線擬合的插值算法研究[J];現(xiàn)代電子技術(shù);2016年01期

4 葉雪梅;許馨月;朱云杰;戴宇佳;蔡艷寧;范青剛;;基于SVM的VANET黑洞攻擊檢測方法[J];傳感器與微系統(tǒng);2015年06期

5 卜飛飛;鄔春學;;一種針對AODV協(xié)議黑洞攻擊的檢測策略[J];計算機應用與軟件;2015年05期

6 許炳昆;李艷萍;;移動Ad Hoc中基于位置輔助的鏈路穩(wěn)定性預測算法[J];計算機測量與控制;2015年02期

7 沈蘇彬;林闖;;專題前言:物聯(lián)網(wǎng)研究的機遇與挑戰(zhàn)[J];軟件學報;2014年08期

8 孫健;李宏智;郭靈波;陳升來;;VANET中一種安全消息擁塞控制機制[J];通信學報;2014年05期

9 張婧;;基于Ad Hoc的礦井巷道無線傳感器網(wǎng)絡路由協(xié)議分析[J];山西大學學報(自然科學版);2013年04期

10 王龍峰;;RAODV:一種基于擁塞跳數(shù)改進的AODV路由協(xié)議[J];計算機與現(xiàn)代化;2013年08期

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

1 顏利平;Ad-hoc網(wǎng)絡中改進AODV路由協(xié)議的研究[D];哈爾濱工業(yè)大學;2011年

，

本文編號：1827134