一种满足剩余能量约束的方向性Ad Hoc网络路由协议

本文提出一种基于剩余能量约束的方向性路由协议ED-AODV。该协议首先控制RREQ分组进行方向性传输来减小网络的洪泛负担;其次,提出基于剩余能量的预警机制,当移动节点剩余能量低于报警阈值时,通知源节点提前主动进行路由选择来提高路由的稳定性。ED-AODV采用的方向性控制RREO分组转发的方法又消除了提前进行路由选择带来的洪泛负担。仿真实验结果表明,在能量有限的情况下,采用ED-AODV协议在平均端到端时延、分组投递率性能指标上均优于AODV协议。     

基于AODV的能量优化路由协议

对AODV路由协议进行改进,提出了基于AODV的能量优化路由协议(EO-AODV).进行了节点的剩余能量的考虑,根据节点的剩余能量对RREQ延迟进行了调节,并采用了避免路由失效算法,利用节点最近一次传递过数据分组的时间作为约束条件对RREQ的洪泛广播进行了优化.仿真结果表明,和AODV路由协议相比,降低了网络的能量消耗并减少了耗尽能量的节点数,延长了网络的生存时间.     

自组网中基于熵的定向洪泛QoS路由算法研究

为了减少移动自组网中路由频繁失效和重构,提高网络性能和资源利用率,提出了基于熵的定向洪泛QoS路由算法。该算法利用定向洪泛的机制控制路由请求转发范围,降低网络的控制开销;并采用一种度量方法——熵来选择稳定的路由,减少重路由,提高数据成功传输率。利用OPNET对算法进行仿真,结果表明该算法能以较小控制开销获得较好的数据传输,降低了路由重构的概率,适合移动自组网的高度动态的特点。     

DTN中一种基于分离时间的改进路由算法*

提出一种DTN中基于分离时间的副本受限的路由协议——EPI-T。EPI-T基于传染路由思想,根据历史路由信息进行路由选择,限制信息的洪泛范围,节约了网络资源。仿真分析结果表明,新协议提高了交付率和降低了时延。     

基于剩余能量的无线传感网路由算法设计

小规模、分布集中的WSNs(Wireless Sensor Networks,无线传感器网络)适宜采用平面路由协议,但在平面路由协议中,传统的洪泛路由算法以广播的方式在整个网络中传输查询请求和查询结果数据帧,消耗了较多的传感器节点能量,导致节点过早失效.论文对传统的洪泛路由算法进行改进,提出并实现了一种节能路由算法BRE-Flooding(Based on the Remaining Energy Flooding,基于剩余能量的洪泛算法).在算法中,节点依据剩余能量决定是否接收和转发数据帧;节点维护由剩余能量、距离网络中聚合节点(Aggregation Node)的跳数等信息组成的邻居路由信息表,并依据数据帧中表示该查询请求关键程度的属性,结合邻居路由信息表动态确定向哪几个(或全部)邻居节点转发数据帧.经实验仿真,表明所提算法在节省节点能量消耗及网络负载均衡方面具有较好的表现.     

无限自组网AODV协议的多路径路由的实现

为了减少建立路由所产生的延时,AODV路由协议允许拥有积极路由的中间节点响应路由请求,而不考虑该节点当时的负荷,这样虽然快速地建立了路由,但并不一定能有效地传输数据。针对这一问题,在AODV的基础上对一种多路径路由方法MP-AODV进行了优化。并结合主动式路由机制,进一步降低了链路失效。仿真结果表明改进的协议和原协议相比,降低了端到端的延时和丢包率,提高了传输效率。     

减少拥塞的AODV路由协议

为了减少建立路由所产生的延时，AODV路由协议允许拥有积极路由的中间节点响应路由请求，而不考虑该节点当时的负荷，这样虽然快速地建立了路由，但并不一定能有效地传输数据。针对这一问题，提出一个改进，在改进的AODV路由协议中，只有负荷较轻的中间节点才能响应路由请求或者进行局部路由维修，使数据流不在某些路段上过于集中。仿真结果表明改进的协议和原协议相比，降低了端到端的延时和丢包率，提高了传输效率。     

