移动Ad hoc网络可靠多路径路由协议的综述

分析研究了移动Adhoc网络（MANET）的可靠多路径路由协议,可靠多路径路由协议的主要目标是提供可靠的通信、以确保负载平衡以及提高服务质量（QoS）。本文分析了Adhoc网络多路径路由技术的研究进展,论述了典型的Adhoc网络多路径路由协议性能,最后对Adhoc网络多路径路由的发展趋势进行了展望。     

一种空基自组网路由协议的研究

针对传统Ad Hoc路由协议无法满足空基自组网在高动态拓扑下成功投递、路由开销和低延迟的要求,研究了一种利用空基平台已规划的航线信息来提高网络路由性能的路由协议.该路由协议由已知移动信息路由协议（MARP,mobility aware route protocol）和移动信息洪泛协议（MDP,mobility dissemination protocol）组成.MARP利用规划的航线信息预测网络拓扑并计算路由,MDP采用洪泛方式通知网络中所有节点实际拓扑和预测拓扑的差异信息.设计该协议的数据结构、链路预测机制、实际链路探测机制、多余广播减少机制.通过QualNet仿真验证,结果表明,MARP/MDP在平均报文传输延迟、报文成功投递率及路由开销方面比AODV和OLSR协议具有更优越的性能.     

无线Ad hoc网络机会路由的实现与仿真

在无线自组织网络中,路由协议对网络的性能起着关键性作用。然而由于无线信道的不稳定性经常造成通信中断而需重建路由,使自组织网传统路由协议的效率大大降低。提出了一种应用于无线自组织网络的机会路由协议（WAOR）,利用无线信道的广播特性和多径传输来增强链路的可靠性。采用网络仿真器NS2的仿真结果表明,WAOR的性能优于传统的动态源路由协议（DSR）和自组织网按需平面距离矢量路由协议（AODV）。     

一种基于AODV的链路质量与能效优先的跨层路由协议

无线ad-hoc网络部署在非人为控制的外部环境中,采用电池供电.在这种应用环境中,如何通过合理的路由协议设计降低能量开销、提高网络的生存时间是近年来研究的热点.文章提出一种结合链路质量与能效的跨层路由协议.在路由建立阶段综合考虑链路质量、发送数据包的能耗和节点剩余能量来建立路由.通过在路由维护阶段对链路质量和节点剩余能量进行检测,预测路由中断的发生,并进行本地修复.通过在IEEE 802.15.4 Matlab模拟器下进行仿真,验证了该协议能够有效地提高网络的生存时间、数据投递率及AODV协议的性能和稳定性.     

基于RED的AODV路由协议改进

基于当前使用非常广泛的随机早期检测（RED）拥塞控制机制，提出了一种改进方案：在AODV的路由发现阶段，根据当前平均队列长度来确定以不同的方式响应路由请求，从而使建立起来的路由比较可靠，使数据流可以绕过负担比较重的节点，实现一定程度的拥塞控制和流量均衡，最后对改进前后的协议进行了性能仿真和分析。结果表明，改进后的协议与原协议相比在复杂度没有明显增加的前提下，降低了平均延时和丢包率，提高了网络性能。     

Ad Hoc网络中两种按需路由协议的比较

Ad hoc网络的特征是多跳的无线连接，网络拓扑的频繁变化，以及需要有效的动态路由协议。重点比较Ad hoc网络中两种主要的按需路由协议：动态源路由（DSR）协议和Ad hoc按需距离矢量路由（AODV）协议。尽管DSR和AODV都是按需路由协议，但不同的协议机制导致了网络性能的显著差异。在OPNET仿真平台下，对采用不用路由协议的网络时延和吞吐量进行比较，从而分析不同的路由机制引起的网络性能差异。     

基于NS2的无线自组织网络路由协议仿真

