AODV和AOMDV路由协议性能分析与比较

移动无线自组网(MANET)作为一种典型的自组织网络,其路由协议一直是研究的重点。介绍了无线自组网按需平面距离矢量路由(AODV)协议和无线自组网按需多路径距离矢量路由(AOMDV)协议的特点,在NS2模拟软件中使用多种测试场景和不同的介质访问控制(MAC)层协议对这两种路由协议的性能进行了测试和分析。实验结果表明,AOMDV协议在平均延时和路由发现频率上优于AODV协议,在分组投递率和归一化路由开销方面的性能低于AODV协议。     

异构网络中的改进AODV协议

研究异构网络环境下各种通信方式之间的数据传输问题,提出一种改进的无线自组网按需平面距离矢量路由(AODV)协议。利用不同网络间的互补特性,使各种网络互相协同,提供通用的网络服务,从而实现异构网络间的数据传输。实验结果表明,在通信负载增加的情况下,该协议能降低网络拥塞、减少端到端时延以及提高数据包投递率。     

AODV路由算法的多播通信

ah—hoc网络具有网络拓扑结构易变的特性，苒加上移动网络本身具有的通信带宽有限，电池能源有限等特性。使得设计适合ad-hoc的路由协议具有一定的难度。AODV（Ad Hoc On—demand Distance Vector）是现在被广泛应用于adhoc网络中的一种按需路由算法，并且还设计了多播功能。多播是指一次给一个有明确定义的组发送消息。AODV的多播功能是路由器通过建立多播书树的方法实现的。本文主要介绍AODV路由协议算法的多播通信，其中详细介绍了多播树的建立过程和维护过程。并且选取传输半径和发包率为参     

A virtual subnet scheme on clustering algorithms for mobile ad hoc networks

Resolving the broadcast storm problem is an important issue in mobile ad hoc networks (MANETs). In this paper, we propose an approach for constructing a virtual subnet whose nodes are logically related. The virtual subnet can be spread upon clusters of a MANET. An intelligent agent with a routing filtering table is proposed to assist the best known clustering algorithms, the original Least ID algorithm and the original Highest Connection Cluster (HCC) algorithm, to improve group communication efficiency. Our simulation covers the network factors of hop count, deprave rate, and delay time. The simulation results show that when the proposed intelligent agent is used with the HCC algorithm, the delay time was reduced by 81.84% as compared with flooding, and by 49.25% as compared with the Ad Hoc On-Demand Distance Vector (AODV) routing algorithm. The delay time for the Least ID algorithm assisted by the proposed agents reduced by 81.84% compared to that of flooding and by 50% compared to that of AODV.     

无线移动自组织网路由协议性能研究

路由是无线移动自组织网的关键技术之一。目前已经提出的MANET路由协议有很多种，因此如何针对一定应用场景选择一个最佳的路由协议，是人们十分关心的一个问题。该文对已经通过IETF认可的三种MANET路由协议：DSR、AODV和OLSR进行了仿真对比分析。设计了大量的场景，通过对路由协议的分组传送率、端到端时延和所选路径长度等指标的比较，得出了在不同的网络环境下MANET最佳路由协议选择方案。仿真中发现同是采用按需的路由发现策略的DSR和AODV在高移动、高负荷的网络环境下的性能存在较大差异，对此原因进行了深入分析，并根据分析对DSR提出了改进方案。     

Enhanced AODV routing protocol for Bluetooth scatternet

Bluetooth is one of the most widespread technologies for personal area networks that allow portable devices to form multi-hop Bluetooth ad hoc networks, so called scatternets. Routing is one of the challenges in scatternets because of its impact on the performance of the network. It should focus on reducing the power consumption in the network because most of the nodes are battery-operated portable devices. In this paper, we propose a routing protocol for Bluetooth scatternets that customizes the Ad hoc On-Demand Distance Vector (AODV) routing protocol by making it power-aware and suitable for scatternets. It enhances the AODV flooding mechanism by excluding all non-bridge slaves from taking apart in the AODV route discovery process. In addition, it improves the AODV route discovery phase by considering the hop count, the predicated node’s power, and the average traffic intensity for each node as metrics for best route selection. By removing HELLO packets, our protocol reduces the control packets overhead and the power consumption in network devices. Simulation results show that the proposed protocol achieved considerable improvements over other enhanced AODV protocols by increasing the data delivery ratio by 10.78%, reducing the average end-to-end delay by 8.11%, and reducing the average energy consumption by 7.92%.     

