移动自主网络多路径路由技术研究进展

MANET具有许多与传统有线网络截然不同的特性，包括移动性、有限的带宽资源、易变的网络拓扑等，因而就需要一种新的路由协议来解决这些缺点。大多数已提出的MANET路由协议没有考虑公平性，它们倾向于把重的负载分布到源一目的对的路径最短的主机上。结果，超重负载的主机会迅速耗尽能源，这将导致网络分离，应用会话失败。为解决
决这个问题，众多专家学者提出用多路径的方法来承担路由任务。本文回顾了MANET多路径路由技术的研究进展，并对有关路由协议进行了评述，比较了各自的贡献和不足；最后对路由协议研究的发展方向进行了展望。     

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.     

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.     

Research on multicast routing protocols for mobile ad-hoc networks

A mobile ad-hoc network (MANET) is composed of mobile nodes without any infrastructure. Mobile nodes self-organize to form a network over radio links. The goal of MANETs is to extend mobility into the realm of autonomous, mobile and wireless domains, where a set of nodes form the network routing infrastructure in an ad-hoc fashion. The majority of applications of MANETs are in areas where rapid deployment and dynamic reconfiguration are necessary and wired network is not available. These include military battlefields, emergency search, rescue sites, classrooms and conventions, where participants share information dynamically using their mobile devices. These applications lend themselves well to multicast operations. In addition, within a wireless medium, it is crucial to reduce the transmission overhead and power consumption. Multicasting can improve the efficiency of the wireless link when sending multiple copies of messages by exploiting the inherent broadcast property of wireless transmission. Hence, reliable multicast routing plays a significant role in MANETs. However, to offer effective and reliable multicast routing is difficult and challenging. In recent years, various multicast routing protocols have been proposed for MANETs. These protocols have distinguishing features and employ different recovery mechanisms. To provide a comprehensive understanding of these multicast routing protocols and better organize existing ideas and work to facilitate multicast routing design for MANETs, we present the taxonomy of the multicast routing protocols, their properties and design features. This paper aims to aid those MANETs researchers and application developers in selecting appropriate multicast routing protocols for their work.     

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.     

Robust and secure routing scheme for wireless multihop network

Mobile ad hoc network (MANET) is an appealing technology that has attracted lots of research efforts. On-demand routing protocol such as AODV may suffer from frequent topological changes. Due to frequent communication failures, multipath MANET is preferred than single-path MANET in many applications as former is used for achieving robustness and load balancing and improving reliability. Although multipath MANET is attractive solution, there are still some major flaws that prevent commercial growth. Security is one of these main barriers; MANETs are known to be particularly vulnerable to security attack. The paper presents a design of robust and secure framework for multipath MANET. In this paper, we propose not only a robust multipath routing protocol but also an extended security scheme. We discuss security analysis for proposed security scheme. And we also conduct simulation to evaluate such a framework through different performance metrics. Results show that the proposed routing protocol achieves better performance in terms of various metrics than other protocols.     

域间多路径路由协议

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

一种低功耗无线传感器网络多径路由优化协议

针对无线传感器网络多媒体传输应用中,单通道路由方案无法获得理想效果的问题,提出了一种低功耗多径路由优化协议(EEOR)。在这个协议中,通过邻居之间的消息交互建立最大化多路径,并引入了多路径选择机制来剔除无意义的路径。在多路径建立过程中,首先考虑降低端到端延迟,其次维护网络的能量平衡。仿真结果显示,提出的方案与其他两种路由协议相比网络生命更长、可靠性更高、端到端的延迟和控制开销更低。     

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.     

Ad Hoc移动网络多路径研究

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

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

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

A survey on secure multipath routing protocols in WSNs

Routing protocols in wireless sensor networks (WSN) have been substantially investigated by researches. Most state-of-the-art surveys have focused on reviewing the different routing schemes that have been proposed for WSN and classifying them based on the network’s type and protocol’s operation. Security aspects in routing protocols have not been given enough attention, since most of the routing protocols in WSNs have not been designed with security requirements in mind. However, taking into consideration that WSN applications need to support critical infrastructures (i.e., military, healthcare, environmental, etc.), security becomes an issue. And since these infrastructures are highly depended on the availability of resources, focus has especially been given to support a secure, resilient and reliable environment, with multipath routing being one of the added functionalities. The need for security in sensitive WSN application has lead researchers to design secure multipath routing protocols from the beginning or design security extensions for existing protocols. This paper surveys the current state-of-the-art of secure multipath routing protocols in WSNs, classifies the protocols in categories according to their security-related operational objectives, defines a new threat model in the routing procedure and identifies open research issues in the area.     

Guaranteed on-demand discovery of node-disjoint paths in ad hoc networks

In recent years, the low cost and abundance of WLAN products has led to the deployment of self-configuring multihop ad hoc networks. Multipath routing has been increasingly studied to improve network reliability and throughput. However, no existing work guarantees discovery of node-disjoint paths when they exist, which limits their applicability in real networks. This paper presents a theoretical framework that establishes the equivalence between multipath discovery and flow network assignment. This equivalence is used to guarantee the on-demand discovery of an arbitrary number of node-disjoint paths between a pair of nodes as long as they exist. We also present an example protocol that integrates the theoretical framework with the Dynamic Source Routing (DSR) protocol to find two node-disjoint paths, which can be easily extended to finding k node-disjoint paths. Analysis of the example protocol demonstrates a good tradeoff between complexity and capability, particularly when compared with existing on-demand multipath routing protocols. Our simulation data shows the effectiveness of the discovered paths.     

