Multiple Disjoint Paths Research Articles

Bridging the gap among actor–sensor–actor communication through load balancing multi-path routing

Wireless sensor actor networks (WSANs) consist of a large amount of sensor nodes with low cost and little actor nodes with better processing capabilities. The actor nodes tend to get partitioned due to low actor density in case of economic considerations. So, the communication among actors requires sensor nodes to relay his data to the destination actor which lead to the bottleneck in communication. A high-throughput disjoint multi-path (HTDM) routing scheme is proposed in this paper which allows actor simultaneously forwards data through multiple disjoint paths to achieve high throughput. HTDM routing scheme can quickly establish multiple disjoint routing paths, which can increase the throughput among actors a lot, and the routing path can be adjusted dynamically according to the energy status of their nodes, which can achieve load balancing. Simulation results show that, compared with related routing schemes, HTDM routing scheme can achieve higher throughput performance and distribute transmission loads more evenly to most of the nodes in the network.

Energy balanced optimum path determination based on graph theory for wireless sensor network

One of the challenging tasks in wireless sensor network is to route data efficiently from source to destination. Sensors collect data from the sensor network area and pass on the aggregated data to the base station. Three techniques have been proposed in the literature: namely, direct, hierarchal and hybrid to fulfil this data transmission task. Sending data on a single path multiple times results in depletion of energy and hence failure of those nodes. Thus, a fault tolerance mechanism is essential for finding multiple disjoint paths for data transmission. In this mechanism, the system can switch from an inaccessible path with broken links to available candidate paths. In this study, a new graph theory method for optimal path selection based on quality of service parameters is proposed. To prolong the lifetime of the network, a fault tolerant mechanism is also adopted. Simulation results show that the proposed approach enhances network lifetime and improves path stability.

Improving sparse data movement performance using multiple paths on the Blue Gene/Q supercomputer

We adapt Ford-Fulkerson's algorithm to find multiple disjoint paths to move data.We realize multi-path data movement by introducing intermediate nodes to the paths.We leverage routing policies to reduce the number of intermediate nodes.We implement pipelined data movement with the Parallel Active Message Interface. In situ analysis has been proposed as a promising solution to glean faster insights and reduce the amount of data to storage. A critical challenge here is that the reduced dataset is typically located on a subset of the nodes and needs to be written out to storage. Data coupling in multiphysics codes also exhibits a sparse data movement pattern wherein data movement occurs among a subset of nodes. We evaluate the performance of data movement for sparse data patterns on the IBM Blue Gene/Q supercomputing system and identify performance bottlenecks. We propose a multipath data movement algorithm for sparse data patterns based on an adaptation of a maximum flow algorithm together with breadth-first search that fully exploits all the underlying data paths and I/O nodes to improve data movement. We demonstrate the efficacy of our solutions through a set of microbenchmarks and application benchmarks on Mira scaling up to 131,072 compute cores. The results show that our approach achieves up to 5 × improvement in achievable throughput compared with the default mechanisms.

An Approach to Distributed Multi-Path QoS Routing

The principal objective of the present research work is to attain QoS in routing mechanism. For this, a distributed QoS multi-path routing algorithm has been designed that finds multiple disjoint paths in a distributed way from one source to one destination. These multiple paths satisfy the given QoS requirements. The proposed algorithm DQM (Distributed QoS Multi-Path algorithm) uses local information to find multiple QoS paths as the global state information available for making routing decisions is often inaccurate in a lively environment and inaccuracy can be the cause of QoS failure. The QoS parameters that have been considered are residual bandwidth and delay. Firstly the algorithm obtains all the paths which satisfy the QoS criteria in a fully distributed fashion. At destination, these paths are again processed to identify mutually exclusive disjoint paths. Among overlapping paths, those paths will be selected whose combination of bandwidth and delay is better than other. To achieve this, fuzzy logic has been used. By applying fuzzy logic a new single metric is obtained from the input’s bandwidth and delay of the calculated paths. Based on this value, the paths are filtered to disjoint paths. Since the paths obtained at destination are already constrained paths and further these paths are refined into most optimal disjoint paths using the concept of fuzzy logic, thus the proposed strategy provides both constrained and optimal paths.

