Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Debilitation of Black Hole and Wormhole Attacks Using Comprehensive Strategies in Wireless Networks

Download as doc, pdf, or txt
Download as doc, pdf, or txt
You are on page 1of 10

Debilitation of Black Hole and Wormhole Attacks using Comprehensive

Strategies in Wireless Networks

K.P.Manikandan 1, P Udayakumar2

Department of CSE, VSB Engineering College, Anna University, Karur, Tamil Nadu, India

*
manikandankp@yahoo.com

Department of CSE, VSB Engineering College, Anna University, Karur, Tamil Nadu, India

uday.uday08@gmail.com

Abstract

Mobile Ad hoc Network (MANET) is keen part used association with geologically getting strong correspondence.
The Black hole and Wormhole are attacks which cause group hardship and vulnerable against network. In this
proposed method, the guideline objective is to give secure data correspondence and moreover reduce noxious center
present in the association. The Rapid Response Round Trip Time (R3T2) is resolved to find the course with no
malignant aggressors earlier. In this R3T2 system, the response time and sales period of center are resolved. By
then it is refreshed for each trade and set aside as a segment of history association with picks the route course
without attacker center point. Despite that it tracks down the briefest route course by using an estimation called Path
Assignment Protocol (PAP). Elliptic Curve Cryptography (ECC) encryption system is used to get the data
packages. Considering the elliptic curve, the bundles are mixed in an incredibly gotten way. The ECC is a sort of
open key encryption. So the attack center doesn't recuperate any data information of packages, finally the result
shows that this method is incredibly gotten and less defenseless than each and every current show. Wormhole
Detection Using Multidimensional Scaling with Advanced Encryption Standard - Cipher Block Chaining-Message
Authentication Code Cryptography (WDMSAC) method is proposed in this paper.
Keywords: MANET, R3T2, PAP, ECC, WDMSAC

Introduction
Adhoc delegated is " For a particular explanation (improvised, made up in a second) " or "unconstrained
association ", is especially significant while overseeing distant contraptions in which a segment of the devices are
significant for the association only for the term of a trades meeting and the prerequisite for an incredible association
topography is conspicuous. Many proposed coordinating shows for exceptionally delegated associations work in an
on-demand style, as on-demand directing shows have been appeared to oftentimes have lower overhead and faster
reaction time than various kinds of guiding ward on discontinuous (proactive) segments. Basic thought actually has
been committed to making secure coordinating shows for uncommonly delegated associations, recalling various
secure for demand controlling shows that Safeguard against a variety of possible attacks on network coordinating.
There are assorted directing attacks, such as flooding, dull opening, interface satirizing, wormhole, and fascinating
miss-hand-off attacks. The current security game plans of wire networks can't be applied directly to MANET,
which makes a MANET essentially more exposed against security attacks. A couple of plans that rely upon
cryptography and key organization give off an impression of being empowering, yet they are unreasonably
expensive for resource obliged in MANET. They are as yet not great to the extent tradeoffs among suitability and
viability. A couple of courses of action work outstandingly inside seeing one dangerous center point, they likely
will not be material inside seeing various plotting aggressors. In like manner, some may require remarkable
hardware like a Global Positioning System (GPS) or a change to the current show. In any case, the proposed
research work will vanquish obstructions of MANET controlling issues, and to resource prerequisites. The work
will oversee security issues in versatile improvised associations. It will lead on to arranging security designing in
dealing with security challenges convenient unrehearsed associations are defying.
This paper is discussed the current security designing in a layered view and analyzes the intuition for such
security plan. This security designing can be used as a packaging work when arranging structure security for
exceptionally delegated associations. A basic part to the proposed structure is that it will join eminent cryptographic
instruments (like modernized confirmations and imprints), with different wellsprings of ID information. This
information comes as properties depicting real center credits, comparable as the biometrical characteristics broke
down during human conspicuous confirmation and check.
Related Works

