MDYMO：一种新的Ad Hoc按需多路径路由协议

移动Ad Hoc网络(MANETs)是一种资源受限、拓扑结构不断动态变化的网络。很多Ad Hoc路由协议的研究都是集中在如何建立一条源节点到目的节点的单路径路由上,但是,使用多路径路由能够显著提高网络性能。基于DYMO协议进行了适当修改,提出了一种新的多路径路由协议——MDYMO。通过在NS-2下进行仿真测试,表明多路径不仅可以减少时延,而且能够降低网络中路由报文的传输数量。     

域间多路径路由协议

边界网关协议(border gateway protocol,简称BGP)是当前互联网的核心协议,但是由于BGP是一种单路径路由协议,所以仍存在可靠性差、无法有效使用次优路径以及负载均衡支持较弱等问题.域间多路径路由可以通过发挥底层网络的AS级路径多样性,提高域间路由的可靠性、报文分组转发的总体性能和整个网络资源的利用率.因此,域间多路径路由是解决上述BGP问题的一种有效手段,符合互联网应用不断深入、促进路由技术发展的需求.主要综述域间多路径协议,并将其分为3类:单径通告多路转发协议、多径通告多路转发协议和新型域间多路径路由体系结构提出路径多样性、控制平面和数据平面开销、无环路特性等8项主要路由系统性能指标,并比较、分析了域间多路径路由协议.最后,指出域间多路径路由协议面临的主要挑战和未来的研究方向.     

Ad hoc网络节点不相交多路径距离矢量路由协议

AMR算法是Ad hoc网络计算节点不相交最大路径集合的累积多路径路由机制。针对节点不相交多路径源路由协议MNVP及SMNVP存在的问题,整合按需距离矢量路由AODV和AMR算法,提出了节点不相交多路径距离矢量路由协议MDVRo MDVR协议建立的路径信息分布在网络节点中,可缩短路由分组长度以及减轻路由发现源节点建立路由的负担;可防止攻击者通过墓改路由消息中的路径信息攻陷协议。     

Ad Hoc网络中的一种基于稳定的多路径路由算法

目前AdHoc网络(自组网)的路由研究正成为Adhoc网络发展的热点,在Adhoc网络中大多数按需路由协议使用单路径路由,但单路径容易断裂,往往需要重新路由。多路径路由在稳定性,均衡负载方面优于单路径路由,非常适合Adhoc网。该文通过理论分析得出多路径路由的稳定性与路由策略有密切的关系,从而提出了一种按需的独立多路径算法。该算法在DSR协议的基础上建立和使用一组完全独立的多路径进行路由。该文将算法与现有的一些算法进行了比较分析,模拟的结果显示独立多路径算法比SMR,DSR更有效。     

分组无线网缠绕多路径数据路由协议仿真

在分组无线网的路由协议中,传统路由协议在恶意节点数目较多时网络吞吐量较低,因此提出一种分组无线网缠绕多路径数据路由协议,利用获取的源节点数量信息与位置信息进行路由发现;根据路由发现结果建立从汇聚节点至源节点之间的路径,从而建立缠绕多径路由;对缠绕多径路由进行建簇与重构;进行支路径数优化,从而实现分组无线网缠绕多路径数据路由协议的构建。为了验证上述路由协议的网络吞吐量,将路由协议与基于链路状态的主动式多路径路由协议、基于动态源的按需式多路径路由协议、基于距离矢量的混合式多路径路由协议进行对比,上述四种路由协议在恶意节点数目为30时的网络吞吐量分别为69.5%、33.5%、23.6%、4.2%,通过比较可知,新提出的路由协议的网络吞吐量最高,证明了新路由协议的性能。     

无线传感器网络多路径路由协议的设计

在传统网络路由协议DSR的基础上,引入了ESDSR的路径生存期的思想,设计出了适用于无线传感器网络的能量多路径路由协议。在该协议的设计过程中针对网络拓扑结构中可能出现的三类路由情况进行了分析,并逐一提出了解决的方法,实现在数据传输的过程中进行传播路径的切换,并通过仿真实验,验证了能量多路径路由协议能有效地延长无线传感器网络的生存期。     

结合混合式信道分配的无线MESH多路径路由协议

为了优化无线Mesh网络中的多接口多信道网络资源,对单接口多路径路由协议和单路径信道分配策略进行了深入的分析研究,提出了与混合式信道分配方式相结合的多路径路由协议(AODV-MP),实现了网络中多条路径的并行传输,从而提高网络的整体吞吐率。并根据多路径路由协议自身的特性,结合与邻居节点干扰相关的因素——信噪比(SNR),提出了多路径路由的路由度量判决WCETTSNR,同时将该路由度量作为负载流量分配的比例标准。利用NS2网络仿真平台对该多路径路由协议进行测试,结果显示AODV-MP在网络吞吐率上提高了45%,并在高负载情况下,较大幅度地减少了网络延时。     