Multipath QoS Routing for Traffic Splitting in MANETs

Abstract Mobile ad hoc networks (MANETs) are characterized by its dynamic topology which has limited channel bandwidth and limited power at the nodes. Because of these characteristics in the MANETs the paths connecting source nodes with destinations may be very unstable and go down at any time, making communication over mobile ad hoc networks difficult. To overcome these issues, in this paper, we propose a Multipath QoS Routing protocol for traffic splitting in MANET. In this protocol, initially multiple disjoint paths are discovered and the data packets are transmitted through the path which satisfies the routing constraints based on bandwidth, delay and path stability. If the path does not satisfy the routing constraints, then the traffic can be distributed along the multiple disjoint paths, using the Traffic Splitting algorithm. By simulation results, we show that the proposed protocol reduces the packet drop and delay with improved throughput.

Efficient Multicast Routing on BCube-Based Data Centers

Multicast group communication has many advantages in data centers and thus is widely used by many applications. It can efficiently reduce the network traffic and improve the application throughput. For the multicast application in data centers, an essential problem is how to find a minimal multicast tree, which has been proved to be NP-hard. In this paper, we propose an approximation tree-building method for the minimal multicast problem, named HD （Hamming Distance）-based multicast tree. Consider that many new network structures have been proposed for data centers. We choose three representative ones, including BCube, FBFLY, and HyperX, whose topological structures can be regarded as the generalized hypercube. Given a multicast group in BCube, the HD-based method can jointly schedule the path from each of receiver to the only sender among multiple disjoint paths; hence, it can quickly construct an efficient multicast tree with the low cost. The experimental results demonstrate that our method consumes less time to construct an efficient multicast tree, while considerably reduces the cost of the multicast tree compared to the representative methods. Our approach for BCube can also be adapted to other generalized hypercube network structures for data centers after minimal modifications.

Bandwidth Aware on Demand Multipath Routing in Manets

Mobile Ad-hoc Networks (MANETs) are self configuring, decentralized and dynamic nature wireless networks which have no infrastructure. These offer a number of advantages, however the demand of high traffic flows in MANETs increases rapidly. For these demands, limited bandwidth of wireless network is the important parameter that restrains the development of real time multimedia applications. In this work, we propose a solution to utilize available bandwidth of the channel for on demand multiple disjoint paths. The approximate bandwidth of a node is used to find the available bandwidth of the path. The source chooses the primary route for data forwarding on the basis of path bandwidth. The simulation results show that the proposed solution reduces the frequency of broadcast and performs well in improving the end to end throughput, packet delivery ratio, and the end to end delay.

AOLSR: hybrid ad hoc routing protocol based on a modified Dijkstra's algorithm

Mobile ad hoc networks (MANETs) are highly vulnerable to both link and node failures due to nodal mobility. The routing resilience against link and/or node failures needs to be enhanced to avoid the degradation of network performance. This can be achieved by multipath routing which uses multiple alternative paths to route the messages via multiple disjoint paths and result in increased bandwidth, fault-tolerance, and security. An optimized link state routing (OLSR) protocol is a proactive routing protocol. An advanced OLSR (AOLSR) protocol is proposed based on a modified Dijkstra's algorithm which enables routing in multiple paths of dense and sparse ne0074work topologies. The routing is based on the energy of nodes and links (implied from the lifetime) and the mobility of the nodes. It is a hybrid ad hoc routing protocol because it combines the proactive and reactive features. It is another form of source routing protocol which allows a sender of a data packet to partially or completely reveal the route the packets take through the network. Two cost functions are introduced to build link-disjoint or node-disjoint paths. Secondary functions, namely path recovery and loop discovery process are involved to manage the topology changes of the network. AOLSR protocol is analyzed and compared with the existing MANET routing protocols namely, dynamic source routing (DSR) and OLSR. Its performance is observed to be satisfactory in terms of average end-to-end delay, packet delivery ratio (PDR), average time in first-in-first-out (FIFO) queue, and throughput.

