高动态Ad Hoc路由协议性能分析

Ad Hoc网络是一种没有固定设施的无线移动自组织网络,动态变化的拓扑结构对路由协议的性能有着重要影响。研究了动态源路由(DSR)协议、Ad Hoc按需距离矢量(AODV)路由协议和最优链路状态路由(OLSR)协议3种传统路由协议,利用OPNET软件作为仿真工具,设计了2种不同网络规模条件下空中飞行平台网络拓扑结构背景的高动态仿真方案,通过比较网络时延、归一化网络吞吐量、路由负载和数据传送成功率,分析了它们的性能。仿真结果表明,OLSR协议的综合性能优于其它协议,更适合于节点高速移动且网络拓扑结构频繁变化的Ad hoc网络,并为下一步研究打下基础。     

Ad Hoc网络中一种新的多径路由机制研究

基于AODV(Ad Hoc on demand distanceVector)提出了一种新的按需多径矢量路由协议模型TRND-AODV(TreeRoot Node Disjoint Ad-Hoc On Demand distance Vector),旨在增强路由的健壮性,增强网络对拓扑变化的适应能力。通过对AODV路由协议发现过程的修改,能够在源节点和目的节点间提供多条节点分离的无环链路。仿真结果表明,该协议模型能有效地减少路由开销、加快数据包的转发速度。     

基于路由表条目删除机制的分类简化AODV

针对按需距离矢量路由协议AODV(Ad Hoc On-demand Distance Vector)在网络拓扑变化迅速性能快速下降的弊端,提出了一种路由改进方案。在节点稳定性比较低时,直接删除该节点的所有路由表条目,从而减少路由维护的代价,并对链路进行分类与细化处理,简约路由协议。     

Ad Hoc网络中两种按需路由协议的比较

Ad hoc网络的特征是多跳的无线连接，网络拓扑的频繁变化，以及需要有效的动态路由协议。重点比较Ad hoc网络中两种主要的按需路由协议：动态源路由（DSR）协议和Ad hoc按需距离矢量路由（AODV）协议。尽管DSR和AODV都是按需路由协议，但不同的协议机制导致了网络性能的显著差异。在OPNET仿真平台下，对采用不用路由协议的网络时延和吞吐量进行比较，从而分析不同的路由机制引起的网络性能差异。     

基于链路可用性预测的AODV路由协议研究

传统的AODV路由协议无法适应Ad hoc网络拓扑的高度动态变化.对AODV路由算法进行链路可用性预测扩展,节点通过接收分组的能量值和链路连续可用时间选择最可靠的路径进行路由,并在链路真正失效之前启动预先修复过程.仿真结果表明,改进后的AODV协议提高了分组的投递率,降低了分组端到端平均传输延时,路由协议的可靠性得到改进.     

Ad Hoc网络中一种基于灰色关联算法的路由协议

针对移动Ad Hoc网络中节点任意移动、网络拓扑频繁变化导致以最小跳数作为路由选择机制的AODV路由协议面临频繁连接中断而造成网络QoS下降的问题,文章综合节点的剩余电量、剩余队列长度和源节点到目的节点的跳数三个跨层信息,提出一种基于灰色关联算法的改进AODV路由协议(GRA-AODV)。仿真结果显示:相比于改进前的AODV协议,改进之后的GRA-AODV(Gray Relevance AlgorithmAODV)协议在稍微增加路由开销的情况下,具有更低的平均端到端时延和更低的分组丢失率,在拓扑频繁变化的移动Ad Hoc网络中具有较好的鲁棒性。     

移动Ad hoc网络中基于链路稳定性预测的按需路由协议

移动Ad hoc网络拓扑的高度动态变化是造成传统按需路由协议的路由频繁通断的主要原因,因此在传统按需路由协议的基础上进行链路稳定性预测扩展,增强路由稳定性具有十分重要的意义。该文利用分组的接收功率把节点间的相对运动划分为靠近和远离两种类型,然后在不同相对运动类型下根据节点间距离得到了的链路平均维持时间。在路由过程中,中间节点利用得到的链路平均维持时间设置请求报文的转发延迟,通过一定转发规则选择稳定性较强的链路构成路径。仿真结果表明进行链路稳定性预测扩展后的按需路由协议能够有效增强路由的稳定性,并提高网络性能。     

Ad Hoc网络中拓扑结构对路由协议性能的影响

介绍了Ad Hoc网络中常见的三种路由协议DSDV、DSR和AODV,针对网络拓扑结构的变化,设计了两种仿真方案,利用NS2仿真工具对三个协议进行了仿真。通过分析报文投递率和平均端到端时延比较了三个协议的性能。仿真结果表明,AODV具有优秀的综合性能,更适合于节点移动速度快且网络拓扑结构变化频繁的网络。     

