Modified AODV Protocol Research Articles

Investigation and Implementation of Secure Routing Protocol against Wormhole Attack

This paper is an attempt to discuss a novel secure routing protocol against wormhole attack in wireless ad hoc network. The modified AODV protocol as WDA is proposed method against wormhole attack. AODV, DSR and WDA protocols are implemented with attacks in ad hoc network and results are drawn for the parameters viz. throughput, average end to end delay and detection rate versus wormhole tunnel length.

Performance Enhancement of MANET Using Modified AODV Protocol for Congestion Avoidance

MANET is a field of networking that deals with communication of the nodes using ad-hoc networking. In this process intermediate nodes have been utilized for packet forwarding. In this paper a novel approach has been proposed for congestion avoidance in MANET so that better performance can be achieved. Modified AODV protocol has been designed that computes queue limit at each interval of packet transmission. On the basis of queue limit and threshold values packet has been transmitted through possible path so that data can be transmitted to destination successfully. Proposed approach provides various merits in MANET communication. On the basis of results analysis we can say that proposed approach provide much better results than previous approach.

An Implementation of Modified AODV Protocol in MANET for Mitigation of Blackhole Attack with Varying Node Densities

An Implementation of Modified AODV Protocol in MANET for Mitigation of Blackhole Attack with Varying Node Densities

Modified Ad Hoc On-Demand Distance Vector Routing Protocols

network is a network without physical structure and is established with mobile nodes using wireless connections. Ad Hoc network is highly flexible and supports dynamic network topology. Thus, the efficiency of the routing protocol will affect the overall network performance. Mobile ad hoc networks carriage several kinds of security problems, initiated by their open systems and nature of collaborative by limited accessibility of resources. In this paper we study and analyses various attacks that can be possible on AODV. My planned work is an extension of AODV to the secure AODV protocol extension, which contains tuning policies aimed at improving routing performance. Proposed an extension to Adaptive- SAODV of the secure AODV protocol extension. In our thesis we goals s Developed a routing protocol algorithm to solve the problem of efficiency transmission in Mobile Ad Hoc networks. So that work we divided the process into two parts. In M-AODV an intermediate node create an adaptive reply decision for an incoming demand that helps to stabile its security and efficiency of incoming messages. I.e. we propose a modification to adaptive mechanism that adjusts M-AODV behaviour. In the AODV protocol, a backup route will be began to transfer data when the original route is broken. However, a backup method affects the overall network performance such as pdr, end-to-end delay, etc. To solve this problem, the method developed in this research is used to reroute the data traffic and improve the performance of AODV protocol by via ACK reply path as a backup way whenever there is a route failure. The proposed method, called Modified AODV protocol (M-AODV), is developed by modifying the AODV protocol. The method creates new flags in the routing message, so that as long as the source node can still receive ACK reply from the destination node when an original route is broken, it uses the forwarding path of ACK as a backup route to transfer the rest of the data packets. M-AODV also incorporates features of the M-TCP scheme to solve unnecessary resending of lost data packets. The both algorithm uses only connectivity information to look for illegal structures in the connectivity graph. The algorithm is independent of wireless communication models. We have analysis that our proposed algorithm improve the performance in M-AODV and also compared its performance like the throughput, end-to-end delay and packet delivery ratio with existing mechanisms using EXATA simulation.

A Hybrid Approach to Modified AODV Protocol to Detect and Avoid Wormhole Effected Path over MANET

In MANET mobile node is responsible for route establishment using wireless link where each node behave like both as a host and router. MANET encounter by number of security threat because of its open untrusted environment with little security arrangement, whether security over MANET is not to be enhance up to satisfactory level because of its characteristics. Among all of security threat worm hole is consider to be a very serious security threat over MANET. In worm hole two selfish node which is geographically very far away to each other, makes tunnel between each other to hide their actual location and try to believe that they are true neighbours and makes conversation through the wormhole tunnel. Recently research will focus over wormhole detection and avoiding path but existing technique having lower network overhead, lower battery power consumption in order to longer survival of network with fast response. This paper introduce a modified AODV protocol that detect and avoid wormhole path over MANET towards secure routing , which is based on an hybrid model that encapsulate location, neighbor node and hop count method.

