基于多径路由负载均衡的动态源路由协议*

提出了一种DSR的改进多径路由协议（LBDSRM）。采用开销小的综合链路状态路由判据算法,协议具有链路状态实时监控与适时调整路由功能,在链路变化较大的情况下,主动通知有路由冗余的源节点改用或重点使用次选路由;而且协议提出了适时退避算法,解决了多径任务与单径任务争用链路时网络公平性问题。仿真结果表明新协议能有效避免节点拥塞,达到较好的动态负载均衡,实现网络资源的充分利用。     

面向IP快速路径切换的OSPF冗余路径算法

在IP网络中,当某链路或者节点发生故障时,通过路由协议的收敛来绕开故障的链路或节点.对OSPF路由协议,这个时间至少为5秒,期间经过故障节点或链路的流量将会被丢弃,绝大多数的应用可以承受这种程度的延迟.但是,对延迟敏感的应用如VoIP而言,这种量级的延迟是很难为用户所接受的.基于现有的OSPF路由协议的最短路径树(SPT)算法,提出一种支持IP快速重路由的多冗余路径树计算算法.算法计算除最短路径外至少一条不相交无环备份路径,保证在最短路径的链路或节点故障时,通过快速切换到备份路径,以提高IP网络的故障收敛时间.     

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

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

PRDT（2，1）架构的NoC系统容错路由算法

链路和节点的故障会导致网络中许多节点无法相互通讯,因此容错性是NoC系统设计中的一个重要问题。基于一种新的NoC网络拓扑结构PRDT（2,1）,提出一种PRDT（2,1）容错路由算法以及相应的节点失效算法。节点失效算法通过使较少数量的无故障节点失效来构造矩形故障区域,PRDT（2,1）容错路由算法仅使用了最小数量的虚拟通道并提供足够的自适应性以实现无死锁容错路由。只要故障区域没有断开网络,这一算法能够保证路由的连通性。算法在不同故障率的PRDT（2,1）网络中仿真,结果显示这一算法具有良好的平滑降级使用特性。     

一种基于相交多径网络编码模型的无线传感网多径路由协议

将网络编码技术应用到无线传感器网络中以提高网络的传输效率是近年来国内外研究的一大热点,相交多径网络编码模型是一种具有高可靠性的基于网络编码的多径路由模型,而目前将相交多径网络编码模型应用在无线传感网的多径路由协议中的研究并不多。通过使用基于地理位置划分虚拟网格的方法设计了一种相交多径网络编码模型的路由协议BRGNC(Braided multipath Routing protocol based on Grid with Network Coding)。在路由过程中先根据网格的能量情况、链路质量、节点个数等因素选择下一跳网格,再通过网格内节点状态选择“最优的”转发节点集,从而降低了以往按照相交多径网络编码模型建立无线传感网的多径路由协议的难度。仿真实验结果表明,该协议具备较好的可靠性和能耗均衡性,在网络规模较大、链路状态较差的情况下也能够很好地保证数据的可靠传输。     

无线Mesh网络链路非相关多径发现算法

非相关路径的使用对于提高网络性能有极其重要的作用,但当前无线Mesh网络的路由协议都不支持链路非相关多径的寻找.在分析DSR协议不足的基础上,提出了一种基于DSR改进的链路非相关多径寻找算法EDSR（enhancedDSR）.其核心思想是在DSR路由寻找完成后,利用网络节点的路由缓存发现和寻找源节点与目的节点间的链路非相关路径.通过非相关路径的使用,提高网络吞吐率,从而达到提高网络性能的目的.仿真结果表明,EDSR算法能以较少的代价获取非相关路径,提高网络性能.     

基于AODV优化的移动自组网路由协议

提出一种基于AODV优化的移动自组网路由协议AODVO,优化RREQ传播机制、HELLO机制和链路修复机制,提供节点不相关多径路由,降低网络路由开销,提高数据传输率,对网络负载平衡有明显帮助。仿真结果验证,相对于AOMDV,该协议在分组传输率、时延和路由开销方面有较大的优越性。     

水声传感器网中基于网络编码的多径路由协议

