Multiple Disjoint Paths Research Articles

Enhanced reliability in hazardous event detection: A resilient multipath routing protocol for wireless sensor networks

AbstractWith the advance of climate change and the local effects of human activity, it has become of utmost importance to sense spatially extended natural and artificial physical phenomena to predict, monitor, and mitigate hazardous events. Wireless sensor networks are suitable for observing such phenomena, for example, wildfires, floods or landslides, without human supervision. This is due to affordable devices, independent power sources, wireless communication, and a broad range of sensors. During normal operation a few, while during the occurrence of an event a multitude of devices can fail. This leads to further disconnected devices, degrading the network's sensing capabilities. The communication requirements of such applications are difficult to fulfil with general routing protocols. The monitored event is rare compared to the network's lifetime, while its occurrence results in multiple, gradual node failures, still demanding the network to perform reliably. Available routing protocols fail to address every aspect of such application, thus the authors propose the Reliable Resilient Multipath Routing Protocol, designed to construct multiple disjoint paths from each device to a distinguished one, called the sink. The protocol employs proactive and reactive network management techniques to increase connection redundancy and maintain connectivity during failures. To verify the proposed protocol end‐to‐end, we evaluated the supported parameters, performed comparative simulations with routing algorithms known from the literature, and provided estimates of a realistic deployment.

Protection by diversity in elastic optical networks subject to single link failure

Among the multipath protection schemes found in the literature, the Partitioning Dedicated Path Protection — PDPP proposes to divide the total transmission rate required by the connection in equal parts, and then proceed the transmission of each part using multiple disjoint paths. Nevertheless, it is also possible to partition the transmission rate unequally among paths, enabling benefits to network performance. This article proposes a mixed-integer linear programming (MILP) formulation to find an optimized unequally partitioning of connections’ transmission rate among multiple disjoint paths, in order to provide dedicated protection and reduction in maximum number of slots on network and average bandwidth squeezing. The solution is analysed over a number of realistic networks, showing that the proposed formulation significantly reduces the spectral usage compared to traditional protection mechanisms and reduces the amount of squeezing required compared to the former PDPP approach.

Multipath Stability Routing in Cognitive UAV Swarm for Emergency Communications: A Hypergraph Matching Approach

With the rapid development of unmanned aerial vehicles (UAVs), it has been considered as an effective solution for emergency communications. In order to solve the contradiction between the rapid growth of user equipments and the shortage of spectrum resources as well as the problem that a single UAV cannot meet the multimission requirements, we integrate the cognitive radio spectrum access and UAVs to form a cognitive UAV swarm. Since most of the base stations cannot work properly in disaster scenarios, cognitive UAV swarm transmits the collected information through multihop routing in the form of a decentralized distributed ad hoc network. In order to solve the problems of low robustness of single paths and unstable links, we explore a multipath stability optimization problem and then propose a multipath stable routing algorithm based on the multidimensional hypergraph matching method. The results show that compared with the greedy algorithm, the proposed algorithm can obtain higher path stability while obtaining multiple node disjoint paths. Finally, this paper provides a reference value for establishing multipath routing of UAV ad hoc networks in emergency communication scenarios.

Disjoint multipath RPL for QoE/QoS provision in the Internet of Multimedia Things

RPL is the IETF standardized IPv6 Routing Protocol for Low-power and lossy networks (LLNs). The major effort is therefore made on handling low data rate traffic. Meanwhile, the Internet of Multimedia Things emerged as one hot topic of the Internet of Things. In LLNs, providing a descent quality of service (QoS) along with a user quality of experience (QoE) for multimedia applications is challenging. High bandwidth and significant computation capabilities are necessary while LLNs are very resource constrained. To raise the available bandwidth to accommodate high data rate applications, we propose to simultaneously transmit a flow on multiple disjoint paths. To do so, we exploit the DODAG structure, already maintained by RPL, to build disjoint paths without incurring extra overhead. To reduce the amount of data to send while considering the low computation resources of video sensors, we propose to apply a priority-based low-complexity encoding scheme on the captured pictures. Highest priority data can be replicated on more than one path. Our conducted experiments using simulations as well as a real testbed show that the best QoS and QoE are obtained when multiple paths are used along with the replication of highest priority data packets.

