MANET中节点驻留时间对路由协议性能的影响

为了研究AODV,DSR和DSDV三种路由协议在MANET中运行恒定比特率FTP业务条件下的性能表现,使用NS仿真软件通过计算机仿真方法建立仿真模型,配置网络业务,运输层分别使用TCP协议和UDP协议对网络运行时的分组投递率和端到端时延等性能指标进行仿真分析。通过仿真分析发现,UDP通信时,DSR具有更高的分组投递率和更小的端到端时延;对于TCP传输而言,AODV比DSR和DSDV在分组投递率和端到端时延方面更有优势。所得结果对特定场合下MANET选择合适的路由协议具有指导意义,为进一步改进路由协议提供了参考依据。     

无线Ad Hoc网络中最佳分组长度问题的研究

为给无线Ad Hoc网络设计者提供参考依据，基于场景，用仿真方法研究了采用不同分组长度传输CBR业务时的网络性能，并给出了相应的最佳分组长度。仿真中采用了DSR路由协议。结果表明，在网络中的CBR连接数一定的情况下，有一个最佳的分组长度，当源节点以这个最佳分组长度发送业务时，网络性能最优；当采用的分组长度由苎佳长度逐渐减小时，网络性能很快变差；当采用的分组长度由最佳长度逐渐增加时，网络性能逐渐变差，但与最优的网络性能相差不大。     

"线性结构"Ad hoc网络DSR及AODV路由协议的性能

路由协议对Ad hoc网络的性能影响很大.为了给"线性结构"Ad hoc网络找到合适的路由协议,研究了DSR和AODV协议的工作原理,对比分析DSR和AODV协议共性和区别.采用OPNET仿真"线性结构"网络环境,对比分析DSR协议和AODV协议的网络性能.仿真结果表明,DSR协议在分组投递率和吞吐量比AODV协议好,DSR协议的路由负荷比AODV稍差.     

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

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

移动Ad-hoc经典路由协议仿真与比较

路由协议选择的方法一般是通过网络仿真器对不同协议进行对比分析,其结果作为协议选取的依据。该文以DSR协议为例,介绍了仿真过程的详细步骤,并对Ad hoc网络经典路由协议DSR和AODV协议进行对比分析。结果表明,在动态的环境下,AODV的分组投递率和路由负载优于DSR路由协议。     

Ad hoc网络按需路由协议性能仿真

介绍了Ad hoc网络中使用的AODV及DSR路由协议,针对Adhoc网络移动的机动性、分组发送的随机性、节点数目的不确定性及发送分组大小的可变性,对文中所采用的仿真场景进行了实用化的改进,并利用OPNET进行了大量的仿真,给出了AODV和DSR两种路由协议性能的仿真结果。     

Ad hoc网络按需路由协议性能仿真

介绍了Ad hoc网络中使用的AODV及DSR路由协议,针对Ad hoc网络移动的机动性、分组发送的随机性、节点数目的不确定性及发送分组大小的可变性,对文中所采用的仿真场景进行了实用化的改进,并利用OPNET进行了大量的仿真,给出了AODV和DSR两种路由协议性能的仿真结果。     

自组织网络按需路由协议性能仿真

介绍了Adhoc网络中使用的AODV及DSR路由协议,针对Adhoc网络移动的机动性.分组发送的随机性,节点数目的不确定性及发送分组大小的可变性,对丈献[1]所采用的仿真场景进行了实用化的改进,并利用OPNET进行了大量的仿真,给出了AODV和DSR两种路由协议性能的仿真结果.     

基于QualNet仿真软件的Ad Hoc路由协议的比较

本论文主要研究的是在QualNet网络仿真软件中比较Ad Hoc网络的两种路由协议:AODV和DSR。Ad Hoc网络是由一组带有无线收发装置的移动终端组成的一个多跳的临时性自治系统,因此,路由协议直接影响了Ad Hoc网络的工作状态及其性能水平。Ad Hoc路由协议主要分为表驱动路由协议和按需路由协议,AODV和DSR属于按需路由协议。本文在QualNet的平台上搭建了Ad Hoc网络模型,并就AODV和DSR这两种路由协议进行了网络仿真,包括不同网络负载情况下的路由协议收敛速度、分组发送成功率、网络吞吐量、端对端延时和抖动等参数指标,分析了两种路由协议的性能。     

