A Comparative Analysis of Jellyfish Attacks and Black Hole Attack with Selfish Behavior Attack under AODV Routing Protocol
Journal Title: Journal of Advances in Mathematics and Computer Science - Year 2017, Vol 21, Issue 2
Abstract
The applications of mobile adhoc network (MANET) are increasing day-by-day due to the flexibility they provide to seamless communication. However MANETS are vulnerable to number of attacks because of properties like non-existing infrastructure, dynamic topology, multihop network etc. Lot of previous works have focused on the impact of various attack on routing protocol. Some attacks like jellyfish attack even follow all the rules and regulations of routing protocol then also they may cause damage to the communication. On the other hand, some attacks like blackhole attack have malicious intentions and causes destruction by dropping the sent packets. There also exist one other category of attack called selfish node attack that do not causes any destruction by modifying the field of the packet rather they do not cooperate in forwarding the packet. In a typical MANET scenario which may be in use for few minutes or even hours, the attacking node will have time to intervene in to the routing process, and able to make some destruction. But, if the network under consideration will be in use for limited short time for a particular military like quick rescue scenario, then how a malicious node will intervene in to the routing process and make considerable damage to the network within that short duration – this is the research question addressed in this work. In this work we study the impacts of some of the attacks on network under a short term military rescue mission like scenario. We will do a comparative analysis of above discussed attacks under AODV routing protocol. The analysis will be made with respect to different network sizes and under the presence of different number of attackers in the network. The impact on the performance will be measured with suitable metrics to understand the nature of different attacks.
Authors and Affiliations
Bhawna Singla, A. K. Verma, L. R. Raheja
Keywords
Related Articles
- EP ID EP321981
- DOI 10.9734/BJMCS/2017/31430
- Views 99
- Downloads 0
The “Vertical” Generalization of the Binary Goldbach’s Conjecture as Applied on “Iterative” Primes with (Recursive) Prime Indexes (i-primeths)
This article proposes a synthesized classification of some Goldbach-like conjectures, including those which are “stronger” than the Binary Goldbach’s Conjecture (BGC) and launches a new generalization of BGC briefly call...
Algorithms for Solving Some Inverse Problems from Combinatorial Number Theory
In this paper we use the characteristic property of sumsets which states that there exists a proper subset tiling the set by translates to solve by an algorithmic methods, for nite sets, some inverse problems in combina...
Resolving Timetable Scheduling Problem Based on Bio-inspired Genetic Algorithm
Timetabling is the task of assigning sets of events to periods of time, taking into account resource-constraints and preferences among assignments. This involves combinatorial optimization, time-based planning, in order...
On Stability of Widest Path in Network Routing
The problem of widest path (WP) is a well-established topic in network routing and digital compositing. This paper contemplates one facet of the robustness of optimal solutions to the widest path; i.e., stability analysi...
1P-ABC, a Simpli ed ABC Variant for Continuous Optimization Problems
In this paper a novel simpli ed and fast variant of the ABC algorithm is proposed, 1 Population ABC (1P-ABC), with the aim to increase the eciency of the ABC algorithm by using only one population of bees, the employed...