Ad-hoc On-demand Distance Vector Protocol Research Articles

Topology Control for Ad-Hoc Networks: A Comprehensive Review for Table Driven and On-Demand Routing Protocols

Routing on ad-hoc network has become a major research issue among the networking communities due to its increasing complexity and the surge of challenging problems. One major factor contributing to this tendency is that every terminal of an ad-hoc network is also functioning as a network router. In this paper we provide a comprehensive review about the principles and mechanisms of routing protocols used in ad-hoc networks. For comparison purposes, we discuss some relevant technical issues of two well-known routing strategies, namely On-Demand (Proactive routing) and Table-Driven (Reactive routing). In particular, focus our attention on two major and well-known routing protocols: AODV (Ad-hoc On-Demand Distance Vector Protocol) and OLSR (Optimized Link State Routing Protocol). Our study has no intention to suggest any definite solution for any ad-hoc network, because it is the case depending on dictated by the nature and varying factors of networks. Instead, we demonstrate our major perception and describe general models that may assist us while modeling a given network.

Improving MANET Routing Protocols Through the Use of Geographical Information

This paper provides a summary of our research study of the location-aided routing protocols for mobile ad hoc networks (MANET). This study focuses on the issue of using geographical location information to reduce the control traffic overhead associated with the route discovery process of the ad-hoc on demand distance vector (AODV) routing protocol. AODV performs route discovery by flooding the whole network with the route request packets. This results in unnecessarily large number of control packets traveling through the network. In this paper, we introduced a new Geographical AODV (GeoAODV) protocol that relies on location information to reduce the flooding area to a portion of the network that is likely contains a path to destination. Furthermore, we also compared GeoAODV performance with that of the Location Aided Routing (LAR) protocol and examined four mechanisms for reducing the size of the flooding area: LAR zone, LAR distance, GeoAODV static, and GeoAODV rotate. We employed OPNET Modeler version 16.0 software to implement these mechanisms and to compare their performance through simulation. Collected results suggest that location-aided routing can significantly reduce the control traffic overhead during the route discovery process. The comparison study revealed that the LAR zone protocol consistently generates fewer control packets than other location-aided mechanisms. However, LAR zone relies on the assumption that location information and traveling velocities of all the nodes are readily available throughout the network, which in many network environments is unrealistic. At the same time, the GeoAODV protocols make no such assumption and dynamically distribute location information during route discovery. Furthermore, the collected results showed that the performance of the GeoAODV rotate protocol was only slightly worse than that of LAR zone. We believe that even though GeoAODV rotate does not reduce the control traffic overhead by as much as LAR zone, it can become a preferred mechanism for route discovery in MANET.

Using Apriori algorithm to prevent black hole attack in mobile Ad hoc networks

Article history: Received July 2, 2012 Received in revised format 28 October 2012 Accepted 11 November 2012 Available online November 14 2012 A mobile ad hoc network (MANET) is considered as an autonomous network, which consists of mobile nodes, which communicate with each other over wireless links. When there is no fixed infrastructure, nodes have to cooperate in order to incorporate the necessary network functionality. Ad hoc on Demand Distance Vector (AODV) protocol is one of the primary principal routing protocols implemented in Ad hoc networks. The security of the AODV protocol is threaded by a specific kind of attack called ‘Black Hole’ attack. This paper presents a technique to prevent the Black hole attack by implementing negotiation with neighbors who claim to maintain a route to destination. Negotiation process is strengthen by apriori method to judge about suspicious node. Apriori algorithm is an effective association rule mining method with relatively low complexity, which is proper for MANETs. To achieve more improvement, fuzzy version of ADOV is used. The simulation results indicate that the proposed protocol provides more securable routing and also more efficiency in terms of packet delivery, overhead and detection rate than the conventional AODV and fuzzy AODV in the presence of Black hole attacks. © 2013 Growing Science Ltd. All rights reserved.

Agent based AODV Protocol to Detect and Remove Black Hole Attacks

