Performance Of Ad Hoc On-Demand Distance Vector Research Articles

Analysing the Performance of a Trust-Based AODV in the Presence of a Flooding Attack

Mobile ad hoc networks (MANETs) are wireless multi-hop networks that do not rely on any fixed infrastructure, unlike traditional networks. Nodes in MANETs are formed dynamically and are free to move in any direction at variable speeds. The special characteristics of MANETs make them vulnerable to flooding attacks, which can have a negative impact on their performance. Moreover, due to their nature, employing solutions designed for traditional networks is not feasible. One potential solution to enhance the performance of MANETs in the face of network attacks is to implement trust management. This paper evaluates the performance of Ad hoc On-Demand Distance Vector (AODV) Routing in the presence of a flooding attack. We propose a direct trust management scheme to detect and isolate malicious nodes and implement this scheme on AODV. We name the modified protocol Trusted AODV (TAODV) and, finally, compare the performance of AODV and TAODV when both are under a flooding attack to measure the improvement achieved by our suggested scheme.

Energy and Mobility Models based Performance Evaluation in MANET

Mobile ad hoc networks are constituted with randomly moving nodes and movement of these nodes is depended upon moving model used in the network. Performance of the network directly depends on the movements and energy consumed in a specific time period by the nodes. Also performance of the protocol used for communication depends on the type of mobility model used by that specific protocol. In this paper, performance of AODV (Ad hoc On demand Distance Vector) routing protocol have been evaluated in respect of five mobility models Random Way Point Mobility Model, Manhattan Grid Mobility Model, Gauss Markov Mobility Model, Random Direction Mobility Model, RPGM (Reference Point Group Mobility)). Performance metrics are considered as: average energy consumption and average residual energy. By varying the network connections, speed of the nodes, and node densities, in different scenarios, routing protocol has been simulated in network simulator 2. Simulation results show that reference point group mobility model is best suitable model as compared to other mobility models for AODV protocol in terms of energy consumption.

Internet of Vehicles Employing Network as a Service

Background: Vehicular Ad Hoc Networks (VANETs) are built on the principles of Mobile Ad-hoc networks, and there are numerous approaches to achieve vehicular communication like vehicle to infrastructure or by vehicle to vehicle with the advantage of Ad-hoc networks. In VANETs, the vehicle to itself and vehicle to roadside architecture both coexist to lend safety, services, and navigation; therefore they are an integral element of the intelligent transportation systems framework. The routing protocols in vehicle-to-vehicle communication are used to optimize the propagation of the messages. Objective: The purpose of this study is to analyze the traits of the routing protocols on the basis of various performance metrics like end-to-end delay, packet drop ratio, and throughput. The routing protocols named Ad-Hoc on-demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Destination Sequenced Distance Vector (DSDV) have been compared considering a real-life scenario. Objective: The purpose of this study is to analyze the traits of the routing protocols on the basis of various performance metrics like end-to-end delay, packet drop ratio, and throughput. The routing protocols named Ad-Hoc on-demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Destination Sequenced Distance Vector (DSDV) have been compared considering a real-life scenario. Methods: It evaluates DSDV, DSR & AODV protocols in Simulation of Urban Mobility (SUMO) through the open street map. SUMO mobility file was configured to the Network Simulator 3 to study the performance of AODV, DSDV, and DSR. Results and Conclusion: By examining the protocols, we concluded that AODV is better when evaluated on the parameters named end-to-end delay, packet drop ratio, and throughput. The practical application of our study can be found in collision alert, emergency response community, highway/rail collision avoidance, etc.

Effect of NTT on Performance of AODV in a Linear AD HOC Network

