无线传感器网络多路径缠绕模型及其容错路由机制

针对无线传感器网络(WSN)不相交多路径路由中的路径过长问题和缠绕多路径路由中的容错削弱问题,提出一种多路径缠绕模型及其容错路由机制。首先,提出将多路径缠绕量化的思想,通过建立多路径缠绕模型将多路径的缠绕性量化,并通过容错概率模型建立多路径缠绕性与路由容错性的理论关联;其次,基于多路径缠绕模型,通过局部调整多路径的相交度建立容错路由机制。实验结果表明,在典型多路径路由算法——顺序分配路由(SAR)和能量有效容错多路径路由(EEFTMR)上应用该容错路由机制,能有效提高算法的数据包传输成功率,并一定程度上优化算法的能量有效性和端到端传输延迟。     

Transient chaotic neural network-based disjoint multipath routing for mobile ad-hoc networks

Due to mobility of wireless hosts, routing in mobile ad-hoc networks (MANETs) is a challenging task. Multipath routing is employed to provide reliable communication, load balancing, and improving quality of service of MANETs. Multiple paths are selected to be node-disjoint or link-disjoint to improve transmission reliability. However, selecting an optimal disjoint multipath set is an NP-complete problem. Neural networks are powerful tools for a wide variety of combinatorial optimization problems. In this study, a transient chaotic neural network (TCNN) is presented as multipath routing algorithm in MANETs. Each node in the network can be equipped with a neural network, and all the network nodes can be trained and used to obtain optimal or sub-optimal high reliable disjoint paths. This algorithm can find both node-disjoint and link-disjoint paths with no extra overhead. The simulation results show that the proposed method can find the high reliable disjoint path set in MANETs. In this paper, the performance of the proposed algorithm is compared to the shortest path algorithm, disjoint path set selection protocol algorithm, and Hopfield neural network (HNN)-based model. Experimental results show that the disjoint path set reliability of the proposed algorithm is up to 4.5 times more than the shortest path reliability. Also, the proposed algorithm has better performance in both reliability and the number of paths and shows up to 56% improvement in path set reliability and up to 20% improvement in the number of paths in the path set. The proposed TCNN-based algorithm also selects more reliable paths as compared to HNN-based algorithm in less number of iterations.     

基于移动Ad Hoc网络的多路路由算法

移动Ad Hoc网络中有限的节点能量和带宽给路由协议设计带来了困难,对此考虑使用多路径机制来平衡负载,并提出了两种多路路由算法。其中,简单相关多路路由算法规定替换路径只能由主路径节点或其相邻节点构成,从而减小了替换路径的平均长度。仿真结果显示简单相关多路路由算法比节点不相关多路路由算法具有更好的性能,它将为无线网络中实现节能及可靠传输提供一种有效的途径。     

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

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

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

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

传感器网络中基于簇的多路径路由协议

针对事件驱动型传感器网络的应用,提出一种基于簇的多路径路由协议CBMRP(Cluster-Based Multi-path Routing Protocol),以平衡节点能耗和提高能量效率。根据应用特点,位于事件区域的节点根据部居节点的分布情况和自身的剩余能量进行簇首竞争;然后,利用蚁群算法有效搜索多路径,并动态地选择一条路径传输数据。此外,该协议还采用一种简单的簇内调度方法,使其在满足监测精度的情况下,通过关闭冗余节点来进一步降低网络能耗。仿真结果表明,与传统协议相比,该协议具有更低的能耗和更长的网络生存期。     

Linear time distributed construction of colored trees for disjoint multipath routing

Disjoint multipath routing (DMPR) is an effective strategy to achieve robustness in networks where data is forwarded along multiple link- or node-disjoint paths. DMPR poses significant challenges in terms of obtaining loop-free multiple (disjoint) paths and effectively forwarding data over the multiple paths, the latter being particularly significant in datagram networks. One approach to reduce the number of routing table entries for disjoint multipath forwarding is to construct two trees, namely red and blue, rooted at a destination node such that the paths from a source to the destination on the two trees are link/node-disjoint. This paper develops the first distributed algorithm for constructing the colored trees whose running time is linear in the number of links in the network. The paper also demonstrates the effectiveness of employing generalized low-point concept rather than traditional low-point concept in the DFS-tree to reduce the average path lengths on the colored trees.     

移动WSN节点不相交多路径路由算法

针对移动无线传感器网络不相交多路径路由中的路径断裂问题,提出基于HSV色彩空间的节点不相交多路径路由算法。采用HSV色彩空间模型为每条链路建立数值化的（h,s,v）三元组,使其属于不同的色彩平面,以寻找从源节点到目标节点的多条节点不相交路径。针对节点移动问题,设计基于可变时间间隔链路接收信号强度指示值探测的不相交多路径维护机制,该机制无需借助地理位置信息。实验结果表明,当使用3条路径传输时,该算法的数据传输成功率可达到80％以上,而对比的经典算法均低于70％。此外,其在网络吞吐量、能量消耗等方面也具有较好的性能。     

