Multipath Protocol Research Articles

A novel algorithm for the development of a multipath protocol for routing and energy efficient in IoT with varying density

A novel algorithm for the development of a multipath protocol for routing and energy efficient in IoT with varying density

A robust hybrid model with low energy consumption for biosensor nano-networks

The biosensor nano-network consists of mobile nano-nodes, nano-routers and micro-gateways in various levels of hierarchy. In the human body, the energy is harvested by the nano-devices by transforming various forms of energy into electrical energy. Simultaneously, the energy is consumed to collect and transmit data to the external network. So, a proper balance between energy harvesting and energy consumption is required. The current multi-path routing enables data flooding, using energy from numerous redundant nodes along the path. Whereas, single-path routing has the drawback of packet loss. In this article, we propose a hybrid model with low energy consumption and minimal packet loss. We grouped the nano-nodes into clusters by which the redundancy is avoided to a great extent. The nano-nodes communicate with a cluster primary node using a Lightweight Secure Directed Diffusion multi-path protocol, and the primary nodes communicate with the nano-router using Energy Conserving Routing single-path protocol at the layer-1 of our model. In the conventional models, the micro-gateway communication with the nano-routers created energy irregularities. So, we come up with a query routing protocol at the layer-2 that chooses a particular nano-router for communication with the micro-gateway. As a result, the energy consumption at the micro-gateway is decreased.

Novel Optimized Strategy Based on Multi-Next-Hops Election to Reduce Video Transmission Delay for GPSR Protocol over VANETs

Reducing transmission traffic delay is one of the most important issues that need to be considered for routing protocols, especially in the case of multimedia applications over vehicular ad hoc networks (VANET). To this end, we propose an extension of the FzGR (fuzzy geographical routing protocol), named MNH-FGR (multi-next-hops fuzzy geographical routing protocol). MNH-FGR is a multipath protocol that gains great extensibility by employing different link metrics and weight functions. To schedule multimedia traffic among multiple heterogeneous links, MNH-FGR integrates the weighted round-robin (WRR) scheduling algorithm, where the link weights, needed for scheduling, are computed using the multi-constrained QoS metric provided by the FzGR. The main goal is to ensure the stability of the network and the continuity of data flow during transmission. Simulation experiments with NS-2 are presented in order to validate our proposal. Additionally, we present a neural network algorithm to analyze and optimize the performance of routing protocols. The results show that MNH-FGR could satisfy critical multimedia applications with high on-time constraints. Also, the DNN model used can provide insights about which features had an impact on protocol performance.

Invulnerability Improvement of Multipath Protocols in Different Scenarios

Developments in computer communications and networks enabled the deployment of exciting new areas. Meanwhile, Efficient network and communication technologies also promote the development of routing protocols. AODV(Ad hoc On-Demand Distance Vector Routing, AODV) routing protocol has invulnerability to different mobile attributes of agent nodes and network damage scenarios. However, this invulnerability performance can not meet the needs of mobile multi-agent cooperative communication. Therefore, this paper proposes an improved responsive multipath routing protocol MD_AODV(Multipath Destroy-resistance AODV, MD_AODV). This routing protocol is based on AODV routing protocol. It is mainly improved in three aspects: multichannel concurrency mechanism, node load balancing mechanism and shortest path maintenance mechanism. Firstly, in this research, an improved multipath routing protocol is modeled and implemented, which is based on OPNET Network simulation platform. Then, network models with different degrees of impairment are built. Combines the mobile attributes of mobile multi-agent task coordination to carry out invulnerability simulation experiments . These experiments study the invulnerability of the improved multipath routing protocol. Finally, this paper evaluates and compares the routing invulnerability of MD_AODV, AODV and AOMDV(Ad-hoc On-Demand Multipath Distance Vector, AOMDV). The evaluation results show that MD_AODV routing has better invulnerability when the network is severely damaged

Data Center Traffic Scheduling Strategy for Minimization Congestion and Quality of Service Guaranteeing