针对水声传感器网通信带宽低、节点能耗高的特点,提出一种基于网络编码的多径路由协议。该协议在路由过程中通过在主链路和后备链路之间动态切换创造更多的网络编码机会进行数据传输,从而优化网络带宽利用率,并降低冗余数据包重传造成的能量消耗。仿真结果表明:基于网络编码的多径路由协议可以在提高水声传感网吞吐量的同时,有效降低网络能量消耗。     

一种晶上系统互连网络的容错感知结构

晶上系统融合预制件组装和晶圆集成等先进理念,是延续摩尔定律的一种新方法。由于晶圆基板本身制造良率和拼接的不确定性,晶上系统存在路由节点故障或链路故障等问题。为提高系统容错性,提出了一种基于2D-Mesh晶上互连网络的容错感知结构。在Mesh环中交叉使用主副感知器用于获取故障信息,再将其广播至全局路由节点实现数据包的避障绕行,缓解数据包在路由过程中可能发生的阻塞。实验仿真表明该结构在多种故障模式下,相较于传统容错路由算法有更高的饱和注入率,能够有效提高系统容错性,降低局部故障导致的性能影响。     

无线传感器网络单跳扩展增强树型路由协议研究

增强树型路由协议是最近提出的无线传感器网络路由协议,除了使用父子链路,当前路由决策节点通过和其一跳邻居节点之间建立增强链路形成比树型路由更短的路由捷径。为了尽可能多地发掘出潜在的路由捷径,提出了单跳扩展增强树型路由协议,该协议在增强树型路由协议的基础上把当前路由决策节点的单跳父亲节点和儿子节点及它们的邻居节点也考虑进路由决策过程中,可选路由捷径范围不再局限于当前路由决策节点及其一跳邻居之间的增强链路,而是向上扩展到其父亲节点及其一跳部居以及向下扩展到其儿子节点及其一跳邻居之间所形成的增强链路。该协议选择最短的路由捷径发送数据包。给出了单跳扩展增强树型路由协议的判定过程,并将该协议应用到ZigBee网络中。仿真结果显示,该协议在路由跳数和能量消耗这两项网络性能上比树型路由和增强树型路由均有提高。     

Backup path set selection in ad hoc wireless network using link expiration time

Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on quality of service. A suitable technique for eliminating this problem is to use multiple backup paths between the source and the destination in the network. Most of the proposed on-demand routing protocols however, build and rely on single route for each data session. Whenever there is a link disconnection on the active route, the routing protocol must perform a path recovery process. This paper proposes an effective and efficient protocol for backup and disjoint path set in an ad hoc wireless network. This protocol converges into a highly reliable path set very fast with no message exchange overhead. The paths selection according to this algorithm is beneficial for mobile ad hoc networks, since it produces a set of backup paths with much higher reliability. Simulations are conducted to evaluate the performance of our algorithm in terms of route numbers in the path set and its reliability. In order to acquire link reliability estimates, we use link expiration time (LET) between each two nodes.In another experiment, we save the LET of entire links in the ad hoc network during a specific time period, then use them as a data base for predicting the probability of proper operation of links.Links reliability obtains from LET. Prediction is done by using a multi-layer perceptron (MLP) network which is trained with error back-propagation error algorithm. Experimental results show that the MLP net can be a good choice to predict the reliability of the links between the mobile nodes with more accuracy.     

移动Ad Hoc网路AODV路由协议的改进

针对移动Ad Hoc网络AODV路由协议的路由维护的缺点,提出了AODV-BR路由协议,即具有备份路由的AODV路由协议。新协议通过为网络中的连接链路增加一条备份路由提高了AODV路由维护的性能。仿真实验表明AODV-BR有效减少了网络中链路中断的数量,降低了丢包率。     

Joint coverage and link utilization for fast IP local protection