A mobile ad hoc network (MANET) is a collection of mobile nodes and is autonomous having communication through the insecure wireless links. Security is very important issue for this type of networks because the nodes in the network dynamically add and join the network. This nature of nodes makes them vulnerable to malicious attacks. One of the widely adopted network routing protocols for Mobile Ad hoc Network (MANET) is AODV (Ad hoc on demand Distance Vector) protocol. Black hole attack is one such attack in which a malicious node makes use of susceptibility of Route Request (RREQ) packets of routing protocol to advertise itself with a fake Route Reply (RREP) message as having the shortest path to the destination node. Black hole attack has serious impact on routing and delivery ratio of packets. Most of the conventional methods to detect and avoid such attacks are likely to be suffered from high rate of errors in detection. To detect the black hole it is proposed to check the replies from all neighboring nodes to find the safe route but all such approaches suffered from high processing delay. In this paper we proposed a new approach called Agent based method to detect and eliminate black hole attack. Agent based method will not only efficiently detect the black holes but completely overcome the problem by eliminating the black hole from participating in MANET thus improving the security of the AODV. In simulation using NS - 2.33, the Agent based AODV has shown outstanding results as compared to AODV in presence of black holes. Results obtained from simulation have shown that Agent based method does not introduce high overhead for the duration of secure time (no attacks) and provide better performance during attack time (presence of Black hole) in the network.

Broadcast ID based Detection and Correction of Black Hole in MANETs

A wireless Adhoc network is a collection of mobile nodes with no pre-established infrastructure, forming a temporary network. In the absence of a fixed infrastructure, nodes have to cooperate in order to provide the necessary network functionality. One of the principal routing protocols used in Ad hoc networks is AODV (Ad hoc On-Demand Distance Vector) protocol. The security of the AODV protocol is compromised by a particular type of attack called ‘Black Hole’ attack [1]. In this attack a malicious node advertises itself as having the shortest path to the node whose packets it wants to intercept. It is proposed to wait and check the replies from all the neighboring nodes to find the Black hole nodes. In this research paper, we have detect the black hole node or unauthorized node on the based of broadcast ID. Firstly, to determine and propose routing algorithm for detection and correction of black hole in AODV.Secondly to implement this along on NS2 and analyze the result. Thirdly to obtain the comparison of the following parameters like End to End delay, Routing overheads and Packet delivery with the already proposed protocols. By doing this our proposed algorithm shows better performance than the conventional AODV.

A new method for improving security in MANETs AODV Protocol

Article history: Received May 20, 2012 Received in Revised form July, 29, 2012 Accepted 15 August 2012 Available online 20 August 2012 In mobile ad hoc network (MANET), secure communication is more challenging task due to its fundamental characteristics like having less infrastructure, wireless link, distributed cooperation, dynamic topology, lack of association, resource constrained and physical vulnerability of node. In MANET, attacks can be broadly classified in two categories: routing attacks and data forwarding attacks. Any action not following rules of routing protocols belongs to routing attacks. The main objective of routing attacks is to disrupt normal functioning of network by advertising false routing updates. On the other hand, data forwarding attacks include actions such as modification or dropping data packet, which does not disrupt routing protocol. In this paper, we address the “Packet Drop Attack”, which is a serious threat to operational mobile ad hoc networks. The consequence of not forwarding other packets or dropping other packets prevents any kind of communication to be established in the network. Therefore, there is a need to address the packet dropping event takes higher priority for the mobile ad hoc networks to emerge and to operate, successfully. In this paper, we propose a method to secure ad hoc on-demand distance vector (AODV) routing protocol. The proposed method provides security for routing packets where the malicious node acts as a black-hole and drops packets. In this method, the collaboration of a group of nodes is used to make accurate decisions. Validating received RREPs allows the source to select trusted path to its destination. The simulation results show that the proposed mechanism is able to detect any number of attackers. © 2012 Growing Science Ltd. All rights reserved.

QoS aware Routing Scheme for AODV Protocol based on Traffic Priority in Wireless Sensor Networks

The most predicament issue that happens in WSN is Congestion. Congestion causes packet loss, which in turn reduces throughput and energy efficiency. Therefore congestion in WSN’s needs to be controlled for high energyefficiency, to prolong system lifetime, improve fairness, and improve quality of service (QoS) in terms of throughput (or link utilization) and packet loss ratio along with the packet delay. The main focus of this paper is to provide modification in an existing system working with DSR (Dynamic Source Routing).This paper proposes modifications in the protocol of the existing system as AODV (Ad-Hoc on Demand Distance Vector). Proposed protocol provides an efficient way to overcome congestion in wireless cluster sensor network. Proposed algorithm provides priority both on data and location.