一种累计多路径的移动自组网络路由策略

描述了一种基于多路径移动自组网络按需路由策略.在移动自组网络,由于网络节点的移动性及拓扑结构的易变性,路由成为最受关注的问题.在以前的移动自组网络路由算法中,主要采用的是传统的单路径方式.最近,多路径方式也逐渐出现,因为相对单路径路由而言,多路径为移动自组网络提供的QoS支持更可行、更高效.鉴于现有的移动自组网络多路径策略未能为源节点提供充分的信息,提出了一种新型的移动自组网络多路径路由算法.该算法可以将路由信息保存在源节点中,并依此在源节点中采用替换路径或多路径并发的方式进行数据传输.     

Influence of mobility models on the performance of data dissemination and routing in wireless mobile ad hoc networks

Many routing protocols are proposed in the literature on mobile ad hoc networks (MANETs). Some of those protocols which have been investigated under different assumptions are unable to capture the actual characteristics of MANETs. Therefore, there is a necessity to investigate the performance of MANETs under a number of different protocols with various mobility models. This paper evaluates the performance of the single path routing protocols (AODV, DSR, and DSDV), in the presence of different network loads and differing mobility models. Our findings show that DSR routing protocol has a better performance compared to other protocols with respect to various metrics.     

Network coding based reliable disjoint and braided multipath routing for sensor networks

This paper presents network coding based reliable disjoint and braided multipath routing (NC-RMR ) for sensor networks, which forms multipath by hop-by-hop method and only maintains local path information of each node without establishing end-to-end paths. Neighbors of each local node are divided into groups according to their hops to sink nodes to improve the network load balancing. For further performance improvement of NC-RMR with disjoint multipath model, local nodes select their own backup nodes in neighbor nodes to form additional logical paths, which implement a braided multipath model. Security advantages of NC-RMR with multipath and network coding mechanisms are analyzed. Analytical and simulation results prove that braided multipath routing model has better performance over disjoint model, and NC-RMR protocol can reduce the required number of transmission paths, ensure load balance of sensor network system, reduce the energy consumption of nodes.     

Cryptographic Versus Trust-based Methods for MANET Routing Security

Mobile Ad-hoc Networks (MANETs) allow wireless nodes to form a network without requiring a fixed infrastructure. Early routing protocols for MANETs failed to take security issues into account. Subsequent proposals used strong cryptographic methods to secure the routing information. In the process, however, these protocols created new avenues for denial of service (DoS). Consequently, the trade-off between security strength and DoS vulnerability has emerged as an area requiring further investigation. It is believed that different trust methods can be used to develop protocols at various levels in this trade-off. To gain a handle on this exchange, real world testing that evaluates the cost of existing proposals is necessary. Without this, future protocol design is mere speculation. In this paper, we give the first comparison of SAODV and TAODV, two MANET routing protocols, which address routing security through cryptographic and trust-based means respectively. We provide performance comparisons on actual resource-limited hardware. Finally, we discuss design decisions for future routing protocols.     

Secure and robust multipath routings for advanced metering infrastructure

A Smart Grid is the modernization of the electricity grid using communication technology with the prime goals of reducing energy consumption as well as cost increasing reliability and creating new services for all participants. It comprises key components such as the Advanced Metering Infrastructure (AMI), which includes Neighborhood area network (NAN). When multi-hopping is considered in wireless communication, especially in WiFi and ZigBee, the range of the communication can be extended to communicate with the gateway collector in AMI network. Wireless mesh AMI network may have smart meters, a NAN gateway, and fixed as well as mobile repeaters. Though many techniques have been developed to secure on-demand routing protocols in wireless multi-hop ad-hoc networks, these protocols have shortcomings. In this paper, we propose two robust and secure multipath routing protocols for wireless mesh AMI networks. We have analyzed their robustness to various attacks. The simulation results show that the proposed protocols are better than existing secure routing protocols.     

移动Ad hoc网络多径路由协议*

给出移动Ad hoc网络多径路由的分类方法,系统地描述了当前各种典型的MANETs多径路由协议,并比较和分析了这些协议的特点及适用情况.最后结合该领域当前的研究现状,指出多径路由协议存在的问题和未来的研究重点.     

Game Theoretic Stochastic Routing for Fault Tolerance and Security in Computer Networks

We introduce the game-theoretic stochastic routing (GTSR) framework, a proactive alternative to today's reactive approaches to route repair. GTSR minimizes the impact of link and router failure by 1) computing multiple paths between source and destination and 2) selecting among these paths randomly to forward packets. Besides improving fault tolerance, the fact that GTSR makes packets take random paths from source to destination also improves security. In particular, it makes connection eavesdropping attacks maximally difficult as the attacker would have to listen on all possible routes. The approaches developed are suitable for network layer routing, as well as for application layer overlay routing and multipath transport protocols such as the stream control transmission protocol (SCTP). Through simulations, we validate our theoretical results and show how the resulting routing algorithms perform in terms of the security/fault-tolerant/delay/throughput trade-off. We also show that a beneficial side effect of these algorithms is an increase in throughput, as they make use of multiple paths.