Wireless Ad Hoc Networks (WANETs) are predicted to be prevalent networks in coming future because of their infrastructure-less characteristics that result in self-organization, self-healing, and self-configuration of such networks. Routing means the process of selecting a path along which data can be transferred from source to destination that plays a significant role in the performance of ad hoc networks. There are many routing protocols developed for wireless ad hoc networks. One of such protocols, developed by C. E. Perkins, is Ad Hoc On-demand Distance Vector (AODV) routing protocol, which is a reactive routing protocol, AODV is used to establish route(s) between source node(s) and destination node(s) as and when routes are required. Performance of AODV routing protocol depends heavily on choice of values of a set of predefined attributes. One of such attributes of AODV is Node Traversal Time (NTT) which is supposed to play significant role in establishing route(s) between source node(s) and destination node(s). In this paper, we have investigated the performance of AODV in a linear wireless ad hoc network using different values of NTT using as well as without using Hello messages. The performance of the network has been measured using several metrics like Route Error Overhead, Routing Overhead, Normalized Routing Load, Average Hop Count, Total Number of Received Data Packets, Packet Delivery Ratio, Average End-to-End Delay and Throughput. It is observed that choice of value of NTT has a significant effect on establishment of route(s) between source node(s) and destination node(s) that eventually affects the performance of the linear wireless ad hoc network under consideration. The insights gained through this work could be useful in analysis of more realistic and complex networks.

Performance evaluation of AODV over CSMA and TSCH

AODV (Ad hoc On‐Demand Distance Vector) is a well‐known routing protocol for wireless networks. Recently, Time Slotted Channel Hopping (TSCH) was proposed as a MAC layer protocol, specified in the IEEE 802.15.4e standard. As MAC layer protocols can impact the performance of protocols in the layers above, we examine the performance of AODV over TSCH and compare it with CSMA. We investigate using different metrics, such as latency, packet delivery rate, and energy consumption. We implemented AODV, as defined by the RFC 3561, using the embedded systems operational system Contiki‐NG, a well established platform for Low power and Lossy Networks (LLNs), and the Internet of things (IoT). Our results, running on the Cooja platform, show that TSCH can greatly improve the performance of AODV, achieving a packet delivery rate of almost 100%. Moreover, our results also show that TSCH consumes less energy than CSMA.

Improving the AODV Route Recovery Mechanism Using PSO in WSN

Objective: The conventional Ad Hoc On-Demand Distance Vector (AODV) routing algorithm, route discovery methods pose route failure resulting in data loss and routing overhead. In the proposed method, needs significant low energy consumption while routing from one node to another node by considering the status of node forwards the packet. So that while routing it avoids unnecessary control overhead and improves the network performance. Methods: Particle Swarm Optimization (PSO) algorithm is a nature- inspired, population-based algorithm. Particle Swarm Optimization (PSO) is a Computational Intelligence technique which optimizes the objective function. It works by considering that every member of the swarm contributes in finding the ideal solution by keeping a track of their own best known location and the best-known location of the group and keeps updating them whenever there is a change and hence minimizes the objective fitness function. The fitness function which we considered here is the Node lifetime, Link Lifetime and available Bandwidth. If these parameters are with good then status of node will be strong and hence routing of packet over those nodes will reduce delay and improves network performance. Result: To verify the feasibility and effectiveness of our proposal, the routing performance of AODV and PSO-AODV is compared with respect to various network metrics like Network Lifetime, packet delivery ratio and routing overhead and validated the result by comparing both routing algorithm using Network Simulator 2. The results of the PSO-AODV has outperformed the AODV in terms of low energy, less end to end delay and high packet delivery ratio and less control overhead. Conclusion: Here we proposed to use Particle Swarm Optimization in order to obtain the more suitable parameters for the decision making. The existing AODV protocol was modified to make a decision to recover from route failure; at the link failure predecessor node implementing PSO based energy prediction concept and using weights for each argument considered in the decision function. The fitness values for each weight were found through PSO basic form. We observed that the PSO showed satisfactory behaviour improvement than the performance of AODV for all metrics on the investigated scenarios.

АНАЛИЗ ПРОИЗВОДИТЕЛЬНОСТИ ПРОТОКОЛОВ РЕАКТИВНОЙ МАРШРУТИЗАЦИИ В VANET НА БАЗЕ NS3