Integrated FLAG based Energy Efficient Routing with Drop Minimization in MANET

The conservation of energy and the improvement in lifetime of the network has been a challenging task in Mobile Ad hoc Networks (MANET) due to their dynamic and un-predictable behavior and topology change. A route selection and packet drop due to limited buffer(queue) size are two important factor that causes energy consumption by handling retransmission of dropped packets. So many energy aware routing and queue management strategies have been introduced individually. By combining energy based routing with queue management, the lifetime of the network can be increased most effectively. This paper proposes integrated maximum energy based routing with prediction of the route failure by energy estimation and Dynamic queue initialization to reduce packet drop. We modified AODV protocol and drop-tail queue. A Simulation has been performed on NS-2 with the parameter packet delivery fraction, Throughput, endto end delay and number of packets. By comparison planned approach with the old one better result has obtained. General Terms Energy based routing, Queue management, Energy consumption.

SR-AODV: A Stable Route-AODV Protocol for Mobile Ad hoc Network

Mobile ad-hoc network is the collection of node whichdynamically forms a temporary network without the use ofany existing network infrastructure or centralizedadministration. When the mobility in the network is high andthe topology changes frequently the route maintenanceoverhead in AODV increases. Because nodes can move linkbreakages can occurs. Long path is more vulnerable to linkbreakages and requires high control overhead for itsmaintenance. In this paper we introduce a new modifiedAODV protocol. This new protocol uses stability factor ofintermediate nodes to find the most sable neighbors andtherefore most stable path. This new proposed protocol is SRAODV(Stable Route AODV) protocol. We simulate bothAODV and SR-AODV with ns-2 in similar scenario. We findthat SR-AODV will show better performance than AODV

A highly topology adaptable ad hoc routing protocol with complementary preemptive link breaking avoidance and path shortening mechanisms

Ad-hoc on-demand distance vector routing (AODV) is a well-known routing protocol for mobile ad hoc networks. The original AODV protocol works in a semi-dynamic fashion, by establishing a route on demand and using that route until it breaks. However, to suit the changing network topology of ad hoc networks, more aggressive and adaptable routing strategies are required. A number of researches have proposed improving AODV performance by locally repairing broken links, predicting and replacing potentially vulnerable links, or shortening a link through removing redundant nodes from the transmission path. Although local repair may relieve some problems, it usually results in longer paths and thus a considerable performance drop in heavy traffic conditions. There are also issues regarding packet loss and communication delay due to route rebuilding once the link is broken. Predicting and replacing potentially vulnerable links may require special hardware, additional tables to maintain, or other extra overhead. Finally, path shortening may result in shorter and more efficient routes, but there is no guarantee that the new paths will be robust. This paper proposes integrating preemptive link breaking avoidance and path shortening mechanisms into a modified AODV protocol. However, the difficult issue lies in determining the right timing to initiate the two independent mechanisms so that the two dynamically and complementarily operating mechanisms can work together to improve the routing performance. Through numerical analysis and simulation, we have arranged a simple parameter setting for controlling the activation of each mechanism at the appropriate time. The proposed combination is a highly dynamic ad hoc routing protocol that is capable of adapting itself to the changing network topology and achieving extremely good performance in various routing performance metrics. Extensive simulations show that each of the two schemes alone improves AODV performance. More importantly, the integrated protocol performs even better in terms of data delivery rate, average delay time, and network overhead. To be more specific, in the best cases our protocol can reduce up to 82% in control overhead and 66% in delay time, while achieving 12% more in data delivery rate comparing to AODV.