Quality and Energy Aware Multipath Routing in Wireless Multimedia Sensor Networks

In Wireless Multimedia Sensor Networks (WMSNs), the sensor nodes are capable of acquiring the multimedia information like wildlife tracking, traffic accidents as well scalar data. Because of these factors, the WMSNs have a bright future in both academic and industry circles. Multimedia applications, on the other hand, generate a lot of network traffic, which causes a lot of delay and wastes a lot of energy. In WMSNs, both network duration and quality of service are critical, hence an effective routing algorithm that can manage more data while simultaneously extending network lifetime is necessary. Towards this objective, in this paper, we proposes a Quality Aware Multipath Routing (QAMR) that selects multiple paths based on three reference metrics; they are Expected Transmission Count, Energy and Delay. For a given source and sink node, the QAMR constructs a composite metric by combining these three metrics and selects node disjoint multiple paths. Since the multiple paths with common nodes has less efficiency in data forwarding, we opt for node disjoint paths in which no two paths have one common node. On the proposed system QAMR model, extensive simulation tests are performed, and the outcomes are evaluated using a variety of metrics such as energy consumption, throughput, delay, and packet delivery ratio.

Data Transfers Using Bandwidth Reservation Through Multiple Disjoint Paths of Dynamic HPNs

Bandwidth reservation was initially designed to provide QoS for real-time multimedia applications, and has been extended to many other applications and widely used because of its proved high efficiency and effectiveness. Particularly, it has now become an indispensable service to support big data transfers in dynamic high-performance networks (HPNs) for remote data storage and processing. A number of problems regarding data transfers using bandwidth reservation have been investigated in the past few years, and most of them focused on the data transfers on one path or two disjoint paths of the dynamic HPNs. In this paper, three important problems regarding data transfers using bandwidth reservation on multiple node- and edge-disjoint paths in dynamic HPNs to achieve are studied: (i) the earliest completion time for a data transfer request through multiple disjoint variable paths with variable bandwidths, (ii) the earliest completion time for a data transfer request through multiple disjoint fixed paths with fixed bandwidths, and (iii) the minimum number of disjoint fixed paths with fixed bandwidths for a deadline-constrained data transfer request. We prove all of these problems to be NP-complete and propose one heuristic algorithm for each. We compare the proposed algorithms with two existing scheduling algorithms and one algorithm derived from an existing algorithm, and conduct extensive simulations. The simulation results show that our proposed heuristic algorithms have much better overall scheduling performance.

Multipath provisioning scheme for fault tolerance to minimize required spectrum resources in elastic optical networks

Multipath provisioning (MPP) uses multiple disjoint paths for data transmission to tolerate network failures. This paper proposes an MPP scheme, which allows allocating the different number of spectrum slots and different amount of transmission capacity to each path to minimize required spectrum resources in elastic optical networks. We present two optimization problems based on the proposed scheme and formulate them. Numerical results observe that the proposed scheme reduces the required spectrum resources compared to the conventional scheme, which allocates the same number of spectrum slots or the same amount of transmission capacity to each path.

The Disjoint Multipath Challenge: Multiple Disjoint Paths Guaranteeing Scalability

The multipath challenge is a research line in continuous development because of its multiple benefits, however, these benefits are overshadowed by scalability, which goes down considerably when the paths are multiple and disjoint. The disjointness aggregates an extra value to the multiple paths, but it also implies more complex mathematical operations that increase the computational cost. In fact, diverse proposals exist that try to increase scalability by limiting the number of paths obtained to the minimum possible (two-disjoint paths), which is enough for backup applications but not for other purposes. This paper presents an algorithm that solves these drawbacks by discovering multiple disjoint paths among multiple nodes in an efficient way, while keeping bounded the computational cost and ensuring scalability. The proposed algorithm has been validated thoroughly by performing a theoretical analysis, bolstered afterwards by an exhaustive experimental evaluation. The collected results are promising, our algorithm reduces the time spent to obtain the disjoint paths regarding its competitors between one and three orders of magnitude, at the cost of a slight decrease in the number of paths discovered.

