Improved Multi-Path Routing for QoS on MANET

A Mobile Ad hoc NETwork(MANET)is a self-configuring network that is not reliant on infrastructure.This paper introduces a new multipath routing method based on the Multi-Hop Routing(MHR)technique.MHR is the consecutive selection of suitable relay nodes to send information across nodes that are not within direct range of each other.Failing to ensure good MHR leads to several negative consequences,ultimately causing unsuccessful data transmission in a MANET.This research work consists of three portions.The first to attempt to propose an efficient MHR protocol is the design of Priority Based Dynamic Routing(PBDR)to adapt to the dynamic MANET environment by reducing Node Link Failures(NLF)in the network.This is achieved by dynamically considering a node’s mobility parameters like relative velocity and link duration,which enable the next-hop selection.This method works more efficiently than the traditional protocols.Then the second stage is the Improved Multi-Path Dynamic Routing(IMPDR).The enhancement is mainly focused on further improving the Quality of Service(QoS)in MANETs by introducing a QoS timer at every node to help in the QoS routing of MANETs.Since QoS is the most vital metric that assesses a protocol,its dynamic estimation has improved network performance considerably.This method uses distance,linkability,trust,and QoS as the four parameters for the next-hop selection.IMPDR is compared against traditional routing protocols.The Network Simulator-2(NS2)is used to conduct a simulation analysis of the protocols under consideration.The proposed tests are assessed for the Packet Delivery Ratio(PDR),Packet Loss Rate(PLR),End-to-End Delay(EED),and Network Throughput(NT).

Multi-Path Routing and Resource Allocation in Active Network

An algorithm of traffic distribution called active multi-path routing (AMR)in active network is proposed. AMR adopts multi-path routing and applies nonlinear optimizeapproximate method to distribute network traffic among multiple paths. It is combined to bandwidthresource allocation and the congestion restraint mechanism to avoid congestion happening and worsen.So network performance can be improved greatly. The frame of AMR includes adaptive trafficallocation model, the conception of supply bandwidth and its' allocation model, the principle ofcongestion restraint and its' model, and the implement of AMR based on multi-agents system in activenetwork. Through simulations, AMR has distinct effects on network performance. The results show AMRisa valid traffic regulation algorithm.

MRBCH: A Multi-Path Routing Protocol Based on Credible Cluster Heads for Wireless Sensor Networks

Wireless sensor networks are widely used for its flexibility, but they also suffer from problems like limited capacity, large node number and vulnerability to security threats. In this paper, we propose a multi-path routing protocol based on the credible cluster heads. The protocol chooses nodes with more energy remained as cluster heads at the cluster head choosing phase, and then authenticates them by the neighbor cluster heads. Using trust mechanisms it creates the credit value, and based on the credit value the multi-path cluster head routing can finally be found. The credit value is created and exchanged among the cluster heads only. Theoretical analysis combined with simulation results demonstrate that this protocol can save the resource, prolong the lifetime, and ensure the security and performance of the network.

The quickly switching routing algorithm based on multi-path in mobile Ad Hoc networks

This paper proposes a new on-demand multi-alternate-path algorithm, called quickly switching routing algorithm(QSRA). It switches failure routing to an alternate path as quickly as the network can. Like a nervure shape, algorithm QSRA shapes disjoint-alternate-path structure, but is not limited to. It also contains another structure that every primary node has several links to alternate paths. This structure has two advantages, the first one is that primary nodes can select one alternate path immediately when primary routing is failure without going back to source node to re-discover a new routing or choose an alternate path; the second is that it guarantees primary nodes can select another alternate path as quickly as possible once one of alternate paths fails. Strongpoint of algorithm QSRA is reducing frequency of routing re-discovering. Besides, the structure occupies fewer resources than other routing algorithms due to its distributed structure. Simulation shows that QSRA has higher packets received ratio and lower control packet overhead and lower end-to-end delay.

Adaptive Multi-Cost Routing Protocol to Enhance Lifetime for Wireless Body Area Network