For the investigation of Black hole and Wormhole assaults, Ansam Khraisat and Ammar Alazab [1] utilized an
AODV convention. To limit bundle misfortune and increment throughput, the AODV convention was utilized.
Mohammad S et al., [4] proposed the Highly Secured approach against Attacks on MANETs (HSAM) plans for getting of
courses on AODV. By sending ALARM bundles to neighbor hubs, the anticipation plans, dynamic information sending,
and directing component were utilized to distinguish malignant hubs. Pooch UW and Sun B. Guan Y [6] proposed a local
method to characterize the specific way in the organization. A recuperation convention was utilized in this strategy to
reestablish the steering way from the source to the objective. This methodology was utilized to expand throughput and
reduction discovery time. The leftover energy of the hub with stable VBOR bunches was presented by T. Companion
Meeralabbai and V. Rajamani [8]. The keys were passed starting with one client then onto the next. The authors of the
Gateway assumed a pivotal part in the arrangement of the association, gatherings and forestalling a Black opening and
Wormhole assaults. C.M.Vidhyapathi et al., [9] utilized the Watchdog methodology to successfully get the organization
against Blackhole and Wormhole assaults. T. Anuradha et al [10] proposed utilizing the AODV steering convention to
characterize helpful Wormhole assaults. To recognize a Wormhole assault in the organization, the Message Digest 5
(MD5) calculation given exceptional ids for all hubs. In the event that there are at least two hubs with similar ids,
Wormhole hubs were found and wiped out. This proposed strategy was utilized to effectively move bundles. Insect based
Routing in Network (ANTNET) and Ant Colony Optimization (ACO) frameworks were utilized by A. Radhika and Dr.
D.Haritha [11] to execute the identification technique and counteraction of Black opening and Wormhole assaults in
MANETs. The anticipation conspires, the dynamic information sending and directing component were utilized to
recognize malevolent hubs by sending ALARM bundles to neighbor hubs. Kamini Singh [12] used to moderate
Wormhole assault seriousness dependent on bunch counter measures in MANET. ECC-based confirmation and key trade
conventions are proposed by Swapnoneel Roy et al [21] for the investigation of weaknesses and to make them safer
against strings. This paper inspects the viability of ECC-based confirmation and key trade conventions for string
displaying. ECC ensures a specific level of safety. By consolidating Elliptic Curve Cryptography and Threshold
Cryptography, LeventErtaul et al [22] recommended another technique. Its point is to protect messages while they are
being communicated. For solid information sending, parting plaintext before encryption and parting figure text after
encryption is thought of. ECC Diffie-Hellman is likewise used to trade keys between two portable hubs. This paper
contrasts ECC and RSA and infers that ECC is the more successful of the two. Differential Behavioral Analysis is a
cryptographic framework assault characterized by Bruno Robisson and Pascal Manet [23]. (or then again DBA). This
assault joined two effectively successful assaults: differential force investigation (DPA) for factual treatment and safe-
blunder assault for flaw structure. DBA will in general be successful when mimicked utilizing an AES algorithmic model.
With byte-wise "stuck-at" flaws embedded over and again, the aggressor had the option to recuperate the whole mystery
key. Ayush Sogani and Aman Jain [24] contrived a strategy for accomplishing high security and fast validation while
monitoring power. It utilizes character put together encryption based with respect to elliptic bend cryptography, just as
client verification and key administration that is energy effective. Besides, to speed up, the mark size was diminished,
taking into account quicker mark confirmation. Therefore, the proposed conspire gives secure key administration, energy
preservation, and quick validation, while likewise lessening figuring overhead and correspondence costs.

Proposed Model

MANET concerns are inciting undertakings to give assurance and forestall assaults on system less correspondences
[12].The proposed procedures are utilized to find vindictive center points and forestall Black Hole and Wormhole assaults.
(a) An Effective Black Hole Attack Position and Anticipation System Based on Confidence in the MANET and (b)
Lessening of the dim opening and wormhole attacks using neighbor-based SCF Tree, R3T2, PAP, and Elliptic curve
pseudo-sporadic cryptography computation. (c) WDMSAC: Wormhole Detection technique using Multidimensional
Scaling with AES-CCM cryptography in a far off environment.
The proposed framework related with Detecting and Preventing Black Hole and Wormhole Attacks in MANETs
and cycle of proposed model stream given underneath

