抵御黑洞攻击的牛顿插值备份路由协议研究

发布时间：2018-05-01 01:29

本文选题：无线移动网络 + 拥塞控制　；参考：《中国矿业大学》2017年硕士论文

【摘要】：物联网概念的提出,很大程度上加快了无线网络的发展。Ad-Hoc网络由分组无线网络发展而来,之后国内外掀起一阵研究Ad-Hoc网络的热潮。路由协议是网络数据发送与接收的基础,国内外学者已对Ad-Hoc网络中路由协议进行多方面研究,并取得颇多成果,但并未有一项研究将拥塞控制、网络安全及链路预测结合起来整体提升网络性能。本文对Ad-Hoc网络中AODV路由协议(Ad hoc On-demand Distance Vector Routing)进行研究,采取四种措施优化AODV路由协议,提升分组投递率、降低网络时延、减少路由失败的个数。本文的主要研究内容及创新点如下:在Ad-Hoc网络拥塞控制方面,一改以往AODV建立路由的过程不考虑网络拥塞只选择跳数最短的一条足够新的路由,提出选择缓冲区队列利用率最低的一条路由代替跳数最短的路由做为最优路由传输数据。该方法通过改变AODV中的路由请求、路由应答和路由维护过程实现,方法中设置参数计算缓冲区队列利用率,反映网络的拥塞程度。在Ad-Hoc网络AODV中,RREQ、RREP的不断发送与接收是造成AODV开销大的主要原因。文章通过减少路由分组发送的次数及降低路由过期时间两种方法减少RREQ、RREP的发送次数,以达到减小开销,降低时延的目的。在Ad-Hoc网络AODV的安全性方面,文章针对单节点的黑洞攻击,提出一种有效检测恶意节点的方法。该方法只修改源节点的工作方式,不改变中间节点和目的节点的工作方式,在路由发现阶段识别出恶意节点,阻止其进一步的破坏活动。结合以上三个创新点提出NAODV路由协议,仿真实验表明,Ad-Hoc网络中NAODV路由协议的分组投递率、时延、归一化路由开销、路由发起频率等性能相比其他AODV路由协议都有明显优势。在Ad-Hoc网络链路预测方面,针对移动Ad-Hoc网络AODV中节点不断运动,链路频繁断开,路由不断重建,造成延时和开销过大、路由失败个数过多等问题,提出一种新的LP-NAODV协议,进行链路时间预测与路由重建,建立预测链路稳定性与备份机制结合的模型。首先使用牛顿均差插值多项式分别进行链路断开时间和节点剩余时间预测;其次选择链路断开时间与节点剩余时间较小者为链路持续时间;最后当链路持续时间小于阈值时启用设置好的备份路由,实现路由重建。仿真实验表明,与AODV、NAODV和PB-AODV三种协议相比,LP-NAODV在发送分组速率改变时,路由失败个数和端到端的延时明显减少,分组投递率明显增大。
[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.
【学位授予单位】：中国矿业大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TN929.5

【参考文献】