Wireless Body Area Network(WBAN)technologies are emerging with extensive applications in several domains.Health is a fascinating domain of WBAN for smart monitoring of a patient’s condition.An important factor to consider in WBAN is a node’s lifetime.Improving the lifetime of nodes is critical to address many issues,such as utility and reliability.Existing routing protocols have addressed the energy conservation problem but considered only a few parameters,thus affecting their performance.Moreover,most of the existing schemes did not consider traffic prioritization which is critical in WBANs.In this paper,an adaptive multi-cost routing protocol is proposed with a multi-objective cost function considering minimum distance from sink,temperature of sensor nodes,priority of sensed data,and maximum residual energy on sensor nodes.The performance of the proposed protocol is compared with the existing schemes for the parameters:network lifetime,stability period,throughput,energy consumption,and path loss.It is evident from the obtained results that the proposed protocol improves network lifetime and stability period by 30%and 15%,respectively,as well as outperforms the existing protocols in terms of throughput,energy consumption,and path loss.

SOPA:Source Routing Based Packet-Level Multi-Path Routing in Data Center Networks

Many ＂rich - connected＂ topologies with multiple parallel paths between smwers have been proposed for data center networks recently to provide high bisection bandwidth, but it re mains challenging to fully utilize the high network capacity by appropriate multi- path routing algorithms. As flow-level path splitting may lead to trafl＇ic imbalance between paths due to flow- size difference, packet-level path splitting attracts more attention lately, which spreads packets from flows into multiple available paths and significantly improves link utilizations. However, it may cause packet reordering, confusing the TCP congestion control algorithm and lowering the throughput of flows. In this paper, we design a novel packetlevel multi-path routing scheme called SOPA, which leverag- es OpenFlow to perform packet-level path splitting in a round- robin fashion, and hence significantly mitigates the packet reordering problem and improves the network throughput. Moreover, SOPA leverages the topological feature of data center networks to encode a very small number of switches along the path into the packet header, resulting in very light overhead. Compared with random packet spraying （RPS）, Hedera and equal-cost multi-path routing （ECMP）, our simulations demonstrate that SOPA achieves 29.87%, 50.41% and 77.74% higher network throughput respectively under permutation workload, and reduces average data transfer completion time by 53.65%, 343.31% and 348.25% respectively under production workload.

Reliable Braided Multipath Routing with Network Coding for Underwater Sensor Networks

Owing to the long propagation delay and high error rate of acoustic channels, it is very challenging to provide reliable data transfer for underwater sensor networks. Moreover, network coding is proved to be an effective coding technique for throughput and robustness of networks. In this paper, we propose a Reliable Braided Multipath Routing with Network Coding for underwater sensor networks （RBMR-NC）. Disjoint multi-path algorithm is used to build independent actual paths, as called main paths. Some braided paths on each main path are built according to the braided multi-path algorithm, which are called logic paths. When a data packet is transmitted by these nodes, the nodes can employ network coding to encode packets coming from the same group in order to further reduce relativity among these packets, and enhance the probability of successful decoding at the sink node. Braided multi-path can make the main paths to be multiplexed to reduce the probability of long paths. This paper mainly employs successful delivery rate to evaluate RBMR-NC model with theoretical analysis and simulation methods. The results indicate that the proposed RBMR-NC protocol is valuable to enhance network reliability and to reduce system redundancy.

Joint routing and rate allocation for multiple video streams in ad-hoc wireless networks

The support for multiple video streams in an ad-hoc wireless network requires appropriate routing and rate allocation measures ascertaining the set of links for transmitting each stream and the encoding rate of the video to be delivered over the chosen links. The routing and rate allocation procedures impact the sustained quality of each video stream measured as the mean squared error (MSE) distortion at the receiver, and the overall network congestion in terms of queuing delay per link. We study the trade-off between these two competing objectives in a convex optimization formulation, and discuss both centralized and dis- tributed solutions for joint routing and rate allocation for multiple streams. For each stream, the optimal allocated rate strikes a balance between the selfish motive of minimizing video distortion and the global good of minimizing network congestions, while the routes are chosen over the least-congested links in the network. In addition to detailed analysis, network simulation results using ns-2 are presented for studying the optimal choice of parameters and to confirm the effectiveness of the proposed measures.

Research of multi-path routing based on network coding in space information networks

