DEFENDING WORMHOLE ATTACK IN WIRELESS AD
International Journal of Pure and Applied Mathematics
Volume 118 No. 18 2018, 235-243
ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version)
url: http://www.ijpam.eu
Special Issue
ijpam.eu
DEFENDING WORMHOLE ATTACK IN
WIRELESS AD-HOC NETWORK USING AD-HOC
ON DEMAND DISTANCE VECTOR
Dr.V.Khanaa, Raju M, Sangeetha N
Professor, BIST, Bharath Institute of Higher Education and Research.Bharath University
,drvkannan62@yahoo.com
P.G. Student, M.E CSE, RRASE College of Engg, Chennai, T.N, India.
Assistant Professor, Dept of CSE, RRASE College of Engg, Chennai, T.N, India.
Abstract – The ad-hoc networks are the momentarily
confirmed wireless networks it does not need stable
infrastructure it is also called as infrastructure less
network. Because of some flaws of ad-hoc network
equally mutual wireless middle and shortage of any
important coordination makes them more prone to
attacks in comparison with the wired network.
Among all the attacks wormhole onslaught is the
most highest harsh attack. So this onslaught an
attacker arrest the packets at one location in the
network and send it two another attacker at a distant
location through tunnels which is stable over
divergent ways like packet enclose, using great
power transmission or by using direct antennas. This
tunnel between two colluding attackers is virtual and
virtual is called stair a wormhole. The wormhole
onslaught is workable alike if the attacker has not
comprised any hosts, and all communication provides
authenticity and confidentiality. By using the various
approaches for discover the solution up wormhole
attack, the changing information of the packets could
still be modified. So in order to give more robust
protection in some special scenario like arena, which
needs highly secured clue, there is required of
establish some secured mechanism for wormhole
detection and prevention. Taking into consideration
this problem the proposed theory is developed. This
paper argue proposed works on wormhole attack
along with its available counter measures in ad-hoc
wireless network.
Keywords – Machine learning, Wireless, coding and
information
theory,
Markov
process,
Algorithm/protocol design and analysis
I.
INTRODUCTION
235
Ad-hoc wireless networks are an excellent choice for
emergency operations, short-live networks and
vehicular communication. The major security
challenges in the ad-hoc wireless networks are the
lack of a central control and the fact that each node
has to forward the packets of other nodes. In order to
avoid this, the ad-hoc network must deal with threats
from external agents and comprised internal nodes (A
node that perform internal attacks are comprised
node, it can act as an informer by deliberate
disclosure
of
confidential
information
to
unauthorized nodes.). The ad-hoc network has the
features of shared broadcast radio channel, insecure
operating environment, absence of infrastructure,
lack of central authority, lack of association, limited
resource availability dynamically changing network
topology, resource constrains and lack of clear line of
defiance, make them vulnerable to a wide range of
security attacks. There are two types of attacks
namely, passive and active attack. In passive attack
the adversary snoop the data exchanged in the
network without altering it whereas the active attack
tries to alter or destroy the data being exchanged in
the network[1-7]. These attacks could involve
eavesdropping, message tampering, or identity
spoofing. For an attacker to be able to launch
damaging data attacks, one option is to have a large
number of powerful adversary nodes distributed over
the network and possessing cryptographic keys. It is
possible for an attacker to achieve this attack by
targeting specific control traffic in the network. Some
examples of control traffic are topology discovery,
distributed location determination, routing and
monitoring liveness of a node. A particularly severe
control attack on the routing functionality of wireless
networks, called the wormhole attack , has been
International Journal of Pure and Applied Mathematics
introduced in the context of ad hoc networks. In
wormhole attack malicious node captures packets
from one location in the network, and “tunnels” them
to another malicious node at a far. The tunnel is
established through different ways like packet
encapsulation, using high power transmission or by
using direct antennas it makes the tunnelled packet
arrive either earlier or with number of hops lesser
compared to the packets transmitted over normal
multihop routes. This creates the illusion that these
two nodes provide the shortest path through them[811].
1.
Special Issue
connected through nodes (malicious) that appear to
be neighbors but are actually distant from one
another as shown in the figure1. Such wormhole
attack results in the false route. So the wormhole
attack is one of the most severe threats to ad-hoc
networks, as it can do harm to both sender and
receiver by performing packet dropping or alteration.
This paper is organized as follows. lists the wormhole
attack modes in , we discuss the solutions that have
been proposed in the literature as a countermeasure
for this attack[12-17]. Finally proposed approach for
mitigating wormhole and conclusion
II.
ALGORITHM
RELATED WORKS
It describes the Stream Control Transmission
Protocol (SCTP). SCTP is designed to transport
Public Switched Telephone Network (PSTN)
signaling messages over IP networks, but is capable
of broader applications. SCTP is a reliable transport
protocol operating on top of a connectionless packet
network such as IP. It offers the following services to
its users: acknowledged error-free non-duplicated
transfer of user data, data fragmentation to conform
to discovered path MTU size, sequenced delivery of
user messages within multiple streams, with an
option for order-of-arrival delivery of individual user
messages, optional bundling of multiple user
messages into a single SCTP packet, and networklevel fault tolerance through supporting of multihoming at either or both ends of an association[18].
The design of SCTP includes appropriate congestion
avoidance behavior and resistance to flooding and
masquerade attacks.
Investigates end-to-end Concurrent Multipath
Transfer (CMT) using SCTP multihoming for
increased application throughput and reliability.
CMT is the simultaneous transfer of new data from a
source host to a destination host via two or more endto-end paths. Simultaneous transfer of new data to
multiple destination addresses is a natural extension
to SCTP multihoming, but there are several design
considerations.
A wormhole tunnel can actually be useful if used for
forwarding all the packets, it puts the attacker in
powerful position compared to other nodes in the
network, which the attacker could use in a manner
that could compromise the security of the network. In
wormhole attack the two remote regions are directly
236
Receive Buffer (rbuf) Blocking in CMT basing on
SCTP with finite rbuf , and gives a new
retransmission algorithm with considering of both
delay and loss rate ,which selects the most effective
path to retransmite data chunks in order to reduce
rbuf blocking. A demonstrate using simulation is
provided showing that it can reduce rbuf blocking
effectively and improve the CMT’s overall
throughput.
International Journal of Pure and Applied Mathematics
Show that, provided packet headers can be used to
carry an amount of side-information that grows
arbitrarily large (but independently of payload size),
random linear network coding achieves packet-level
capacity for both single uncast and single multicast
connections and for both wire line and wireless
networks[19]. This result holds as long as packets
received on links arrive according to processes that
have average rates. Thus packet losses on links may
exhibit correlations in time or with losses on other
links. In the special case of Poisson traffic with i.i.d.
losses, we give error exponents that quantify the rate
of decay of the probability of error with coding delay.
Our analysis of random linear network coding shows
not only that it achieves packet-level capacity, but
also that the propagation of packets carrying
“innovative” information follows the propagation of
jobs through a queueing network, thus implying that
fluid flow models yield good approximations.
On Coding for Reliable Communication over Packet
Networks (Lun, Medard, and Effros, 2004), a
capacity-achieving coding scheme for unicast or
multicast over lossy wireline or wireless packet
networks is presented. We extend that paper’s results
in two ways: First, we extend the network model to
allow packets received on a link to arrive according
to any process with an average rate, as opposed to the
assumption of Poisson traffic with losses that was
previously made. Second, in the case of Poisson
traffic with losses, we derive error exponents that
quantify the rate at which the probability of error
decays with coding delay
.
III. DESIGN AND IMPLEMENTATION
In order to give more robust protection in some
special scenario like battlefields, where highly
secured information is required there is a need of
developing some secured mechanism for wormhole
detection and prevention[21-24]. So our aim is to
build a robust and secure mechanism for preventing
the devastating effects caused by the wormhole
attack.
System Model
As shown in the system model under consideration
consists of the following:
.Detection/removal of cooperative Black
hole attack in MANET.
Analysis of black hole and gray hole attack
on RPAODV in MANET.
237
Special Issue
Destination based group black hole attack
detection in MANET
The impact of packet drop attack and
solution on overall performance of AODV
in MANET
Dynamic trust based method to mitigate
black hole attack in MANET
Active detection routing and date routing
Wireless networks are merged, in order to obtain the
shortest path usually Distance Vector or Link state
routing protocols are used[20]. These protocols do
not per form well in ad-hoc wireless networks
because wireless ad-hoc networks have limited
bandwidth and there is no central control. Ad-hoc
wireless networks are differ rent from other networks
because of the characteristics like absence of
centralized control, each node has wireless interface,
nodes can move around freely which results in f
requent changes in network topology, nodes have
limited amount of resources and lack of symmetrical
links i.e. transmission does not usually perform
equally well in both directions. Therefore,
modifications to these routing protocols or totally
new routing protocols are required for the ad hoc
wireless domain. Presently, there are f our ad-hoc
routing protocols in demand for wireless ad-hoc
networks i.e. AODV , DSR , TORA and OLSR .
From the various ad-hoc routing protocols proposed,
the authors founded TORA, DSR and for ad-hoc ondemand distance vector (AODV) routing protocols
as most promising and compared them TORA is a
distributed routing protocol for ad-hoc networks,
Which uses a link reversal algorithm. TORA
performs the routing portion of the protocol but
depends for other functions on the internet MANET
encapsulation protocol (IMEP). DSR allows nodes to
find out a route over a network dynamically. The
AODV algorithm is a confluence of both DSR and
destination sequenced distance vector (DSDV)
protocols. It shares on-demand characteristics of
DSR, and adds the hop-by-hop routing, sequence
numbers and periodic beacons from DSDV.
Comparative performance analysis, each protocol for
ad-hoc networks was simulated for three different
scenarios with varying network sizes of 40, 80 and
100 nodes. In case of network of 40 nodes, TORA
shows good performance for the control
trafficreceived and sent, data traffic sent and for
successful transmission of packets. AODV shows
better performance for data traffic received,
throughput and channel utilization. DSR shows an
average level of performance in both power and
channel utilization over time.
International Journal of Pure and Applied Mathematics
Special Issue
However, when the network size was increased to 80
and 100 nodes, for DSR, the number of packets in
routing traffic received and sent, as well as the
number of packets in total traffic received and sent,
increase with increasing load[25-28]. However, for
route discovery time and the number of hops per
route, the performance depends primarily on the
algorithm rather than on the load. For TORA, the
number of packets in control traffic received and
sent, as well as in ULP traffic received and sent,
increases with the increment of loads. In the case of
AODV, varying the number of nodes has no effect on
the number of hops per route or route discovery time.
Therefore, it was concluded that for specific
differentials, TORA shows better performance over
the two on-demand protocols, that is DSR and
AODV.
IV. CONCLUSION & FUTURE WORK
System Initialization
In order to give more robust protection in some
special scenario like battlefields, where highly
secured information is required there is a need of
developing some secured mechanism for wormhole
detection and prevention[29-33]. So our aim is to
build a robust and secure mechanism for preventing
the devastating effects caused by the wormhole attack
We have mentioned the AODV protocol and Black
hole attack in MANET. We have proposed a feasible
solution for Black hole attack that can be
implemented on the AODV protocol. The proposed
method can be used to find the malicious node. Based
on the trust value of node we define which path is
most suitable for routing the packet and Untrusted
node can easily remove or ignored[34-36]. As future
work, we intend to develop simulation to analyze the
performance of proposed solution based on the
security parameters like packet overhead, memory
usage, and mobility.
V. REFERENCES
1. Hameed Hussain J., Anbazhgan G.,
Improve of the cop of vapour
compression refrigeration system by
238
International Journal of Pure and Applied Mathematics
2.
3.
4.
5.
6.
7.
using
thermoelectric
cooler,
International Journal of Pure and
Applied Mathematics, V-116, I-14
Special Issue, PP-585-589, 2017
Nakkeeran
S.,
Hussain
J.H.,
Innovative technique for running a
petrol engine with diesel as a fuel,
International Journal of Pure and
Applied Mathematics, V-116, I-18
Special Issue, PP-41-44, 2017
Naveenchandran P., Vijayaragavan
S.P., A sensor less control of SPM
using fuzzy and ANFIS technique,
International Journal of Pure and
Applied Mathematics, V-116, I-13
Special Issue, PP-43-50, 2017
Hameed Hussain J., Nakkeeran S.,
Design and development of pepper
plucking equipment, International
Journal of Pure and Applied
Mathematics, V-116, I-14 Special
Issue, PP-573-576, 2017
Naveenchandran P., Vijayaragavan
S.P., A high performance inverter
fed energy efficient cum compact
microcontroller
based
power
conditioned distributed photo voltaic
system, International Journal of Pure
and Applied Mathematics, V-116, I13 Special Issue, PP-165-169, 2017
Golden RenjithNimal R.J., Hussain
J.H., Stress analysis of gear tooth
using metal, International Journal of
Pure and Applied Mathematics, V116, I-17 Special Issue, PP-317-322,
2017
Hameed Hussain J., Hariharan R.,
Development of temperature-time
and pressure-time diagrams for
diffusion
bonding
ti-aa7075
dissimilar materials, International
Journal of Pure and Applied
239
Special Issue
Mathematics, V-116, I-14 Special
Issue, PP-493-499, 2017
8. Udayakumar R., Khanaa V.,
Saravanan T., Saritha G., Cross layer
optimization for wireless network
(WIMAX), Middle - East Journal of
Scientific Research, V-16, I-12, PP1786-1789, 2013
9. Khanaa V., Thooyamani K.P.,
Udayakumar R., Cognitive radio
based network for ISM band real
time embedded system, Middle East Journal of Scientific Research,
V-16, I-12, PP-1798-1800, 2013
10. Khanaa V., Mohanta K., Saravanan
T., Comparative study of uwb
communications over fiber using
direct and external modulations,
Indian Journal of Science and
Technology, V-6, I-SUPPL.6, PP4845-4847, 2013
11. Kumarave A., Udayakumar R., Web
portal visits patterns predicted by
intuitionistic fuzzy approach, Indian
Journal of Science and Technology,
V-6, I-SUPPL5, PP-4549-4553,
2013
12. Thooyamani K.P., Khanaa V.,
Udayakumar R., An integrated agent
system for e-mail coordination using
jade, Indian Journal of Science and
Technology, V-6, I-SUPPL.6, PP4758-4761, 2013
13. Sengottuvel P., Satishkumar S.,
Dinakaran D., Optimization of
multiple characteristics of EDM
parameters based on desirability
approach and fuzzy modeling,
Procedia Engineering, V-64, PP1069-1078, 2013
14. Udayakumar R., Khanaa V.,
Saravanan T., Synthesis and
structural characterization of thin
International Journal of Pure and Applied Mathematics
films of sno2 prepared by spray
pyrolysis technique, Indian Journal
of Science and Technology, V-6, ISUPPL.6, PP-4754-4757, 2013
15. Udayakumar R., Kumarave A.,
Rangarajan K., Introducing an
efficient programming paradigm for
object-oriented distributed systems,
Indian Journal of Science and
Technology, V-6, I-SUPPL5, PP4596-4603, 2013
16. KeranaHanirex D., Kaliyamurthie
K.P., Multi-classification approach
for detecting thyroid attacks,
International Journal of Pharma and
Bio Sciences, V-4, I-3, PP-B1246B1251, 2013
17. Udayakumar R., Khanaa V.,
Kaliyamurthie K.P., Performance
analysis of resilient ftth architecture
with protection mechanism, Indian
Journal of Science and Technology,
V-6, I-SUPPL.6, PP-4737-4741,
2013
18. Udayakumar R., Khanaa V.,
Kaliyamurthie K.P., Optical ring
architecture performance evaluation
using ordinary receiver, Indian
Journal of Science and Technology,
V-6, I-SUPPL.6, PP-4742-4747,
2013
19. Udayakumar R., Khanaa V.,
Saravanan T., Chromatic dispersion
compensation in optical fiber
communication system and its
simulation, Indian Journal of Science
and Technology, V-6, I-SUPPL.6,
PP-4762-4766, 2013
20. Sundarraj M., Study of compact
ventilator, Middle - East Journal of
Scientific Research, V-16, I-12, PP1741-1743, 2013
240
Special Issue
21. Udayakumar R., Khanaa V.,
Saravanan
T.,
Analysis
of
polarization mode dispersion in
fibers and its mitigation using an
optical compensation technique,
Indian Journal of Science and
Technology, V-6, I-SUPPL.6, PP4767-4771, 2013
22. Gopalakrishnan K., PremJeya Kumar
M., SundeepAanand J., Udayakumar
R., Thermal properties of doped
azopolyester and its application,
Indian Journal of Science and
Technology, V-6, I-SUPPL.6, PP4722-4725, 2013
23. Udayakumar R., Khanaa V.,
Kaliyamurthie K.P., High data rate
for
coherent
optical
wired
communication using DSP, Indian
Journal of Science and Technology,
V-6, I-SUPPL.6, PP-4772-4776,
2013
24. KeranaHanirex D., Kaliyamurthie
K.P., Kumaravel A., Analysis of
improved tdtr algorithm for mining
frequent itemsets using dengue virus
type 1 dataset: A combined
approach, International Journal of
Pharma and Bio Sciences, V-6, I-2,
PP-B288-B295, 2015
25. Thooyamani K.P., Khanaa V.,
Udayakumar R., Using integrated
circuits with low power multi bit
flip-flops in different approch,
Middle - East Journal of Scientific
Research, V-20, I-12, PP-2586-2593,
2014
26. Gopalakrishnan K., SundeepAanand
J., Udayakumar R., Electrical
properties of doped azopolyester,
Middle - East Journal of Scientific
Research, V-20, I-11, PP-1402-1412,
2014
International Journal of Pure and Applied Mathematics
27. Thooyamani K.P., Khanaa V.,
Udayakumar R., Partial encryption
and partial inference control based
disclosure in effective cost cloud,
Middle - East Journal of Scientific
Research, V-20, I-12, PP-2456-2459,
2014
28. Sundar Raj M., Saravanan T.,
Srinivasan V., Design of siliconcarbide based cascaded multilevel
inverter, Middle - East Journal of
Scientific Research, V-20, I-12, PP1785-1791, 2014
29. Thooyamani K.P., Khanaa V.,
Udayakumar R., Wide area wireless
networks-IETF, Middle - East
Journal of Scientific Research, V-20,
I-12, PP-2042-2046, 2014
30. Kanniga E., Srikanth S.M.K.,
Sundhararajan M., Optimization
solution of equal dimension boxes in
container loading problem using a
permutation block algorithm, Indian
Journal of Science and Technology,
V-7, PP-22-26, 2014
31. Arulselvi S., Sundararajan M., Smart
control system in traffic analysis
using
RTK-GPS
standards,
International Journal of Pure and
Applied Mathematics, V-116, I-15
Special Issue, PP-349-352, 2017
32. Arulselvi
S.,
Karthik
B.,
Sundararajan M., A frame work for
road network extraction from
remotely sensed high resolution
images, International Journal of Pure
and Applied Mathematics, V-116, I15 Special Issue, PP-355-360, 2017
33. Arulselvi
S.,
Karthik
B.,
Sundararajan M., Super resolution
method for Thumbnail Web image,
International Journal of Pure and
241
Special Issue
Applied Mathematics, V-116, I-15
Special Issue, PP-369-373, 2017
34. Arulselvi
S.,
Karthik
B.,
Sundararajan M., Linear framework
free rewriting systems, International
Journal of Pure and Applied
Mathematics, V-116, I-15 Special
Issue, PP-363-367, 2017
35. Kanniga E., Selvaramarathnam K.,
Sundararajan M., Kandigital bike
operating system, Middle - East
Journal of Scientific Research, V-20,
I-6, PP-685-688, 2014
36. Lakshmi C., Ponnavaikko M.,
Sundararajan M., Improved kernel
common vector method for face
recognition varying in background
conditions, Lecture Notes in
Computer
Science
(including
subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in
Bioinformatics), V-6026 LNCS, PP175-186, 2010
37. M. Rajesh, K.Sathesh Kumar,
K.Shankar,
M.
Ilayaraja.,
SENSITIVE DATA SECURITY IN
CLOUD COMPUTING AID OF
DIFFERENT
ENCRYPTION
TECHNIQUES,
Journal
of
Advanced Research in Dynamical
and Control Systems, Volume 18,
PP-2888-2899, 2017
38. M. Rajesh, A signature based
information security system for
vitality
proficient
information
accumulation in wireless sensor
systems, International Journal of
Pure and Applied Mathematics,
Volume 118, Issue 9, Pages 367-387
39. M. Rajesh, A Review on Excellence
Analysis of Relationship Spur
Advance in Wireless Ad Hoc
Networks, International Journal of
International Journal of Pure and Applied Mathematics
Pure and Applied Mathematics,
Volume 118, Issue 9, Pages 407-412
40. Rajesh, M., and J. M. Gnanasekar.
"Path Observation Based Physical
Routing Protocol for Wireless Ad
Hoc Networks." Wireless Personal
Communications 97.1 (2017): 12671289.
41. Rajesh, M., and J. M. Gnanasekar.
"Congestion Control Scheme for
Heterogeneous Wireless Ad Hoc
Networks Using Self-Adjust Hybrid
Model." International Journal of Pure
and Applied Mathematics 116
(2017): 537-547.
42. Rajesh, M., and J. M. Gnanasekar.
"Get-Up-And-Go Efficientmemetic
Algorithm Based Amalgam Routing
Protocol." International Journal of
Pure and Applied Mathematics 116
(2017): 537-547.
242
Special Issue
243
244
Volume 118 No. 18 2018, 235-243
ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version)
url: http://www.ijpam.eu
Special Issue
ijpam.eu
DEFENDING WORMHOLE ATTACK IN
WIRELESS AD-HOC NETWORK USING AD-HOC
ON DEMAND DISTANCE VECTOR
Dr.V.Khanaa, Raju M, Sangeetha N
Professor, BIST, Bharath Institute of Higher Education and Research.Bharath University
,drvkannan62@yahoo.com
P.G. Student, M.E CSE, RRASE College of Engg, Chennai, T.N, India.
Assistant Professor, Dept of CSE, RRASE College of Engg, Chennai, T.N, India.
Abstract – The ad-hoc networks are the momentarily
confirmed wireless networks it does not need stable
infrastructure it is also called as infrastructure less
network. Because of some flaws of ad-hoc network
equally mutual wireless middle and shortage of any
important coordination makes them more prone to
attacks in comparison with the wired network.
Among all the attacks wormhole onslaught is the
most highest harsh attack. So this onslaught an
attacker arrest the packets at one location in the
network and send it two another attacker at a distant
location through tunnels which is stable over
divergent ways like packet enclose, using great
power transmission or by using direct antennas. This
tunnel between two colluding attackers is virtual and
virtual is called stair a wormhole. The wormhole
onslaught is workable alike if the attacker has not
comprised any hosts, and all communication provides
authenticity and confidentiality. By using the various
approaches for discover the solution up wormhole
attack, the changing information of the packets could
still be modified. So in order to give more robust
protection in some special scenario like arena, which
needs highly secured clue, there is required of
establish some secured mechanism for wormhole
detection and prevention. Taking into consideration
this problem the proposed theory is developed. This
paper argue proposed works on wormhole attack
along with its available counter measures in ad-hoc
wireless network.
Keywords – Machine learning, Wireless, coding and
information
theory,
Markov
process,
Algorithm/protocol design and analysis
I.
INTRODUCTION
235
Ad-hoc wireless networks are an excellent choice for
emergency operations, short-live networks and
vehicular communication. The major security
challenges in the ad-hoc wireless networks are the
lack of a central control and the fact that each node
has to forward the packets of other nodes. In order to
avoid this, the ad-hoc network must deal with threats
from external agents and comprised internal nodes (A
node that perform internal attacks are comprised
node, it can act as an informer by deliberate
disclosure
of
confidential
information
to
unauthorized nodes.). The ad-hoc network has the
features of shared broadcast radio channel, insecure
operating environment, absence of infrastructure,
lack of central authority, lack of association, limited
resource availability dynamically changing network
topology, resource constrains and lack of clear line of
defiance, make them vulnerable to a wide range of
security attacks. There are two types of attacks
namely, passive and active attack. In passive attack
the adversary snoop the data exchanged in the
network without altering it whereas the active attack
tries to alter or destroy the data being exchanged in
the network[1-7]. These attacks could involve
eavesdropping, message tampering, or identity
spoofing. For an attacker to be able to launch
damaging data attacks, one option is to have a large
number of powerful adversary nodes distributed over
the network and possessing cryptographic keys. It is
possible for an attacker to achieve this attack by
targeting specific control traffic in the network. Some
examples of control traffic are topology discovery,
distributed location determination, routing and
monitoring liveness of a node. A particularly severe
control attack on the routing functionality of wireless
networks, called the wormhole attack , has been
International Journal of Pure and Applied Mathematics
introduced in the context of ad hoc networks. In
wormhole attack malicious node captures packets
from one location in the network, and “tunnels” them
to another malicious node at a far. The tunnel is
established through different ways like packet
encapsulation, using high power transmission or by
using direct antennas it makes the tunnelled packet
arrive either earlier or with number of hops lesser
compared to the packets transmitted over normal
multihop routes. This creates the illusion that these
two nodes provide the shortest path through them[811].
1.
Special Issue
connected through nodes (malicious) that appear to
be neighbors but are actually distant from one
another as shown in the figure1. Such wormhole
attack results in the false route. So the wormhole
attack is one of the most severe threats to ad-hoc
networks, as it can do harm to both sender and
receiver by performing packet dropping or alteration.
This paper is organized as follows. lists the wormhole
attack modes in , we discuss the solutions that have
been proposed in the literature as a countermeasure
for this attack[12-17]. Finally proposed approach for
mitigating wormhole and conclusion
II.
ALGORITHM
RELATED WORKS
It describes the Stream Control Transmission
Protocol (SCTP). SCTP is designed to transport
Public Switched Telephone Network (PSTN)
signaling messages over IP networks, but is capable
of broader applications. SCTP is a reliable transport
protocol operating on top of a connectionless packet
network such as IP. It offers the following services to
its users: acknowledged error-free non-duplicated
transfer of user data, data fragmentation to conform
to discovered path MTU size, sequenced delivery of
user messages within multiple streams, with an
option for order-of-arrival delivery of individual user
messages, optional bundling of multiple user
messages into a single SCTP packet, and networklevel fault tolerance through supporting of multihoming at either or both ends of an association[18].
The design of SCTP includes appropriate congestion
avoidance behavior and resistance to flooding and
masquerade attacks.
Investigates end-to-end Concurrent Multipath
Transfer (CMT) using SCTP multihoming for
increased application throughput and reliability.
CMT is the simultaneous transfer of new data from a
source host to a destination host via two or more endto-end paths. Simultaneous transfer of new data to
multiple destination addresses is a natural extension
to SCTP multihoming, but there are several design
considerations.
A wormhole tunnel can actually be useful if used for
forwarding all the packets, it puts the attacker in
powerful position compared to other nodes in the
network, which the attacker could use in a manner
that could compromise the security of the network. In
wormhole attack the two remote regions are directly
236
Receive Buffer (rbuf) Blocking in CMT basing on
SCTP with finite rbuf , and gives a new
retransmission algorithm with considering of both
delay and loss rate ,which selects the most effective
path to retransmite data chunks in order to reduce
rbuf blocking. A demonstrate using simulation is
provided showing that it can reduce rbuf blocking
effectively and improve the CMT’s overall
throughput.
International Journal of Pure and Applied Mathematics
Show that, provided packet headers can be used to
carry an amount of side-information that grows
arbitrarily large (but independently of payload size),
random linear network coding achieves packet-level
capacity for both single uncast and single multicast
connections and for both wire line and wireless
networks[19]. This result holds as long as packets
received on links arrive according to processes that
have average rates. Thus packet losses on links may
exhibit correlations in time or with losses on other
links. In the special case of Poisson traffic with i.i.d.
losses, we give error exponents that quantify the rate
of decay of the probability of error with coding delay.
Our analysis of random linear network coding shows
not only that it achieves packet-level capacity, but
also that the propagation of packets carrying
“innovative” information follows the propagation of
jobs through a queueing network, thus implying that
fluid flow models yield good approximations.
On Coding for Reliable Communication over Packet
Networks (Lun, Medard, and Effros, 2004), a
capacity-achieving coding scheme for unicast or
multicast over lossy wireline or wireless packet
networks is presented. We extend that paper’s results
in two ways: First, we extend the network model to
allow packets received on a link to arrive according
to any process with an average rate, as opposed to the
assumption of Poisson traffic with losses that was
previously made. Second, in the case of Poisson
traffic with losses, we derive error exponents that
quantify the rate at which the probability of error
decays with coding delay
.
III. DESIGN AND IMPLEMENTATION
In order to give more robust protection in some
special scenario like battlefields, where highly
secured information is required there is a need of
developing some secured mechanism for wormhole
detection and prevention[21-24]. So our aim is to
build a robust and secure mechanism for preventing
the devastating effects caused by the wormhole
attack.
System Model
As shown in the system model under consideration
consists of the following:
.Detection/removal of cooperative Black
hole attack in MANET.
Analysis of black hole and gray hole attack
on RPAODV in MANET.
237
Special Issue
Destination based group black hole attack
detection in MANET
The impact of packet drop attack and
solution on overall performance of AODV
in MANET
Dynamic trust based method to mitigate
black hole attack in MANET
Active detection routing and date routing
Wireless networks are merged, in order to obtain the
shortest path usually Distance Vector or Link state
routing protocols are used[20]. These protocols do
not per form well in ad-hoc wireless networks
because wireless ad-hoc networks have limited
bandwidth and there is no central control. Ad-hoc
wireless networks are differ rent from other networks
because of the characteristics like absence of
centralized control, each node has wireless interface,
nodes can move around freely which results in f
requent changes in network topology, nodes have
limited amount of resources and lack of symmetrical
links i.e. transmission does not usually perform
equally well in both directions. Therefore,
modifications to these routing protocols or totally
new routing protocols are required for the ad hoc
wireless domain. Presently, there are f our ad-hoc
routing protocols in demand for wireless ad-hoc
networks i.e. AODV , DSR , TORA and OLSR .
From the various ad-hoc routing protocols proposed,
the authors founded TORA, DSR and for ad-hoc ondemand distance vector (AODV) routing protocols
as most promising and compared them TORA is a
distributed routing protocol for ad-hoc networks,
Which uses a link reversal algorithm. TORA
performs the routing portion of the protocol but
depends for other functions on the internet MANET
encapsulation protocol (IMEP). DSR allows nodes to
find out a route over a network dynamically. The
AODV algorithm is a confluence of both DSR and
destination sequenced distance vector (DSDV)
protocols. It shares on-demand characteristics of
DSR, and adds the hop-by-hop routing, sequence
numbers and periodic beacons from DSDV.
Comparative performance analysis, each protocol for
ad-hoc networks was simulated for three different
scenarios with varying network sizes of 40, 80 and
100 nodes. In case of network of 40 nodes, TORA
shows good performance for the control
trafficreceived and sent, data traffic sent and for
successful transmission of packets. AODV shows
better performance for data traffic received,
throughput and channel utilization. DSR shows an
average level of performance in both power and
channel utilization over time.
International Journal of Pure and Applied Mathematics
Special Issue
However, when the network size was increased to 80
and 100 nodes, for DSR, the number of packets in
routing traffic received and sent, as well as the
number of packets in total traffic received and sent,
increase with increasing load[25-28]. However, for
route discovery time and the number of hops per
route, the performance depends primarily on the
algorithm rather than on the load. For TORA, the
number of packets in control traffic received and
sent, as well as in ULP traffic received and sent,
increases with the increment of loads. In the case of
AODV, varying the number of nodes has no effect on
the number of hops per route or route discovery time.
Therefore, it was concluded that for specific
differentials, TORA shows better performance over
the two on-demand protocols, that is DSR and
AODV.
IV. CONCLUSION & FUTURE WORK
System Initialization
In order to give more robust protection in some
special scenario like battlefields, where highly
secured information is required there is a need of
developing some secured mechanism for wormhole
detection and prevention[29-33]. So our aim is to
build a robust and secure mechanism for preventing
the devastating effects caused by the wormhole attack
We have mentioned the AODV protocol and Black
hole attack in MANET. We have proposed a feasible
solution for Black hole attack that can be
implemented on the AODV protocol. The proposed
method can be used to find the malicious node. Based
on the trust value of node we define which path is
most suitable for routing the packet and Untrusted
node can easily remove or ignored[34-36]. As future
work, we intend to develop simulation to analyze the
performance of proposed solution based on the
security parameters like packet overhead, memory
usage, and mobility.
V. REFERENCES
1. Hameed Hussain J., Anbazhgan G.,
Improve of the cop of vapour
compression refrigeration system by
238
International Journal of Pure and Applied Mathematics
2.
3.
4.
5.
6.
7.
using
thermoelectric
cooler,
International Journal of Pure and
Applied Mathematics, V-116, I-14
Special Issue, PP-585-589, 2017
Nakkeeran
S.,
Hussain
J.H.,
Innovative technique for running a
petrol engine with diesel as a fuel,
International Journal of Pure and
Applied Mathematics, V-116, I-18
Special Issue, PP-41-44, 2017
Naveenchandran P., Vijayaragavan
S.P., A sensor less control of SPM
using fuzzy and ANFIS technique,
International Journal of Pure and
Applied Mathematics, V-116, I-13
Special Issue, PP-43-50, 2017
Hameed Hussain J., Nakkeeran S.,
Design and development of pepper
plucking equipment, International
Journal of Pure and Applied
Mathematics, V-116, I-14 Special
Issue, PP-573-576, 2017
Naveenchandran P., Vijayaragavan
S.P., A high performance inverter
fed energy efficient cum compact
microcontroller
based
power
conditioned distributed photo voltaic
system, International Journal of Pure
and Applied Mathematics, V-116, I13 Special Issue, PP-165-169, 2017
Golden RenjithNimal R.J., Hussain
J.H., Stress analysis of gear tooth
using metal, International Journal of
Pure and Applied Mathematics, V116, I-17 Special Issue, PP-317-322,
2017
Hameed Hussain J., Hariharan R.,
Development of temperature-time
and pressure-time diagrams for
diffusion
bonding
ti-aa7075
dissimilar materials, International
Journal of Pure and Applied
239
Special Issue
Mathematics, V-116, I-14 Special
Issue, PP-493-499, 2017
8. Udayakumar R., Khanaa V.,
Saravanan T., Saritha G., Cross layer
optimization for wireless network
(WIMAX), Middle - East Journal of
Scientific Research, V-16, I-12, PP1786-1789, 2013
9. Khanaa V., Thooyamani K.P.,
Udayakumar R., Cognitive radio
based network for ISM band real
time embedded system, Middle East Journal of Scientific Research,
V-16, I-12, PP-1798-1800, 2013
10. Khanaa V., Mohanta K., Saravanan
T., Comparative study of uwb
communications over fiber using
direct and external modulations,
Indian Journal of Science and
Technology, V-6, I-SUPPL.6, PP4845-4847, 2013
11. Kumarave A., Udayakumar R., Web
portal visits patterns predicted by
intuitionistic fuzzy approach, Indian
Journal of Science and Technology,
V-6, I-SUPPL5, PP-4549-4553,
2013
12. Thooyamani K.P., Khanaa V.,
Udayakumar R., An integrated agent
system for e-mail coordination using
jade, Indian Journal of Science and
Technology, V-6, I-SUPPL.6, PP4758-4761, 2013
13. Sengottuvel P., Satishkumar S.,
Dinakaran D., Optimization of
multiple characteristics of EDM
parameters based on desirability
approach and fuzzy modeling,
Procedia Engineering, V-64, PP1069-1078, 2013
14. Udayakumar R., Khanaa V.,
Saravanan T., Synthesis and
structural characterization of thin
International Journal of Pure and Applied Mathematics
films of sno2 prepared by spray
pyrolysis technique, Indian Journal
of Science and Technology, V-6, ISUPPL.6, PP-4754-4757, 2013
15. Udayakumar R., Kumarave A.,
Rangarajan K., Introducing an
efficient programming paradigm for
object-oriented distributed systems,
Indian Journal of Science and
Technology, V-6, I-SUPPL5, PP4596-4603, 2013
16. KeranaHanirex D., Kaliyamurthie
K.P., Multi-classification approach
for detecting thyroid attacks,
International Journal of Pharma and
Bio Sciences, V-4, I-3, PP-B1246B1251, 2013
17. Udayakumar R., Khanaa V.,
Kaliyamurthie K.P., Performance
analysis of resilient ftth architecture
with protection mechanism, Indian
Journal of Science and Technology,
V-6, I-SUPPL.6, PP-4737-4741,
2013
18. Udayakumar R., Khanaa V.,
Kaliyamurthie K.P., Optical ring
architecture performance evaluation
using ordinary receiver, Indian
Journal of Science and Technology,
V-6, I-SUPPL.6, PP-4742-4747,
2013
19. Udayakumar R., Khanaa V.,
Saravanan T., Chromatic dispersion
compensation in optical fiber
communication system and its
simulation, Indian Journal of Science
and Technology, V-6, I-SUPPL.6,
PP-4762-4766, 2013
20. Sundarraj M., Study of compact
ventilator, Middle - East Journal of
Scientific Research, V-16, I-12, PP1741-1743, 2013
240
Special Issue
21. Udayakumar R., Khanaa V.,
Saravanan
T.,
Analysis
of
polarization mode dispersion in
fibers and its mitigation using an
optical compensation technique,
Indian Journal of Science and
Technology, V-6, I-SUPPL.6, PP4767-4771, 2013
22. Gopalakrishnan K., PremJeya Kumar
M., SundeepAanand J., Udayakumar
R., Thermal properties of doped
azopolyester and its application,
Indian Journal of Science and
Technology, V-6, I-SUPPL.6, PP4722-4725, 2013
23. Udayakumar R., Khanaa V.,
Kaliyamurthie K.P., High data rate
for
coherent
optical
wired
communication using DSP, Indian
Journal of Science and Technology,
V-6, I-SUPPL.6, PP-4772-4776,
2013
24. KeranaHanirex D., Kaliyamurthie
K.P., Kumaravel A., Analysis of
improved tdtr algorithm for mining
frequent itemsets using dengue virus
type 1 dataset: A combined
approach, International Journal of
Pharma and Bio Sciences, V-6, I-2,
PP-B288-B295, 2015
25. Thooyamani K.P., Khanaa V.,
Udayakumar R., Using integrated
circuits with low power multi bit
flip-flops in different approch,
Middle - East Journal of Scientific
Research, V-20, I-12, PP-2586-2593,
2014
26. Gopalakrishnan K., SundeepAanand
J., Udayakumar R., Electrical
properties of doped azopolyester,
Middle - East Journal of Scientific
Research, V-20, I-11, PP-1402-1412,
2014
International Journal of Pure and Applied Mathematics
27. Thooyamani K.P., Khanaa V.,
Udayakumar R., Partial encryption
and partial inference control based
disclosure in effective cost cloud,
Middle - East Journal of Scientific
Research, V-20, I-12, PP-2456-2459,
2014
28. Sundar Raj M., Saravanan T.,
Srinivasan V., Design of siliconcarbide based cascaded multilevel
inverter, Middle - East Journal of
Scientific Research, V-20, I-12, PP1785-1791, 2014
29. Thooyamani K.P., Khanaa V.,
Udayakumar R., Wide area wireless
networks-IETF, Middle - East
Journal of Scientific Research, V-20,
I-12, PP-2042-2046, 2014
30. Kanniga E., Srikanth S.M.K.,
Sundhararajan M., Optimization
solution of equal dimension boxes in
container loading problem using a
permutation block algorithm, Indian
Journal of Science and Technology,
V-7, PP-22-26, 2014
31. Arulselvi S., Sundararajan M., Smart
control system in traffic analysis
using
RTK-GPS
standards,
International Journal of Pure and
Applied Mathematics, V-116, I-15
Special Issue, PP-349-352, 2017
32. Arulselvi
S.,
Karthik
B.,
Sundararajan M., A frame work for
road network extraction from
remotely sensed high resolution
images, International Journal of Pure
and Applied Mathematics, V-116, I15 Special Issue, PP-355-360, 2017
33. Arulselvi
S.,
Karthik
B.,
Sundararajan M., Super resolution
method for Thumbnail Web image,
International Journal of Pure and
241
Special Issue
Applied Mathematics, V-116, I-15
Special Issue, PP-369-373, 2017
34. Arulselvi
S.,
Karthik
B.,
Sundararajan M., Linear framework
free rewriting systems, International
Journal of Pure and Applied
Mathematics, V-116, I-15 Special
Issue, PP-363-367, 2017
35. Kanniga E., Selvaramarathnam K.,
Sundararajan M., Kandigital bike
operating system, Middle - East
Journal of Scientific Research, V-20,
I-6, PP-685-688, 2014
36. Lakshmi C., Ponnavaikko M.,
Sundararajan M., Improved kernel
common vector method for face
recognition varying in background
conditions, Lecture Notes in
Computer
Science
(including
subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in
Bioinformatics), V-6026 LNCS, PP175-186, 2010
37. M. Rajesh, K.Sathesh Kumar,
K.Shankar,
M.
Ilayaraja.,
SENSITIVE DATA SECURITY IN
CLOUD COMPUTING AID OF
DIFFERENT
ENCRYPTION
TECHNIQUES,
Journal
of
Advanced Research in Dynamical
and Control Systems, Volume 18,
PP-2888-2899, 2017
38. M. Rajesh, A signature based
information security system for
vitality
proficient
information
accumulation in wireless sensor
systems, International Journal of
Pure and Applied Mathematics,
Volume 118, Issue 9, Pages 367-387
39. M. Rajesh, A Review on Excellence
Analysis of Relationship Spur
Advance in Wireless Ad Hoc
Networks, International Journal of
International Journal of Pure and Applied Mathematics
Pure and Applied Mathematics,
Volume 118, Issue 9, Pages 407-412
40. Rajesh, M., and J. M. Gnanasekar.
"Path Observation Based Physical
Routing Protocol for Wireless Ad
Hoc Networks." Wireless Personal
Communications 97.1 (2017): 12671289.
41. Rajesh, M., and J. M. Gnanasekar.
"Congestion Control Scheme for
Heterogeneous Wireless Ad Hoc
Networks Using Self-Adjust Hybrid
Model." International Journal of Pure
and Applied Mathematics 116
(2017): 537-547.
42. Rajesh, M., and J. M. Gnanasekar.
"Get-Up-And-Go Efficientmemetic
Algorithm Based Amalgam Routing
Protocol." International Journal of
Pure and Applied Mathematics 116
(2017): 537-547.
242
Special Issue
243
244