Figure 1 Flow of Proposed Model

Pseudo Code for WDMSAC

Procedure B
{

for each

K= ;

S= M [ ];

D= ; F= ;

T= ;

if then

{
P=V+S;
}
}

for

{
V=D;
F=V+D;
}

for do

if then
{
Remove edges X×Y
else
Remove B from B }}

Experimental Results and Discovery

NS2 simulator tools are used to analyze the proposed model for the detection of wormhole nodes on the
network. The WDMSAC proposed parameter techniques such as a true negative ratio, average delay, PDR, routing
overhead, detection ratio and false detection ratio is compared with existing algorithms namely PAP and SCF[16]
cluster. Table 1 shows that simulation parameter of proposed work.

Table 1 Simulation Parameter

Simulation Value
Parameter
Channel Wireless
Mac Channel
802.11

X 300
diimension
Y 300
dimension

Adhoc AODV
Routing Omni 125
Antenna Max 160
Packet
Number of 30
nodes
simulated

Simulation 120 s
time
Energy Energy Model
Min. 10
Neighbor 8
Adversary
node

The following graph compares Algorithms WDMSAC to the ECC, SCF, PAP, R3T2, and SCF clusters.

Table 2.True Negative, Detection, and False Detection Ratio Performance Analysis

True False
Techniques No. of nodes negative Detection ratio Detection
ratio Ratio
10 90 95 4
WDMSAC 20 92 93 5
30 85 94.6 8
10 95 96.5 4
ECC_SCF_ PAP 20 99.8 92.6 8.8
30 76.5 98.2 7.5
10 84.2 86 4.2
PAP 20 86 91.8 9.5
30 86.8 88.25 10.2
10 93 84.8 9.85
SCF_ CLUSTER 20 87 86.5 11.2
30 82.2 87.29 13.5
True Negative Ratio

The true negative ratio is the proportion of correctly defined negatives [22]. As a result, the percentage of nodes
that are correctly marked as not being incorrect is calculated.

𝑇𝑟𝑢𝑒 N𝑒𝑔𝑎𝑡𝑖𝑣𝑒 R𝑎𝑡𝑖𝑜 = 𝑇𝑁 / 𝑇𝑁 + 𝐹𝑃

The number of correctly identified non-malicious nodes is the True Negative (TN) value, while the number of
correctly identified malicious nodes is the False Positive (FP) value.
Detection Ratio

This is the percentage of malicious nodes found out of all the nodes in the network. It's expressed as a percentage
of the detection ratio. Since the shifts on the routing table are less with decreased agility, the identification ratio
rises, making it easier to spot suspicious activity [23]. When mobility is high, the detection ratio is low, and vice
versa.

Detection ratio=sum of ratio of routing packets / average of packets delivered

False Detection Ratio

It's the proportion of decisions in which routine alerts are flagged as unusual problems. These tests of the
likelihood of aggregated routing control packet source address exclude the sudden, unpredictable changes that
occur during normal operation [24].

False Detection Ratio = False discovery of malicious node / Total number of discoveries

Figure 2 Graph for True Negative, Detection and False Detection Ratio for 10 nodes
Figure 3 Graph for True negative, Detection and False Detection Ratio for 20 nodes

No. of Avg. Routing


Techniques PDR
node Delay Overhead
10 2 99 1
WDMSAC 20 3 97 2
30 3 93 2.45
10 1.8 82 5
ECC_SCF_ PAP 20 6 85 8
30 8 83 9
10 2.25 72 11
PAP 20 5 70 15
30 7 68 20
10 3.49 56 13
SCF 20 15 54 16
30 20 50 20

Figure 4 Graph for True Negative, Detection and False Detection Ratio for 30 nodes

Table 3 Average Delay, PDR, and Routing Overhead Performance Analysis


Average Delay

The average delay is a parameter that indicates how often network resources are being used by routing
protocols. It is given in a matter of seconds. This can be determined by multiplying the total number of samples by
the sum of all delay samples.

Average delay = Sum of total packet delay / Total number of received packets

Packet Delivery Ratio