Since importance of improving of Intelligent Transportation System (ITS) always follow modern trends by using new wireless communication technologies, the trend of latest research topics is focusing on Vehicular Ad Hoc Network (VANET). VANET networks play a vital role in ITS due to their increasing importance for the building of ITS. VANET is a subclass of mobile ad-hoc networks (MANET). VANET depends on wireless technologies to establish communication between moving vehicles (nodes). An appropriate and efficient routing protocol helps to successful exchange data between mobility nodes in vehicular ad-hoc networks. VANET has a lot of similar features to MANETs such as finite bandwidth, self-arrangement, self-administration, and unstable network topology. Except it has some important features of its characteristic such as very high node mobility, delay restrictions, and frequent network outages. For this reason, routing in VANET networks is much more complex than routing in MANET networks. The purpose of this study - to evaluate the performance of protocols AODV (Ad hoc On-Demand Distance Vector) and DSR (Dynamic Source Routing) and their impact on the performance of networks VANET. This paper differs in that it analyses the impact of network size at a large number of nodes, and different vehicle speeds on network performance metrics like packet delivery ratio, throughput, average delay, overhead and packet loss ratio and assessing the level of network performance at realistic mobility scenarios for the movement of vehicles in the street generated by Bonnmotion tool. Also, the simulation is carried out in NS-3 simulator to create VANET network topology and routing protocols.

Performance Optimization of MANET Networks through Routing Protocol Analysis

A Mobile Ad Hoc Network (MANET) protocol requires proper settings to perform data transmission optimally. To overcome this problem, it is necessary to select the correct routing protocol and use the routing protocol’s default parameter values. This study examined the effect of route request parameters, such as RREQ_RETRIES and MAX_RREQ_TIMOUT, on the Ad Hoc On-demand Distance Vector (AODV) protocol, which was then compared with the default AODV performance Optimized Link State Routing (OLSR) protocols. The performance metrics used for measuring performance were Packet Delivery Ratio (PDR), throughput, delay, packet loss, energy consumption, and routing overhead. The results show that the OLSR protocol has a smaller delay than the AODV protocol, while in other measurements, the AODV protocol is better than OLSR. By reducing the combination value of RREQ_RETRIES, MAX_RREQ_TIMEOUT in AODV routing to (2, 10 s) and (3, 5 s), the protocol’s performance can be improved. The two combinations result in an average increase in throughput performance of 3.09%, a decrease in delay of 17.7%, a decrease in packet loss of 27.15%, and an increase in PDR of 4.8%. For variations in the speed of movement of nodes, 20 m/s has the best performance, while 5 m/s has the worst performance.

Survey on Performance Analysis of AODV, DSR and DSDV in MANET

Routing is a crucial issue in MANET due to the absence of fixed infrastructure and centralized administration. Many routing protocols like Ad-hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Destination Sequenced Distance Vector (DSDV) have been proposed to find the optimized path from source node to destination nodes. This paper analyzed the performance of AODV, DSR and DSDV on the basis of sent packets, received packets and Quality of Service (QoS) metrics like throughput, end to end delay, packet delivery ratio, packet loss ratio with varying network load and network size. Index Terms : AODV, DSR, DSDV, QoS, Routing Protocols. DOI: 10.7176/CEIS/11-3-03 Publication date: May 31 st 2020

RGIM: An Integrated Approach to Improve QoS in AODV, DSR and DSDV Routing Protocols for FANETS Using the Chain Mobility Model

Abstract Flying ad hoc networks (FANETs) are a collection of unmanned aerial vehicles that communicate without any predefined infrastructure. FANET, being one of the most researched topics nowadays, finds its scope in many complex applications like drones used for military applications, border surveillance systems and other systems like civil applications in traffic monitoring and disaster management. Quality of service (QoS) performance parameters for routing e.g. delay, packet delivery ratio, jitter and throughput in FANETs are quite difficult to improve. Mobility models play an important role in evaluating the performance of the routing protocols. In this paper, the integration of two selected mobility models, i.e. random waypoint and Gauss–Markov model, is implemented. As a result, the random Gauss integrated model is proposed for evaluating the performance of AODV (ad hoc on-demand distance vector), DSR (dynamic source routing) and DSDV (destination-Sequenced distance vector) routing protocols. The simulation is done with an NS2 simulator for various scenarios by varying the number of nodes and taking low- and high-node speeds of 50 and 500, respectively. The experimental results show that the proposed model improves the QoS performance parameters of AODV, DSR and DSDV protocol.