A multi-path routing algorithm based on network coding is proposed for combating long propagation delay and high bit error rate of space information networks. On the basis of traditional multi-path routing, the algorithm uses a random linear network coding strategy to code data pack- ets. Code number is determined by the next hop link status and the number of current received packets sent by the upstream node together. The algorithm improves retransmission and cache mechanisms through using redundancy caused by network coding. Meanwhile, the algorithm also adopts the flow distribution strategy based on time delay to balance network load. Simulation results show that the proposed routing algorithm can effectively improve packet delivery rate, reduce packet delay, and enhance network performance.

Distributed Multi-hop Clustering Approach with Low Energy Consumption in WSN

The purpose of sensing the environment and geographical positions,device monitoring,and information gathering are accomplished using Wireless Sensor Network(WSN),which is a non-dependent device consisting of a distinct collection of Sensor Node(SN).Thus,a clustering based on Energy Efficient(EE),one of the most crucial processes performed in WSN with distinct environments,is utilized.In order to efficiently manage energy allocation during sensing and communication,the present research on managing energy efficiency is performed on the basis of distributed algorithm.Multiples of EE methods were incapable of supporting EE routing with MIN-EC in WSN in spite of the focus of EE methods on energy harvesting and minimum Energy Consumption(EC).The three stages of performance are proposed in this research work.At the outset,during routing and Route Searching Time(RST)with fluctuating node density and PKTs,EC is reduced by the Hybrid Energy-based Multi-User Routing(HEMUR)model proposed in this work.Energy efficiency and an ideal route for various SNs with distinct PKTs in WSN are obtained by this model.By utilizing the Approximation Algorithm(AA),the Bregman Tensor Approximation Clustering(BTAC)is applied to improve the Route Path Selection(RPS)efficiency for Data Packet Transmission(DPT)at the Sink Node(SkN).The enhanced Network Throughput Rate(NTR)and low DPT Delay are provided by BTAC.To MAX the Clustering Efficiency(CE)and minimize the EC,the Energy Effective Distributed Multi-hop Clustering(GISEDC)method based on Generalized Iterative Scaling is implemented.The Multi-User Routing(MUR)is used by the HEMUR model to enhance the EC by 20%during routing.When compared with other advanced techniques,the Average Energy Per Packet(AEPP)is enhanced by 39%with the application of proportional fairness with Boltzmann Distribution(BD).The Gaussian Fast Linear Combinations(GFLC)with AA are applied by BTAC method with an enhanced Communication Overhead(COH)for an increase in performance by 19%and minimize the DPT delay by 23%.When compared with the rest of the advanced techniques,CE is enhanced by 8%and EC by 27%with the application of GISEDC method.

Toward path reliability by using adaptive multi-path routing mechanism for multimedia service in mobile Ad-hoc network

Traditional multi-path routing mechanisms aim to establish complete node or link disjoint paths. However, under some circumstances if multiple paths cannot be established based on the current network topology, the traditional multi-path routing mechanism will degenerate into single path routing mechanism, thus the advantages of multi-path routing cannot be exhibited. To enhance the end-to-end path reliability, an adaptive multi-path routing mechanism with path segment is proposed, in which multi-path can be established at part of the end-to-end path. In this way the reliability of the path can be enhanced. This path segment mechanism can divide the end-to-end path into several short segments, and a parallel forwarding mechanism is proposed for guaranteeing the quality of service of multimedia services over the wireless network. Simulations show that the network performance metrics such as the packet delivery ratio, the end-to-end delay and the number of route discoveries are all improved by using the adaptive multi-path routing mechanism.

Multi-path routing based on load-balance for cognitive packet networks

Quality of service （QoS） routing algorithms have been hardly discussed in the scientific community, most previous work on QoS routing concentrates on the performance of the single route. Cognitive packet network （CPN） has been designed for providing QoS routing. In this paper, to balance the loads among networks, we present a multi-path routing algorithm based on load-balance （MPRLB）, which is carried out in two steps. The algorithm with low computational complexity is firstly applied to establish multi path routing for each source and destination node pairs （SD-pair） nodes in the network. Then, we propose the hopfield neural network algorithm, which is applied to improve the efficiency of the flow deviation method for fast flow allocation among the links of the network based on load balance. Extensive simulation results demonstrate that the proposed scheme significantly improves the performance compared with the existing scheme that ignores load balancing.

Study of network survivability based on multi-path routing mechanism

