DPRAODV: A Dynamic Learning System Against Blackhole Attack In AODV Based MANET

Security is an essential requirement in mobile ad hoc networks to provide protected communication between mobile nodes. Due to unique characteristics of MANETS, it creates a number of consequential challenges to its security design. To overcome the challenges, there is a need to build a multifence security solution that achieves both broad protection and desirable network performance. MANETs are vulnerable to various attacks, blackhole, is one of the possible attacks. Black hole is a type of routing attack where a malicious node advertise itself as having the shortest path to all nodes in the environment by sending fake route reply. By doing this, the malicious node can deprive the traffic from the source node. It can be used as a denial-of-service attack where it can drop the packets later. In this paper, we proposed a DPRAODV (Detection, Prevention and Reactive AODV) to prevent security threats of blackhole by notifying other nodes in the network of the incident. The simulation results in ns2 (ver-2.33) demonstrate that our protocol not only prevents blackhole attack but consequently improves the overall performance of (normal) AODV in presence of black hole attack

Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks

Mobile ad hoc networks (MANETs) are wireless networks that are subject to severe attacks, such as the black hole attack. One of the goals in the research is to find a method to prevent black hole attacks without decreasing network throughput or increasing routing overhead. The routing mechanism in define uses route requests (RREQs; for discovering routes) and route replies (RREPs; for receiving paths). However, this mechanism is vulnerable to attacks by malicious black hole nodes. The mechanism is developed to find the shortest secure path and to reduce overhead using the information that is available in the routing tables as an input to propose a more complex nature-inspired algorithm. The new method is called the Daddy Long-Legs Algorithm (PGO-DLLA), which modifies the standard AODV and optimizes the routing process. This method avoids dependency exclusively on the hop counts and destination sequence numbers (DSNs) that are exploited by malicious nodes in the standard AODV protocol. The experiment by performance metrics End-to-End delay and packet delivery ratio are compared in order to determine the best effort traffic. The results showed the PGO-DLLA improvement of the shortest and secure routing from black hole attack in MANET. In addition, the results indicate better performance than the related works algorithm with respect to all metrics excluding throughput which AntNet is best in routing when the pause time be more than 40 seconds. PGODLLA is able to improve the route discovery against the black hole attacks in AODV. Experiments in this thesis have shown that PGO-DLLA is able to reduce the normalized routing load, end-to-end delay, and packet loss and has a good throughput and packet delivery ratio when compared with the standard AODV protocol, BAODV protocol, and the current related protocols that enhance the routing security of the AODV protocols

An Effective Black Hole Attack Detection Mechanism using Permutation Based Acknowledgement in MANET

With the evolution of wireless technology and use of mobile devices, Mobile Ad-hoc Network has become popular among researchers to explore. A mobile ad-hoc network (MANET) is a self-configuring network of mobile routers (and associated hosts) connected by wireless links. The routers and hosts are free to move randomly and organize themselves arbitrarily. It allows mobile nodes to communicate directly without any centralized coordinator. Such network scenarios cannot rely on centralized and organized connectivity, and can be conceived as applications of Mobile Ad-Hoc Networks. Thus, MANET is vulnerable due to its dynamic network topology, as any node become untrusted at any time. The Black hole attack is one kind of security risk in which malicious node advertises itself to have a shortest path for any destination, to forge data or for DOS attack. In this paper, to detect such nodes effectively, we propose a Permutation based Acknowledgement for most widely used reactive protocol ad-hoc on demand distance vector routing AODV. This mechanism is enhancement of Adaptive Acknowledgement (AACK) and TWO-ACK, here we have tried to show the efficiency increment by decreasing number of messages routed in the network.Comment: MANET, Black Hole, Permutation, Security, Ad-hoc networ

Intelligent black hole detection in mobile AdHoc networks