According to Cisco’s Internet Report 2020 white paper, there will be 29.3 billion connected devices worldwide by 2023, up from 18.4 billion in 2018. 5G connections will generate nearly three times more traffic than 4G connections. While bringing a boom to the network, it also presents unprecedented challenges in terms of flow forwarding decisions. The path assignment mechanism used in traditional traffic scheduling methods tends to cause local network congestion caused by the concentration of elephant flows, resulting in unbalanced network load and degraded quality of service. Using the centralized control of software-defined networks, this study proposes a data center traffic scheduling strategy for minimization congestion and quality of service guaranteeing (MCQG). The ideal transmission path is selected for data flows while considering the network congestion rate and quality of service. Different traffic scheduling strategies are used according to the characteristics of different service types in data centers. Reroute scheduling for elephant flows that tend to cause local congestion. The path evaluation function is formed by the maximum link utilization on the path, the number of elephant flows and the time delay, and the fast merit-seeking capability of the sparrow search algorithm is used to find the path with the lowest actual link overhead as the rerouting path for the elephant flows. It is used to reduce the possibility of local network congestion occurrence. Equal cost multi-path (ECMP) protocols with faster response time are used to schedule mouse flows with shorter duration. Used to guarantee the quality of service of the network. To achieve isolated transmission of various types of data streams. The experimental results show that the proposed strategy has higher throughput, better network load balancing, and better robustness compared to ECMP under different traffic models. In addition, because it can fully utilize the resources in the network, MCQG also outperforms another traffic scheduling strategy that does rerouting for elephant flows (namely Hedera). Compared with ECMP and Hedera, MCQG improves average throughput by 11.73% and 4.29%, and normalized total throughput by 6.74% and 2.64%, respectively; MCQG improves link utilization by 23.25% and 15.07%; in addition, the average round-trip delay and packet loss rate fluctuate significantly less than the two compared strategies.

An Effective Wireless Sensor Network Routing Protocol Based on Particle Swarm Optimization Algorithm

Improving wireless communication and artificial intelligence technologies by using Internet of Things (Itoh) paradigm has been contributed in developing a wide range of different applications. However, the exponential growth of smart phones and Internet of Things (IoT) devices in wireless sensor networks (WSNs) is becoming an emerging challenge that adds some limitations on Quality of Service (QoS) requirements. End-to-end latency, energy consumption, and packet loss during transmission are the main QoS requirements that could be affected by increasing the number of IoT applications connected through WSNs. To address these limitations, an effective routing protocol needs to be designed for boosting the performance of WSNs and QoS metrics. In this paper, an optimization approach using Particle Swarm Optimization (PSO) algorithm is proposed to develop a multipath protocol, called a Particle Swarm Optimization Routing Protocol (MPSORP). The MPSORP is used for WSN-based IoT applications with a large volume of traffic loads and unfairness in network flow. For evaluating the developed protocol, an experiment is conducted using NS-2 simulator with different configurations and parameters. Furthermore, the performance of MPSORP is compared with AODV and DSDV routing protocols. The experimental results of this comparison demonstrated that the proposed approach achieves several advantages such as saving energy, low end-to-end delay, high packet delivery ratio, high throughput, and low normalization load.

Can Wavelet Transform Detect LDDoS Abnormal Traffic in Multipath TCP Transmission System?

With the rapid development of mobile Internet technology and multihost terminal devices, multipath transmission protocol has been widely concerned. Among them, multipath TCP (MPTCP) has become a hot research protocol in recent years because of its good transmission performance and Internet compatibility. Due to the increasing power of Low-Rate Distributed Denial of Service (LDDoS) attack, the network security situation is becoming increasingly serious. The robustness of MPTCP network has become an urgent performance index to improve. Therefore, it is very necessary to detect LDDoS abnormal traffic timely and effectively in the transmission system based on MPTCP. This paper tries to use wavelet transform technology to decompose and reconstruct network traffic and find a detection method of LDDoS abnormal traffic in the MPTCP transmission system. The experimental results show that in the MPTCP transmission system, the signal processing technology based on wavelet transform can realize the identification of LDDoS abnormal traffic. It indicates a direction worth further exploration for the detection and defense of the LDDoS attack.

The HOP Protocol: Reliable Latency-Bounded End-to-End Multipath Communication

Next-generation wireless networks are expected to enable new applications with strict latency constraints. However, existing transport layer protocols are unable to meet the stringent Quality of Service (QoS) requirements on throughput and maximum latency: excessive queuing due to capacity-oriented congestion control inflates end-to-end latency well beyond interactivity deadlines. In this work, we propose a novel framework that evolves best-effort communications into reliability- and latency-aware communications for QoS-sensitive applications. The new protocol, named High-reliability latency-bounded Overlay Protocol (HOP), provides a novel combination of packet-level Forward Error Correction (FEC) and multipath scheduling to compensate for capacity drops and meet pre-defined QoS requirements. More specifically, the sender splits the data and the associated redundancy between the paths by using a stochastic forecast of their future capacity and decides the amount of redundancy necessary to meet the application’s requirements without clogging the connections. We compare HOP’s performance with state-of-the-art multipath protocols in ns-3 simulations using both synthetic and live network traces, and confirm that our scheme can reliably deliver high-throughput data, reducing the number of late blocks by 2 to 5 times with respect to optimized Multipath TCP (MPTCP).