The Packet Delivery Ratio (PDR) is the proportion of packets transmitted by a traffic source node to the
packets acknowledged by a traffic drop. It explains the correctness and efficacy of mobile ad hoc routing protocols
by measuring the loss rate as shown by transport protocols.

PDR = Packet received / Packet delivered × 100

Routing Overhead

The percentage of packets provided for routing and packets received at the destination is known as routing
overhead. It’s worth is expressed in bits. The sum of routing control packets in circulation in the network that are
responsible for route discovery and route management is known as routing overhead.

Routing overhead = Total number of routing packets / transmitted a data packet sent to destination

Figure 5 Graph for Average Delay, PDR, and Routing Overhead Ratio for 10 nodes
Figure 6 Graph for Average Delay, PDR, and Routing Overhead Ratio for 20 nodes

Figure 7 Graph for Average Delay, PDR, and Routing Overhead Ratio for 30 nodes

Conclusion

In this paper, at the principal phase of the proposed work, presents the Self-Centered Friendship tree (SCF tree)
with MD5 calculation in MANET. In this work, the bundle conveyance proportion is expanded, throughput esteem
is expanded, the normal postponement is diminished, the hub energy is decreased and the control overhead worth
is diminished. At last, Black hole assault is identified and kept from assault by proposing a strategy in MANET. At
the second phase of the proposed work, the execute depends on SCT tree, trust esteem, Rapid Response Round
Trip Time (R3T2), Path Assignment Protocol (PAP), and ECC encryption for identifying and forestalling Black
hole and Wormhole assaults in MANET. Because of the aggressors in the organization, security is a profoundly
delicate issue for information transmission. The Rapid Response Round Trip Time system and Path Assignment
Protocol are proposed to defeat the security challenges and to distinguish hazardous assaults like Black hole and
Wormhole assault in the transmission course way. In the third, the WDMSAC strategy is suggested that utilizes
topological data to recognize the Wormhole assault and keep up secure transmission utilizing AES-CCM
cryptography [25]. The proposed work builds security level, bundle conveyance proportion, location proportion
and diminishes normal deferral, steering overhead rate through which it accomplishes minimization of
correspondence cost and expands the throughput successfully.

References

[1] Ansam Khraisat and Ammar Alazab, “A critical review of intrusion detection systems in the internet of things:
techniques, deployment strategy, validation strategy, attacks, public datasets and challenges” springer open, Cyber
secure 4, 18 (2021). https://doi.org/10.1186/s42400-021-00077-7.

[2] Chaabouni N, Mosbah M, Zemmari A, Sauvignac C, Faruki P “Network Intrusion Detection for IoT Security
Based on Learning Techniques” , in IEEE Communications Surveys & Tutorials, vol. 21, no. 3, pp. 2671–2701,
third quarter 2019. https://doi.org/10.1109/COMST.2019.2896380.
[3] Khraisat A, Gondal I, Vamplew P, Kamruzzaman J, Alazab A (2020) Hybrid Intrusion Detection System
Based on the Stacking Ensemble of C5 Decision Tree Classifier and One Class Support Vector Machine.
Electronics 9(1):173, 2020.

[4] Mohammad S. Obaidat, IssacWougang, Sanjay Kumar Dhurandher and Vincent Koo, 2012 “Preventing Packet
Dropping and Message Tampering Attacks on AODV-based Mobile Ad-Hoc Networks”, (CITS), IEEE pp.1-5.

[5] Kaur, S. and Gupta, A., 2015 “A Novel Technique to Detect and Prevent Black Hole Attack in MANET”,
International Journal of Innovative Research in Science, Engineering and Technology, 4(6):pp.4261-4267.

[6] Sun B,Guan Y and Pooch UW, 2003 “Detecting Black hole Attack in Mobile Adhoc Networks” ,Paper
presented TX 5th European Personal Mobile Communication Conference, pp. 490-495.

[7] Shefi Mehta, D. and Sharma, M., 2013 “Analysis of Black Hole and Wormhole Attack using AODV
Protocol”, International Journal of Research in Management, Science & Technology, 1 (1):pp.44-48.