Security is a critical and challenging issue in MANET due to its open-nature characteristics such as: mobility, wireless communications, self-organizing and dynamic topology. MANETs are commonly the target of black hole attacks. These are launched by malicious nodes that join the network to sabotage and drain it of its resources. Black hole nodes intercept exchanged data packets and simply drop them. The black hole node uses vulnerabilities in the routing protocol of MANETS to declare itself as the closest relay node to any destination. This work proposed two detection protocols based on the collected dataset, namely: the BDD-AODV and Hybrid protocols. Both protocols were built on top of the original AODV. The BDD-AODV protocol depends on the features collected for the prevention and detection of black hole attack techniques. On the other hand, the Hybrid protocol is a combination of both the MI-AODV and the proposed BDD-AODV protocols. Extensive simulation experiments were conducted to evaluate the performance of the proposed algorithms. Simulation results show that the proposed protocols improved the detection and prevention of black hole nodes, and hence, the network achieved a higher packet delivery ratio, lower dropped packets ratio, and lower overhead. However, this improvement led to a slight increase in the end-to-end delay

Disruption of Black Hole attacks in MANET

An Ad hoc network in a wireless system consist of an autonomous system, without centralization which results forming of mobile nodes. In MANET, each node works in a dual form that consists of a router as well as hosts. These nodes configure dynamically and communicate using hop to hop. Due to its simplicity it is used in mobile conferencing, military communication. In MANET nodes can join and leave the network so MANET becomes vulnerable. Certain factors like dynamic network configures, distribution cooperation, open medium terrorized in routing which give rise to security issues. Once such protocol AODV has been a victim of security. In existing, MANET faces a severe problem known as the Black Hole problem. This Black hole problem is mostly found in reactive routing protocol called AODV.The black hole conducts its Malicious node during route discovery process. Black hole node is a severe threat in AODV protocol that easily employed and becomes vulnerable in MANET. In this paper various techniques are discussed to overcome the Black hole attack

A Prey-Predator Defence Mechanism For Ad Hoc On-Demand Distance Vector Routing Protocol

This study proposes a nature-based system survivability model. The model was simulated, and its performance was evaluated for the mobile ad hoc wireless networks. The survivability model was used to enable mobile wireless distributed systems to keep on delivering packets during their stated missions in a timely manner in the presence of attacks. A prey-predator communal defence algorithm was developed and fused with the Ad hoc On-demand Distance Vector (AODV) protocol. The mathematical equations for the proposed model were formulated using the Lotka-Volterra theory of ecology. The model deployed a security mechanism for intrusion detection in three vulnerable sections of the AODV protocol. The model simulation was performed using MATLAB for the mathematical model evaluation and using OMNET++ for protocol performance testing. The MATLAB simulation results, which used empirical and field data, have established that the adapted Lotka-Volterra-based equations adequately represent network defense using the communal algorithm. Using the number of active nodes as a measure of throughput after attack (with a maximum throughput of 250 units), the proposed model had a throughput of 230 units while under attack and the intrusion was nullified within 2 seconds. The OMNET++ results for protocol simulation that use throughput, delivery ratio, network delay, and load as performance metrics with the OMNET++ embedded datasets showed good performance of the model, which was better than the existing conventional survivability systems. The comparison of the proposed model with the existing model is also presented. The study concludes that the proposed communal defence model was effective in protecting the entire routing layer (layer 2) of the AODV protocol when exposed to diverse forms of intrusion attacks

An Optimised and Efficient Routing Protocol Application for IoV: A Review

Mobile ad hoc network (MANET) is a wireless network without a centralised administrator, where each node acts as a router forwarding data packets to other nodes. The study compares the performance of three routing protocols (AODV, OLSR, and DSDV) using the NS2 simulator under various mobility models. The proposed work introduces a modified protocol, MAODV, which combines the features of AODV protocols to optimise energy consumption, minimise transmissions, and find an optimum path for data transmission. The proposed method is compared with the standard AODV protocol. It shows better average throughput and packet delivery ratio results in a vehicular ad hoc network (VANET) scenario