在无线自组织网络中,由于节点移动,网络拓扑结构变化频繁,所以路由协议的选择一直都是关键问题。该文采用NS2软件对两种主要的协议：动态源路由协议（DSR）和自组网按需距离矢量路由协议（AODV）进行了仿真。并且通过端到端延时、路由开销和分组投递率三种参数在不同条件下的数据对两种协议进行了评估。实验结果表明没有一种协议能够完全适用于自组网,对于特殊环境选择不同协议以满足需要。     

链路稳定的AdHoc网络组播路由协议

Ad Hoc网络中,组播路由协议具有广泛的应用前景.但由于网络拓扑的变化,设计具有可靠数据传输能力的组播路由协议比较困难.综合考虑Ad Hoc网络中节点的移动性和节点能量对路由稳定性的影响,选取具有较高性能的链路,使得路由具有较好的稳定性.仿真结果证明,与MAODV协议相比,设计的路由协议明显提高了数据投递率,并大大降低了丢包数.     

车载自组织网络中基于贪婪算法能地理位置路由

车载自组织网络（VANET）技术发展迅速,但由于其特殊的节点类型和信道特性,采用传统AdHoc网络路由协议无法取得满意的性能。实现高速可靠的数据传输速率,需要研究新兴的路由算法。基于贪婪算法的地理位置辅助路由是目前VANET路由的主流思路。文章认为基于这类思路的协议利用车载GPS装置、电子地图和下一代网络导航技术,能使路由发现和建立的时间大大缩短;结合已知的道路拓扑结构,选择多跳传输的最优路径,能避免路边建筑物的屏蔽效应,改善信道条件;动态评估道路上的车流密度,选择可靠性最高的传输路径,能很好地降低传输时延,提高网络吞吐能力。     

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

路由问题一直是移动Ad Hoc网络（MANET）研究中的难点和重要问题。按需路由协议是当前移动Ad Hoc网络的主流路由协议。丈中通过对AODV和DSR两种典型的按需路由协议的分析与比较，提出了一种利用DSR的路径收集机制来改进和提高AODV路由协议性能的方法。通过NS2仿真实验表明，该方法能有效减少路由请求的数量，从而降低路由的开销，提高分组发送的成功率，减少端对端的延时。     

基于无线Ad Hoc的多路径多信道路由度量准则

WCETT准则是针对单路径单信道的路由协议设计的,对于多路径多信道的路由协议会导致无效的路由,从而制约整个网络的累积吞吐量。文中分析了现有WCETT路由准则,并在此基础上提出了适用于多信道多路径路由协议的路由度量准则MWCETT准则(Multi-MWCETT)。通过对应用于该路由准则的MSR路由协议以及应用于WCETT准则的MSR协议进行仿真比较可知,该准则在吞吐量方面要优于WCETT准则。     

Rendezvous-based data dissemination for supporting mobile sinks in multi-hop clustered wireless sensor networks

In wireless sensor networks, a clustering-based technique is considered as an efficient approach for supporting mobile sinks without using position information. It exploits a Backbone-based Virtual Infrastructure (BVI) which uses only cluster heads (CHs) to construct routing structures. Since sensor nodes have constrained energy and are failure-prone, the effective design of both a clustering structure to construct a BVI and a routing protocol in the BVI is an important issue to achieve energy-efficient and reliable data delivery. However, since previous studies use one-hop clustering for a BVI, they are not robust against node and link failures and thus leading low data delivery ratio. They also use flooding-based routing protocols in a BVI and thus leading high energy consumption. Thus, in this paper, we propose a rendezvous-based data dissemination protocol based on multi-hop clustering (RDDM). Since RDDM uses a multi-hop clustering to provide enough backup sensor nodes to substitute a CH and enough backup paths between neighbor CHs, it can provide high robustness against node and link failures. By using a rendezvous CH, RDDM constructs routing paths from source nodes to mobile sinks without flooding in our BVI and thus can save energy of sensor nodes. By considering movement types of sinks, RDDM finds out a shorter path between a source node and a mobile sink through signaling only between neighbor CHs and thus can reduce the energy consumption. Analysis and simulation results show that RDDM provides better performance than previous protocols in terms of energy consumption and data delivery ratio.     