Model and simulations of multipath bridge routing for inter-swarm UAV communications in EMANE/CORE

ABSTRACT The unmanned aerial vehicle (UAV) network is a special type of mobile ad hoc network (MANET). 1 There are two types of UAV swarm communications: Communications within a swarm (i.e. intra-swarm) and communication between different swarms (i.e. inter-swarm). This paper proposes the concept of bridge routing to establish the route(s) for efficient inter-swarm communications. The bridge routing scheme is a progressive process with two functions: UAV formation control and data transmissions. Based on the bridge routing topology, we have implemented the multipath user datagram protocol (MP-UDP), as a sub-layer between the transport and application layers. Compared with the multipath transmission control protocol (MP-TCP), MP-UDP is more suitable to the dynamic network topologies, since it does not use the high-overhead sliding window control. We have used the emulator tools, the Extendable Mobile Ad -hoc Network Emulator (EMANE) and Common Open Research Emulator (CORE) to implement and study the QoS performance of MP-UDP and bridge routing in UAV swarm networks. Our results demonstrate the improved throughput performance for inter-swarm communications. Approved for Public Release; distribution unlimited 88ABW-2020-2122 on 13 July 2020. Other requests shall be referred to AFRL/RIT 525 Brooks Rd Rome, NY 13,441

A Cached Based Multipath Load Balancing Technique for Internet of Things Sensor Networks

By providing intelligent capabilities to objects the physical objects communicate each other without human intervention in Internet of Things (IoT) environment. And these devices generate enormous traffic as the sum of IoT gadgets is increased. As the network traffic is irregular it is most important to obtain an optimal load balance among all the nodes. In this paper, we propose to develop a cache based multipath load balancing protocol for IoT sensor networks. In this protocol multiple paths are established between each IoT sender and the server such that each sender has multiple next-hop delivering IoT data. Whenever, the load of the server becomes greater than a threshold, the server transmits the overloaded high priority data to these cache points and the IoT clients can fetch the data from the nearby CPs rather than the server. The outcome of simulation had proved that CBMLB mechanism attains maximum ratio of packet delivery with reduced overhead and delay.

Multipath Reliable Routing Using Cluster Based Communication

In this research we proposed the protection in ANT Optimized primarily based multipath congestion routing performance. Here the situation of DDoS is simulated and examines their impact in dynamic network. The multipath protocol like AOMDV is balance the all load by way of offering alternative path however not knowledgeable at each and every condition. The DDoS attacker is blocking off the whole viable direction in community by way of flooding large quantity of redundant packets in dynamic network. The attacker is that the intermediate node and this attacker contamination is continuously dispersing infection and the entire network overall performance is dumped. The proposed security scheme is identified attacker and their loss effect. Attacker is utterly disabled by way of proposed protection mechanism and their loss is also evaluated. The proposed approach is now not only detecting but also stop community from DDoS attack. The overall performance of protection scheme and assault is measured in three distinctive scenarios of a range of node densities. The proposed scheme is offers attacker free routing and get better network performance after making use of it. The performance of ANT OPTIMIZED is almost equal. The packets receiving, throughput, and PDR are bettering but the loss of packets and unnecessary flooding is decreased in dynamic network.

Adaptive Decrease Window for BALIA (ADW-BALIA): Congestion Control Algorithm for Throughput Improvement in Nonshared Bottlenecks