基于NS2仿真的AODV和DSR路由协议性能的比较与分析

针对Ad hoc网络中两种路由协议AODV和DSR,用NS2网络环境模拟器对分组投递率和归一化路由开销两个性能指标进行了仿真,分析和对比这两种路由协议在不同的通信模型和移动模型条件下的性能表现。NS2仿真结果表明,两种路由协议AODV和DSR,节点越大,分组投递率越高。节点数大的,路由开销较为平稳。在艰难的作战环境下,AODV协议表现得更加有效,而在相对平稳的环境下,DSR协议表现得更好。     

一种基于OLSR的新型层次路由算法*

提出了一种新型的基于OLSR的层次化改进算法HOLSR,旨在提高OLSR的整体效率。该算法通过分层设置洪泛范围和灵活调整各层拓扑控制分组的更新周期,降低路由执行开销;同时采用差值路由补偿技术提高数据分组的传输效率。仿真实验结果表明：HOLSR与OLSR路由算法相比,数据分组成功传输率高,端到端延迟小,路由协议开销少;与DSR、AODV、DSDV等典型路由算法相比,在不同节点移动速度和不同通信负载下,综合性能也有优势,尤其在通信负载较大时（880 kbps）,优势更加明显。     

Impact of a simple load balancing approach and an incentive-based scheme on MANET performance

Most reactive mobile ad hoc network (MANET) routing protocols such as AODV and DSR do not perform search for new routes until the network topology changes. But, low node mobility does not affect the MANET connectivity and the same routes may be used for a long time. This may cause concentration of traffic on few mobile stations (MSs), which results in congestion and hence longer end-to-end delay. In addition, continuous use of MSs may cause their battery power to get exhausted rapidly. Expiration of MS energy causes disruption of connections traversing through the MSs and could generate many simultaneous new routing requests. Therefore, we propose a load balancing approach called Simple Load Balancing Approach (SLBA), which can be transparently added to any current reactive routing protocol such as AODV and DSR. SLBA minimizes the traffic concentration by allowing each MS to drop RREQ or to give up packet forwarding depending on its own traffic load. Meanwhile, MSs may deliberately give up forwarding packets to save their own energy. For encouraging MSs to volunteer in forwarding packets, we introduce a reward scheme for packet forwarding, named Protocol-Independent Fairness Algorithm (PIFA). We compare the performance of AODV and DSR with and without SLBA and PIFA. Simulation results indicate that SLBA can distribute traffic very well and improve the MANET performance. PIFA is also observed to prevent MANET partitioning and any performance degradation due to selfish nodes.     

基于NS2的Ad Hoc网络TCP路由仿真及性能比较

Ad Hoc网络由于其无中心、自组织的特点目前已得到广泛关注。本文首先介绍Ad Hoc网络中3种典型路由协议AODV、DSDV、DSR的基本原理,然后采用网络仿真软件NS2对3种协议进行模拟,其中,仿真场景通过分别改变网络中节点的数目、节点的停留时间而分为两类。本文流量模型选用的是TCP代理中的FTP应用,而传统多采用UDP代理中的应用。最后,在给定的场景下,对网络端到端时延、路由开销、分组投递率3种指标进行仿真,通过性能评估后给出比较结论。     

Randomized dynamic route maintenance for adaptive routing in multihop mobile ad hoc networks

