International Journal of Emerging
Technology & Research
Volume 2, Issue 1, Jan - Feb, 2015
(www.ijetr.org)
ISSN (E): 2347-5900
2347
ISSN (P): 2347-6079
Analyzing Aodv And Dsdv Protocol To Prevent
Wormhole Attack In Wsn
Harleen Kaur1, Neetu Gupta2
Department of ECE, GIMET
GIMET, Amritsar, Punjab, India
ABSTRACT
Wireless sensor network are usually deployed in unattended or hostile environment for information gathering and transmitting it
to the base station for evaluation. Due to built
built-in
in deficiencies of sensors, security is the major threat in WSN. WSNs are
responsive to various external and internal attacks bbeing
eing curbed by computation assets, definite memory capacity and battery life,
mechanism power, lack of tamper resistant packaging and the use of doubtful wireless communication channels. The wormhole
attack is one of the intense attacks on WSN that can aff
affect
ect the networks performance. In this paper, protocol (AODV and DSDV)
that is based on security is implied against wormhole attack in WSN. The evaluation of AODV and DSDV protocol is evaluated on
the basis of metrics like throughput, average energy, packet overhead, packet delivery ratio. We present a technique to identify
wormhole attack in wireless ad hoc network and a solution to discover a safe route by using NS
NS-2
2 simulator.
Keywords: Wireless sensor network, security, AODV, DSDV, overhead, wormhole.
1. INTRODUCTION
Wireless Sensor Networks (WSN) is a collection of nodes organized into a cooperative network [1]. Each node consists of
processing capability (one or more microcontrollers, CPUs or DSP chips), may contain multiple types of memory (program, data
and flash memories), have a RF transceiver (usually with a single Omni directional antenna), have a power source (e.g., batteries
batte
and solar cells), and accommodate various sensors and actuators. Systems of 1000s or even 10,000 nodes are anticipated. Such
S
systems can revolutionize the way we live and work. Security is a major challenging issue in wireless sensor networks
applications because they are operated in public and unrestrained areas. The foremost goal of providing security is to protect
protec the
network
work resources against a number of attacks such as DoS attack, wormhole attack, black hole attack, grayhole attack, routing
table overflow attack, packet replication attack, and modification of packets attack [2]. The paper is organized as follows. In the
section II, description of Wormhole attack and AODV routing protocol is given. In section III proposed algorithm is described.
Section IV discusses about the simulation setup and result
results and evaluation of simulation is given in section V and at the end in
section VI conclusion of simulation scenarios is drawn out.
© Copyright reserved by IJETR
(Impact Factor: 0.997)
99
International Journal of Emerging Technology & Research
Volume 2, Issue 1, Jan - Feb, 2015
(www.ijetr.org) ISSN (E): 2347-5900
5900 ISSN (P): 2347-6079
2347
2. WORMHOLE ATTACK AND ROUTING PROTOCOL AODV
The main scheme of this attack is to tunnel packets established on one part of the system to another. It is located in a desired
environment, wormhole can entirely mess routing. These wormholes can utilize routing race circumstances which occur when
node takes routing decisions [3] depending on the primary course advertisement. This may persuade distant nodes that they are
very close to the sink. This may also headed to sinkhole if node on the other end foes elevated quality way to sink.
Figure1: Wormhole attack in WSN
Wormholes may induce 2 nodes that they are neighbors when the
they
y are far away from each other. It can be used in conjunction
with sybil attack. Encryption alone cannot prevent this attack AODV (Ad-hoc
hoc on Demand Distance Vector) is a reactive protocol.
The reactive routing protocols do not periodically update the routi
routing
ng table like table driven proactive protocols periodically. It is
the modification of DSDV (Destination Sequence Distance Vector)
Vector). [11]
11] It provides unicast, multicast and broadcast. It works on,
on demand algorithm. It searches for route between nodes onl
only
y which is decided by the source nodes. These routes are maintained
as long as they are needed by source. AODV builds route using route request and route reply query cycle. It is the loop free, selfself
starting scale to large number of nodes. AODV is a well
well-known
nown distance vector routing protocol and it works as follows.
Whenever a node wants to communicate with another node, it looks for an available path to the destination node, in its local
routing table. If there is no path exists, then it broadcasts a rout
routee request (RREQ) message to its neighborhood nodes. Any node
that receives this message for route discovery looks for a path leading to the respective destination node. The important feature
fea
of
AODV is the maintenance of time based states. This means that routing entry which is not used recently is expired. The
intermediate nodes store the route information in the form of route table
table.
A. Counter Attacks:
To detect and for the solution of this attack, there is an easy exchange of 4 way handshaking messages. It is easy to implement and
it does not entail any location information
ation or time synchronization [4
[4].
Detection can be done on basis of data packet flow. In the proposed journal [5], by using network simulator NS2 whose code is
written as tcl script
pt this attack detection can be implemented. This attack is detected based on packet reception
r
and dropped ratio,
and also based on throughput. Number of packets is declini
declining exponentially so WSNs can be protected by using this technique.
technique
© Copyright reserved by IJETR
(Impact Factor: 0.997)
100
International Journal of Emerging Technology & Research
Volume 2, Issue 1, Jan - Feb, 2015
(www.ijetr.org) ISSN (E): 2347-5900 ISSN (P): 2347-6079
In [6], a way out to this attack for adhoc networks where all nodes are ready with directional antennas.
For perceiving and shielding against this attack Packet Leash [7] is one of the most suitable Method. This method has 2 types of
leashes they are Geographic and Temporal. Geographic Leashes: All the nodes have a synchronized clock and know its exact
location. Each node attaches its transmission time and existing position before transferring the packet. Receiving node figures out
the path/ distance and also calculates the time for the packets to reach. To guess whether the predictable packet passed through
wormhole or not, distance information can be used. Temporal Leashes: Here the correspondent puts the sending time with the
packet and then the receiving node calculates the distance/ path of that packet by pretentious promulgation and exploiting the
discrepancy between time to send and receive the packet.
One particular class of protocols which seems to be resistant to wormhole attacks is geographic routing protocols [9]. These
protocols direct the traffic to the base station along a geographically shortest path and therefore do not rely on advertisements
from potential adversaries[10].
B. Classification of Wormhole Attack
There are several ways to classify the wormhole attack. Wormhole can be classified into two classes- Hidden Attack and Exposed
Attack, depending on whether malicious nodes show their identity into packet's header when tunneling and replaying packets [12].
1. Hidden Attack
Each participating node on the path updates packet's header before forwarding it to the subsequent node by putting their identity
(MAC address) to allow receivers know the packet directly comes from. In hidden attack, wormhole nodes do not put their
identity into the packet's header so that do not realize the existence of them. For example, in this kind of attack a path from S to D
via wormhole link A, B will be S-P-Q-R-D. In this way Q seems to get the packets directly from P so it considers P its neighbour
although P is Out of radio range from Q. In general in hidden attack nodes within A's vicinity are fake neighbours of nodes within
B's vicinity and vice versa.
2. Exposed Attack
In exposed attacks, wormhole nodes include their identities in the packet's header as other authenticated nodes do. Therefore,
other nodes are aware of the existence of wormhole nodes but they do not know wormhole nodes are malicious. In case of
exposed attacks, the path from S to D via wormhole will be S-P-A-B-Q-R-D. In hidden attacks, there are many fake neighbours
created by wormhole link but there is no fake neighbour except (A, B) in exposed attacks
3. PROPOSED ALGORITHM
This paper presents a novel approach to secure AODV against wormhole attack in WSN using data tracker node analysis. In this
work, data tracker analysis approach analyzes the neighboring nodes so as to check the authenticity of the nodes for secure
© Copyright reserved by IJETR
(Impact Factor: 0.997)
101
International Journal of Emerging Technology & Research
Volume 2, Issue 1, Jan - Feb, 2015
(www.ijetr.org) ISSN (E): 2347-5900
5900 ISSN (P): 2347-6079
2347
transmission of data over the network. According to this approach a node will request to its neig
neighboring
hboring nodes and perform a
request and response mechanism. The node will maintain the table to track the timeout. If the reply time is not accurate there is an
attack in the network. All the intermediate nodes are analyzed to detect the presence of wormhole
le attack using AODV protocol in
WSN. The steps of proposed algorithm are:
Step 1: Divide the network in number of zones information of number of nodes and packet routing.
Step 2: Select the leader for the respective zones giving the information of each no
node.
Step 3: Assign the data tracker for each zone keeping the track of data send and received by the destination.
Step 4: Mismatch between data sent by source and received by destination will lead to the detection of
the wormhole in the
network.
Step 5: If the number of received packet - number of forwarded packets was more.
Step 6: Isolate the wormhole nodes from the network by sending alert messages to the nodes.
Step 7: Nodes after receiving the alert message will not communicate with the wormhole.
4. SIMULATION SETUP
Network Simulator tool is used to evaluate the performance of different routing protocols in Wireless sensor networks. In this
thi
simulation, we have tested routing protocols with scalability of nodes. The nodes are deployed randomly in a terrain of size 1100
* 1100m.
00m. CBR is used as data traffic application with multiple source and destination. It consists of basic network entities
en
as
sensor nodes (mobile). The performance of different rrouting protocols is analyzed on behalf of metrics like
li throughput, overhead,
Packet delivery ratio and energy consumption. The parame
parameters used in the simulation are summarized in the table below:
A. Scenario design
Figure1: Scenario environment
© Copyright reserved by IJETR
(Impact Factor: 0.997)
102
International Journal of Emerging Technology & Research
Volume 2, Issue 1, Jan - Feb, 2015
(www.ijetr.org) ISSN (E): 2347-5900 ISSN (P): 2347-6079
B. Simulation Parameters
Parameters
Values
Number of nodes
56
MAC type
IEEE 802.11
Initial Energy
100
Sleep Power
0.0005
Transmission Power
0.002
Transmission Time
0.005
Routing Protocol
AODV
Number of sent messages
30
Extent of territory
1100m x 1100m
Traffic model
CBR(UDP)
Figure2: Simulation Environment
5. Results and Evaluation
We evaluate the effect of wormhole attack on different routing protocols on the basis of metrics like throughput, overhead, packet
delivery ratio, average energy consumption in WSN. The attacks effect the routing of the data from source to destination by
changing their path or say the routing table information of different protocols. The wormhole attacks works in different mode
namely in threshold. To analyze the performance of the routing protocols by varying the nodes, the metrics used to evaluate the
performance are given below.
1. Throughput
In our study we have calculate the throughput on the node around which tunnel is formed. During the normal communication the
throughput value was observed to be around 32 Kbps which drops to zero which signifies that tunnel has been made and the node
is not receiving any data. The increase in the throughput is after preventing the wormholes and making a new path to resume the
communication. From the figure of throughput it shows that throughput of AODV routing protocol is more as compared with
routing protocol DSDV
© Copyright reserved by IJETR
(Impact Factor: 0.997)
103
International Journal of Emerging Technology & Research
Volume 2, Issue 1, Jan - Feb, 2015
(www.ijetr.org) ISSN (E): 2347-5900
5900 ISSN (P): 2347-6079
2347
Figure3: AODV throughput
Figure4: DSDV throughput
2. Overhead
The above results show the comparison between AODV and DSDV for the wormhole attack on the basis of performance metrics.
As the results of
DSDV are based on the routing table and number of hop counts and in AODV routing protocol, routes are
established dynamically at intermediate node. The impact of the above mentioned results for AODV will check out Wormhole
attack when cluster head does not receive any data from the mobile nodes. The proposed AODV and base DSDV routing protocol
produce result for tracing and isolation of wormhole attack by calculating its throughput and overhead. From the figure of
overhead it shows that overhead of AODV is less as compared with DSDV i.e. overhead of 1.75 is observed which signifies the
amount of routing required to transmit the data in the network is 1.75 times the data packets in AODV.
© Copyright reserved by IJETR
(Impact Factor: 0.997)
104
International Journal of Emerging Technology & Research
Volume 2, Issue 1, Jan - Feb, 2015
(www.ijetr.org) ISSN (E): 2347-5900
5900 ISSN (P): 2347-6079
2347
Figure5: AODV overhead
Figure6: DSDV Overhead
3. Packet delivery ratio
PDR [8]] is the ratio of number of packets received at destination node to that of number of packets sent by source node. PDR
decreases drastically indicating the formation of tunnel and increase afterwards depicts formation of new path to resume the
communication as show in figure.
© Copyright reserved by IJETR
(Impact Factor: 0.997)
105
International Journal of Emerging Technology & Research
Volume 2, Issue 1, Jan - Feb, 2015
(www.ijetr.org) ISSN (E): 2347-5900
5900 ISSN (P): 2347-6079
2347
Figure7: AODV PDR
4. Average energy
Figure shows energy consumption. The metric is measured as the percent of energy consumed by a node with respect to its initial
energy The initial energy and the final energy left in the node, at the end of the simulation run are measured The percent energy
en
consumed by a node is calculated
ed as the energy consumed to the initial energy..
Figure8: AODV average energy
And finally the percent energy consumed by all the nodes in a scenario is calculated as the average of their individual energy
energ
consumption of the nodes
6. Conclusion
In this paper
aper we present different routing protocols in wireless sensor network and how the attack named wormhole attack can
affect the routing. The performance of different routing protocols can be evaluated on the basis of different parameters like
© Copyright reserved by IJETR
(Impact Factor: 0.997)
106
International Journal of Emerging Technology & Research
Volume 2, Issue 1, Jan - Feb, 2015
(www.ijetr.org) ISSN (E): 2347-5900 ISSN (P): 2347-6079
throughput, overhead, packet delivery ratio and average energy consumption. Wireless sensor networks have an additional
vulnerability because nodes are generally deployed in unprotected environment. The throughput of AODV routing protocol under
wormhole threshold mode is more than DSDV protocol as shown in figure. AODV over WSN is simulated with different
operation modes. The comparison of the WSN with and without malicious node by encapsulating the wormhole is done by
modified routing table
With the results of AWK programming and trace graph, we can conclude that in the case of simple AODV PDR decreases
drastically indicating the formation of tunnel and increase afterwards depicts formation of new path to resume the communication
and also increase in throughput by isolating the wormholes and decrease in the packet overhead.
References
[1]Varsha Sahni , “Result Analysis of AODV and DSR with Different Node Mobility Using Wormhole Attack in Wireless Sensor
Network”, International Journal of Computer Science and Technology Vol. 4, Issue 1, Jan - March 2013.
[2] Adnan Ahmed, “Performance Evaluation of Wireless Sensor Network in Presence of Grayhole Attack”, Quaid-E-Awam
University Research Journal Of Engineering, Science & Technology, Volume 13, No. 1, Jan-Jun. 2014.
[3]Nusrat Fatema, “Attacks and Counterattacks on Wireless Sensor Networks”, International Journal of Ad hoc, Sensor &
Ubiquitous Computing (IJASUC) Vol.4, No.6, December 2013.
[4] Virendra Pal Singh, Aishwarya S. Anand Ukey , Sweta Jain, “Signal Strength based Hello FloodAttack Detection and
Prevention in Wireless Sensor Networks” International Journal of ComputerApplications (0975 – 8887) Volume 62– No.15.
[5] Kashyap Patel, Mrs.T.Manoranjitham, 2013. “Detection of Wormhole Attack in Wireless Sensor Network” India International
Journal of Engineering Research & Technology (IJERT) Vol. 2 Issue 5, May – 2013.
[6] Lingxuan Hu and David Evans, 2004. “Using directional antennas to prevent Wormhole Attack”, In Proceedings of the
Network and Distributed System Security Symposium, pp. 131-141.
[7] Yih-Chun Hu, Adrian Perrig, David B. Johnson, 2003. “Packet Leashes: A defence against Wormhole Attacks in Wireless
Networks”. INFOCOM 2003. Twenty-Second Annual Joint conferences of the IEEE Computer and Communications. IEEE, pp.
267-279.
[8] Vandana C.P, A. Francis Saviour Devaraj, “Evaluation of impact of wormhole attack on AODV International Journal of
Advanced Networking and Applications, ISSN 0975-0290 Volume: 04 Issue: 04 pp. 1652-1656, 2013.
[9] Karlof, C., & Wagner,. D. (2003), “secure routing in wireless sensor networks: attacks and countermeasures. Ad Hoc
Networks Journal: Special Issue on Sensor Network Applications and Protocols”, Vol.1, (p293-315), Elsevier Publications.
© Copyright reserved by IJETR
(Impact Factor: 0.997)
107
International Journal of Emerging Technology & Research
Volume 2, Issue 1, Jan - Feb, 2015
(www.ijetr.org) ISSN (E): 2347-5900 ISSN (P): 2347-6079
[10] [24] Law, Y. W., & Havinga, P. (2005) How to secure a wireless sensor network. (P 89-95)
[11] K.Rashidha Begam, M.Savitha Devi2,
“Protected Data Transfer in Wireless Sensor Network Using Promiscuous Mode”, IJCSMC, Vol. 3, Issue. 11, November 2014,
pg.643 – 648
[12]Sweety Goyal, Harish Rohil, “Securing MANET against Wormhole Attack using Neighbor Node Analysis”, International
Journal of Computer Applications (0975 – 8887) Volume 81 – No 18, November 2013
© Copyright reserved by IJETR
(Impact Factor: 0.997)
108