The main design goals of the multipath transmission control protocol (MPTCP) are to improve the throughput and share a common bottleneck link fairly with a single-path transmission control protocol (TCP). The existing MPTCP congestion control algorithms achieve the goal of fairness with single-path TCP flows in a shared bottleneck, but they cannot maximize the throughput in nonshared bottlenecks, where multiple subflows traverse different bottleneck links. This is because the MPTCP is designed not to exceed the throughput of a single-path TCP competing in the bottleneck. Therefore, we believe that MPTCP congestion control should have different congestion window control mechanisms, depending on the bottleneck type. In this paper, we propose an adaptive decrease window (ADW) balanced linked adaptation (BALIA) congestion control algorithm that adaptively adjusts the congestion window decrease in order to achieve better throughput in nonshared bottlenecks while maintaining fairness with the single-path TCP flows in shared bottlenecks. The ADW-BALIA algorithm detects shared and nonshared bottlenecks based on delay fluctuations and it uses different congestion window decrease methods for the two types of bottleneck. When the delay fluctuations of the MPTCP subflows are similar, the ADW-BALIA algorithm behaves the same as the existing BALIA congestion control algorithm. If the delay fluctuations are dissimilar, then the ADW-BALIA algorithm adaptively modulates the congestion window reduction. We implement the ADW-BALIA algorithm in the Linux kernel and perform an emulation experiment that is based on various topologies. ADW-BALIA improves the aggregate MPTCP throughput by 20% in the nonshared bottleneck scenario, while maintaining fairness with the single-path TCP in the shared bottleneck scenario. Even in a triple bottleneck topology, where both types of bottlenecks exist together, the throughput increases significantly. We confirmed that the ADW-BALIA algorithm works stably for different delay paths, in competition with CUBIC flows, and with lossy links.

Multi-Path Routing in Green Multi-Stage Upgrade for Bundled-Links SDN/OSPF-ECMP Networks

This paper considers the novel problem of upgrading a <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">legacy</i> network into a Software Defined Network (SDN) over multiple stages and saving energy in the upgraded network, or hybrid SDN. That is, in each stage, the problem at hand is to select and replace <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">legacy</i> switches with SDN switches and reroute traffic to power off as many unused cables as possible to save energy. Also, the operator must consider: (i) the available budget at each stage, (ii) maximum path delays, (iii) maximum link utilization, (iv) per-stage increase (decrease) in traffic size (upgrade cost), and (v) the Open Shortest Path First - Equal Cost Multi-Path protocol. This paper addresses two multi-path routing scenarios: 1) non-link-disjoint and 2) link-disjoint. It outlines a Mixed Integer Program and a heuristic algorithm for each scenario. The experimental results show that: (i) both solutions produce only up to 0.63% higher energy saving in scenario-1 than in scenario-2, (ii) the mixed integer program (heuristic algorithm) for both scenarios give an energy saving up to 71.93% (71.64%), (iii) using a larger budget and/or number of stages can increase the energy saving, and (iv) the saving achieved by the heuristic solution for each scenario is within 4% from the optimal saving.

Failure-Aware and Delay-Predicted Multipath Virtual Queue Scheduling for Multimedia Transmission in Edge IoT

The spread of Edge Internet of Things (IoT) radically changes our lifestyle. However, the multimedia services in edge IoT are still stuck by inefficiency. The dynamic typologies perplex the transmission of massive real-time data. To solve this problem, multipath transmission control protocol (MPTCP) which has a natural advantage in transmission robustness and bandwidth aggregation is becoming a good choice. In this paper, failure-aware and delay-predicted multipath virtual queue scheduling (FD-MVQS) is proposed to optimize the MPTCP performance in edge IoT. FD-MVQS constructs a two-plane cooperative scheduling system. In the control plane, the transmission failure estimation and chaos theory-based arrival delay prediction methods are introduced to provide the foundation for prescheduling. In the data plane, the multipath virtual queue scheduling is designed to allocate segments to different subflows. Simulation results showed that the proposed FD-MVQS performed better than standard and typical multipath transmission solutions in throughput, delay, and segment disorder.

A New Energy-Efficient Multipath Routing in Internet of Things Based on Gray Theory

Internet of Things (IoT) is a network of smart things. It indicates the ability that the mentioned physical things transfer information with each other. The characteristics of these networks, such as topology dynamicity and energy constraint, make the routing problem a challenging task in these networks. Traditional routing methods could not achieve the required performance in these networks. Therefore, developers of these networks have to consider specific routing methods in order to satisfy their requirements. One of the routing methods is utilization of the multipath protocols in which data are sent to its destination using multiple routes with separate links. One of such protocols is AOMDV routing protocol. In this paper, AOMDV is improved using gray system theory which chooses the best paths used for separate routes to send packets. To do this, Ad hoc On-demand Multipath Distance Vector (AOMDV) packet format is altered and some fields are added to it so that energy criteria, link expiration time, and signal-to-noise ratio can also be considered during selection of the best route. The proposed method named RMPGST-IoT is introduced which chooses the routes with highest rank for concurrent transmission of data, using a specific method based on the gray system theory. In order to evaluate the results, the proposed Routing Multipath based on Gray System Theory (RMPGST)-IoT method is compared to the Emergency Response IoT based on Global Information Decision (ERGID) and Ad hoc Delay-aware Distributed Routing Model (ADRM)-IoT approaches in terms of throughput, packet receiving rate, packet loss rate, average remaining energy, and network lifetime. The results demonstrate that the performance of the proposed RMPGST-IoT is superior to that of ERGID and ADRM-IoT approaches.