Energy-efficient multipath routing in wireless sensor network considering wireless interference

Due to the energy and resource constraints of a wireless sensor node in a wireless sensor network (WSN), design of energy-efficient multipath routing protocols is a crucial concern for WSN applications. To provide high-quality monitoring information, many WSN applications require high-rate data transmission. Multipath routing protocols are often used to increase the network transmission rate and throughput. Although large-scale WSN can be supported by high bandwidth backbone network, the WSN remains the bottleneck due to resource constraints of wireless sensors and the effects of wireless interference. In this paper, we propose a multipath energy-efficient routing protocol for WSN that considers wireless interference. In the proposed routing protocol, nodes in the interference zone of the discovered path are marked and not allowed to take part in the subsequent routing process. In this way, the quality of wireless communication is improved because the effects of wireless interference can be reduced as much as possible. The network load is distributed on multiple paths instead of concentrating on only one path, and node energy cost is more balanced for the entire wireless network. The routing protocol is simulated in NS2 software. Simulation result shows that the proposed routing protocol achieves lower energy cost and longer network lifetime than that in the literature.     

一种基于路径跟踪反馈的SDN网络可信传输方案

针对软件定义网络(SDN)中的转发设备存在不可避免的漏洞和后门、缺乏主动监测或被动检查网络行为的机制等问题,提出一种基于路径跟踪反馈的SDN网络可信传输方案,设计基于跟踪反馈的传输路径可信验证机制,依据反馈信息分析节点的可信性,以此评估路径的可信度;同时,提出一种基于路径跟踪反馈的不相交多路径可信路由算法DMTRA-PTF,能够通过路径跟踪反馈和可信评估引导新的路径及时规避恶意交换机节点,构造不相交多路径路由方案以增强SDN网络传输服务的可信性。对比实验结果表明,路径跟踪反馈机制能够以较小的性能代价准确识别恶意交换机,提出的可信路由算法能够以此为后续路由动态规划不相交多条可信路径,有效提升网络整体的可信性。     

Disjoint multipath routing using colored trees

Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath routing (DMPR) requires the multiple paths to be link- or node-disjoint. Both MPR and DMPR pose significant challenges in terms of obtaining loop-free multiple (disjoint) paths and effectively forwarding the data over the multiple paths, the latter being particularly significant in IP datagram networks.This paper develops a two-disjoint multipath routing strategy using colored trees. Two trees, red and blue, that are rooted at a designated node, called the drain, are formed. The paths from a given source to the drain on the two trees are link- or node-disjoint. The colored tree approach requires every node to maintain only two preferred neighbors for each destination, one on each tree. This paper (1) formulates the problem of colored-trees construction as an integer linear program (ILP); and (2) develops the first distributed algorithm to construct the colored trees using only local information. We demonstrate the effectiveness of the distributed algorithm by evaluating it on grid and random topologies and comparing to the optimal obtained by solving the ILP.     

A multipath routing strategy to prevent flooding disruption attacks in link state routing protocols for MANETs

Multipath routing has been proposed to increase resilience against network failures or improve security in Mobile Ad Hoc Networks (MANETs). The Optimized Link State Routing (OLSR) protocol has been adopted by several multipath routing strategies. They implement Multipoint Relay (MPR) nodes as a flooding mechanism for distributing control information. Ideally, the construction of multiple disjoint paths helps to increase resilience against network failures or malicious attacks. However, this is not always possible. In OLSR networks, partial link-state information is generated and flooded exclusively by the MPRs. Therefore, the nodes only obtain a partial view of the network topology. Additionally, flooding disruption attacks may affect either the selection of the MPRs or the propagation of control traffic information. As a consequence, the chances of constructing multiple disjoint paths are reduced. We present a strategy to compute multiple strictly disjoint paths between any two nodes in OLSR-based networks. We provide mechanisms to improve the view of the network topology by the nodes, as well as handling potential flooding disruption attacks to the multipath construction mechanism in OLSR-based networks. We conduct simulations that confirm our claims.     

Reliable multistage interconnection network design

High-performance supercomputers generally comprise millions of CPUs in which interconnection networks play an important role to achieve high performance. New design paradigms of dynamic on-chip interconnection network involve a) topology b) synthesis, modeling and evaluation c) quality of service, fault tolerance and reliability d) routing procedures. To construct a dynamic highly fault tolerant interconnection networks requires more disjoint paths from each source-destination node pair at each stage and dynamic rerouting capability to use the various available paths effectively. Fast routing and rerouting strategy is needed to provide reliable performance on switch/link failures. This paper proposes two new architecture designs of fault tolerant interconnection networks named as reliable interconnection networks (RIN-1 and RIN-2). The proposed layouts are multipath multi-stage interconnection networks providing four disjoint paths for all the source-destination node pairs with dynamic rerouting capability. The designs can withstand switch failures in all the stages (including input and output stages) and provide more reliability. Reliability analysis of various MIN architectures is evaluated. On comparing the results with some existing MINs it is evident that the proposed designs provides higher reliability values and fault tolerance.     