适用于水下物联网的混合地理路由协议设计

该文针对水下物联网(IoUT)数据传输问题设计了一种混合地理路由协议。海洋环境的复杂性严重地限制了IoUT水下物联网节点间的数据传输性能,因此需要一个高效的路由协议以对抗复杂的信道环境。无状态几何路由(G-STAR)是一种采用贪婪转发模式的地理路由协议,在大多数3维物联网情景中能够找到合适的数据传输路径,然而水下环境中存在诸多不利因素制约了G-STAR的性能。对此,该文提出一个混合G-STAR(Hybrid G-STAR, H-G-STAR)协议,在保有G-STAR优势的基础上对协议在水下环境中的适应性进行了针对性设计。通过增加基于信道监听的无协作转发策略,在节点数量足够时自发地选择信道状况最佳的路径进行路由,由此避开贪婪转发在水下环境中可能遭遇的极端劣化信道。仿真结果显示H-G-STAR协议相较于基准G-STAR协议有着更好的路由性能,并且在物理层能够取得更低的误比特率(BER),在水下节点的网络拓扑中更为适用。     

On Maximizing Transmission Reliability for Real-Time Routing in Multi-hop Wireless LANs

Three factors have been often shown to significantly affect the reliability of real-time transmission in wireless local area networks—transmission rate, power, and packet size. We analyze these factors and determine the optimal combination of factors subject to time constraints that yields the most reliable transmission of real-time data. We propose a cross-layer framework to jointly design the routing and MAC protocol combined with our optimization approach. The approach under a non-real-time routing protocol that produces a path metric is compared with a real-time routing protocol. Additionally, the real-time routing protocol enhances a guaranteed rate with our approach. Our experiments reveal that real-time performance in terms of miss ratio and throughput is significantly increased in lossy link and heavy traffic environments. Miss ratio and average throughput are improved by up to 30% over a state-of-the art routing protocol and 35% over a MAC protocol, respectively.     

QoS routing based on multi-class nodes for mobile ad hoc networks

In this paper, we present a new quality of service (QoS) routing protocol for mobile ad hoc networks (MANETs). Most of the existing routing protocols assume homogeneous nodes in MANETs, i.e., all nodes have the same communication capabilities and characteristics. However, in many ad hoc networks, nodes are not the same. Some nodes have longer transmission range, larger transmission bandwidth, and are more reliable and robust than other nodes. We take advantage of the non-homogeneous property to design more efficient QoS routing protocol. And node location information is used to aid routing. We also develop a new algorithm to calculate end-to-end bandwidth for a given path. Our QoS routing protocol contains end-to-end bandwidth calculation and bandwidth reservation. QoS route is discovered and setup only when it is needed. Extensive simulation studies demonstrate the good performance of the QoS routing protocol.     

DSR协议cache管理策略的优化

针对DSR协议不能充分利用潜在路由信息、路由缓存中过期路由影响路由选择准确性以及存在数据分组额外开销较大的问题,从cache管理策略方面提出了一种优化方案——采用链路缓存与“超时”机制相结合的方法,减小数据分组头的开销,充分利用潜在路由信息,保证路由缓存中路由选择的准确性。仿真结果表明,优化后的协议能够显著降低网络开销及时延。     

Stable-Aware Evolutionary Routing Protocol for Wireless Sensor Networks