[8] Labbai, T.P.M. and Rajamani, V., 2013. “Prevention of Wormhole and Blackhole attacks in secure VBOR for
mobile ad hoc networks”. Journal of Theoretical and Applied Information Technology, 55(2):pp.190-196.

[9] Vidyapathi, S. and Harshita, K., 2013. Securing MANET from Black Hole And Wormhole
Attacks. International Journal of Engineering and Technology, 5(3):pp. 2212-2220.

[10] Anuradha T and Padmashree S. Shedbalkar, 2012, “Detection and Prevention of Cooperative Wormhole
Attack in a MANET” International Journal of Science and Research (IJSR), 3(2):pp.2302-2305.

[11] Radhika, A. and Haritha, D., 2016 “Detection and Prevention of Blackhole Attack, Wormhole Attack in
MANET Using ACO”, International Journal of Engineering and applied Sciences (IJEAS), 3(1):pp.104-107.

[12] Singh, K., Singh, G. and Agrawal, A., 2014. “A Trust based Approach for Detecting and Preventing
Wormhole Attack in MANET”. International Journal of Computer Applications, 94(20):pp.1-5.

[13] Gojiya, J., Nayak, A. and Patel, B., 2016. An Enhanced Approach of Detection and Prevention of Black Hole
Attack on AODV over MANET. International Journal of Computer Applications, 142(13).

[14] Venkatadri, N. and Reddy, K.R., “Detection and Prevention of Black Hole Attack using Trust-TORA”,
International Journal of Computer Networks and Wireless Communications, 5(2):pp.447-456.

[15] Jain. A., 2012. “Trust based routing mechanism against black hole attack using AOMDV-IDS system in
MANET format” International Journal of Emerging Technology and Advanced Engineering (IJETAE),
2(4):pp.653-661.

[16] Jain, A. and Tiwari, A.J., 2014, “A Combined Approach for Worm-Hole and Black-Hole Attack Detection in
MANET”, International Journal of Engineering Research and Applications, 4(9):pp.18-22.

[17] Katal, A Wazid, M. Sachan, R. S. Singh, D. P. Goudar, R. H, 2013, “Effective Clustering Technique for
Selecting Cluster Heads and Super Cluster Head in MANET”,IEEE (ICMIRA),pp:1-6.

[18] Bhosle, A.A., Thosar, T.P. and Mehatre, S., 2012. “Black-hole and wormhole attack in routing protocol
AODV in MANET. International Journal of Computer Science, Engineering and Applications, 2(1), p.45-54.

[19] Alem, Y. F., &Xuan, Z. C. 2010, “Preventing black hole attack in mobile ad-hoc networks using Anomaly
Detection”, 2nd International Conference on Future Computer and Communication, IEEE, 3:ppV3-672-V3-676.
[20] Naït-Abdesselam, F., Bensaou, B., &Taleb, T. (2008). Detecting and avoiding wormhole attacks in wireless
ad hoc networks. Communications Magazine, IEEE, 46(4):pp.127-133.

[21] Swapnoneel Roy and ChanchalKhatwan, 2017 “Cryptanalysis and Improvement of ECC Based
Authentication and Key Exchanging Protocols”, Cryptography, 1(9):pp.1-25.

[22] Levent Ertaul and Weimin Lu, 2005 “ECC Based Threshold Cryptography for Secure Data Forwarding and
Secure Key Exchange in MANET”, International Federation for Information Processing, pp. 102-113.

[23] Bruno Robisson and Pascal Manet,” Differential Behavioral Analysis”, Cryptographic Hardware and
Embedded Systems CHES, Springer, pp. 413-426, 2007.

[24] Ayush Sogani and Aman Jain, “Energy aware and fast authentication scheme using identity based
encryption in wireless sensor networks”, Cluster Computing, Springer, pp.1-12, 2017.

[25] Nageswaran.C.M and Faizal Mukthar Hussain.S “Cluster Based MANET of Self Node Detection in SCF+
Tree” International Journal of Innovations in Scientific and Engineering Research (IJISER) ,Vol 2, Issue 4,pp.93-
98, 2015.

You might also like