DFDP: A Distributed Algorithm for Finding Disjoint Paths in Wireless Sensor Networks with Correctness Guarantee

In wireless sensor networks, routing messages through multiple (node) disjoint paths between two sensor nodes is a promising way to increase robustness, throughput, and load balance. This paper proposes an efficient distributed algorithm named distributedly finding disjoint paths (DFDP) to find k disjoint paths connecting two given nodes s and t. A set of paths connecting s and t are disjoint if any two of them do not have any common nodes except s and t. Unlike the existing distributed algorithms, DFDP guarantees correctness; that is, it will output k disjoint paths if there exist k disjoint paths in the network or the maximum number of disjoint paths otherwise. Compared with the centralized algorithms which also guarantee correctness, DFDP is shown to have much better efficiency and load balance by theory analysis and simulation results.

Multipath Grid-Based Enabled Geographic Routing for Wireless Sensor Networks

This work proposes an efficient disjoint multipath geographic routing algorithm for dense wireless sensor networks (WSN), called Multipath Grid-based Enabled Geographic Routing (MGEGR). The proposed algorithm relies on the construction of a 2-D logical grid in the geographical region of deployment. The objective of the proposed scheme is to determine optimal or near-optimal (within a defined constant) multiple disjoint paths (multipath) from a source node to the sink, in order to enhance the reliability of the network. The determined multiple disjoint paths would be used by the source node in a round-robin way to balance the traffic across the disjoint paths, and to avoid discovered paths with cell holes. The proposed scheme limits the use of broadcasting to the process of gateway election within each cell, and the process of maintaining the table of neighbors of each gateway. Our simulation results show the effectiveness and scalability of our routing scheme with increased network size compared to on-demand routing protocols.

An Optical Multicast Routing with Minimal Network Coding Operations in WDM Networks

Network coding can improve the optical multicast routing performance in terms of network throughput, bandwidth utilization, and traffic load balance. But network coding needs high encoding operations costs in all-optical WDM networks due to shortage of optical RAM. In the paper, the network coding operation is defined to evaluate the number of network coding operation cost in the paper. An optical multicast routing algorithm based on minimal number of network coding operations is proposed to improve the multicast capacity. Two heuristic criteria are designed to establish the multicast routing with low network coding cost and high multicast capacity. One is to select one path from the formerKshortest paths with the least probability of dropping the multicast maximal capacity. The other is to select the path with lowest potential coding operations with the highest link shared degree among the multiple wavelength disjoint paths cluster from source to each destination. Comparing with the other multicast routing based on network coding, simulation results show that the proposed multicast routing algorithm can effectively reduce the times of network coding operations, can improve the probability of reaching multicast maximal capacity, and can keep the less multicast routing link cost for optical WDM networks.

Interference aware energy efficient multipath routing in multihop wireless networks

Energy efficiency is considered as an important design issue in multihop wireless networks as the nodes are battery limited. Energy efficiency can be achieved by establishing multiple paths. Multipath routing explores multiple disjoint paths between sources–sink pair in order to improve energy consumption at nodes and thus, provide robustness against possible node failure. However, it remains a challenging task in wireless networks due to associated interference. Reducing interference lowers the energy consumption, improving the network lifetime. This paper proposes an interference aware energy efficient multipath routing protocol for a given source-sink pair by a combined route construction and power allocation method. After finding k-minimum weight node disjoint paths on a weighted communication graph, iterative power allocation is performed on the derived paths considering signal to interference plus noise ratio (SINR) model. The power allocation method minimizes the interference experienced by each node at an acceptable level so that multiple transmissions can take place simultaneously. By alternatively invoking multipath route construction and power allocation method on a weighted communication graph, the proposed algorithm optimizes the assignment of transmission power and thereby minimizes the total energy consumption on k-node disjoint multipath. The simulation results show that the performance of the proposed scheme is better than existing multipath routing algorithms.