一种Ad Hoc网络单径和多径路由的选择算法

主要分析了Ad Hoc网络中单径路由协议和多径路由协议的特点。从路由中断时所传输分组的丢失率角度考虑,提出了一种单径路由和多径路由的路由协议选择算法。该算法考虑了由于网络的动态拓扑导致链路频繁失效时,原有路由中各节点缓存的分组会被丢弃的特征,通过选择合适的路由协议,降低分组的丢失概率,提高网络效率。     

MANET中基于AODV的跨层多度量路由协议

针对无线自组网按需平面距离向量路由协议(AODV)路由度量的单一化而引起的节点能耗枯竭,形成的网络区域化以及路径拥塞问题,提出一种多度量路径选择机制的路由协议――M-AODV。以AODV路由协议为基础,在路由发现阶段,根据设定的能量阈值和接收信号强度阈值选择能量较高和信号强度较强的节点作为路由节点;在路径选择阶段,首先根据物理层的接收信号强度、拥塞度和跳数计算每段链路稳定值,其次将每段路径稳定值进行累加得到整条路径的稳定值,最后选择稳定值最大的路径作为最优路径。使用NS2.35仿真软件仿真,结果表明：改进后的协议与AODV相比在端到端延时缩短了近30%,在数据包传输率、吞吐量和节点存活率方面优于AODV和I-AODV-SE路由算法。     

基于移动性的AODV路由协议改进

介绍了Ad Hoc网络路由协议（Ad Hoc On-Demand Distance Vector Routing,AODV）的路由机制和特点,提出了一种基于AODV的改进协议V-AODV。V-AODV改进了AODV的路由测度,用量化的节点移动性代替跳数作为路由代价的度量,在动态网络中能够选取到更加稳定的路由。仿真表明,V-AODV比AODV在时延和重传次数等性能上都有一定程度的提升。     

基于IEEE802.11 DCF的链路预先修复AODV路由协议

基于无线自组织网络中普遍使用的底层通信协议IEEE802.11 DCF,针对广泛应用于无线自组织网络中的路由协议(AODV),提出了一种链路预先修复算法。该算法首先推算了DCF协议中的不稳定传输范围,然后通过MAC层与路由层的跨层协作,在下一跳节点移动在不稳定传输范围时就事先采取相应的路由修复措施。相对于AODV中采用节点周期性地发送HELLO消息来监测邻居节点变化的方法,该算法更为高效及时。仿真结果表明,该算法能够有效的减小端到端时延,保障了投递率。     

DOA: DSR over AODV Routing for Mobile Ad Hoc Networks

We present a lightweight hierarchical routing model, Way Point Routing (WPR), in which a number of intermediate nodes on a route are selected as waypoints and the route is divided into segments by the waypoints. Waypoints, including the source and the destination, run a high-level intersegment routing protocol, while the nodes on each segment run a low-level intrasegment routing protocol. One distinct advantage of our model is that when a node on the route moves out or fails, instead of discarding the whole original route and discovering a new route from the source to the destination, only the two waypoint nodes of the broken segment have to find a new segment. In addition, our model is lightweight because it maintains a hierarchy only for nodes on active routes. On the other hand, existing hierarchical routing protocols such as CGSR and ZRP maintain hierarchies for the entire network. We present an instantiation of WPR, where we use DSR as the intersegment routing protocol and AODV as the intrasegment routing protocol. This instantiation is termed DSR over AODV (DOA) routing protocol. Thus, DSR and AODV—two well-known on-demand routing protocols for MANETs—are combined into one hierarchical routing protocol and become two special cases of our protocol. Furthermore, we present two novel techniques for DOA: one is an efficient loop detection method and the other is a multitarget route discovery. Simulation results show that DOA scales well for large networks with more than 1,000 nodes, incurring about 60 percent-80 percent less overhead than AODV, while other metrics are better than or comparable to AODV and DSR.     

AODV、AOMDV和AODV-UU路由协议性能仿真与分析

使用NS-2(Network Simulator Version 2)仿真软件,选取分组投递率、端到端平均时延、归一化路由开销和路由发现频率4个指标对按需距离矢量路由(AODV,Ad hoc On-Demand Distance Vector Routing)、多径按需距离矢量路由(AOMDV,Ad Hoc On-Demand Multipath Distance Vector Routing)和乌普萨拉大学开发的按需距离矢量路由(AODV-UU,Ad Hoc On-Demand Distance Vector Routing developed by Uppsala University)进行了性能仿真,通过改变节点最大运动速度和业务源连接对数分析比较这些参数对3个协议性能的影响,研究结果表明了AODV-UU协议的优越性。并提出了对AODV-UU协议的改进。     

基于NS2的智能集装箱网络路由协议的研究简