Several approaches have been proposed for designing multihop routing protocols in mobile ad hoc networks (MANET). Many of them adopt a method, called flooding, to discover a routing path. Due to the time-varying nature of the route in MANET, the discovered route needs to be dynamically maintained for optimality in terms of traffic load, hop-distance, and resource usage. It is easy to see that flooding incurs significant overhead and hence is inappropriate for the dynamic route maintenance. In this paper we propose a randomized, dynamic route maintenance scheme for adaptive routing in MANET. The scheme makes use of a nomadic control packet (NCP) which travels through the network based on a random walk, and collects its stopovers as a traversal record. The NCP uses the traversal record to probabilistically provide the nodes with clue for routing path updates. From the clue, the nodes can find the routing path update information that is up-to-date and optimal (less-loaded and shorter), thereby adapting to the dynamic network topology and traffic load conditions. We present an analytical model for measuring the effectiveness of NCP in terms of its frequency of visits and probability of finding the clue from the NCP traversal record. The proposed randomized scheme serves as a routing protocol supporting layer and can be easily applied with minimum modifications to the existing on-demand routing protocols such as AODV and DSR. In our experimental study, we modified the AODV protocol to maintain routing paths using NCPs’ traversal record. Simulation results show that NCPs help the routing protocol to notably reduce average end-to-end packet delay with increased route optimality and better control on traffic congestion.     

Congestion Adaptive Routing in Mobile Ad Hoc Networks

Mobility, channel error, and congestion are the main causes for packet loss in mobile ad hoc networks. Reducing packet loss typically involves congestion control operating on top of a mobility and failure adaptive routing protocol at the network layer. In the current designs, routing is not congestion-adaptive. Routing may let a congestion happen which is detected by congestion control, but dealing with congestion in this reactive manner results in longer delay and unnecessary packet loss and requires significant overhead if a new route is needed. This problem becomes more visible especially in large-scale transmission of heavy traffic such as multimedia data, where congestion is more probable and the negative impact of packet loss on the service quality is of more significance. We argue that routing should not only be aware of, but also be adaptive to, network congestion. Hence, we propose a routing protocol (CRP) with such properties. Our ns-2 simulation results confirm that CRP improves the packet loss rate and end-to-end delay while enjoying significantly smaller protocol overhead and higher energy efficiency as compared to AODV and DSR     

基于链路稳定度的车载网路由协议研究

针对车载网中节点移动速度快,拓扑结构变化速度快的特点,以及AODV协议广播式路由链路存活时间短、平均端到端时延大等问题,提出了一种通过计算链路稳定度的方式来改进AODV协议.在节点进行广播时,首先计算转发角度,然后,再将投影最长和链路生存时间最长作为综合选择条件,以此高效地选择路径相对较短以及链路相对稳定的路由.通过这种方式,改进后的AODV协议很好地解决了网络中链路易断裂的问题,提高了数据包的投递率,降低了平均端到端的时延.利用NS2仿真软件进行性能仿真,结果表明:改进后的AODV协议在包递率、平均时延和吞吐量方面优于传统模型.     

多路径DSR和AODV路由协议性能研究

在支持移动节点和自组织网络的路由协议中,最典型的单径路由协议是DSR和AODV协议,对它们进行扩展分别得到相应的多径路由协议。通过仿真比较分析这2种多径路由协议在混合无线Mesh网络和移动AdHoc网络中的性能。结果显示,混合无线Mesh网络中的这2种多径路由协议具有分组传输率高、端到端的平均延时和路由开销小等优点。以DSR协议为基础扩展得到的多径路由协议,在高度动态的网络环境中,性能得到了改善,能广泛应用于移动性强的环境中。     

Performance evaluation for on-demand routing protocols based on OPNET modules in wireless mesh networks

In wireless networks, users expect to get access to the network securely and seamlessly to share the data flow of access points anytime and anywhere. However, either point-to-point or point-to-multipoint methods in traditional wireless networks make the network bandwidth decrease rapidly, which cannot meet the requirements of users. Recently, a new wireless broadband access network, wireless mesh networks (WMNs), has emerged. As one of the key technologies in WMNs, wireless routing protocols plays an important role in performance optimization of WMNs. Therefore, in this paper, we address the on-demand routing protocols by focusing on dynamic source routing (DSR) protocol and ad hoc on-demand distance vector (AODV) routing protocol in WMNs. Then, we use the OPNET modules to establish the simulation models of DSR and AODV protocols in WMNs. Simulation and results show that, DSR protocol that is based on the dynamic source routing is not suitable for wireless transmission, while AODV routing protocol that is based on the purpose-driven routing is suitable for wireless transmission with rapid change of network topology.