Ad-hoc On-demand Distance Vector Protocol Research Articles

Multi-Route AODV Protocol in Association with Overhearing Concept for Routes Selection Based on Unified Norm Composed of the Steadiness, Traffic Load and Energy Coefficients for Nodes

Mobile Ad-hoc Network (MANET) considered as one of the major important neoteric directions of wireless networks that allows movable devices to communicate with each other’s at any time anywhere. The main distinctive feature of MANET is its operation does not depend on any type of centralized administration. Due to non-truancy of localized management, devices motion and MANET resources scarcity, routing design mechanisms becoming essential problem that faces MANET until yet. Therefore, this article focuses on performance enhancement for one of most notorious interactive routing schemes that is called Ad-hoc On Demand distance Vector (AODV). Where performance refinement for AODV has been achieved via modification of route creation and maintenance processes, conjunction with overhear concept and getting multiple routes for each source - destination pair, in such a way that reduce energy consumption of nodes, avoiding unnecessary control packets, getting a more stable paths among communication nodes and fulfillment of a balanced traffic load among nodes, leading to elongate life time of nodes. Hence, prolonging life time of network. The proposed algorithm is called, Steadiness, balanced Load and Energy efficient for Multiple paths of Overhear AODV (SLE-MOAODV), where route election depending on unified metric called efficiency factor of node (NEF), which composed of parameters of stabilization, traffic load and energy for node. Functioning appraisal and comparison among proposed algorithm (SLE-MOAODV) and original AODV was carried out utilizing network simulator NS2. Outcome of simulation proved that functioning of proposed scheme outdo the original AODV with regard to: ratio of successfully delivered packets, retard time, routing cost and spent energy of nodes.

Trust framework for attack resilience in MANET using AODV

Mobile Ad-hoc network (MANET) is a collection of arbitrary moving autonomous nodes having routing capabilities. Theoretically, nodes are expected to cooperate with each other to facilitate communication with not directly connected nodes but in real scenario some of the nodes may be malicious. These compromised /malicious nodes may be part of the network or any other node trying to intrude in the network. A trust based framework is proposed in this paper to make the network resilient to malicious nodes. Trust is calculated using route request and route reply counter to make it simple and scalable. Ad Hoc On- Demand Distance Vector (AODV) routing protocol is used as the basic protocol. Performance analysis is done by varying malicious node density and calculating packet loss & average packet delay. It shows that the proposed framework along with trust calculating mechanism is giving better results as compared to basic routing protocol AODV in the presence of malicious nodes.

A Feasibility Study of Privacy Ensuring Emergency Vehicle Approaching Warning System

With the deployment of Vehicular Ad hoc Networks (VANETs), new transport safety and efficiency applications are emerging. One of the fields where the adoption of information and communication technologies (ICT) is expected to bring great benefits, is emergency systems. A properly designed emergency vehicle warning system should provide car drivers with adequate reaction times and additional information, complementing the currently used lights and sirens. The objective is to increase road safety and to create conditions for a fast and reliable movement of emergency vehicles (EVs). The available literature addressing privacy issues in VANET-based emergency vehicle warning systems is strongly limited. In this paper, the privacy ensuring emergency vehicle approaching warning system (PEEV-WS) is proposed based on a requirements analysis. Privacy is ensured by avoiding transmissions of sensitive information (e.g., expected EV route) over the wireless channel. This is achieved by assigning the decision-making responsibility to an EV and determining which vehicles can potentially interfere with the EV in the near future, and to notify those vehicles only by unicasting vehicle-customized information. The performance of the system is evaluated by federated telco-traffic simulations in terms of end-to-end delay and message delivery probability for three commonly used ad hoc routing protocols—Ad hoc On-Demand Distance Vector (AODV), Greedy Perimeter Stateless Routing (GPSR), and Dynamic MANET On-demand (DYMO), as well as in terms of reaction time, which the system provides to the drivers. Despite low applicability of the ad hoc routing protocols for vehicular communication, especially for low-latency and high-frequency applications, the simulations of the communication network demonstrate that the AODV protocol, with the modified configuration, can support the emergency vehicle warning system. The traffic simulations confirm that the system has the potential to provide drivers with sufficient reaction time.

Performance Analysis of MANET under Rushing Attack

In this article performance analysis of MANET under rushing attack has been performed. It is mainly focused on the analysis of the effect of Rushing attack in MANET. Ad-hoc On-Demand Distance Vector (AODV) routing protocol is considered as the routing protocol of MANET. This paper will analysis the various results that how the attackers affect the performance of the routing protocol in the MANET. Network Simulator NS2 (2.35) is taken as simulation tools for simulation purpose. Various node densities are considered as simulation parameters, which are used for analysis of AODV protocol under Rushing Attack. Analysis of performance is based on Control Overheads, Normalized Routing Overheads, Delay and Throughput.