To mitigate the impact of failures, many IP Fast Local Recovery (IPFLR) schemes have been proposed to reroute traffic in the events of failures. However, the existing IPFLR schemes either aimed to find the alternate backup routes to protect failures, or focused on balancing the traffic load routed on the backup routes. Furthermore, in Internet, flows are often managed by shortest path routing, and therefore purely determining the backup routing paths is not sufficient in protecting the error-prone networks. In this paper, we propose a Simulated Annealing based Load balancing and Protection (SALP) scheme to determine link weights for balancing link utilization in the non-failure state and simultaneously construct backup routing tables for protecting any single link failure in IP networks. In our proposed scheme, the two most significant issues, (1) load balancing and (2) coverage, are jointly considered to recover the network operation from single link failures. In the proposed scheme, upon a failure, only the nodes adjacent to a failure are activated to divert affected traffic to backup paths without disturbing regular traffic. Numerical results delineate that the proposed scheme achieves high coverage rate and load balancing at the expense of slightly increasing the entries of backup routing table.     

无线传感器网络一种不相交路径路由算法

无线传感器网络经常被用来采集物理数据,监测环境变化.由于低功耗无线通信不确定性、链路质量不稳定性以及节点失效等问题,传感器网络很容易导致路由数据包丢失.为了提高网络路由的可靠性,人们提出多路径路由算法.多路径路由中源节点到目的节点的多条路径可能含有公共节点,或者公共边,如果公共节点或者公共链路失效,则这个数据包也丢失,因此又有人提出不相交多路径路由算法.不相交多路径路由算法又分为链路不相交多路径路由算法和节点不相交多路径路由算法.提出了一种不相交路径路由算法,可以将感知节点采集到的数据通过不相交路径传送到汇聚节点,提高路由的可靠性.而且,这个算法还可以很方便地应用到多Sink节点的网络当中.该路由算法用到的路由表大小为|K|,其中|K|表示路径数.算法的运行时间复杂度是O(|L|),其中|L|表示网络中的边数.     

LABILE: link quAlity-based lexIcaL routing mEtric for reactive routing protocols in IEEE 802.15.4 networks

In this paper, we propose a lexical routing metric to enable path-wise link quality-aware routing in Wireless Sensor Networks (WSNs). The realization of this routing metric is achieved by applying the indexing techniques of formal language processing in multi-metric route classification and cost evaluation for WSNs. In particular, the metric is motivated from the fact that IEEE 802.15.4 networks are formed on links with highly variable quality, and selection of poor quality links degrades the data delivery considerably. Although IEEE 802.15.4 supports link-level awareness through LQI, (a)?it remains unbeknownst at the path level, and therefore, (b)?its processing is link-local in scope. We propose LABILE, a composite routing metric, that is implemented through modifying RREQ and RREP structures of AODV to capture and convey two-state link information to destination which in turn is processed through an easy to compute routing lexicon and a corresponding lexical algorithm for path selection in case of availability of multiple paths. Multiple paths are represented in a path space through a proposed cost model that encompasses hop-count, weak links and a quantity weakness factor of each link, depending upon a thresholding mechanism which in turn declares a link to be either healthy (aka usable) or weak (aka unusable). Using the weakness factor, the success probability of data delivery over weak link turns out to be a fraction of success probability at healthy link. The mathematical model along with the experiments done for LABILE show that proposed composite metric and its parsing scheme together achieve link robustness consistently by evading the link failures, as the number of weak links is fairly reduced in lexical path as compared to the hop-count-based metric. Increased data delivery is obtained through preventing retransmissions as on failure-prone links.     

基于链路生存时间预测的高动态飞行自组网组播路由协议

针对飞行自组网（FANETs）中因节点高速移动导致链路频繁断开的问题,提出一种具备链路生存时间预测与路由自主修复能力的高动态FANETs组播路由协议。根据相邻节点间距离的变化情况预测邻居节点间剩余链路生存时间,同时基于预测结果并结合路由跳数、剩余能量等因素对链路质量作出综合评价,选出最佳中继节点以提高路由的可靠性。此外,通过局部路由修复与全局路由刷新相结合的策略对所建立路由进行动态维护,缓解节点高速移动引起的链路频繁断开问题,提高数据递交率。实验结果表明,在不同场景下,该协议在数据递交率、网络吞吐量、路由开销等方面均优于经典组播路由协议ODMRP。     

Dual paths node-disjoint routing for data salvation in mobile ad hoc