In real life scenario for wireless sensor networks (WSNs), energy heterogeneity among the sensor nodes due to uneven terrain, connectivity failure, and packet dropping is a crucial factor that triggered the race for developing robust and reliable routing protocols. Prolonging the time interval before the death of the first sensor node, viz. the stability period, is critical for many applications where the feedback from the WSN must be reliable. Although Low Energy Adaptive Clustering Hierarchy (LEACH) and LEACH-like protocols are fundamental and popular clustering protocols to manage the system’s energy and thus to prolong the lifespan of the network, they assume a near to a perfect energy homogeneous system where a node failure, drainage and re-energizing are typically not considered. More recent protocols like Stable Election Protocol (SEP) considers the reverse, i.e., energy heterogeneity, and properly utilizes the extra energy to guarantee a stable and reliable performance of the network system. While paradigms of computational intelligence such as evolutionary algorithms (EAs) have attracted significant attention in recent years to address various WSN’s challenges such as nodes deployment and localization, data fusion and aggregation, security and routing, they did not (to the best of our knowledge) explore the possibility of maintaining heterogeneous-aware energy consumption to guarantee a reliable and robust routing protocol design. By this, a new protocol named stable-aware evolutionary routing protocol (SAERP), is proposed in this paper to ensure maximum stability and minimum instability periods for both homogeneous/heterogeneous WSNs. SAERP introduces an evolutionary modeling, where the cluster head election probability becomes more efficient, to well maintain balanced energy consumption in both energy homogeneous and heterogeneous settings. The performance of SAERP over simulation for 90 WSNs is evaluated and compared to well known LEACH and SEP protocols. We found that SAERP is more robust and always ensures longer stability period and shorter instability period.     

A routing framework for providing robustness to node failures in mobile ad hoc networks

Nodes in a mobile ad hoc network are often vulnerable to failures. The failures could be either due to fading effects, battery drainage, or as a result of compromised nodes that do not participate in network operations. Intermittent node failures can disrupt routing functionalities. As such, it is important to provide redundancy in terms of providing multiple node-disjoint paths from a source to a destination. In line with this objective, we first propose a modified version of the widely studied ad hoc on-demand distance vector routing protocol to facilitate the discovery of multiple node-disjoint paths from a source to a destination. We find that very few of such paths can be found. Furthermore, as distances between sources and destinations increase, bottlenecks inevitably occur and thus, the possibility of finding multiple paths is considerably reduced. We conclude that it is necessary to place what we call reliable nodes (in terms of both being robust to failure and being secure) in the network to support efficient routing operations. We propose a deployment strategy that determines the positions and the trajectories of these reliable nodes such that we can achieve a framework for reliably routing information. We define a notion of a reliable path which is made up of multiple segments, each of which either entirely consists of reliable nodes, or contains a preset number of multiple paths between the end points of the segment. We show that the probability of establishing a reliable path between a random source and destination pair increases tremendously even with a small number of reliable nodes when we use our algorithm to appropriately position these reliable nodes.     

基于ACP的RPL路由协议设计与实现

有损低功耗网络路由协议(Routing Protocol for Lossy and Low-power Networks,RPL)是为解决在无线传感网中无线传感节点受限而被提出,现有的实现是基于Contiki和Tiny操作系统,并不能应用在基于有线自治网络的自治控制平面(Autonomic Control Plane,ACP)中。为了对ACP提供可靠的通信支撑,设计和实现了基于ACP的RPL路由协议软件。协议软件主要由通信模块、消息处理模块、路由构造模块以及路由维护模块组成。其中,针对协议的实现是基于Linux操作系统根据ACP标准使用C语言进行开发。测试结果表明,实现的RPL协议能够支持ACP中正常的通信功能。     

基于AOMDV的多径路由协议改进及仿真分析

Ad Hoc网络是由一些移动节点组成、拓扑结构复杂且动态变化的自组织网络。网络中没有固定的网络基础设施,对路由协议要求较高。通过在每个节点的路由表和发送接收包中增加能量参数等措施,提出基于AOMDV的多路径路由协议改进方案PE-AOMDV协议,最后在NS2仿真平台上实现对改进的AOMDV多路径路由协议仿真分析。仿真结果表明：与AOMDV协议相比,新的基于能量的多路径路由协议PE-AOMDV的传输时延和路由开销都有所降低,并提高了分组投递率,从而提高了网络性能。