LAMR:移动Ad hoc网络位置匿名的多路径路由协议

为有效减少移动Ad hoc网络路由协议开销并且实现网络路由的鲁棒性,引入位置匿名性和LAR局部定向洪泛机制。对Ad hoc网络中的ARMR协议(anonymous routing protocol with multiple routes)进行改进,提出一种新的基于匿名位置的多路径路由协议LAMR(location-based anonymous route protocol),LAMR与ARMR的不同之处有两点:a)融入匿名性的位置可减少路由分组在网络的全局洪泛;b)定向洪泛思想可避免路由回路产生。仿真实验结果表明,LAMR能比ARMR有效地提高路径请求成功率和降低路由请求时延。     

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

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

改进的AODV路由协议性能比较研究

为了提出适合Ad Hoc实际网络环境的路由协议,分析了按需距离矢量路由协议（AODV）的基本原理和局限性,在此基础上介绍现有的三种改进协议：基于区域路由的增强AODV协议（AOZDV）,基于AODV和DSR的层次路由协议（DOA）以及稳定性增强的AODV改进协议（SAODV）,并对比分析了各自的优势和适用场合。NS2仿真结果表明,AOZDV适用于网络拓扑变化较为频繁的场景;DOA在大型网络中显示了其优势,较大地降低了路由负载;而SAODV提供了一条较为稳定的路由,提高了数据包成功发送率。     

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%.     

Ad Hoc网络中AODV路由协议的改进

介绍了无线自组织网和AODV路由协议,在对AODV路由协议的原理、特点作了全面分析的基础上,针对该协议存在的不足,提出了改进方法。方案对原Hello消息机制进行了改进,使节点可以利用Hello消息交换路由信息,从而建立备份路由。通过在NS-2中对改进的协议进行仿真模拟,发现与传统AODV协议相比,该方案可以减少断路后重新找到路由的时间,有效提高了Ad Hoc网络的吞吐量,降低了时延,从而有效的提高了网络的性能。     

VANET中一种基于概率转发的AODV路由协议

泛洪被作为实现广播通信的最简单的技术,广泛应用于车联网VANET(vehicular Ad Hoc network)路由.然而,由于VANET中节点的快速移动以及网络拓扑动态变化,简单的泛洪容易导致大量的冗余数据包,并引发广播风暴.为此,以典型的按需式距离矢量路由协议AODV (Ad Hoc on-demand distance vector)为基础,提出基于概率转发的AODV路由协议,记为AODV_P.AODV_P协议利用概率转发机制替代AODV中的泛洪.节点利用距离、密度信息计算转发概率,并依据转发概率设置计时器.计时器时间越短,成为下一跳转发节点的可能性越大.仿真结果表明,提出的AODV_P能够有效降低冗余数据包,缓解广播风暴问题.与AODV协议相比,AODV_P在传输时延、数据包传输率方面得到了有效提高.     

Efficient use of route requests for loop-free on-demand routing in ad hoc networks

On-demand routing protocols flood a route request (RREQ) identified by a unique source-sequenced label (SSL) to build directed acyclic graphs (DAG) consisting of possible paths to destinations, and use reverse paths along such DAGs to send route replies from the destinations. We present the first framework that uses only the SSL of the RREQ to establish loop-free paths without requiring additional mechanisms or information, e.g., per destination-sequence numbers or source routing. We present the Labeled Successor Routing (LSR) protocol, which stores the SSL of the RREQ as a route request label (RRL) at the nodes that participated in the creation of the RREQ DAG. The RRLs allow the source of the RREQ to identify neighbors as loop-free successors to the destination, which reduces network-wide RREQ flooding. Simulations results for scenarios consisting of networks of 50 and 100 mobile nodes show that LSR performs comparably or better than the Dynamic Source Routing (DSR) protocol, the Ad hoc On-demand Distance Vector (AODV) routing protocol, and the Optimized Link State Routing (OLSR) protocol.     