ASR - Adaptive Similarity-Based Regressor for Uplink Data Rate Estimation in Mobile Networks

This paper presents a passive data rate estimation method that leverages commonly available parameters of commercial modems with application in Intelligent Transportation Systems. The estimation is performed by utilizing an Adaptive Similarity-based Regression (ASR) approach. This constitutes the use of Support-Vector Regression (SVR) in conjunction with a similarity-based unlearning algorithm. It is demonstrated that this approach can adapt to the various properties of different mobile networks, while maintaining a fixed training set size. This is particularly useful in cases where training data is not available in large quantities, or the uplink rate is limited by the users subscription. ASR is developed as a set of modular components and as such can be used as an enhancement to protocols such as multipath Transmission Control Protocol (TCP), Software-Defined Networking (SDN), or as an aid to Quality-of-Service (QoS) routing. It is shown that the algorithm can achieve satisfactory performance with as little as 24 training samples, and can be deployed across different mobile networks without the need of pre-training. The solution is validated using a custom test-bed to perform mobile network measurements, gathering over 15, 000 measurement samples. In addition, the algorithm is tested using measurements collected under real life conditions both in a moving car and train. As there is a shortage of open source data in the field of rate estimation in mobile networks, we publish all of the data sets used in this paper to encourage further research on the subject.

Q Learning Algorithm with Network Coding in Multi Path Transfer Protocol for Wireless Mesh Network

In a wireless mesh network, the network coding algorithm used to improve network efficiency. In this paper, we have implemented the Q-learning algorithm with CSMA/CA as in distributed co-ordination function along with multi-path transfer protocol (MPTP). The functioning of CSMA/CA is based on physical carrier sensing. Q-learning algorithm, along with network coding, is implemented to achieve better throughput. Our proposed method has used to reduce the packet loss and to minimize the end to end delay of the network communication. Also, it will improve the possibility of receiver buffer blocking.

SDN-Based Survivability Analysis for V2I Communications

In vehicle-to-infrastructure (V2I) communications, various failures in the dynamic movement pose serious link interruptions. To study the continuous service quality for the V2I network when this issue happens, this paper proposes a survivability analysis and establishes the communication architecture for software-defined network (SDN)-based V2I communications. With the controllable advantages of SDN centralized management, the multi-path transmission control protocol is used to seamlessly switch the transmission information between the V2I links of each vehicle node. Specifically, according to the analysis of specific fault types for V2I links, the definitions of SDN-based V2I survivability is provided to establish the corresponding survivability mode. To further verify the survivability model, a full-state search is adopted by means of probability model checker PRISM. In addition, multi-directional probability and expected reward evaluation analyses are carried out from the point of view of time. The simulation results show that, with the failure of multiple V2I links, the network quality of service (QoS) correspondingly declines, but the network still survives, due to the multi-path transmission control protocol (MPTCP) action. Moreover, with a high fault repair rate, the service performance and survivability of the network is improved rapidly.

Enhancing Security in Smart Cities using Dynamic Multipath Algorithm

The world of today is an ultimate connected world, where all types of physical devices and virtual objects can communicate in order to exchange information or provide services. Internet of Things (IoT) is one of the leading areas that make this worldwide connection possible, by integrating and enabling different solutions and communication technologies. Wireless mobile networks are increasing very fast and giving more perspectives in the telecommunication field. Nevertheless, some problems are still facing this development. The most important and mandatory issue, among them, is the security of the network. In this paper, we will introduce some related works about security concept for mobile networks and we present our solution that provides a new dynamic approach to find a variable number of multiple paths according to the neighborhood, the density and to the mobility of nodes in the network. In order to evaluate the impact of our solution on network performances, we implement our algorithm on one of the most known multipath protocols (MP-OLSR).

Prevention of Routing Attacks using Trust-Based Multipath Protocol

Prevention of Routing Attacks using Trust-Based Multipath Protocol