Optimized flow assignment for applications with strict reliability and latency constraints using path diversity

The unprecedented increase in the number of smart connected devices invoked a plethora of diverse applications with different performance requirements stipulating various network management strategies. Ultra-reliable low-latency communication (URLLC), one of the promised 5G dimensions, is expected to enable mission-critical applications while adhering to the heterogeneity of their quality metrics. At its core, URLLC rests on the notion of providing stringent reliability and latency requirements, in which guaranteed network availability becomes a necessity. Network slicing (NS) is one of the key paradigms that can offer performance guarantees through customized network management of software defined networking (SDN). However, unlocking URLLC with network slicing based mechanisms requires careful demultiplexing of the network into various slices and proper assignment of traffic flows generated by ultra-reliable low latency applications over those slices. Within each slice, multiple disjoint paths may be selected to ensure the reliability requirement of the assigned application while meeting its latency constraint. Hence, we study, in this paper, the joint problem of forming end-to-end network slices, mapping URLLC applications to corresponding slices and assigning their traffic flows over multiple disjoint paths; then formulate it as a mixed integer program. Due to its complexity, we decompose the problem into two subproblems; end-to-end disjoint paths and traffic flow assignment for ultra-reliable low latency applications. Simulation results are presented for various scenarios to demonstrate the performance and scalability of the proposed decomposition approach as compared to the general formulation.

Node Disjoint Multiple Paths Routing Technique for Secure, Reliable and Confidential Data Transmission against Black Hole Attacks in MANET

The Ad-hoc On-Demand Multipath Distance Vector (AOMDV) is an extension of AODV protocol in the mobile ad-hoc network (MANET). It utilizes the features of DSDV, DSR, and AODV Routing protocols for Secure, Reliable and confidential data transmission against the attacks in the MANET, but in black hole attack malicious nodes utilize the behavior of AODV and show its malicious behavior at the data transmission, it causes the loss of data packets. So to avoid this loss more researchers have been conducted several techniques for detection and put several efforts to prevent the Blackhole attacks. But still, it is not prevented completely, so this paper proposes a Node Disjoint Multiple paths routing algorithm technique on AOMDV against blackhole attacks in MANET and shows its better performance in Network Simulator (NS2).

A Multipath Transport Scheme for Real-Time Multimedia Services Based on Software-Defined Networking and Segment Routing

It is still a challenging task to provide satisfactory quality of experience (QoE) to users by traditional routing mechanism in current public Internet for real-time multimedia services with high bandwidth and strict end-to-end latency constraint. Multipath transmission is a promising way to improve the performance of data delivery, due to its advantage in bandwidth aggregation capacity over multiple paths to speed up high volume transfers between endpoints. However, existing multipath transmission has many disadvantages such as the requirements for end-host support (i.e. the necessary multi-homed network setting, and operating system or upper applications updates of user devices), and blindingly pursuing maximum of transmission throughput. Path allocation and end-to-end transmission control are two important factors affecting the quality of multipath transmission. As an emerging network architecture, software-defined networking (SDN) is flexible, manageable, and responsive to rapid changes in traffic requirements. In this paper, we propose a multipath transport scheme based on SDN with segment routing (SR) which can meet the bandwidth and low end-to-end transmission latency requirements of real-time interactive multimedia services. The centralized SDN controller is extended to allocate multiple disjoint paths meeting bandwidth requirement meanwhile balancing the network load. The proprietary multipath media server (MMS) dynamically controls the assignment between subflows and routing paths to reduce the end-to-end transmission latency and thus improve QoE of end-users. To show the feasibility of our approach, we construct an SDN platform using Mininet. Simulation results show that our approach performs better compared to the conventional approaches in terms of traffic balancing and end-to-end transmission delay.

