Multipath Routing In MANET Research Articles

Adaptive deep Runge Kutta Garson’s network with node disjoint local repair protocol based multipath routing in MANET

Adaptive deep Runge Kutta Garson’s network with node disjoint local repair protocol based multipath routing in MANET

LF Distribution and Equilibrium Optimizer Based Fuzzy Logic for Multipath Routing in MANET

LF Distribution and Equilibrium Optimizer Based Fuzzy Logic for Multipath Routing in MANET

A Comparative Analysis of Energy Efficient Multipath Routing in MANET

A Comparative Analysis of Energy Efficient Multipath Routing in MANET

QoS Aware Cross Layer for SIP Based VoIP Over Enhanced OLSR Routing Protocol in Hybrid Wireless Network

To improve SIP signal execution in MANET, routing parameters must be powerfully balanced through SIP methods dependent on a set equal for execution improvement measurements to help the SIP signal framework. In this manner, the presentation of the Optimal Link State Routing Protocol (OLSR) is to be additionally improved. In MANET, vitality is a key anxiety for secure communication, making it conceivable to avoid enemies or childish hubs since the system. In term of this paper, the projected secure as well as QoS based energy aware multipath routing in MANET. In support of multipath path collection, we have provided the Optimal Link State Routing Protocol (OLSR) algorithm. Energy efficient multipath routes are designated on the system using this method. Afterward a quantity of transactions, a route may misplace its connection quality. Hence the optimal path is selected to the paths installed on the system utilizing the Spider Monkey Optimization (SMO) algorithm. At last the presentation measurements of our planned SMO-OLSR task are contrasted and the current OLSR. SMOOLSR used for hybrid wireless network for efficient communication. The reproduction results demonstrate that the presentation of our planned work, the packet delivery rate, the delay, and the packet fallout are improved over the existing work. This planned methodology is actualized on the foundation of NS2.

Data Security through Node-Disjoint on Demand Multipath Routing in MANETs

Data Security through Node-Disjoint on Demand Multipath Routing in MANETs

Secured and QoS Based Energy-Aware Multipath Routing in MANET

In MANET, energy aware multipath routing is major concern for securable transmission which is possible by avoiding the attackers or selfish nodes from the network. In this paper we have proposed secured and QoS based energy aware multipath routing in MANET. For multipath route selection, we have presented particle swarm optimization-gravitational search algorithm. Using this algorithm energy efficient multipath routes are selected in the network. After number of transmissions, a route may loss its link quality. So an optimal path is selected from the established routes in the network using cuckoo search algorithm which performs based on the behavior of cuckoos. Performance metrics of our proposed work is compared with that of the existing work authenticated anonymous secure routing. Simulation results show that energy efficiency and network lifetime of our proposed work is improved than that of existing work.

Improved security and routing path learning in MANETs using Beer–Quiche game theoritical model in cloud computing

In anAdhoc Cloud as a Service (Adhoc Cloud is used over MANETs), the attackers try to interrupt the data packets being broadcasted in the network between the nodes, which travels from source to destination. To solve this problem, Beer–Quiche theoretical routing model is utilized for stochastic multipath routing in MANETs. Initially, the path setup and route selection is regulated using proposed approach. During each stage, the source node tracks the available paths, path residual bandwidth and policy of the attackers, who gathers information from previous stage to provide an attack. Depending on such selection, the optimal paths are selected by the source node for broadcasting the packets. This is selected using a proper switching mechanism in multiple paths which is established between the source and destination. Further, an optimal routing selection policy is proposed to broadcast the packet to its destination node during each stage of the Beer–Quiche game. The numerical analysis proves that the proposed scheme attains better performance than AODV, AOMDV, CA-AOMDV, FS and MR in terms of reduced end-to-end delay, better residual bandwidth utilization, routing overhead, packet delivery ratio and increased path security. The results shows that the packet transmission has increased nearly to 68%, with 17% reduction in packet delay transmission. This has resulted in reducing the overhead by 25% than the AODV method.

Energy-efficient stable multipath routing in MANET

In MANET, node’s battery energy and stability of the links are often affecting the communication activities in the network. These two factors are one of the main reasons which are responsible for the loss of data packets and occurrence of congestion issue that networks are facing today. In order to overcome these issues, we propose an approach known as efficient and stable multipath routing in MANETs with congestion awareness. This approach is an extension work to our previous work where bandwidth and delay are considered during the routing. Here, in this approach, network estimates the residual energy and stability of the links in the network. While estimating the residual energy, it also considers the receiving energy and transmitting energy of the node. Then, stability of the link LET is estimated; this LET is obtained by using motion parameters (i.e. velocity, direction of the nodes). Based on these parameters, the network selects the path to transmit the data packets between the nodes.

English

English

IJARCCE - Computer and Communication Engineering

MANET is one of the acts as routing. Routing main work is exchange information from one host to other host in the network. Multipath routing can be used to improve the efficiency of wireless links in Manet when sending multiple copies of data from one source to multiple group of receiver. In this paper BeeIP present multipath routing in Manet. BeeIP is swarm intelligence based new honeybee inspired routing protocol. It is based on the collective behavior of honeybee forager and able to actively detect multiple paths between Source and destination also distributes traffic across them. The simulation result show that proposed work achieves able to delivery of packet faster and average end to end delay and packet delivery ratio better than other routing protocol and this protocol maintains balanced control overhead during mobility changes.

Link-stability and Energy Aware Multipath Routing in MANET

Energy conservation is important for mobile ad hoc networks where devices are expected to work for longer periods of time without the need for charging their batteries. Therefore there is a need of an intelligent routing protocol that can minimize overhead and ensure the use of minimum energy routes. In Progressive Energy Efficient Routing, energy efficient shortest paths are selected with minimum energy consumption. Here due to the single path routing, there occur end-to-end delay, routing overhead and packet loss. Therefore to overcome these issues, PEER can be extended for multipath routing. Link-stability metrics and energy aware metrics can be applied for path selection. By this method, stable links are selected. In this study, energy efficient routing is done with maximum life time. The proposed Link-Stability and Energy Aware Multipath Routing gives good performance results in terms of packet delivery ratio, packet drop, energy consumption and delay compared with Progressive Energy Efficient Routing.

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.

An analytical review for multipath routing in Mobile Ad Hoc Networks

Multipath routing is a new extension to many traditional routing protocols in MANETs. Using multipath routing in MANETs can save energy, reduce frequent routing update, enhance data transmission rates, and increase wireless network bandwidth. This paper introduces an analytical review for multipath routing in MANETs covering its applications, classification, and design issues. A simulation-based analytical evaluation is presented in this review using NS2 for AODV and its multipath extensions namely, AOMDV and MRAODV against two traditional multipath routing protocols namely, DSR and TORA. Simulation results show that traditional multipath protocols outperform the single path version of AODV in terms of packet delivery fraction, routing packets overhead, and throughput while AODV has better performance in terms of average end-to-end delay. AODV extensions outperforms traditional protocols in terms of packet delivery fraction and average end-to-end delay.

A Cluster-Based Multipath Routing Algorithm in Mobile Ad Hoc Networks

This paper proposes a cluster-based multi-path routing in MANET (CBMRP). It distributes traffic among diverse multiple paths to avoid congestion, optimize bandwidth used and improve the sharing rate of channel. It uses clustering’s hierarchical structure diverse to decrease routing control overhead and improve the networks scalability. This algorithm is implemented on the OPNET environment, and the results show that the algorithm can balance the load of the network and deal with the change of the network topology effectively, and also improve the reliability, throughput and stability of the network efficiently.