The operational patterns of multifarious backup strategies on AODV-based (Ad-hoc On-Demand Vector) routing protocols are elaborated in this article. To have a broader picture on relevant routing protocols together, variants of AODV-based backup routing protocols are formulated by corresponding algorithms, and also each of them are simulated to obtain the necessary performance metrics for comparisons in terms of packet delivery ratio, average latency delay, and the normalized routing load. Then to make the process of data salvation more efficiently in case of link failure, we explore the possibility of combining the AODV backup routing strategy and on-demand node-disjoint multipath routing protocols. This article proposes an improved approach named DPNR (Dual Paths Node-disjoint Routing) for data salvation, a routing protocol that maintains the only two shortest backup paths in the source and destination nodes. The DPNR scheme can alleviate the redundancy-frames overhead during the process of data salvation by the neighboring intermediate nodes. Our simulation results have demonstrated that DPNR scheme delivers good data delivery performance while restricting the impacts of transmission collision and channel contention. The mathematical rationale for our proposed approach is stated as well.     

一类专用网络中的动态路由选择协议*

在分析现有路由选择协议的基础上,设计了适用于一类专用网络的动态路由选择协议。该协议采用按需路由方式,利用该类专用网络的全连通性缩短初始通信延迟,通过度量链路延迟来确定最佳路由,通过邻接节点信息表的维护实现备份链路的管理,支持到目的节点的多重路由。原型系统实现表明,该协议简单、高效、高可靠和高可用,可以满足专用网络的需要。     

An improved scheme for self-healing in ATM networks

Broadband networks based on ATM technology can carry a large volume of data and can support diverse services like audio, video, and data uniformly. The reliability and availability levels provided by such networks should be very high. Self-healing is an elegant concept in this direction to provide highly reliable networks. A self-healing network can detect failures such as link/node failures and reroute the failed connections automatically using distributed control mechanisms. In this paper, we consider link and node failures including the VP terminating nodes unlike Kawamura and Tokizawa (Self-healing in ATM networks based on virtual path concept, IEEE Journal on Selected Areas in Communications 12 (1) (1994) 120–127). We present here an improved scheme for self-healing in ATM networks based on the concept of backup VPs. The problems we address are: (i) self-healing scheme; and (ii) backup VP routing. Two issues are addressed in the self-healing scheme: (i) backup VP activation protocol; and (ii) dynamic backup VP routing. We propose a new backup VP activation protocol which uses a VC packing strategy which allows the fast and prioritized restoration of critical VCs that were carried by failed VPs. We also propose a distributed dynamic backup VP routing algorithm which reduces the resource contention that may occur when multiple source–destination pairs contend for the routes simultaneously. The objective of the backup VP routing problem is to find a backup VP for each of the working VPs so that the cost of providing the backup is minimized. We propose a heuristic based solution for the backup VP routing problem using the concept of minimum cost shortest paths. We conducted simulation experiments to evaluate the performance of the proposed schemes. The results show that the proposed schemes are effective. Comparison of the results with those of the earlier schemes (R. Kawamura, I. Tokizawa, Self-healing in ATM networks based on virtual path concept, IEEE Journal on Selected Areas in Communications 12 (1) (1994) 120–127; C.J. Hou, Design of a fast restoration mechanism for virtual path-based ATM networks, Proceedings of IEEE INFOCOM’97, Kobe, Japan, April 1997) shows that the proposed schemes perform better.     

Dynamic backup routes routing protocol for mobile ad hoc networks

Mobile Ad Hoc Networks (MANETs), which provide data networking without infrastructure, represent one kind of wireless networks. A MANET is a self-organizating and adaptive wireless network formed by the dynamic gathering of mobile nodes. Due to the mobility of mobile nodes, the topology of a MANET frequently changes and thus results in the disability of originally on-the-fly data transmission routes. The dynamic properties of MANETs are therefore challenging to protocol design. To cope with the intrinsic properties of MANETs, Dynamic Backup Routes Routing Protocol (DBR²P), a backup node mechanism for quick reconnection during link failures, is proposed in this paper. DBR²P is an on-demand routing protocol and it can set up many routes to reach a destination node in a given period. Even when a link fails, those routes from the source node to the destination node can be analyzed to obtain backup routes to sustain quick reconnection. The information of backup routes can be saved in a specific on-the-route node and enables backup routes to be found immediately in situation regarding disconnection. As a result, DBR²P could more thoroughly improve the quality of routing protocol than those proposed in the past.