结合混合式信道分配的Mesh多路径路由协议

为了优化无线Mesh网络中的多接口多信道网络资源,对单接口多路径路由协议和单路径信道分配策略进行了深入的分析研究,提出了与混合式信道分配方式相结合的多路径路由协议(AODV-MP),实现了网络中多条路径的并行传榆,从而提高网络的整体吞吐率.并根据多路径路由协议自身的特性,结合与邻居节点干扰相关的因素--信噪比(SNR),提出了多路径路由的路由度量判决WCETYSNR,同时将该路由度量作为负栽流量分配的比例标准.利用NS2网络仿真平台对该多路径路由协议进行测试,结果显示AODV-MP在网络吞吐率上提高了45%,并在高负载情况下,较大幅度地减少了网络延时.     

能量感知的无线传感器网络多路径路由研究

针对现有多路径路由协议AOMDV的不足,提出了适用于无线传感器网络的能量感知多路径路由协议IMEA.IMEA在建立链路不相关的多路径时能优先建立节点不相关的多路径,在主路径失效时能优先选择与主路径共用节点最少的作为次优路径,而能量感知的路径选择策略能均衡网络中节点的能量消耗,实现数据传输路径的低能耗.对IMEA进行了仿真实验,结果表明IMEA有效延长了网络的生存时间.     

Ad Hoc移动网络多路径研究

在Ad Hoc移动网络中,由于结点的移动性,网络拓扑结构的易变性,路由成为研究的热点和难点。当前AdHoc路由协议一般都是单路径协议。然而由于多路径路由方式可以大大减少路由开销,提高数据传输率,减少网络拥塞,越来越多的研究表明,它将是未来Ad Hoc网络路由的主要方式。本文介绍了几种典型的多路径路由协议,并对这些多路径协议进行评价,对其性能进行比较,然后介绍多路径协议在QoS、能源和安全方面的应用,最后指出未来多路径研究的关键问题。     

A learning automata-based fault-tolerant routing algorithm for mobile ad hoc networks

Reliable routing of packets in a Mobile Ad Hoc Network (MANET) has always been a major concern. The open medium and the susceptibility of the nodes of being fault-prone make the design of protocols for these networks a challenging task. The faults in these networks, which occur either due to the failure of nodes or due to reorganization, can eventuate to packet loss. Such losses degrade the performance of the routing protocols running on them. In this paper, we propose a routing algorithm, named as learning automata based fault-tolerant routing algorithm (LAFTRA), which is capable of routing in the presence of faulty nodes in MANETs using multipath routing. We have used the theory of Learning Automata (LA) for optimizing the selection of paths, reducing the overhead in the network, and for learning about the faulty nodes present in the network. The proposed algorithm can be juxtaposed to any existing routing protocol in a MANET. The results of simulation of our protocol using network simulator 2 (ns-2) shows the increase in packet delivery ratio and decrease in overhead compared to the existing protocols. The proposed protocol gains an edge over FTAR, E2FT by nearly 2% and by more than 10% when compared with AODV in terms of packet delivery ratio with nearly 30% faulty nodes in the network. The overhead generated by our protocol is lesser by 1% as compared to FTAR and by nearly 17% as compared to E2FT when there are nearly 30% faulty nodes.     

具有副本抑制能力的多跳无线网络路由协议

针对多跳无线网络中机会路由的副本传输问题,提出一种新的机会路由协议。提出的策略不再简单采用单跳广播的方式转发数据,而是通过节点间的距离确定转发开销,再让数据包携带下一跳候选节点信息并根据候选节点的ACK选择下一跳节点,从而保证了每个数据包只有一个候选节点进行转发。仿真结果显示,提出的方案能减少不必要的传输行为,有效改善了网络吞吐率。     

移动预测下一种基于QoS保障的组播协议

基于QoS路由及保障路由实施是支持MANET应用的关键.为解决MANET中QoS问题,在移动预测机制下提出了一种基于QoS保障的组播协议.该协议通过簇头选举,移动预测和QoS控制策略在组播源与含目的节点的组播簇头间确定最稳传输路径,并采用基于动态资源管理的QoS路由模型来保障路由实施.仿真结果显示该方案可获得较高传输成功率和较低控制开销,能有效支持MANET中具有QoS需求的组播传输.     