Mechanism of Immune System Based Multipath Fault Tolerant Routing Algorithm for Wireless Sensor Networks

It is significant to improve fault tolerance and transmission reliability for improving the overall performance of wireless sensor networks. Related studies on this issue become the hotspot at present. For issues that nodes fault or link quality can affect the transmission stability and reliability of the network, mechanism of immune system based multipath fault tolerant routing algorithm is presented for wireless sensor networks. Firstly, mechanism of immune system is adopted to establish the hierarchical clustering topology with superior performance of clustering compactness. Then nodes' comprehensive measurement (CM) values are calculated and the contour lines are established among cluster heads according to nodes gradient. Mechanism of immune system is applied to do the variation on the initial antibody population, namely, the multiple disjoint paths, to establish the final optimal transmission paths. Mathematical model is established to do the theoretical analysis on the performance of the algorithm. Through the simulation on the packet receiving rate, accuracy rate, and energy efficiency, the algorithm improves the transmission reliability, energy efficiency of the network, and shows superior performance of fault tolerance.

An adaptive sensor sleeping solution based on sleeping multipath routing and duty-cycled MAC protocols

Various applications of wireless sensor networks require multihop data transmission over error-prone wireless links, hence multipath routing can be used to meet the application's reliability requirement. On the other hand, wireless sensors are usually battery powered, and thus it is very important to save energy in order to prolong the network lifetime. In this article, we propose (1) Sleeping Multipath Routing, which can trade off reliability and network lifetime by dynamically activating an optimal number of paths to support the application's reliability requirement and putting the rest of the sensors to sleep, and (2) an adaptive sensor sleeping solution, which includes Sleeping Multipath Routing, a duty-cycled MAC protocol, and cross-layer coordination to further prolong the network lifetime by putting sensors to sleep at both the routing and the MAC layers. Our proposed Sleeping Multipath Routing and adaptive sensor sleeping solution can be implemented on any multipath routing protocol that discovers multiple disjoint paths between two nodes, and any duty-cycled MAC protocol that has fixed cycle length. We show an example of implementing our adaptive sensor sleeping solution using Directed Diffusion and S-MAC. Simulation results show that our proposed adaptive sensor sleeping solution outperforms single-layer sensor sleeping with a longer network lifetime with required reliability support. Moreover, our proposed adaptive sensor sleeping solution can significantly prolong the network lifetime when the application's reliability requirement varies over time, or when the number of alive nodes in the network changes over time.

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.

Efficient distributed algorithm for correctly finding disjoint paths in wireless sensor networks

Routing messages through multiple (node) disjoint paths connecting two sensor nodes is a promising way to increase robustness, throughput and load balance of sensor networks. This paper proposes a distributed algorithm to find k disjoint paths connecting two given nodes s and t. A set of paths connecting s and t are disjoint if any two of them do not have any common nodes besides s and t. Unlike the existing distributed algorithms, the proposed algorithm can guarantee answer correctness, i.e. it will output k disjoint paths if there exist k disjoint paths in the network or the maximum number of disjoint paths otherwise. Compared to the centralised algorithms which can also guarantee answer correctness, this algorithm is shown to have much lower communication cost, which is confirmed by experimental results. To the best of our knowledge, this algorithm is the first distributed algorithm which can guarantee answer correctness.

QoS-Aware Multipath Communications over MANETs