由于传统集装箱是由金属制造的,所以集装箱的箱与箱之间的信号屏蔽作用特别明显,以至于位于箱堆内侧的集装箱信息无法得到有效采集。严重影响了智能集装箱的实时监控操作。针对这种问题,文中结合了现实集装箱堆场管理的需求。提出了一种可行的智能集装箱网络路由协议CNRP（Container Network Routing Protocols）,并利用NS2网络仿真软件．进行了该协议与典型的网络路由协议AODV、DSR、DSDV的性能比较,实验结果表明该路由协议具有低能耗、短时延的特点。更加适合于3D—Mesh集装箱网络。     

一种加入入侵检测的可信AODV方案

可信的AODV路由协议（Trusted Ad hoc On Demand Distance Vector Routing Algorithm,TAODV）是一种在AODV中加入信任机制的协议,对路由传输中网络层数据的安全性传输起到一定的改进作用。单个入侵检测（Single Intrusion Detection,SID）即一个节点持续地监听邻居节点间的信息交互,计算出邻居节点的信任值,增加了网络对于恶意行为的敏感度,从而能以最快的速度找到最佳路由。在TAODV中加入SID单元可以大大提高网络的传输效率,降低丢包率,更快地找到安全可靠并且距离最短的路由。     

Integrating machine learning in ad hoc routing: A wireless adaptive routing protocol

The nodes in a wireless ad hoc network act as routers in a self‐configuring network without infrastructure. An application running on the nodes in the ad hoc network may require that intermediate nodes act as routers, receiving and forwarding data packets to other nodes to overcome the limitations of noise, router congestion and limited transmission power. In existing routing protocols, the ‘self‐configuring’ aspects of network construction have generally been limited to the construction of routes that minimize the number of intermediate nodes on a route while ignoring the effects that the resulting traffic has on the overall communication capacity of the network. This paper presents a context‐aware routing metric that factors the effects of environmental noise and router congestion into a single time‐based metric, and further presents a new cross‐layer routing protocol, called Warp‐5 (Wireless Adaptive Routing Protocol, Version 5), that uses the new metric to make better routing decisions in heterogeneous network systems. Simulation results for Warp‐5 are presented and compared to the existing, well‐known AODV (Ad hoc On‐Demand Distance Vector) routing protocol and the reinforcement‐learning based routing protocol, Q‐routing. The results show Warp‐5 to be superior to shortest path routing protocols and Q‐routing for preventing router congestion and packet loss due to noise. Copyright © 2011 John Wiley & Sons, Ltd.     

AODV routing overhead analysis based on link failure probability in MANET

This article puts forward an Ad-hoc on-demand distance vector routing(AODV)routing overhead analysis method in mobile Ad-hoc network(MANET).Although multiple routing protocols have been proposed to improve the performance,scarcely any paper analyzed the routing overhead caused by routing setup and maintenance processes in mathematical way.Routing overhead consumes part of network resources and limits the supported traffic in the network.For on-demand routing protocols like AODV,the routing overhead depends on the link failure probability to a great extent.This article analyzes the collision probability caused by hidden-node problem and the impact on link failure probability.In chain and rectangle scenarios,it presents a mathematical analysis of the theoretical routing overhead of AODV protocol based on link failure probability.Simulations on OPNET 14.5platform match well with the theoretical derivation which confirms the effectiveness of the analysis method.     

Security upgrade against RREQ flooding attack by using balance index on vehicular ad hoc network

VANET is an ad hoc network that formed between vehicles. Security in VANET plays vital role. AODV routing protocol is a reactive or on-demand routing protocol which means if there is data to be send then the path will create. AODV is the most commonly used topology based routing protocol for VANET. Using of broadcast packets in the AODV route discovery phase caused it is extremely vulnerable against DOS and DDOS flooding attacks. Flooding attack is type of a denial of service attack that causes loss of network bandwidth and imposes high overhead to the network. The method proposed in this paper called Balanced AODV (B-AODV) because it expects all network node behave normally. If network nodes are out of the normal behavior (too much route request) then they identified as malicious node. B-AODV is designed with following feature: (1) The use of adaptive threshold according to network conditions and nodes behavior (balance index) (2) Not using additional routing packets to detect malicious nodes (3) Perform detection and prevention operations independently on each node (4) Perform detection and prevention operations in real time (5) No need for promiscuous mode. This method for detection and prevention flooding attack uses average and standard deviation. In this method each node is employing balance index for acceptation or rejection RREQ packets. The results of the simulation in NS2 indicates B-AODV is resilience against flooding attack and prevent loss of network bandwidth. Comparing between AODV with B-AODV in normal state (non-attacker) shows B-AODV is exactly match with AODV in network performance, this means that the B-AODV algorithm does not impose any overhead and false positive to AODV.