A New Technique for Multiple-Path Creation in AODV Protocol Based on Composite Criterion Consisting of the Factors of Energy, Traffic Load and Stability of Nodes

Not long ago mobile ad hoc networks (MANET) became one of the most recent and famous trends in the field of wireless communications. This is because, it permits the mobile appliances for communication with each other at any instant anyplace without the need of pre-defined infrastructure or centralized management. As the absence of centralized administration, the free movement of appliances and the limited resources of MANET, the designing of routing protocols have been becoming the main fundamental challenge that meet MANET till now. Furthermore, nodes with heavily traffic load may exhaust their energy in routing others packets resulting in unstable network and hence performance deterioration. In this essay we present a new version of one of the well prominent reactive routing protocols named Ad Hoc On Demand distance Vector (AODV). The suggested version aims to make the original AODV more efficient in terms of the energy consumption of nodes, traffic load distribution among nodes and routes stabilization. The suggested scheme is called, Energy efficient, Load balanced and Stabilized Multi routes- AODV (ELSM-AODV), where the paths selection is based on a composite criterion, named Node Efficiency Factor (NEF) which contain all factors that have direct impact on the performance level and life time of MANET (e.g. energy, speed, distance and traffic load of nodes). Performance assessment and comparison between suggested schema (ELSM-AODV) and standard AODV has been performed using network emulator NS2. Simulation results evidenced that performance of the suggested protocol outperform standard AODV from point of view: correct packets delivery ratio, end to end delay time, normalized routing load and nodes energy consumption.

Congestion Control for Improved Cluster-head Gateway Switch Routing Protocol using Modified Ad-hoc on-demand Distance Vector Algorithm

MANETs are a trending topic in the wireless communication network. MANETs are formed automatically by an autonomous system of mobile nodes that are connected via wireless links. Cluster-head gateway switch routing protocol (CGSR) is a proactive protocol which is also called table-driven protocol. It consists of routing table information before setting up a connection. Ad-hoc on-demand distance vector protocol (AODV) is a reactive protocol, it sets path only when demanded by the network. CGSR protocol forms a group of nodes into clusters and selects a node as cluster-head based on some clustering algorithms for each cluster. In this paper, we have proposed a protocol, which combines the advantages of both CGSR and AODV to minimize traffic congestion in an ad-hoc wireless network. The performance metrics such as routing overhead, end-end delay, packet delivery ratio, throughput, and average energy consumption are enhanced and compared with other clustering protocols such as CGSR and LEACH protocols. The comparison result reveals that the routing overhead, end-end delay, and the average energy consumption is reduced and packet delivery ratio, throughput is improved.

Evaluation of Maximum Lifetime Power Efficient Routing in Ad hoc Network Using Magnetic Resonance Concept

Background: A mobile Ad-hoc Network is a network in which each node is independent of all other nodes of the network. In MANETs, nodes do not have proper infrastructure. The power source of the Mobile Ad-hoc network is battery power. As we all know, battery power has a certain limit and problems. Objective: The main objective of this manuscript is to resolve the power problem of nodes of mobile ad hoc networks and increase the lifetime of the network. Methods: This paper implements the concept of wireless power transfer between the nodes of Adhoc network and transfers the power to these nodes wirelessly and uses the maximum lifetime power efficient routing algorithm (MLPER) to reduce the consumption of power used by the nodes. The wireless power transfer can be achieved with the help of one type of near-field techniques called magnetic resonance which works at the same resonance frequency. This technique is nonradiative in nature. Results: This paper reduces the problem of power of the ad hoc network nodes nearly 70 to 80 % from the traditional concept used for lifetime optimization of these nodes. Conclusion: In this manuscript, performance optimization can be analysed with the help of AODV (Ad hoc On-Demand Distance Vector Routing Protocol) on-demand routing protocol. This manuscript shows that the proposed algorithm gives significant better results than AODV protocol with some performance metrics. We revised some patents relating to Wireless power transfer.

Comparative study of zigBee topologies for IoT‐based lighting automation

