Congestion Aware Multipath Routing Research Articles

OCC-MP: An optimal cluster based congestion aware technique multipath routing protocol in WSN using hybrid evolutionary techniques

Due to massive data traffic, wireless network congestion is inevitable, causing network performance deterioration and data transmission quality reduction. By adjustingthe traffic flow at the source node along the optimal path, Wireless sensor networks strive to evade and overcome congestion. Recently, numerous evolutionary approaches for congestion detection and avoidance have been presented, although they do not improve WSN performance. A hybrid evolutionary approach is attempted to avoid congestion in WSN and improve network performance. We present an optimum cluster-based congestion aware multipath routing protocol (OCC-MP). An improved atom search optimization (IASO) approach for efficient clustering is introduced initially in OCC-MP. Then the HSIPO method is used for decision making, which computes each node's trust degree. The HSIPO algorithm selects the cluster head (CH) from a group of nodes. Then a deep recurrent neural network (DRNN) is used to monitor congestion and provide congestion aware routing. Finally, multiple simulation situations like various node densities andat various simulation rounds supported our proposed OCC-MP techniqueoutperformedcurrent methodologies with respect to energy consumption, throughput, traffic load overflow, delivery ratio, and number of nodes alive.

Energy and Congestion Aware Multipath Routing in MANET

An interconnection of wireless nodes in motion is called as Mobile AdHoc Network (MANET). One of the problems facing MANET is the route failure due to dynamic movement of nodes. Route failure leads to frequent path search and extra effort for maintaining existing path. An effective routing protocol should choose an elite path for dispatching data and consume less resources. Ad-hoc On-demand Multipath Distance Vector (AOMDV) protocol can sustain more than one path between the communicating nodes and switches between them, whenever communication fails over selected path. This way, it reduces the effort of discovering new path, whenever an existing path fails. However, while choosing alternative paths the protocol only considers the hop count as a deciding factor and it does not take into consideration the energy associated with node nor the congestion along the chosen path. In this paper, we consider both residual energy and active load while selecting path for communication. Performance of both protocols are tested on NS2 simulator. It was found that, the enhancement does provide an improvement in performance than the existing protocol

Multi-objective cross layer approach for 802.11e over MANETs

The IEEE 802.11e protocol, which provides QoS support to real-time multimedia applications at the MAC layer, has not adequately addressed the issue of handling the data flows through congestion-based mobile ad hoc networks, which result in high data loss, link breakage and re-transmissions, causing performance deterioration. In this paper, we propose a Multi-Objective Cross-Layer Optimisation (MOCLO) between the PHY-MAC-Network layer over MANETs. First, we implement each of the queues in 802.11e as a priority queue scheduler to prioritise the transmission of the traffic flow. Next, we propose a congestion aware QoS metric-based disjoint multipath routing scheme to route the priority traffic through the most efficient path. Using the mapping function between the MAC and network layer, the traffic is split into a set of efficient paths based on priority. The performance of the proposed scheme highlights the advantages of our cross-layer mechanism.

Congestion Aware Multi-Path Routing Protocol with Load Balancing

The multi-path routing protocol is one of the approaches used to have less overhead, better bandwidth cost through the load distribution among a set of paths. However, due to the interference of the paths during the communication, it increases the end to end delay and do not work well under a highly congested network. We have proposed the congestion aware multi-path routing protocol with load balancing. The paper explains the problem associated with the end-to-end delay. It deals with the problem of channel interference during the Multi-path communication. It suggests the congestion control mechanisms to improve the protocol performance. It proposes an additive increase/ multiplicative decrease and fast retransmits and recovery process and also it suggest the algorithm for load balancing scheme. In order to minimize the congestion formation, it selects the node disjoint paths for communication. The correlation factor among the selected multiple paths are calculated. It calculates the congestion formation in the network. It compares the proposed MPR protocol with ordinary DSR through the simulation and the simulation results are discussed.

CAMR: Congestion-Aware Multi-Path Routing Protocol for Wireless Mesh Networks

The Wireless Mesh Network (WMN) is a multi-hop wireless network consisting of mesh routers and clients, where the mesh routers have minimal mobility and form the backbone. The WMN is primarily designed to access outer network to mesh clients through backhaul gateways. As traffic converges on the gateways, traffic hotspots are likely to form in the neighborhood of the gateways. In this paper, we propose Congestion Aware Multi-path Routing (CAMR) protocol to tackle this problem. Upon congestion, CAMR divides the clients under a mesh STA into two groups and returns a different path for each group. The CAMR protocol triggers multi-path routing in such a manner that the packet reordering problem is avoided. Through simulations, we show that CAMR improves the performance of the WMN in terms of throughput, delay and packet drop ratio.

Congestion Aware Multipath Routing: Performance Improvements in Core Networks

In this paper the improved Congestion Aware Multipath Routing algorithm is analysed in terms of Core network throughput and longer paths contribution. The algorithm discovers unused network resources and dynamically adapts to the actual traffic load and available resources displacement. Several simulation scenarios have been benchmarked in order to verify algorithm in typical Internet Service Provider cases. Simulation scenarios in this paper are focused on verifying functionality in dense core networks. For this purpose, tests were performed on TeraStream based network – the Deutsche Telekom Group design concept. Simulation results have proven better performance and resource utilization of the proposed algorithm than traditional Bellman-Ford based algorithms and equal cost multipath approaches.