Energy Storage Overflow-Aware Data Delivery Scheme for Energy Harvesting Wireless Sensor Networks.

In Energy-Harvesting Wireless Sensor Networks (EH-WSNs), energy storage with limited capacity is used in the nodes to store the harvested energy. Energy storage overflow (ESO) happens when the energy storage is full, which causes the nodes to be unable to store the newly harvested energy. In traditional data delivery schemes, there is the problem of “energy hungry and surplus coexistence”, meaning that some nodes in the network are hungry for energy while some other nodes continue to waste energy due to ESO. To alleviate this problem, in this paper, we present the ESO-aware multiple path (EAMP) data delivery scheme so that more data can be delivered to the sink. With the EAMP, multiple disjoint paths from the source node to the sink are constructed, and the source node splits data into multiple pieces with each going through one of the paths, which helps in mitigating ESO. Simulation results show that the proposed EAMP scheme can deliver more data than the existing ones.

Synthesizing Fault-Tolerant Schedule for Time-Triggered Network Without Hot Backup

Real-time switched networks are becoming popular with the growing complexity of distributed embedded systems. There is a practical need to transmit noncritical data including diagnostic and supervising data for cost reduction. To meet hard real-time constraints, the time-triggered method is widely used due to its deterministic property, where both the reliability of the control data transmission and the tolerance of link failures are required. Conventional methods deploy redundant links and transmit frames over multiple disjoint paths. This paper presents a novel schedule method for the time-triggered network without simultaneous transmissions with multiple frames. The fault tolerance protocol is localized for critical data. We harness multiple effective optimization heuristics and strategies to ameliorate the existing schedule model and constraints. The experimental evaluation substantiates that our effective method can considerably improve the bandwidth for noncritical traffics with no link failures.

Minimum-latency data aggregation scheduling based on multi-path routing structures under physical interference model

Minimum-Latency Aggregation Scheduling is a significant problem in wireless sensor networks. The key challenge is to find an effective solution to aggregate data from all sensors to the sink with minimum aggregation latency. In this article, we propose a novel data aggregation scheduling algorithm under the physical interference model. First, the algorithm partitions the network into square cells according to the communication range of a sensor. Second, a node is selected randomly as the aggregated node to receive the data from the other nodes in the same cell. Finally, a data aggregation tree, which consists of multiple disjoint paths, is constructed to aggregate data from all aggregated nodes to the sink. We empirically proved that the delay of the aggregation schedule generated by our algorithm is ( K+1)2Δ− K−1+2λ time-slots at most, where K is a constant depending on the sensors transmitting power, the signal-to-interference-plus-noise-ratio threshold, and the path-loss exponent; [Formula: see text] represents the maximal number of nodes in a cell; and [Formula: see text] denotes the number of cells at a row/column in a square network area. Simulation results also show that our algorithm achieves lower average latency than the previous works.

Fault Detection for Message Passing Systems

Many crucial dependable and secure services including atomic commitment, consensus and group membership, and middleware services (such as replica, communication and transaction services) use fault detectors. Through the use of fault detectors, the overlying service can be exempted from failure treatment and synchronization requirements. Fault detection is essential for proving that the services carried out are correct. In this paper, we first identify the necessary conditions to detect faults in a message passing system where multiple disjoint paths exist between each pair of endpoints. We then present the first fault detection protocol capable of detecting message meta-data modification in the presence of various message interferences in addition to other faults including omission faults, message replay and spurious messages using disjoint paths, where paths with faults are not known a priori. In addition, it authenticates message origins allowing Sybil attacks to be detected, identifies faulty paths, and classifies faults in the presence of multiple messages sent by various system processes. We establish the completeness and soundness properties of the proposed algorithm, i.e., it detects each considered fault and each detected fault is an actual fault, respectively. We also show that our algorithm does not yield a significant packet size and delay overheads. The algorithm shows the viability of the use of disjoint paths in fault detection.