ZigBee standard is the popular communication protocol for wireless sensor networks (WSN) and Internet of Things (IoT) networks. An energy efficient WSN technology is a good choice for an IoT based lighting control technology. This article is a comparative analysis for finding the quality of service parameters provided by the different topologies of ZigBee for a wireless networked lighting control system. In order to estimate the energy consumption in ZigBee topologies for lighting automation, this work analyses the star, mesh, and tree topology-based WSN with two routing protocols Adhoc on-demand distance vector (AODV) and dynamic source routing (DSR). Lighting automation using wireless control networks with sensor-actuator nodes in a laboratory is considered as the test scenario. The applicability of ZigBee topologies for IoT-based lighting automation is discussed by the evaluation of performance parameters like average jitter, throughput, end-to-end delay, and energy model.

Analisis Kinerja Protokol Routing AODV Single Path dan Multipath Pada Jaringan IEEE 802.15.4/ ZIGBEE

Routing protocol is used to keep the stabilization of connection. Its connected with the performance was caused good communication when the communication from the source node to the destination node. The main factor of success in routing protocol techniques was quality of service to provide the difference level of service in arraging and giving the traffic service prority in the the network like constant bit rate (CBR) and file transfer protocol (FTP) using wireless network sensor network (WSN).This research will analyse the achivement quality of service in IEEE 802.15.4/Zigbee network used routing protocol techniques ad hoc on demand distance vector (AODV) single path and multipath based on distance and number of nodes simulated used Cygwin software. Based on the results of tests performed using the technique of routing protocol Ad Hoc On Demand Distance Vector single path and multipath for service traffic with constant bit rate and file transfer protocol, the result packet delivery ratio and goodput better on the distance between nodes 10m than the distance between node 15m to 25m, thus indicating that the goodput affect the traffic services are used. And the average delay results using the technique of multipath routing protocol AODV lower, thus indicating that the alternative pathway suppress buffer traffic delay on the service used.

BP-AODV: Blackhole Protected AODV Routing Protocol for MANETs Based on Chaotic Map

Even though the ad-hoc on-demand distance vector (AODV) is a broadly used routing protocol for mobile ad-hoc networks (MANETs), it is vulnerable to a blackhole attack. Lu et al. developed a secure MANET routing protocol called SAODV to address the security weakness associated with the original AODV protocol and to remedy the blackhole attack. Specifically, the SAODV protocol can protect against blackhole attack performed by a malicious node during the routing process. However, it cannot resist the cooperative blackhole attack, in which two nodes are participating together to mount such attack. Therefore, this paper proposes a secure MANET routing protocol called BP-AODV to overcome the security breaches related to the SAODV protocol along with the original AODV protocol. In addition, the BP-AODV is able to protect against a cooperative blackhole attack launched during the routing process and guards against the blackhole attack that might take place during the forwarding process. The BP-AODV is developed by extending the functionality of the AODV protocol along with utilizing the chaotic map features. The experimental results assure that the BP-AODV protocol is more secure than the SAODV protocol and can effectively fight the blackhole attack achieved by a malicious node or cooperative malicious nodes during the routing process. The results also reveal that the BP-AODV can strongly guard against the blackhole attack that occurs during the forwarding process.

A Reliable and Secure AODV Protocol for MANETs

