Ad Hoc网络路由协议性能分析

介绍了移动自组网的表驱动和按需驱动两类路由协议.提出了定量评估网络路由协议性能的六个基本指标.利用网络仿真器NS-2,对四种典型的路由协议(DSR、DSDV、AODV和TORA)建立仿真模型,配置仿真参数,并进行了仿真.对仿真过程产生的文档进行处理,分析,比较它们的性能指标.试验结果表明,模型仿真结果接近理论分析和实际情况,该方法在路由协议研究,设计与仿真方面具有较强的实用性和通用性.     

无线网络路由协议性能的研究与仿真

文章简要介绍自组网中常用的路由协议,利用网络仿真软件NS2对DSDV、DSR和AODV路由协议进行仿真,通过不同仿真场景计算出路由协议的第一个包收到时间、平均延时和包投递率.结果表明DSDV路由协议适合用于节点静止的网络场景,在移动环境下使用AODV和DSR路由协议有更好的网络性能.     

移动自组网典型路由协议的性能分析与比较

分析了移动自组网的先应式路由协议DSDV和按需路由协议AODV与DSR,并通过网络仿真软件ns2进行了仿真实验,对其分组投递率,端到端平均时延、吞吐量、路由开销等方面的性能进行了分析和比较.实验结果表明,按需路由协议具有更好的性能.     

移动自组网典型路由协议研究

随着网络的发展,移动自组网已成为当前研究的热点,文中介绍了移动自组网与现有通信系统在路由上的区别,重点探讨了移动自组网DSDV、AODV、DSR等几类典型的路由协议,以及MANET路由协议今后的主要研究方向。     

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

A d Hoc网络的路由协议是A d Hoc网络研究的关键问题,对于研究A d Hoc网络是至关重要的。本文采用网络仿真软件N S2评价移动自组网的路由协议。通过实例仿真,利用编写的脚本程序,对仿真结果进行分析,从而对移动自组网路由协议AODV(自组网按需路由协议)、DSR(动态源路由)以及DSDV(基于目的序号和距离矢量路由)的性能参数进行比较。     

移动自组网路由协议在3G速率下性能分析

本文研究了两种典型的移动自组网路由协议AODV和DSR在3G速率下的性能,设置了各种仿真场景,在NS2仿真环境中对报文丢失率和端到端延迟进行了详细的仿真和比较。仿真结果表明在3G速率下AODV性能要优于DSR。     

针对军用自组网环境下的路由协议（MMAR）设计

Ad Hoc网络目前的主要应用领域仍然是军事方面.文中针对战场环境中装甲部队这一特殊移动自组网的运动特性及移动终端配置等特点,参考目前较为完善的AODV、DSR路由协议,提出了适用于装甲车自组网的路由协议MMAR(military mobile ad hoc network routing protocol),通过OPNET仿真表明:相对于军用移动环境,该协议比AODV、DSR能更有效地减少路由负载,并能显著提高端到端时延、相对路由开销和平均投递率等性能.     

飞行自组网路由协议的仿真与分析

飞行自组网是移动自组网的一个新的研究方向,它将移动自组网的思想拓展到空天领域。但由于节点的高动态性和拓扑结构快速变化等特点,飞行自组网对路由协议提出更多挑战,传统移动自组网路由协议的适用性有待验证。文章利用OMNe T++仿真工具,针对飞行器组网的特定场景,对多种路由协议进行仿真,分析对比了各协议性能,探讨了无人机自组网路由协议的优选问题。实验结果表明OLSR_ETX协议综合性能优于其他几类协议,更适用于飞行自组网场景,但它在节点需要动态入网时表现不佳,还需要进一步的优化。     

基于阈值判断的动态源路由协议算法优化设计

针对移动自组织网动态源路由协议(DSR)中旧路径中断至新路径建立期间存在的丢包和端到端时延问题,设计了一种基于阈值判断的路由发现和维护算法,以优化路由协议性能。该方法首先定义节点电池能量和节点接收信号能量双阈值等级,分别用于衡量节点和既存链路状态;然后修改路由发现和路由维护算法,使动态源路由具备阈值判断功能。分别对增强型动态源路由协议(EDSR)包传递率和端到端时延等性能随节点数目和移动速度等参数的变化规律进行了软件仿真。实验结果表明,节点数目超过150或者速度小于10 m/s时,EDSR端到端时延和包传递率优于DSR,其他性能基本相当,因此EDSR协议性能得到明显改善,为低速大规模移动自组网路由协议提供了重要参考。     

一种改进无线Mesh网络孤岛效应的路由算法研究

针对无线Mesh网络路由协议自身的缺陷而导致的孤岛效应,分析了其形成原因以及对网络的危害,通过对AODV、DSDV、DSR和TORA等典型路由协议的具体分析,提出动态传输距离算法,整理形成了改进的AODV路由协议,仿真结果表明,改进后的协议能够很好地解决Mesh孤岛效应。     

Ad Hoc网络路由协议研究及其性能比较