基于萤火虫群优化的Ad Hoc网络路由协议

针对Ad Hoc网络拓扑结构多变、网络生存时间受限及数据包分组传输效率低下等问题,本文借鉴萤火虫群优化算法的思想,提出了一种基于萤火虫群优化的Ad Hoc网络路由协议。路由协议用萤火虫优化算法的荧光素强度的更新规则与无线自组网络中的节点移动速度、拥塞程度、节点剩余能量及节点间的距离等因素相互映射,改进萤火虫群优化算法中的搜索萤火虫、驻留萤火虫及回溯萤火虫用于完成Ad Hoc网络中路由协议的路由发现、路由选择及路由维护等过程,整个协议无须传送大量的控制分组,即可实现Ad Hoc网络的稳定。仿真实验结果表明,与AODV及基于蚁群优化的路由算法AntRouting协议相比,本文所提出的路由协议在端到端延时、分组数据传输率及网络生存时间上均有良好的性能。     

Link stability based multicast routing scheme in MANET

The group-oriented services are one of the primary application classes that are addressed by Mobile Ad hoc Networks (MANETs) in recent years. To support such services, multicast routing is used. Thus, there is a need to design stable and reliable multicast routing protocols for MANETs to ensure better packet delivery ratio, lower delays and reduced overheads. In this paper, we propose a mesh based multicast routing scheme that finds stable multicast path from source to receivers. The multicast mesh is constructed by using route request and route reply packets with the help of multicast routing information cache and link stability database maintained at every node. The stable paths are found based on selection of stable forwarding nodes that have high stability of link connectivity. The link stability is computed by using the parameters such as received power, distance between neighboring nodes and the link quality that is assessed using bit errors in a packet. The proposed scheme is simulated over a large number of MANET nodes with wide range of mobility and the performance is evaluated. Performance of the proposed scheme is compared with two well known mesh-based multicast routing protocols, i.e., on-demand multicast routing protocol (ODMRP) and enhanced on-demand multicast routing protocol (EODMRP). It is observed that the proposed scheme produces better packet delivery ratio, reduced packet delay and reduced overheads (such as control, memory, computation, and message overheads).     

基于Delaunay三角剖分的Ad Hoc网络路由算法

Delaunay三角剖分已广泛地应用于计算流体力学、统计学、气象学、固体物理学、计算几何学等多个领域.随着无线Ad Hoc网络的发展,一些研究者提出了可以保证网络任意节点对之间分组顺利传输的几何路由协议,而这些协议的网络基础拓扑同样可以用Delaunay三角剖分的思想来实现.提出了一种新型的用于发现移动节点间通信路径的在线路由算法GLNFR(greedy and local neighbor face routing).利用局部构造法,构造出局部化的Delaunay三角剖分作为网络的基础拓扑.在该网络拓扑中进行的GLNFR路由算法可以保证节点间分组的顺利传输,对网络变化具有更好的可扩展性和适应性.在NS(network simulator)模拟器上仿真了该路由算法.结果表明,在分组成功传输率和路由分组开销性能方面,这一在线路由协议要优于先前提出的一些几何路由协议.     

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.     

An enhanced real-time routing protocol with load distribution for mobile wireless sensor networks

Mobile wireless sensor network (MWSN) is a wireless ad hoc network that consists of a very large number of tiny sensor nodes communicating with each other in which sensor nodes are either equipped with motors for active mobility or attached to mobile objects for passive mobility. A real-time routing protocol for MWSN is an exciting area of research because messages in the network are delivered according to their end-to-end deadlines (packet lifetime) while sensor nodes are mobile. This paper proposes an enhanced real-time with load distribution (ERTLD) routing protocol for MWSN which is based on our previous routing protocol RTLD. ERTLD utilized corona mechanism and optimal forwarding metrics to forward the data packet in MWSN. It computes the optimal forwarding node based on RSSI, remaining battery level of sensor nodes and packet delay over one-hop. ERTLD ensures high packet delivery ratio and experiences minimum end-to-end delay in WSN and MWSN compared to baseline routing protocol. In this paper we consider a highly dynamic wireless sensor network system in which the sensor nodes and the base station (sink) are mobile. ERTLD has been successfully studied and verified through simulation experiment.     

一种改进的簇头成链路由协议

针对LEACH路由协议和PEGASIS路由协议的局限性,提出一种改进的簇头成链路由协议。将网络内所有传感器节点以区域为单位集合成簇,由Sink节点向下遍历区域内全部节点形成多条簇头链,通过计算数据丢包率得到能串联整个网络的簇头链。仿真结果表 明,该路由协议具有较好的数据传输可靠性和实时性。