移动Ad hoc网络低开销AODV路由算法改进研究

发布时间：2018-04-28 15:58

本文选题：移动Ad + hoc网络　；参考：《天津理工大学》2017年硕士论文

【摘要】：移动Ad hoc网络(Mobile Ad hoc Network,MANET)是由一系列具有无线收发装置的移动节点组成的多跳临时性自组织网络。Ad hoc按需距离矢量(Ad hoc On-Demand Distance Vector,AODV)路由协议是MANET使用最广泛的路由协议之一。AODV路由协议的路由发现阶段采用简单广播(泛洪)机制实现路由请求消息的传播。当MANET节点密度较大时,AODV协议在路由发现阶段会因为路由开销增大而引发广播风暴问题;AODV路由协议的路由维护阶段实现路径断裂后的路由修复,其缺陷会引起数据包丢失的增加和路由开销的增大。本文对解决上述问题进行了深入探讨,主要研究内容包括:1.针对路由发现过程中广播引起的广播风暴问题,本文提出了一种地理位置辅助的概率广播路由算法(Location-Aided Probabilistic Broadcast,LAPB)。LAPB算法基于节点的地理位置信息与邻节点信息,动态地调整位于特殊区域内的节点的广播概率,并以此概率值选择最高效的节点广播路由请求消息;目的节点根据跳数与时延从多条路由中选择最优路由。仿真结果表明在保证建立可靠路由的条件下,LAPB路由算法可以有效减少路由开销和路由发现时延。2.针对路由维护过程中AODV协议会造成路由开销增大和数据包丢失率高的问题,提出了一种预测辅助的路由算法(Prediction-Aided Routing,PAR)。PAR算法利用节点在路由中不同的位置分布制定了路由维护所需时间的预测方法,并根据节点具体的路由维护方式计算判决发起路由维护的能量阈值,使节点提前修复即将断裂的路由。仿真分析表明在保证网络可靠性的基础上对比传统预测算法,PAR降低了3~5%的网络路由开销。
[Abstract]:Mobile Ad hoc Network Manet is a multi-hop ad hoc network, composed of a series of mobile nodes with wireless transceiver devices. Ad hoc on-demand distance vector Ad hoc On-Demand Distance vector AODV) routing protocol is the most widely used routing protocol for MANET. In the routing discovery phase of AODV routing protocol, simple broadcast (flooding) mechanism is used to propagate the routing request message. When the density of MANET nodes is high, the routing maintenance phase of the MANET routing protocol may cause broadcast storm due to the increase of routing overhead. The defect will cause the increase of packet loss and the increase of routing overhead. This article has carried on the thorough discussion to solve the above question, the main research content includes: 1. In order to solve the broadcast storm problem caused by broadcast in the course of routing discovery, this paper proposes a geographical location aided probabilistic broadcast routing algorithm named "Location-Aided Probabilistic broadcast LAPBU. LAPB" algorithm based on node location information and neighbor node information. The broadcast probability of nodes located in a special region is dynamically adjusted and the most efficient routing request message is selected according to the value of the probability. The destination node selects the optimal route from multiple routes according to the number of hops and the delay. Simulation results show that LAPB routing algorithm can effectively reduce routing overhead and routing discovery delay. In order to solve the problem of high routing overhead and high packet loss rate caused by AODV protocol during routing maintenance, In this paper, a prediction-aided routing algorithm (Prediction-Aided routing PAR.PAR) is proposed to predict the time required for routing maintenance by using different locations of nodes in the route. The energy threshold of initiating route maintenance is calculated according to the specific route maintenance mode of the node, so that the node can repair the route that is about to break ahead of time. The simulation results show that the network routing overhead is reduced by 3% or 5% compared with the traditional prediction algorithm (PPAR) on the basis of network reliability.
【学位授予单位】：天津理工大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TN929.5

【相似文献】