Energy Efficiency in Ad-Hoc On Demand Distance Vector and Dynamic Source Routing Protocols Using High Energy First Algorithm for Mobile Ad-Hoc Networks

The main issue that occurs in battery powered applications in Mobile Ad Hoc networks (MANETs) is energy efficiency. Routing protocols are mainly based on energy related parameters which are used to extend the lifetime of networks. In most of the situations Shortest path routing protocols are used in MANETs which do not consider the energy awareness. Hence power failure of the nodes affect the life time of the network. In this paper we focus on Energy efficiency in Ad-hoc On Demand Distance Vector (AODV) and Dynamic Source Routing (DSR) protocol by using High Energy First (HEF) algorithm to overcome the shortcomings that occur in MANETs due to increase in node density. Simulations are performed using NS-2 and we have compared the performance of AODV and DSR using HEF with the performance of existing DSR and AODV to prove the maximization of lifetime of the network. Simulation results show that the proposed protocols with HEF are efficient than the existing protocols.

Comparison of AODV and DSR in MANET’s

MANET acronym for Mobile Ad-hoc Network is a wireless network that is it operates without any physical fixed infrastructure and does not need any centralized access point. Mobile network is wireless in nature that is any node can be part of this network. Different routing protocols exist in a network like reactive, proactive and hybrid. They may be better in one network while nastiest in the other. In this paper we have made an effort for the comparison of the performance of AODV (Ad-hoc On Demand Distance Vector) and DSR (Dynamic source routing) on simulation tool like NS-2 on the basis of various parameters like packet delivery ratio, delay and average throughput.

Performance Evaluation of Reactive Routing Protocols in MANETs in Association with TCP Newreno

We inspect the performance of TCP NewReno protocol for data transfer in Mobile Ad hoc networks (MANETs). Dynamic Source Routing (DSR) protocols and AdHoc On-demand Distance Vector (AODV) are standard reactive routing protocols widely used in MANETs. In addition we also have to consider Transmission Control Protocol (TCP) as essential for MANETs since it is one of the widely used internet protocol for dependable data transmission. TCP has its variants namely TCP Reno, TCP NewReno , TCP Vegas and TCP SACK. In this paper we are evaluating the performance of DSR and AODV in association with TCP Newreno with respect to various parameters such as Average throughput, instant throughput, residual energy, packet delivery ratio. The ns-2 network simulator was used for simulation.

Black hole attack evaluation for AODV and AOMDV routing protocols

Protecting a mobile ad hoc network (MANET) from malicious attacks is a challenging security issue, many of those attacks are reported on ad hoc on demand distance vector (AODV) and ad hoc on-demand multipath distance vector (AOMDV) routing protocols. Black hole attack (BHA) is a serious attack, in which wireless packets are redirected to a fake mobile node (MN), actually, a fake MN attacks other MNs as it presents itself in such a way that has the shortest path. This paper studies the impact of BHA on the performance of AODV and MAODV in terms of throughput, end-to-end delay and packet delivery ratio using network simulator version 2 (NS-2) and compares the resiliency of these routing protocols against BHAs. Simulation results revealed that AOMDV is more resilient against BHAs as it is able to easily find alternative routes to destination MNs.

Towards a Better Approach for Link Breaks Detection and Route Repairs Strategy in AODV Protocol

This paper describes a parameterized approach to the Ad Hoc On-Demand Distance Vector (AODV) routing protocol using a network-simulator 2 (ns2). By utilizing two AODV’s protocol functions, which are HELLO messages and local route repair, we explore the more flexible approach on these two important functions, rather than a fixed setting within the default AODV protocol. HELLO message is used to detect the broken link, while the local route repair in AODV is used to fix and discover alternative routes in the event of route failure. In this paper, two functions to optimize AODV performance have been utilized. The first is link break detection time (Llb), using the HELLO message to detect link failure, and the second is link break position parameter (Lbp) for AODV’s local route repair. The results show that the default AODV setting does not yield the best results for most defined network scenarios. In some cases, improvement compared to the default setting can be as high as 38%, for local route repair strategies. This paper presents a potential flexible and parameterized approach for dealing with link breaks and route repairing strategies for AODV protocol.