Congestion Aware Multipath Routing: Aggregation Network Applicability and IPv6 Implementation

Currently, the service provider network capacity utilization is low due to the shortest multipath based routing protocols Opens Shortest Path First (OSPF) and Intermediate System-to-Intermediate System (ISIS). Due to inefficient routing approach, certain paths can be overloaded and link capacity is required while alternative paths are unused. The overall network has to be dimensioned with higher link bandwidth requirements introducing additional line, linecard, routing engine and overall solution cos. This paper provides improved Congestion Aware Multipath Routing (CAMRv2) algorithm overview. The new network routing algorithm allows higher throughput, network load-balancing and stability to ensure lower congestion and data drop on critical links. The algorithm discovers unused network resources and dynamically adapts to the actual traffic load and displacement. The focus in this paper is on new parameters for path computation performance improvement. Additionally, detailed IPv6 source routing CAMRv2 implementation for parallel coexistence with present networks is presented. Finally, the new routing algorithm is simulated in several scenarios over aggregation network. The result of simulations have proved better performance and resource utilization of the proposed algorithm in sparse aggregation network in terms of load-balancing between uplinks to the core network

Congestion aware multi-path routing protocol for mobile ad-hoc networks

We propose a congestion-based extension to existing multipath routing protocol AOMDV (CA-AOMDV). AOMDV is based on minimum number of hops count between source and destination nodes and is not suitable for real time applications because of its high end to end delay, jitter and packet loss. CA-AOMDV selects a least congested path instead of minimum number of hops between source and destination nodes. CA-AOMDV performs well under high load and varying mobility conditions. In CA-AOMDV, end to end delay is improved by 20%-80%, jitter is reduced by 25%-47%, routing overheads is reduced by 40%-70%. CA-AOMDV performs better than AOMDV in real time applications.

Multipath Routing Protocol for Reducing Congestion and Delay in MANET

In this paper, a congestion aware multipath routing protocol in mobile ad hoc networks (MANET) is proposed. The paths which have better bandwidth will be initially selected. For selected paths, first the congestion status of the node is found by using the early congestion detection technique which is based on the queue status and data arrival rate of the nodes. The delay includes weighted channel delay and buffer queuing delay. The paths which have better bandwidth will be initially selected. . If the congestion status is lower than the threshold value, the packets are sent direcrly through the path. If it is more than the threshold value, a congestion aware routing is initiated. In this congestion aware routing, routes having less end-to-end delay will be selected from the backup routes, so that they have low congestion. Simulation results show that the proposed protocol reduces the end-to-end delay and increases the packet delivery ratio.

Awareness in Congestion for Multipath Load Balancing in MANET

Mobile communication plays a vital role in disaster recovery management during emergency situations. It is helpful in situations where the system has less robust and less flexible infrastructure. However, the rapid growth in number and multiplicity of real-time network applications has made it imperative to consider the impact of end-to-end delay requirements of traffic on network. The research papers are published to increase the network performance on the network layer. In this paper, we propose a Reliable and Efficient Load balancing Technique in presence of congestion. It is based on AODV Protocol in Mobile Ad hoc Networks. In this protocol, a weight function based on route length, traffic load, energy level and freshness of each route is calculated and stored in the route cache. We propose a congestion aware multi-path routing protocol for load balancing in MANET. When the source node wants to forward the data packet to the destination, it uses the reactive route discovery technique where the multiple paths are well-known using multi-path Dijkstra algorithm. This paper combines a multipath routing protocol with load balancing concept and presents a new protocol called AC-AODV. We use NS-2.34 to simulate the scenario. The simulation’s result shows the significant performance enhancement of the network for the multipath routing protocol with load balancing. The simulation results illustrate that the proposed load balanced routing protocol improves packet delivery ratio and reduces the delay.

A Fault Tolerant Congestion Aware Routing Protocol for Mobile Adhoc Networks

Problem statement: The performance of ad hoc routing protocols will si gnificantly degrade when there are faulty nodes in the network. Packet losses and bandwidth degradation are caused due to congestion and thus, time and energy is wasted during its recovery. The fault tolerant congestion aware routing protocol addresses these p roblems by exploring the network redundancy through multipath routing. Approach: In this study, it is proposed to design a fault to lerant congestion aware multi path routing protocol to reduce the rou te breakages and congestion losses. The AOMDV protocol is used as a base for the multipath routin g. This proposed scheme enables more nodes to salvage a dropped packet. Results: Simulation results show that the proposed protocol achieves better throughput and packet delivery ratio with reduced d elay, packet drop and energy. Conclusion: An effective congestion control technique proposed in this study proactively detects node level and link level congestion and performs congestion control us ing the fault-tolerant multiple paths.

Multi-Path TCP: A Joint Congestion Control and Routing Scheme to Exploit Path Diversity in the Internet

We consider the problem of congestion-aware multi-path routing in the Internet. Currently, Internet routing protocols select only a single path between a source and a destination. However, due to many policy routing decisions, single-path routing may limit the achievable throughput. In this paper, we envision a scenario where multi-path routing is enabled in the Internet to take advantage of path diversity. Using minimal congestion feedback signals from the routers, we present a class of algorithms that can be implemented at the sources to stably and optimally split the flow between each source-destination pair. We then show that the connection-level throughput region of such multi-path routing/congestion control algorithms can be larger than that of a single-path congestion control scheme.