MANET路由子层微移动管理

在采用无线自组网按需平面距离矢量(AODV)路由协议的移动自组网(MANET)网关设计中,针对MANET节点的微移动特性,提出应用于MANET路由子层的微移动管理策略,并在AODV路由协议中进行实现。在NS2平台上的仿真结果表明,采用微移动管理策略的MANET网关可有效降低MANET网络访问Internet的时延,并能减少MANET内控制报文的开销。     

Performance evaluation and comparison of different ad hoc routing protocols

A Mobile Ad Hoc Network (MANET) is a dynamic wireless network that can be formed without the need for any pre-existing infrastructure in which each node can act as a router. One of the main challenges MANET is the design of robust routing algorithms that adapt to the frequent and randomly changing network topology. In recent years, a variety of routing protocols have been proposed and several of these have been already extensively simulated or implemented as well. In this paper, we compare the performance of different protocols for ad hoc networks – Ad Hoc On-Demand Distance Vector Routing (AODV), Location-Aided Routing (LAR), Ad Hoc On-Demand Multipath Distant Vector (AOMDV) routing and Location-Aided Multipath Routing (LAMR). Therefore, we propose a location multipath routing-based method by extension of LAR. A simulation model with MAC and physical layer models is used to study interlayer interactions and their performance implications. The performance differentials are analyzed using varying network load and mobility. Simulations demonstrate the performance benefits of our proposal LAMR over LAR and AODV in most movement scenarios. AOMDV uses higher bandwidth than LAMR due to more frequent flooding of control packets. This paper directly discusses the performance evaluation and comparison of four routing protocols. Moreover, we also discuss the solutions for security in a MANET briefly, and address discussion and directions for future research.     

基于蚁群算法的Ad Hoc网络能量均衡路由协议

AdHoc网络路由协议的研究是AdHoe网络研究的重点之一,其中在节点能量、网络生命周期方面还存在问题有待解决。针对现有的路由算法对链路整体能量、单点能量之间的关系考虑的不足,该文综合分析链路平均能量与最小能量对网络生存期的影响,将链路平均能量与单点最小能量的乘积作为信息素的计算方法对蚁群算法进行改进,提出了基于蚁群算法的AdHoe网络能量均衡路由协议（ACEBR）。与AODV等协议进行对比,实验仿真结果表明,改进后的协议减少了节点的死亡数,延长了网络的生存周期。     

基于NS2的Ad Hoc网络路由协议性能比较分析

Ad Hoc网络是由一组移动节点在没有任何现存网络基础设施或是集中管理的情况下形成的动态网络.论文利用NS2网络仿真软件,在不同的网络负载、移动性和网络规模等条件下,分析比较Ad Hoc网络的四种路由协议DSR、AODV、DSDV和洪泛协议的性能.仿真结果表明由于各协议适用范围不同,因此可根据具体情况自适应地进行协议选择.     

一种基于位置和能量感知的MANET单播路由协议

能量消耗问题是MANET网络中研究的热点问题之一.针对基于位置的路由协议没有考虑节点剩余能量的问题,提出了一种结合位置信息和剩余能量的路由协议.本协议是在AODV[1]协议的基础上,提出了两个新的算法:基于位置的算法LBA(Location-Based Alaorithm)和动态能量控制的算法(DPC),并用NS2仿真比较了这两种协议.仿真结果表明,尽管改进的协议平均的端到端的延时增加,但是其能够明显地减少网络的总的耗能,平均了网络节点的耗能,延长了整个网络的寿命.     

一种基于跨层功率控制的Ad hoc网络路由算法*

在无线Ad Hoc网络路由协议中引入功率控制不但可以降低网络能量消耗,同时还能改善网络的吞吐量、投递率等性能,已成为当前Ad Hoc网络的一个研究热点.本文提出了一种基于跨层功率控制的按需路由算法CPC-AODV(Cross-layer Power Control Ad hoc On-demand Distance Vector).算法按需建立多个不同功率级的路由,节点选择到目的节点最小功率级的路由来传递分组,并对网络层的数据分组、路由分组和MAC层控制帧的传输采用不同功率控制策略来降低能量消耗.仿真结果表明:算法有利于降低通信能量开销,延长网络寿命,提高网络投递率及改善网络时延.     

多信道无线Mesh网络的路由协议