As an important secure routing mechanism, multi-path routing is one of the major ways to improve network efficiency and to guarantee the network security, which ensures the reliability of data transmission by using backup paths when the primary one is unavailable due to local node or link failures. Most current studies on multi-path routing mechanism are based on experiments or simulations. The resulta are usually specific application scenarios oriented heuristic algorithms, lacking universal significance. In this paper, a theoretic analysis is performed on the relationship between the multi-path routing policy, the network efficiency and its survivability. Starting with point-to-point communication network, an impactoriented analysis is made on the network interference under multi-path routing mechanism. Based on the analysis, the upper-limit of network performance under interference impact is also discussed.

An OpenFlow-Based Load Balancing Strategy in SDN

In today’s datacenter network,the quantity growth and complexity increment of traffic is unprecedented,which brings not only the booming of network development,but also the problem of network performance degradation,such as more chance of network congestion and serious load imbalance.Due to the dynamically changing traffic patterns,the state-of the-art approaches that do this all require forklift changes to data center networking gear.The root of problem is lack of distinct strategies for elephant and mice flows.Under this condition,it is essential to enforce accurate elephant flow detection and come up with a novel load balancing solution to alleviate the network congestion and achieve high bandwidth utilization.This paper proposed an OpenFlow-based load balancing strategy for datacenter networks that accurately detect elephant flows and enforce distinct routing schemes with different flow types so as to achieve high usage of network capacity.The prototype implemented in Mininet testbed with POX controller and verify the feasibility of our load-balancing strategy when dealing with flow confliction and network degradation.The results show the proposed strategy can adequately generate flow rules and significantly enhance the performance of the bandwidth usage compared against other solutions from the literature in terms of load balancing.

Non-uniform clustering routing protocol of wheat farmland based on effective energy consumption

Wireless sensor network(WSN)can achieve real-time data collection and transmission of environment,soil,meteorology,crop physiology and other information in agriculture.The data provided by WSN could be used for decision making and management,which is very important in precision agriculture.Wheat farmland wireless sensor network has the characteristics of wide coverage area,long planting period,inconvenient energy supply,and serious impact of crop environment on wireless signal transmission.Routing protocol is an important method to achieve long-term WSN monitoring by selecting an appropriate path with low energy consumption for data transmission.According to the phenomenon of uneven environment and channel parameters caused by intensive crop growth in farmland,a non-uniform clustering routing protocol based on effective energy consumption(UCEEC)was proposed in this work.The method combined with the characteristics of multi-path fading of farmland environment signals.The idea of image segmentation was introduced.Nodes with high similarity were divided into a cluster area by the dissimilarity between nodes in order to improve the intracluster communication performance.Meanwhile,a multi-hop path selection method between cluster-heads based on the estimation of two-hop effective energy consumption is designed.The energy consumption cost factor is calculated by the effective energy consumption and the average energy consumption within the cluster to achieve the minimum and balance of the overall energy consumption of the network.Simulation results show that,compared with the existing Maximum Residual Energy Based Routing(MREBR)protocol,minimum Energy Consumption Based Routing(MEC)routing protocols,UCEEC improves the energy balance effect between nodes,prolongs the network life cycle,and realizes efficient energy utilization of wireless sensor network data collection in the complex environment of wheat field.

Scheduling algorithms for time-constrained big-le transfers in the Internet of Vehicles

In order to transfer large les and provide high-quality services in the IoV(Internet of Vehicles),intelligent routing and scheduling are indispensable for fast transfers and effcient network utilization,particularly when multi-path routing is allowed in the wired-transfer.Thus,a network administrator must select a set of feasible paths over which the transfer can be conducted.We consider a TBTS(Time-constrained Big-le Transfer Scheduling)problem in this paper.We prove that TBTS problem is NP-hard and that the TBTS problem can be solved by addressing a corresponding maximum ow over time problem with multi-path routing technique.We then propose both a heuristic algorithm(TBTS-H)and an exact algorithm(TBTS-A)to solve the TBTS problem.Although both of the proposed approaches can solve the TBTS problem,the heuristic runs more effciently by trading accuracy for delay,while the exact algorithm can achieve high accuracy for delay,at the cost of increased running-time.The corresponding simulation results illustrate this trade-o.Additionally,we conduct some comparisons between our proposed approaches and a traditional single-path routing scheme.