基于网络编码的传感网多径路由模型分析

针对多径路由容易产生报文乱序和丢包现象,将网络编码技术引入到多径路由中,建立两种基于网络编码的无线传感器网络多径路由模型.通过源节点和中继节点的编码以及目的节点的解码,在报文乱序和部分丢包的情况下仍然可以恢复出源数据包,达到降低网络冗余度的同时,提高网络成功交付率.提出根据网络规模选择路由的思想进行仿真计算,结果表明两种模型适合于不同规模的网络.     

基于多级模糊评判的高效数据聚集算法

基于多级模糊综合评判,提出一种既可节省传感节点能量又能提高数据聚集度和减少数据传输延迟的高效的数据聚集算法.先由一级模糊综合评判获得路由信息,然后根据路由表中相邻传感节点转发的数据包个数,利用二级模糊综合评判重新选择下一跳传感节点,通过增加原有路径间交叠的方式来高效的提高数据聚集度;然后为了均衡能耗和减少传输延迟提出一种新的聚集定时机制.仿真结果表明,该算法能延长网络生命周期,提高数据包交付率,降低平均传输延迟及提升数据聚集度.     

一种基于分治策略的多路径Ad Hoc路由协议

在无线自组织网络(MANET)中,比起单路径路由协议,多路径路由协议提供了更好的可靠性、容错性、负载平衡等,并且提供较小的端对端延迟、提供较大的有效总带宽;但是,当网络规模较大、通信节点之间相距较远时,多路径路由协议的开销会很大,多路径的条数也减少.针对这一问题,提出了一种基于分治思想的多路径路由协议(DCMR).当通信节点之间必须经过的节点较多时,将这些节点划分为较小的节点集,对各个节点集分别进行路径查找及维护.模拟实验表明,该协议明显提高了路由寻径效率,减小了网络维护开销,并且实现简单,更具实用性.     

All-to-all disjoint multipath routing using cycle embedding

In this paper, we evaluate the performance of disjoint multipath routing approaches for all-to-all routing in packet-switched networks with respect to packet overhead, path length, and routing table size. We develop a novel approach based on cycle embedding to obtain two node-disjoint paths between all source–destination pairs with reduced number of routing table entries maintained at a node (hence the reduced lookup time), small average path length, and less packet overhead. We study the trade-off between the number of routing table entries maintained at a node and the average length of the two disjoint paths by: (a) formulating the cycle-embedding problem as an integer linear program; and (b) developing a heuristic. We show that the number of routing table entries at a node may be reduced to at most two per destination using cycle-embedding approach if the average length of the disjoint paths are allowed to exceed the minimum by 25%.     

无线传感器网络多径路由算法

路由协议是无线传感器网络研究的热点,针对传感器节点能量有限的特点,为了均衡网络负载、延长网络生存期,该文提出一种基于能量－跳数权重值的多径路由算法(EHM),其核心思想是各节点维护到其邻居节点的多条路径,并根据邻居节点的跳数和剩余能量信息进行路由选择。利用OPNET仿真工具对算法进行仿真,结果表明EHM算法可以有效地均衡网络节点的能量消耗,在节点剩余能量上有50%左右的性能提升。     

Constructing disjoint paths for failure recovery and multipath routing

Applications such as Voice over IP and video streaming require continuous network service, requiring fast failure recovery mechanisms. Proactive failure recovery schemes have been recently proposed to improve network performance during the failure transients. These proactive failure recovery schemes need extra infrastructural support in the form of routing table entries, extra addresses etc. In this paper, we study if the extra infrastructure support can be exploited to build disjoint paths in those frameworks, while keeping the lengths of the recovery paths close to those of the primary paths. Our evaluations show that it is possible to extend the proactive failure recovery schemes to provide support for nearly-disjoint paths which can be employed in multipath routing for load balancing and QoS.     

Improving the efficiency of multipath traffic via opportunistic traffic scheduling

Multipath routing, as defined by OSPF extensions and other protocols, enables a network’s traffic to be split among two, or more, possibly disjoint paths. Advantages of multipath vs. unipath routing include load balancing, reduced latency, and improved throughput. However, once the control plane establishes multiple routes, a policy is needed for efficiently splitting traffic among the selected paths. In this paper, we introduce opportunistic multipath scheduling (OMS), a technique for exploiting short-term variations in path quality to minimize delay, while simultaneously ensuring that the splitting rules dictated by the routing protocol are satisfied. We develop a performance model of OMS and derive an asymptotic lower bound on the performance of OMS as a function of path conditions (mean, variance, and Hurst parameter) for self-similar traffic. Finally, we use an extensive simulation-based performance study to evaluate the accuracy of the analytical model, explore the impact of OMS on TCP throughput and performance of real-time traffic, and study the impact of factors such as delayed measurements.