介绍和分析了当前Ad Hoc网络中的主要路由协议算法,在Linux下使用网络仿真软件NS2评价Ad Hoc路由协议中的距离矢量路由协议、临时排序路由算法、动态源路由协议和Ad Hoc按需距离矢量路由协议,编写了用于仿真实现的脚本程序,并对仿真结果进行了分析比较和性能评价,由此得出不同协议的特性及其适用范围。     

Ad hoc路由协议性能评价

在继承传统路由协议性能评价的基础上,提出了较为清晰合理的Adhoc网络路由协议性能评价标准,并对Adhoc两种较为典型的路由协议DSDV、AODV进行仿真及性能分析.仿真结果表明AODV的稳定性要好于DSDV,但在网络拓扑变化缓慢的环境中,DSDV的分组时延较短.     

Multi-Fractal Characteristics of Mobile Node’s Traffic in Wireless Mesh Network with AODV and DSDV Routing Protocols

The analysis of traffic characteristics can be used for performance evaluation, design and implementation of routing protocols in WMNs (Wireless Mesh Networks). Higher bursty traffic will cause larger queue size, which means more dropping packets, and thus affects other metrics. Because burstiness can be modeled by multi-fractal characteristics effectively, multi-fractal characteristics of mobile node’s traffic in WMNs are analyzed with typical proactive and reactive routing protocols, which are DSDV (Destination Sequenced Distance Vector) and AODV (Ad hoc On-demand Distance Vector), respectively. Three types of traffic models are used to generate traffic at application level, which corresponding to open-loop and closed-loop scenarios. With different configurations, the probability distribution of inter-arrival time and multi-fractal characteristics of traffic at mobile node and gateway are analyzed with DSDV and AODV protocols. Results show that inter-arrival time with AODV and DSDV protocols possesses heavy-tailed property. And traffic with DSDV protocol exhibits more multi-fractal characteristics than that with AODV protocol, which can explain the higher routing performance of AODV.     

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

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

电力通信PCM组网方式研究

基于64k通道的PCM业务,是现有电力通信网最常见的接入层业务,结合地区PCM组网情况,提出应用VPN技术进行组网,解决了基于HDLC组网时故障无法监测定位的问题,为PCM业务的可靠运行奠定了坚实的基础。     

Design and Performance Analysis of a Proxy-Based Indirect Routing Scheme in Ad Hoc Wireless Networks

The majority of existing ad hoc network routing protocols has a tendency to use the shortest single path from a source to a destination. However, in constantly changing topologies such as those in mobile ad hoc wireless networks, the shortest single path is not only unreliable for reachability but also unsuitable for traffic load equilibrium. In order to improve routing performance and make optimum use of the limited resources, the congestion must first be relieved as much as possible and the routing path be made available at all times. In this paper, we propose a novel scheme, called the Applicative Indirect Routing (AIR), to control network traffic congestion and refine route availability by coping with unreliable links quickly. The proposed scheme, acting as a proactive routing protocol, utilizes additional information about the neighbors shared by the sender and the receiver to find an alternative for the original path with unreliable links. The additional bandwidth usage in AIR to obtain the information about shared neighbors (defined as proxy candidates) is so minimal that the bandwidth availability for user data traffic is not significantly affected. Extensive simulation experiments show that compared with a conventional proactive protocol, namely Destination-Sequenced Distance Vector (DSDV), the AIR scheme leads to a much improved system performance in terms of packet delivery ratio, average end-to-end packet delay, and network reliability. We further show that, in terms of packet delivery ratio, AIR is also a competitive protocol compared with such reactive protocols as Ad hoc On Demand Distance Vector (AODV) and Dynamic Source Routing (DSR).     

Congestion Control Performance of R-DSDV Protocol in Multihop Wireless Ad Hoc Networks

Ad hoc wireless networks are composed of mobile nodes communicating through wireless links, without any fixed backbone infrastructure. Frequent topology changes due to node mobility make routing in such dynamic networks a challenging problem. Moreover, successful message routing implies every mobile node is potentially capable of acting as a router, thus supporting store-and-forward mechanisms. However, resource limitations on these nodes also require a control on congestion due to message forwarding. In this paper, we consider our recently proposed randomized version of the well-known Destination-Sequenced Distance Vector (DSDV) routing protocol, referred to as R-DSDV, and validate its performance through extensive simulation experiments. Our results demonstrate that a probabilistic control on message traffic based on local tuning of protocol parameters is feasible, and that R-DSDV outperforms the basic DSDV protocol by significantly reducing the average queue size associated with each mobile node and hence the average packet delay.     

移动自组网中基于声誉机制的安全路由协议设计与分析

移动自组网是一种有特殊用途的对等式网络,具有无中心、自组织、可快速展开、可移动等特点,这些特点使得它在战场、救灾等特殊场合的应用日渐受到人们的重视.由于在移动自组网络中每节点既是主机又是路由器,所以容易遭受基于路由信息的攻击,而现今的路由协议基本没有考虑到该问题.本文在分析移动自组网络安全特性的基础上,综述了该方面的研究工作,建立了基于声誉机制评价体系,并给出了具体的评价方法和计算模型.在此基础上,提出了基于声誉机制的安全路由协议S-DSR.仿真结果表明在存在攻击节点的情况下S-DSR协议比DSR协议具有更好的包传输率、包丢失率等属性.