To enhance the Quality of service (QoS) communications over mobile ad hoc networks (MANETs), this paper proposes QoS-Aware Multipath Routing Protocol (QMRP). Delay is the most crucial factor for multimedia applications which can be minimized by providing more than one path between source-destination pair as well as choosing the path based on the quality in terms of reliability and stability of the link. To the best of our knowledge no one before included projected load; load introduced by the node requesting a path to a destination into the delay computation for a path between source-destination pair as well as maintaining loop freedom through the neighbor hop list of the source. The originality of the proposed protocol comes from the fact that it introduces this new parameter into route quality computation which makes QMRP unlike its precursors providing more accurate measure of the realistic delay as well as maintaining loop freedom of multiple node disjoint paths using neighbor hop list. Cross layer communications between physical (PHY), MAC and routing layers interact to achieve QoS against the network and channel dynamics by minimizing delay and choosing more reliable and stable paths without requiring any additional resources. Performance evaluation of the proposed protocol against a single path AODV routing protocol using OPNET has been conducted. Results show that QMRP outperforms AODV in terms of E2E delay, packet delivery fraction (PDF) and route discovery frequency. However, routing overhead for QMRP is more than that of AODV due to the discovery of more one path in each route discovery process.

MPE 2 S: Multi-paths and Erasure Encoding Based Reliable Transmission Strategy for Wireless Sensor Networks

摘要: 传输可靠性是衡量无线传感器(Wireless sensor networks, WSN)网络性能的一个重要指标. 针对节点故障会影响网络传输稳定性和可靠性的问题, 提出了基于多路径纠删编码的 无线传感器网络可靠传输策略(Multi-paths and erasure encoding strategy, MPE2S). 根据反映链路质量的最优最差蚂蚁系统的信息素归一化值, 在相邻等级节点间建立多条互不交叉的传输路径, 将源数据包经纠删编码的 数据片沿多条路径分配和传输以实现负载均衡和故障容错. 理论分析和仿真结果表明,MPE2S具有较高数据包接收率、数据准确率和能效性, 体现了良好的故障容错性、数据传输稳定性和可靠性. 关键词: 无线传感器网络 / 可靠传输 / 故障容错 / 多路径路由 / 纠删编码

Multipath Routing Protocol using Cross-layer based QoS Metrics for IEEE 802. 11e WLAN

To achieve Quality of Service (QoS) support for multimedia traffic, IEEE 802.11e specifies Hybrid Coordination Function (HCF) Controlled Channel Access (HCCA) technique. When it is applied in multi-hop networks, the performance results, however, reveal that there is significant degradation of throughput with high delay at high load conditions. This is due to the fact that routing is responsible for the successful packet delivery and QoS Support. In a single path routing protocol, although multiple paths are discovered by the source during the process of discovering a route, the path with the shortest delay is chosen as the best path while discarding the rest. An increased efficiency can be achieved in terms of QoS metrics, balancing the load and tolerance to faults by the use of multipath routing. Apart from using multipath routing, cross-layer based approach is also necessary for the enhancement of QoS in IEEE 802.11e networks. This paper proposes a multipath routing protocol using cross-layer based metrics for improving the QoS of multimedia traffic in IEEE 802.11e networks. Initially a combined cost metric is formed based on traffic contention time, average transmission delay and signal fading values. The path with minimum combined cost is chosen as the primary path from the multiple disjoint paths discovered. In case of failed data transmission, the traffic is re-routed through an alternate path with next minimum cost. Simulated Performance evaluation substantiates the reliability of the proposed protocol in achieving higher delivery ratio and throughput and reducing the delay. General Terms Average Transmission Delay, Multipath Route Discovery Process, Signal Fading Value, Traffic Contention Time.

A New Approach To Enhance Security In Mpls Network

As Multiprotocol Label Switching (MPLS) is becoming a more widespread technology For providing virtual private network (VPN) services, MPLS architecture security is of increasing concern to service providers (SPs) and VPN customers. MPLS suffers from a number of security issues as soon as an attacker successfully penetrates the core. This paper provides an approach to enhance security in MPLS network by integrating a new (k,n) Threshold Secret Sharing scheme with MPLS in which shares obtained are send over multiple disjoint paths. Our approach is implemented to measure time overhead on secrets packet transmission.