Secure AODV Research Articles

High Secure Routing Protocol with Authentication and Confidentiality Increased in Wireless Ad Hoc Networks

Wireless mobile ad hoc networks are the special type of networks where a collection of mobile devices forms a temporary network without any established infrastructure aid. Having no central infrastructure and random devices movement cause some problems in ad hoc networks such as routing and security. Routing is a critical function in mobile ad hoc networks. The most important requirement for routing protocols is the capability to act in adversarial environments. In this article a secure routing algorithm is suggested to increase confidentiality and authentication in ad hoc routing protocols. The secure routing algorithm presented with two methods high secure AODV authenticated with asymmetric algorithms (HSAODV1) and high secure AODV authenticated with MAC algorithms (HSAODV2) which every one of them has two phases as follows: at the first phase of HSAODV1, the source, destination and intermediate nodes authenticate by using digital signature and asymmetric algorithms, and in the second phase, the protocol utilizes one way key-chain for increased data confidentiality. In the first phase of HSAODV2, the destination and intermediate nodes authenticate by using MAC algorithm for source node and the second phase operates approximately as the second phase of HSAODV1. In order to assess the functionality of these algorithms, security matrix, normalized routing overhead and energy consumption are evaluated for the proposed algorithm.

FLOODING ATTACK AWARE SECURE AODV

Providing security in a Mobile Ad hoc Network (MANET) is a challenging task due to its inherent nature. Flooding is a type of Denial of Service (DoS) attack in MANET. Intentional flooding may lead to disturbances in the networking operation. This kind of attack consumes battery power, storage space and bandwidth. Flooding the excessive number of packets may degrade the performance of the network. This study considers hello flooding attack. As the hello packets are continuously flooded by the malicious node, the neighbor node is not able to process other packets. The functioning of the legitimate node is diverted and destroys the networking operation. Absence of hello packet during the periodical hello interval may lead to wrong assumption that the neighbor node has moved away. So one of the intermediate neighbor nodes sends Route Error (RERR) message and the source node reinitiates the route discovery process. In a random fashion the hello interval values are changed and convey this information to other nodes in the network in a secured manner. This study identifies and prevents the flooding attack. This methodology considers the performance parameters such as packet delivery ratio, delay and throughput. This algorithm is implemented in Secure AODV and tested in ad hoc environment. The result of the proposed algorithm decreases the control overhead by 2%.

A Secure AODV Protocol Based on Distributed EigenTrust Algorithm against Packet Drop Attacks in WMNs

In view of the increasing threats to routing protocols of the wireless mesh networks (WMNs), reputation mechanisms are widely used to mitigate the effects of routing attacks. However, in many reputation schemes different nodes generally hold various opinions about one’s reputation value. To compute a comprehensive and consensus reputation for each node in the WMN, this paper improves a distributed EigenTrust algorithm in terms of modifying initial value and termination condition to guarantee the convergence of the algorithm when no pre-trusted nodes are specified. In addition, the improved algorithm is implemented into the AODV routing protocol in Linux operating system to resist against the packet drop attack. Finally, experimental results show that our implementation is able to switch from a route compromised by an attack to a more reliable route for data transmission.

Secure AODV using Symmetric Key Cryptography with Cyclic Chain Hash Function (CCHF)

paper, we analyze the network performance with using Symmetric Key Cryptographic technique applying in AODV routing protocol with cyclic chain hash function (CCHF). Throughput and end to end delay of KK cryptographic (KKC) algorithm applying in AODV is less. If Symmetric Key Cryptographic technique used in AODV routing protocol with cyclic chain hash function has given maximum throughput and minimum end to end delay. In this dissertation, Key authentication is used in cyclic chain hash function. The proposed work we have implemented of the network performance. Shows the network performance of the proposed work is analysis of results. Network Simulator 2.34 is used for Simulation of results.

Securing AODV: the A-SAODV secure routing prototype

Mobile ad hoc networks pose new kinds of security problems, caused by their nature of collaborative and open systems and by limited availability of resources. In this article, we consider a Wi-Fi connectivity data link layer as a basis and focus on routing security. We discuss our implementation of the secure AODV protocol extension, which includes tuning strategies aimed at improving its performance. Namely, we propose an adaptive mechanism that tunes SAODV behavior. Moreover, we analyze our adaptive strategy and another technique that delays the verification of digital signatures. This article sums up the experimental results we collected in the prototype design, implementation, and tuning.

Secure ad hoc on-demand distance vector routing

This article gives an overview of different approaches to provide security features to routing protocols in mobile ad hoc networks (MANET). It also describes Secure AODV (an extension to AODV that provides security features) giving a summary of its operation and talking about future enhancements to the protocol.