Ad Hoc网络中多约束的QoS路由协议和性能分析

多媒体应用的发展使得在Ad Hoc网络中提供服务质量(QoS)保证具有重要的意义。提出了一种基于AODV协议的多约束QoS路由协议(MQAR),扩展了QoS路由表项,允许中间节点发起路由回复(RREP)和资源预留,并且采用局部路由修复机制。仿真实验表明,MQAR协议在保持较高的报文传输率的情况下,有效地减少了路径建立时间和修复时间,大大降低了路由开销。     

基于泛洪协议的无线Mesh网络路由研究

在分析无线Mesh网络结构特点的基础上,针对无线Mesh网中客户端网络节点的移动性、拓扑结构变化较大等特点,提出了一种基于泛洪协议改进的路由算法.该算法设计了以序列号形式存在的路由表,同时通过调节最大、最小序列号的大小,泛洪消息的生命周期TTL等形式提高算法的性能.仿真结果显示,提出的算法在网络吞吐量和平均传输速率等方面要好于AODV算法,算法在拓扑变换频繁的无线Mesh网络中是可行的.     

AODV协议中路由黑洞问题的分析与解决

移动自组网是由一组带有无线收发装置的移动节点组成的无需固定设置支持的临时性的通信网络,路由在整个网络安全中起着重要作用。剖析了AODV路由协议中存在的路由黑洞问题,并在分析了已有解决方案基础上,提出了一种基于节点邻居集的解决方案,实验和分析表明本方案在对原AODV协议流程和控制包做了少量修改的情况下,能够检测黑洞攻击、发现到达目的节点的可信路由。     

Braving the broadcast storm: infrastructural support for ad hoc routing

Several routing algorithms for mobile ad hoc networks have been proposed in the recent past [Broch et al., The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks, Internet Draft draft-ietf-manet-dsr-03.txt, October 1999; Perkins et al., Ad Hoc On Demand Distance Vector (AODV) Routing, Internet Draft draft-ietf-manet-aodv-04.txt, October 1999; Haas and Pearlman, The Zone Routing Protocol (ZRP) for Ad Hoc Networks, Internet Draft draft-zone-routing-protocol-01.txt, August 1998; IEEE J. Select. Areas Commun. 17 (8) (1999) 1454]. With the exception of a few, these protocols (i) involve all nodes in the route management process, (ii) rely on the use of broadcast relays for route computation, and (iii) are primarily reactive in nature. Related work [Broch et al., Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols, Proceedings of IEEE MOBICOM, Dallas, TX, October 1998; Johansson et al., Scenario-based Performance Analysis of Routing Protocols for Mobile Ad-hoc Networks, Proceedings of IEEE MOBICOM, Seattle, August 1999] has shown that the capacity utilization in ad hoc networks decreases significantly when broadcast relays or “broadcast storms” are performed frequently. This effect is compounded when all nodes in the network take part in the route computation.We propose and study an approach based on overlaying a virtual infrastructure (adaptation of the core, proposed in [IEEE J. Select. Areas Commun. 17 (8) (1999) 1454]) on an ad hoc network and operating routing protocols over the infrastructure. The core enables routing protocols to use only a subset of nodes in the network for route management and avoid the use of broadcast relays. We evaluate the performance of dynamic source routing (DSR) [Broch et al., The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks, Internet Draft draft-ietf-manet-dsr-03.txt, October 1999] and AODV [Perkins et al., Ad Hoc On Demand Distance Vector (AODV) Routing, Internet Draft draft-ietf-manet-aodv-04.txt, October 1999], when they are operated over the core and compare their performances against those of their basic versions. Through extensive simulations using ns-2 [Fall and Vardhan, ns notes and documentation, available from http://www-mash.cs.berkeley.edu/ns/, 1999], we show that using a virtual infrastructure significantly improves the performance of both DSR and AODV, in terms of data delivery and routing overhead, under varied network characteristics.     

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

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