Energy Model based Performance Analysis of Wireless Sensor Networks

In this paper, four routing protocols AODV (Adhoc On demand distance vector), ZRP (Zone routing protocol), DSR (Dynamic Source Routing), and DYMO (Dynamic Manet On Demand), are analyzed and compared by using QualNet simulator on the basis of performance metrics such as Throughput, Average End-to-End Delay, Average Jitter, Total Packets Received, Packet Delivery Ratio, Energy Consumption in transmit mode, receive mode, sleep mode and idle mode. The results are taken, examined and analyzed in order to test the efficiency of these four protocols using different energy models. From the study performed it has been analyzed that ZRP consumes maximum energy while other protocols show similar consumption with Generic as the maximum energy consuming mode in transmit receive and idle modes. Mica-motes consumes energy in sleep mode while it shows the least consumption in transmit and receive mode for all the four protocols.

Performance Evaluation of AODV and DSR Routing Protocols in MANET Networks

Extensive use of wireless networks in different fields increases the need to improve their performance, as well as minimize the amplitude of loss messages. Device mobility, where there is no standard topology that can be applied or fixed routing that can be designed, is a topic that received recent attention in wireless networks. In a Mobile Ad Hoc Network (MANET), some nodes may join the network while others may leave. In this paper, we analyze a MANET’s performance for two proactive protocols; Ad Hoc On-Demand Distance Vector (AODV) Protocol, and Dynamic Source Routing (DSR) Protocol. By using network simulator NS2, we setup and evaluate the performance of AODV and DSR protocols with respect to the packets’ size.

Improving AODV Route Recovery Mechanisms with Connectivity and Particle Swarm Optimization

This paper proposes a new function for the Ad Hoc On-Demand Distance Vector (AODV) algorithm using the connectivity concept to decide between source and local repair when a link break occurs. Besides, we used a Computational Intelligence algorithm, called Particle Swarm Optimization (PSO), which enables to find candidate solutions in all considered search space in order to reduce average data packet delivery delay sent over the network. The performance of the original AODV protocol, according to its Request for Comments (RFC), is compared with this new implemented approach, called here as AODVPSO. Three metrics were used to evaluate the performance of the algorithm: throughput (as data packet delivery fraction), routing overhead and average data packet delivery delay. We observed that the AODV-PSO outperformed the original AODV protocol in the scenarios studied in this paper.

PERFORMANCE STUDY OF ADHOC ROUTING PROTOCOLS FOR CBR TRAFFIC

Mobile ad hoc network (MANET) is a dynamic network without fixed infrastructure due to their wireless nature and can be deployed as multi-hop packet networks. The nodes are free to move about and organize themselves into a network. These nodes change position frequently. A Reactive (on-demand) routing strategy is a popular routing category for wireless adhoc routing. The primary objective of this paper is to do comparative study of the performance of routing protocols Destination-Sequenced Distance-Vector (DSDV), Dynamic Source Routing (DSR) and Ad-hoc on demand Distance Vector (AODV) for wireless ad hoc networks in a simulated environment against varying network parameters. The evaluations are done by means of simulations using NS-2 network simulator. The study was done on the basis of performance metrics: throughput, packet delivery function, end-to-end delay, routing overhead and packet lost. Simulation results show that despite in most simulations reactive routing protocols DSR and AODV performed significantly better than proactive routing protocol DSDV for the CBR based traffic.

Analysis of mobile ad-hoc network routing protocols using shadowing propagation model

In this paper, we present the implementation and analysis of our implemented MANET simulation system considering ad-hoc on demand distance vector (AODV), dynamic MANET on-demand (DYMO) and optimised link state routing (OLSR) protocols for wireless multi-hop networking. We investigate the effect of mobility and topology changing in MANET. We study the impact of source and destination movement for indoor environment. In this work, we consider five models: stationary, source movement scenario, destination movement scenario, source and destination movement scenario and random way-point models. We assess the performance of our simulation system in terms of throughput, number of received packets and hop distance. From the results, we found that the AODV protocol has a good performance when the source and destination nodes are moving. Also, the AODV protocol provides a flexible and effective routing for indoor environment.