An Approach to Locate Nasty Node and to Prevent Selective Dropping in WSN

The fast growth in wireless communication and digital electronics has led to the development of low-cost and lowpower sensor nodes that are small in size and may communicate over short distances. Sensor nodes are deployed in hostile environment in large number, which makes their physical protection against tampering difficult or more prone to be compromised by an adversary force. By doing that, an adversary can modify the behavior of the compromised nodes and launch routing misbehavior attacks. One most common type of such attacks is gray hole attack. Adhoc On Demand Distance Vector (AODV) in its pure form does not have any mechanism to deal with such type of attack. In this paper, we simulate gray hole attack on AODV routing protocol and evaluate AODV’s performance by considering different metrics and scenarios. NS2 simulator has been used to conduct simulation of gray hole attack. Our simulation results show the influence of gray hole attack on the performance of AODV which suffers from decreased delivery ratio and increased packet loss. Furthermore, some countermeasures against gray hole attack are also provided.

A Comprehensive Study on Mobility Issues in AODV

Ad-hoc network plays an important role in wireless networks as they are self-configured and can be operated independently with limited resources. The critical issue is to assess the performance of routing protocols in Mobile Ad hoc Network (MANET) due to the frequent changes in network topology. Here the Ad-hoc On demand Distance Vector (AODV) routing protocol, which is quite susceptible to node mobility is taken into consideration, as it determine the end to end route discovery in dynamic manner; the identified problem is it leads to extra time and energy consuming. Driven by this issue, it is necessary to examine the scalability of AODV protocol by varying the number of Wi-Fi nodes’ and its mobility degree. Performance of AODV is addressed in this study; by calculating aggregated throughput, Packet Loss Ratio (PLR) and end to end delay. Also, extensive simulations are carried out to exactly capture its Quality of Service (QoS) parameters in sparse and dense network scenarios.

Impact of Hello Interval on Performance of AODV Protocol

The multi-hop ad hoc networks are self organizing networks with dynamic topology. The reactive and proactive protocols are designed to handle these dynamically changing networks. Ad Hoc On-Demand Distance Vector (AODV) Routing Protocol is one such Reactive protocol that has been widely adopted in MANETs. In this protocol, routes are maintained as and when required, i.e. they operate ‘On Demand’. AODV relies on ‘Hello’ messages to maintain local link connectivity. The hello messages are sent periodically, the period of which is defined by ‘AODV hello interval. In this paper, we investigate the performance of AODV protocol by varying the hello interval. The performance is analyzed in terms of Quality of Service parameters such as throughput, End-to-end Delay and PDR. Our experimental results show that the performance of AODV is improved when hello interval is increased.

Comparative Analysis of AODV & AOMDV under Varying Number of Nodes &at Different Pause Time

An ad hoc wireless networkcan be described as a collection of nodes which have to interact among themselves without any centralized authority. In an ad hoc network node movement results in dynamic topology and link failure and thus routing become a challenging task. Many routing protocols have been proposed to overcome various challenges of routing in ad hoc networks. This paper presents performance comparison of mobile ad hoc network routing protocols; Ad hoc On demand Distance Vector (AODV) and Ad hoc On demand Multipath Distance Vector (AOMDV). Here investigation has been done on the effect of change in number of nodes and varying pause time on MANET routing protocols. The performance of AODV & AOMDV based on TCP based traffic pattern has been analyzed and compared. The NS2 simulator is used for performing various simulations. The performance analysis is based on different network metrics such as end to end delay, Packet Delivery Ratio (PDR), Throughput, Normalized Routing Load, Packet loss and Routing Overhead.

Implementing and Improving the Performance of AODV by Receive Reply Method and Securing it from Black Hole Attack

We attempt to analyze the MANET's routing protocol and improve the security of viz. the Ad hoc On Demand Distance Vector (AODV) routing protocol. We propose modifications to the AODV protocol used in MANET an algorithm to reduce the Black hole attack on the routing protocols in MANETs. Wait time and Request Reply Tab table created to counter the Black hole attacks and the AODV protocol.