In recent years, Mobile ad hoc networks ((MANETs) have generated great interest among researchers in their implementation under several computing environments. However, MANETs are highly susceptible to various security attacks due to their inherent characteristics. The ad hoc on demand distance vector (AODV) is most suitable routing protocol for mobile adhoc networks in which resource consumption attacks are frequent if it is not detected timely. In this paper, we have proposed a scheme to detect as well as overcome black hole attacks using an Intrusion Detection System (IDS). The proposed scheme is implemented using network simulator 2(NS2) to compare its performance against the standard AODV with and without attack. The results of the simulation show that proposed scheme optimizes the end-to-end delay, normalized routing load, packet delivery fraction and average throughput in comparison with AODV protocols under black hole attack.

Improving Quality of Service for Mobility Aware of Multi-path Routing Protocol for Load Balancing in Mobile Ad-Hoc Network

In Mobile Ad hoc Network (MANET), the single path QoS routing is disadvantageous as it may cause interference, fading, collision and link failures. For QoS routing, the load balancing is necessary, because it allows a router to take advantage of best of multiple shortest paths to a given destination. It also avoids congestion within the network using multipath. While using the MQRLB, the Load balancing may cause some of the major issues such as Link failure, Out of range, Limited Bandwidth, due to this the load balancing in multipath function is not efficient.To overcome these issues, in this paper, MMQRLBMultipath Mobility Aware QoS Routing Load Balancingwith AODV(Ad-hoc on demand distance vector)protocol is proposed to improve the QoS in Load balancing.

Energy Consumption Analysis in WSN Based on Node Placement Strategies

Wireless Sensor Networks (WSNs) is a collection of devices and sensor nodes connected with wireless network and communicate with one another via radio signals. Sensor in WSN is an autonomous (self-configuring) device used to sense the light, heat, motion, moisture and pressure etc that communicate with their neighbor nodes. Node placement is a technique that places the nodes effectively in the specified network environment. In WSN basically, wireless sensor network includes different topologies namely star, point-to-point, ring, bus, mesh and hybrid. In recent years, research has been carried out on different node placement strategies and produced different results based on its performance that includes power distribution and energy consumption of sensors. Energy consumption and network lifetime are considered to be the critical issues as the nodes are powered by the batteries which have finite energy reservoirs. In this paper, three different node placements namely Random, Uniform and Grid with respect to AODV (Ad hoc On-Demand Distance Vector) protocol is evaluated in order to analyze the energy factor during wireless communication. The performance metrics used to measure the analysis are Energy Consumption Average Jitter, Average End-to-End Delay, Average Throughput and Average Packet Delivery Ratio. The comparison results suggests that Grid node placement performs well in grid scenarios and shows best for specific performance metrics.

Mobility aware and dual phase AODV protocol with adaptive hello messages over vehicular ad hoc networks

Establishing stable routes over high mobility networks is a challenging field and consequently brought the attention of a lot of current researchers. In this article, a new reactive routing protocol has been proposed which is considered as a major extension of both Ad-hoc On-demand Distance Vector (AODV) and Mobility and Direction Aware AODV (MDA-AODV) prior routing protocols. It is named as Mobility Aware and Dual Phase Ad-hoc On-demand Distance Vector with Adaptive Hello Messages (MA-DP-AODV-AHM). It primarily concentrates on building routes considering vehicles’ speeds and direction of motion with respect to source vehicles, thereby establishing more stable routes and reducing the route breakages. Not only to this extent, but rather, we proposed an adaptive control packet announcement mechanism, which is directly connected to the periodic hello messages approach, with vehicles’ speeds, yielding a significant reduction in the amount of control overhead and congestion over the network. Moreover, the new protocol is proposed to alternate working among two phases, for the reason of guaranteeing the generation of efficient routes on a timely basis, which include MA-DP-AODV-AHM and AODV protocols. Our protocol has been evaluated in terms of control overhead, end-to-end delay, and energy consumption using QualNet simulator version 7.1 in which enormous simulations have been conducted under the base of vehicle density, packet rate, and constant bit rate connections. Simulation results summarize that MA-DP-AODV-AHM contributes efficiently in mitigating the network instability through generating effective stable routes and reducing link failures. Furthermore, it has proved its superiority over AODV and MDA-AODV.

CONGESTION AVOIDANCE AND CONTROL MECHANISMS FOR MANET USING AODV PROTOCOL: A SURVEY

Mobile Ad-hoc Network (MANET) comprises of self-organized mobile nodes, which communicate wirelessly without any fixed infrastructure.Congestion is one of the most common factors that affects functioning of MANET. When congestion encounters in the network the victim nodesfail to transmit the data, in turndeteriorates the network throughput. Appropriate congestion control algorithm is necessary in controlling the congestion, which reduces the load over the network, utilize the resources efficiently and provide a congestion free path for transmission of data.The Ad hoc On-Demand Distance Vector (AODV) protocol, one of the popular routing protocols defined for MANET, enables dynamic, self-starting, multihop routing between participating mobile nodes wishing to establish and maintain an ad hoc network. As AODV protocol is not adaptive to congestion, several researchers have suggested upgradations in the AODV protocolto control the congestion.This review paper aims to deliberate about some of the bettercongestion avoidance and control mechanisms for MANET using AODV Protocol by different researchers, their comparative analysis and performance assessment.

Analisis Kinerja Protokol Routing AODV Single Path dan Multipath Pada Jaringan IEEE 802.15.4/ ZIGBEE

Routing protocol is used to keep the stabilization of connection. Its connected with the performance was caused good communication when the communication from the source node to the destination node. The main factor of success in routing protocol techniques was quality of service to provide the difference level of service in arraging and giving the traffic service prority in the the network like constant bit rate (CBR) and file transfer protocol (FTP) using wireless network sensor network (WSN).This research will analyse the achivement quality of service in IEEE 802.15.4/Zigbee network used routing protocol techniques ad hoc on demand distance vector (AODV) single path and multipath based on distance and number of nodes simulated used Cygwin software. Based on the results of tests performed using the technique of routing protocol Ad Hoc On Demand Distance Vector single path and multipath for service traffic with constant bit rate and file transfer protocol, the result packet delivery ratio and goodput better on the distance between nodes 10m than the distance between node 15m to 25m, thus indicating that the goodput affect the traffic services are used. And the average delay results using the technique of multipath routing protocol AODV lower, thus indicating that the alternative pathway suppress buffer traffic delay on the service used.

A secured routing algorithm against black hole attack for better intelligent transportation system in vehicular ad hoc network

The societal costs accompanying the developments are usually related to traffic congestion and accidents. The condition can be enhanced by providing timely information on traffic conditions using vehicular ad-hoc networks. vehicular ah hoc network (VANET), which is an essential technology in the realization of intelligent transportation system (ITS), has key challenges such as infrequent link connection duration and high packet drop ratio. In this paper, an algorithm is proposed which provides security against attacks on routing protocols and better network connectivity. In this algorithm, attacker node or the chain of attacker node can be identified, and IPs of these attacker nodes are blacklisted which implies if any RREP (route reply packet)come from the blacklisted node then that RREP will be discarded. The proposed algorithm is implemented using NCTUns network simulator and comparison of leading VANET protocols ad hoc on-demand distance vector (AODV), B-AODV (AODV with black hole attack) with the proposed secured algorithm is done. Extensive simulation scenarios are considered, and final results show that proposed algorithm has 40% higher throughput in comparison to AODV protocol, which makes it more efficient in a dense vehicular environment having V2V communication. Also, the proposed algorithm has 10% lower packet drop and a lesser number of collisions which renders it more reliable for the vehicle vehicle (V2V) environment. It proves that proposed secured routing algorithm performs better than standard AODV in the presence of malicious nodes causing black hole attack.

Wireless Sensor Network Quality of Service Improvement on Flooding Attack Condition

There are two methods of building communication using wireless media. The first method is building a base infrastructure as an intermediary between users. Problems that arise on this type of network infrastructure is limited space to build any network physical infrastructure and also the cost factor. The second method is to build an ad hoc network between users who will communicate. On ad hoc network, each user must be willing to send data from source to destination for the occurrence of a communication. One of network protocol in Ad Hoc, Ad hoc on demand Distance Vector (AODV), has the smallest overhead value, easier to adapt to dynamic network and has small control message. One AODV protocol’s drawback is route finding process’ security for sending the data. In this research, AODV protocol is optimized by determining Expanding Ring Search (ERS) best value. Random topology is used with variation in the number of nodes: 25, 50, 75, 100, 125 and 150 with node’s speed of 10m/s in the area of 1000m x 1000m on flooding network condition. Parameters measured are Throughput, Packet Delivery Ratio, Average Delay and Normalized Routing Load. From the test results of AODV protocol optimization with best value of Expanding Ring Search (ERS), throughput increased by 5.67%, packet delivery ratio increased by 5.73%, and as for Normalized Routing Load decreased by 4.66%. ERS optimal value for each node’s condition depending on the number of nodes on the network.

Evaluation of neighbor credit value based AODV routing algorithms for selfish node behavior detection

Mobile ad hoc networks (MANETs) nodes interchange information by means of numerous intermediate nodes without the requirement of infrastructure (Toh, Ad hoc mobile wireless networks: protocols and systems, pp 34–37, 2002). Owing to the exposed arrangement and inadequate energy of the nodes, some nodes may not involve in the routing process properly (Laay et al., IEEE Commun Surv Tutor 10(4):78–93, 2008). This leads to selfish behavior of the nodes and moreover, some nodes do not have the chance to forward the packets, so they still idle in the network. Hence, these genuine idle nodes are also considered as selfish nodes and they are avoided in the routing process. To address this issue, credit-based protocols namely Neighbor credit value based and improved Neighbor credit value based Ad Hoc on demand distance vector (AODV) routing algorithms are proposed. These two protocols are evaluated against AODV for the better detection of selfish node behavior. Earlier works addressed the methods to overwhelm selfish behavior attack but fail in performance. A simple neighbor credit value based AODV (NCV-AODV) routing protocol was proposed to avoid such false detection. Some simple assumption is made on NCV-AODV that the nodes in the network are fundamentally not malicious and only some of the new nodes may be added to behave maliciously. This improved version is called improved Neighbor credit value based AODV (iNCV-AODV) protocol is proposed. The proposed two mechanisms are implemented in AODV routing protocol. An extensive analysis of the performance of the proposed detection mechanisms against the selfish behavior attack.

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.