Hybrid AODV protocol for energy efficient routing in wireless sensor networks

Energy efficiency is one of the major concerns in wireless sensor networks since it impacts the network lifetime. The trade-off between sensed information and the amount of energy expended in communication are considered in developing protocols as sensor networks are resource constrained. In this paper, the ad hoc on-demand distance vector (AODV) protocol and threshold-sensitive energy efficient sensor network (TEEN) protocol are integrated to form a hybrid AODV routing protocol. The hybrid protocol is based on the characteristics of both protocols. The primary design objective of this research is to determine the active nodes and enhance the energy efficiency. Extensive simulation results show that the proposed protocol is efficient in transmission of packets, reduction in latency, energy consumption and throughput.

Secure Enhanced Authenticated Routing Protocol for Mobile Ad Hoc Networks

Problem statement: This study propose an improvement of Ad Hoc on Demand Distance Vector (AODV) Routing protocol in order to include some of the aspects of ad hoc networks such as load balancing, congestion avoidance and avoidance of link breakage. Approach: The most important problem nowadays is link breakage which mainly occurs due to excessive load and congestion in the network. Each node contains a buffer in order to detect the congestion in the network. Thus it selects a route from source to destination to avoid congestion and balance the load. The threshold value is initially set to a pre-determined value. Once the buffer crosses the threshold value, then packet forwarding is carried out via alternate path. Results: As a result, the proposed protocol Secure Enhanced Authenticated Routing Protocol (SEARP) avoids congestion and balances the load to avoid link failure. Conclusion: By detailed simulation studies, we show that even in high mobility scenario, SEARP achieves better packet delivery ratio with reduced delay and overhead compared to AODV protocol.

Securing AODV Routing Protocol in MANET Based on Cryptographic Authentication Mechanism

In mobile ad hoc wireless network (MANET), secure communication is more challenging task due to its fundamental characteristics like infrastructure less, wireless link, distributed cooperation, dynamic topology, lack of association, resource constrained and physical vulnerability of node. In MANET, attacks can be broadly classified in two categories: routing attacks and data forwarding attacks. Any action not following rules of routing protocols belongs to routing attacks. The main objective of routing attacks to mislead or disrupt normal functioning of network by advertising false routing updates. On the other hand data forwarding attacks include actions such as modification or dropping of data packet that does not disrupt routing protocol. In this thesis work, we proposed a method to secure ad hoc on-demand distance vector (AODV) routing protocol. The proposed method provides security for routing packets and can efficiently prevent the attacks such as black hole, modifying routing information and impersonation. The proposed method uses hashed message authentication code (HMAC) function which provides fast message verification and sender as well as intermediate nodes authentication. We simulate and compare the proposed method with original AODV and secure AODV (SAODV) protocol using network simulator tool (NS2). Simulation result shows that proposed method minimizes the time delay and network routing load involved in computation and verification of security fields during route discovery process and performs better than the original AODV protocol in the presence of malicious nodes performing black hole attack.

Design & Implementation of Secure AODV in Multicast Routing to Detect DDOS Attack

The wireless ad hoc network is particularly vulnerable to DOS attacks due to its features of open medium, dynamic changing topology, cooperative algorithms, decentralization of the protocols, and lack of a clear line of defense is a growing problem in networks today. In Mobile Ad hoc Networks (MANET), various types of Denial of Service Attacks (DOS) are possible because of the inherent limitations of its routing protocols. In this paper we will secure the MANET from the DDOS attack. DDOS attacks are similar to DOS attacks but there is a difference between them and that is DDOS attacks involve breaking in to hundreds or thousands of machines, so for this reason, this attack called Distributed. Very often, systems that use for attack is a part of the networks and users of these systems don’t know about that, their systems used for attack to another systems. This kind of attack, consume more bandwidth and uses more sources in network. . In this work, we study the effect of one of the important attacks that called DDOS in MANET on most vulnerability protocol that named AODV. The product of this study is detection of DDOS attack by using AODV (adhoc on demand distance vector) protocol. Proposed scheme is distributed in nature it has the capability to prevent Distributed DOS (DDOS) as well.

Performance Evaluation of Energy Efficient Routing Protocols for MANET