针对单径路由协议不能充分利用多信道无线Mesh网络的信道资源的问题,提出了一种基于拥塞控制的并行多径路由协议PMRP。该协议将一个数据流分配到多条路径同时传输,当所有路径都发生中断时,才重新寻找路由;并采取相应的拥塞感知技术,避免拥塞节点再转发新的数据流。仿真结果证明：与无线自组网按需平面距离矢量路由协议（AODV）协议相比,PMRP在网络负载较大时,能有效地减小端到端延迟,提高数据包的成功投递率,增加网络的整体吞吐量。     

高能量节点驱动的按需距离矢量路由协议

无线自组织网络中的按需距离矢量路由协议(AODV)没有考虑到能量消耗的均衡性和网络生命期的问题。针对AODV的这一缺点,提出了一种高能量节点驱动的AODV协议(HN-AODV)。此协议将高能量节点驱动的策略应用于按需路由发现过程,尽量选择能量较高的节点来承担转发任务,以此来平衡网络能耗。仿真结果显示,HN-AODV在基本不降低数据传输性能的前提下,显著提高了网络生命周期。这种高能量节点驱动的方案同样可以运用在其它类似的反应式路由协议中。     

无线Ad hoc网络路由协议的分析比较

无线adhoc的路由算法是adhoc领域的研究难点。论文分析了四种路由协议DSDV、CGSR、AODV、DSR的机制,并进行了网络模拟试验,在网络时延、吞吐量、路由开销、平均跳数等方面进行了对比。试验结果表明按需路由在无线adhoc网络环境下具有更好的性能。     

基于定向广播的AODV控制报文抑制研究

AODV路由协议是通过全向广播请求报文和定时广播Hello报文来建立Ad Hoc网络的路由,但在路由发现阶段需要广播发送大量的请求控制报文,导致了协议性能的下降。针对此问题,提出了一种新的基于定向广播的路由协议,该协议通过定向广播发送请求报文,并根据节点的移动性动态调整Hello报文的发送时间间隔来减少报文的发送。理论分析和仿真结果表明,该方法能有效地减少控制报文的数量,减少路由负载,也显著提高了端到端时延、平均投递率等性能参数。     

基于链路状态的AODV路由协议改进

针对AODV协议运行时路由相对稳定的特点,提出一种AODV协议运行时优化方法。该方法通过Hello消息和邻居节点进行信息交换,根据路由跳数、节点电池电量和射频信号强度3个链路状态值动态选择最优路由,实现AODV协议的运行时优化。仿真实验结果证明,改进的路由协议能够有效增加数据包投递率,减少平均端到端延时。     

无线自组网路由协议研究及OPNET实现

无线Ad hoc网络是一种由节点任意移动、拓扑结构动态、随机且快速变化的自组网。由于其复杂性和多棒性,常规路由无法传输信息。所以自组网路由协议一直是无线网络研究中的热点之一,目前大多数无线Ad hoc网络采用AODV或DSR路由协议。对这两种路由协议在不同网络环境下的性能进行了进行比较,分析。并对AODV协议进行改进,仿真结果表明,改进的AODV路由协议增加了无线Ad hoc网络的吞吐量,降低了延时和路由开销,从而有效地提供了网络性能。     

移动Ad Hoc网络QoS路由研究

本文首先阐述了移动Ad Hoc网络的特点及应用。接着对当前的几种Ad Hoc网络的QoS主要路由协议进行了分析,特别是对IETF的MANET推荐的AODV路由协议作了详细的分析。并从路由机制、单向链路的支持、多播功能、QoS参数选择以及节能几个方面进行了比较和分析。     

A light-weight trust-based QoS routing algorithm for ad hoc networks

In a mobile ad hoc network (MANET), the lack of a trusted infrastructure makes secure and reliable packet forwarding very challenging, especially for providing QoS guarantee for multimedia applications. In this paper, we firstly introduce the concept of trust and QoS metric estimation into establishing a trust-based QoS model. In this model, we estimate the trust degree between nodes from direct trust computation of direct observation and indirect trust computation by neighbors’ recommendations. On the other hand, due to the NP-completeness of the multi-QoS constraints problem, we only take into account link delay as the QoS constraint requirement. Then, we design a trust-based QoS routing algorithm (called TQR) from the trade-off between trust degree and link delay. At last, by using NS2 we implement this algorithm based on AODV (Ad hoc On-demand Distance Vector). We compare its performance with AODV, Watchdog-DSR and QAODV. The simulation results show that TQR scheme can prevent attacks from malicious nodes and improve the security performance of the whole network, especially in terms of packet delivery ratio, average end-to-end delay, routing packet overhead and detection ratio of malicious nodes.