SMRRP: scalable multipath reactive routing protocol for mobile ad hoc networks

Routing scalability is a prime issue in a large mobile ad hoc network (MANET) and has a direct impact on the performance of the network. The performance of MANET degrades appreciably for a poorly scaled network. The present work aims at proposing a new routing protocol scalable multipath reactive routing protocol (SMRRP) for MANETs which aims at reducing the routing overhead incurred in recovering from route breaks. The SMRRP computes stable multiple disjoint paths from source node to destination node. The proposed routing protocol is suitable for a dynamic self-starting network and scales well to large populations of mobile nodes wishing to form mobile ad hoc networks.

SMRRP: scalable multipath reactive routing protocol for mobile ad hoc networks

Routing scalability is a prime issue in a large mobile ad hoc network (MANET) and has a direct impact on the performance of the network. The performance of MANET degrades appreciably for a poorly scaled network. The present work aims at proposing a new routing protocol scalable multipath reactive routing protocol (SMRRP) for MANETs which aims at reducing the routing overhead incurred in recovering from route breaks. The SMRRP computes stable multiple disjoint paths from source node to destination node. The proposed routing protocol is suitable for a dynamic self-starting network and scales well to large populations of mobile nodes wishing to form mobile ad hoc networks.

Flow Allocation for Maximum Throughput and Bounded Delay on Multiple Disjoint Paths for Random Access Wireless Multihop Networks

In this paper, we consider random access, wireless, multi-hop networks, with multi-packet reception capabilities, where multiple flows are forwarded to the gateways through node disjoint paths. We explore the issue of allocating flow on multiple paths, exhibiting both intra- and inter-path interference, in order to maximize average aggregate flow throughput (AAT) and also provide bounded packet delay. A distributed flow allocation scheme is proposed where allocation of flow on paths is formulated as an optimization problem. Through an illustrative topology it is shown that the corresponding problem is non-convex. Furthermore, a simple, but accurate model is employed for the average aggregate throughput achieved by all flows, that captures both intra- and inter-path interference through the SINR model. The proposed scheme is evaluated through Ns2 simulations of several random wireless scenarios. Simulation results reveal that, the model employed, accurately captures the AAT observed in the simulated scenarios, even when the assumption of saturated queues is removed. Simulation results also show that the proposed scheme achieves significantly higher AAT, for the vast majority of the wireless scenarios explored, than the following flow allocation schemes: one that assigns flows on paths on a round-robin fashion, one that optimally utilizes the best path only, and another one that assigns the maximum possible flow on each path. Finally, a variant of the proposed scheme is explored, where interference for each link is approximated by considering its dominant interfering nodes only.

Power Aware QoS Management in Node-Disjoint Multipath Routing Protocol FOR Mobile Adhoc Network

Multipath routing protocols are gradually increasing the network duration by share out the traffic between several paths. To widen the load between dissimilar nodes, node disjoint multiple paths are implemented for data communication. In such networks achieving Quality of Service (QoS) routing is a challenging task due to the network breakage by node mobility or high power consumption of mobile nodes. This paper presents a novel adaptation of Power Aware QoS Management in Node-Disjoint Multipath Routing Protocol (PAQM-NDMRP) to permit the sharp selection of node-disjoint routes from the environment condition of the network to satisfy the QoS requirements. The performance of our protocol is contrasted with NDMRP. From simulation results obtained from NS2 simulator by implementing the proposed protocol, show improved result in terms of power consumption, end-to-end delay, node mobility and throughput as compared to NDMRP.

Modified ECMP Routing Using Adapted Cost Disjoint Multiple Paths ACDMP

Modified ECMP Routing Using Adapted Cost Disjoint Multiple Paths ACDMP