In this paper the mobile ad-hoc networks where there is no fixed infrastructure the mobile nodes are highly dynamic mobility. Due to mobility of node cased increasing over head and also require more energy consumption. , in mobile ad hoc network major challenging issue is energy and network overhead because of mobile nodes have limited energy source which are operated with only DC source. The effective use of energy requires efficient routing protocol. A performance comparison of Dynamic Source Routing (DSR) and Ad hoc On-Demand Distance Vector (AODV) routing protocols with respect to average energy consumption and routing energy consumption are explained thoroughly. The performance of the DSR protocol is compared with AODV protocol in terms of energy consumption, network overhead, throughput, end to end delay. The simulation parameters are carried out using network simulator ns 2.35. Keyword: AODV, DSR, MANETs, Energy

TODV: Performance Analysis of a Time on Demand Distance Vector Protocol for MANETS

In MANET (Mobile Adhoc Network) the physical connectivity of the network keeps on changing dynamically. Because of the several MANET constraints such as limited bandwidth, mobility, battery power etc; it becomes very important to design a protocol that suits the requirements for MANETS. In this paper, we suggest a protocol mechanism which is loosely based on a reactive protocol AODV (Ad Hoc On demand Distance Vector Protocol). The proposed protocol uses the time concept based on first come first served basis for path choosing process, hence the name Time On Demand Distance Vector Protocol (TODV). The protocol design presented here suits the MANETS dynamic topology perfectly in finding the best path or route for data communication. The simulation study reveals that the proposed protocol outperforms than existing AODV, in terms of throughput and end-to-end delay.

Efficient AdHoc Ondemand Distance Vector Routing Protocol using Link State Algorithm

developed a new algorithm for route discovery, nodes management, and mobility handling for on-demand cache routing on mobile Ad-Hoc networks (MANET). We used Ad- Hoc On demand Distance Vector (AODV) protocol as the better known reactive protocol, as well as using Link State algorithm of the Optimize Link State Routing (OLSR) protocol together. We used two levels of caches memory L-1 and L-2 along with link state routing table for each node. Which maintaining by using the algorithm of OLSR, which working under the AODV protocol. For mobility handling, we used link state algorithm working under AODV to manage node addition, deletion and movement in the network efficiently. We used the Network simulator NS-2 version 2.29 to show the results comparing with the AODV used just cache memory, and comparing with AODV without cache memory. The results shows that our algorithms outperform comparing with AODV without cache memories, and AODV with two levels of cache memory on packet delivery rate, where the link state routing protocol is used to distribute and maintain routing information among various nodes within a domain by using two messages which are Hello messages and Topology Control messages (TC) .

MP-AODV : AODV 기반 모바일 Ad-Hoc 네트워크에서의 다중경로 라우팅 프로토콜

본 논문에서는 모바일 노드들의 움직임이 심한 MANET 환경에서 데이터의 전송을 보다 안정적이고 신뢰성 있게 하기 위해 소스 목적지 간의 다중 경로를 찾는 새로운 방법을 제시하고자 한다. 새로운 다중경로 라우팅은 먼저 AODV에 기반을 두어 주경로를 설정하고 주경로로 설정된 노드는 보조경로 탐색에 참여하지 못하도록 하여 주경로와 보조경로를 노드 비 겹침(disjoint)하게 형성한다. 또한 주경로가 설정된 후 바로 데이터 전송을 시작하고 데이터 전송이 되고 있는 중에 백그라운드로 보조경로 탐색을 실행하여 경로 탐색 시에 발생하는 데이터 전송의 지연을 주경로 탐색 시에만 발생하도록 한다. 주경로와 보조경로 중 하나의 경로가 단절되면 즉시 다른 경로로 데이터전송을 하게 되고 단절된 경로는 경로유지를 통해 다시 노드 비 겹침 경로를 찾는다. 또한 노드 비 겹침, 링크 비 겹침 방식을 혼합한 하이브리드 방식을 제안하여 네트워크의 상황에 따라 적합한 방식으로 경로를 탐색하도록 한다. Qualnet 기반 시뮬레이션을 수행한 결과, 제안한 라우팅 프로토콜을 사용한 경우 AODV, AOMDV에 비해 높은 패킷 전송률을 보이고 종단간 지연시간도 줄어든다.