Internati
o
nal
Journal of Ele
c
trical
and Computer
Engineering
(IJE
CE)
V
o
l.
5, N
o
. 5
,
O
c
tob
e
r
201
5, p
p
. 1
111
~111
8
I
S
SN
: 208
8-8
7
0
8
1
111
Jo
urn
a
l
h
o
me
pa
ge
: h
ttp
://iaesjo
u
r
na
l.com/
o
n
lin
e/ind
e
x.ph
p
/
IJECE
Desi
gning an Ad
versarial
Model
Against Reactive and Proactive
Routing Protocols in MANETS
: A Comparative Performance
Study
A
.
Peda
Go
pi
*
,
E
.
Suresh B
a
bu*
,
C.
N
aga Ra
j
u
**
,
S.
A
s
ho
k Kuma
r*
* Department of
Computer Scien
ce
a
nd
Engineering, K
L Univ
ersity
, Ind
i
a
** Departmen
t
o
f
Computer Science
and
Engi
neering, Yogi Vemana
Uni
v
e
r
sity
, Indi
a
Article Info
A
B
STRAC
T
Article histo
r
y:
Received Apr 2, 2015
Rev
i
sed
Jun
15,
201
5
Accepted
Jun 29, 2015
Mobile ad-ho
c
n
e
tworks are se
lf
-organiz
ed infr
a
s
tructure
less ne
tworks that
consists of mobile nodes, which
are ca
pab
l
e of
maintaining
and
forming the
network b
y
th
e
m
s
e
lves
. Recen
t
l
y
, res
e
a
r
chers
a
r
e des
i
gned s
e
v
e
ral rout
ing
protocols on
th
ese networks.
However,
th
ese routing pro
t
ocols are more
vulnerab
l
e
to
a
tta
cks from
the
intrud
ers, whi
c
h c
a
n
easil
y
paral
y
z
e
the
operation of the network due to
its i
nherited ch
aracteristics of MANETS.
One s
u
ch t
y
pe
of atta
ck is
worm
hole atta
ck.
Becaus
e
of its
s
e
verit
y
,
the
worm
hole atta
c
k
has
attra
c
ted
a great de
al
of atten
tion in
the res
e
arch
com
m
unit
y
.
Thi
s
paper
com
p
are
s
reac
tiv
e and
pr
oactive rou
ting
protocols in
advers
ari
a
l envi
ronm
ent. S
p
ecif
i
ca
ll
y, worm
hole att
ack is
appli
e
d to thes
e
routing protocols to evaluate its
performance through
simulation.
Com
p
rehens
ivel
y the res
u
l
t
s
s
h
ows
the com
p
arativ
e perform
ance of thes
e
protocols
against wormhole attack is ha
rd
to
de
te
ct
and
eas
y to
im
plem
ent.
Keyword:
M
ANET
S
R
out
i
n
g pr
ot
oc
ol
s
Wo
rm
hole
Copyright ©
201
5 Institut
e
o
f
Ad
vanced
Engin
eer
ing and S
c
i
e
nce.
All rights re
se
rve
d
.
Co
rresp
ond
i
ng
Autho
r
:
C. Nag
a
Raj
u
Depa
rt
em
ent
of C
o
m
put
er
sci
e
nce a
n
d
E
ngi
neeri
n
g
,
Yogi Vemana U
n
iversity
,
Em
a
il: cn
rcse@yaho
o
.co
m
S. Ash
o
k
Kum
a
r
Depa
rt
em
ent
of C
o
m
put
er
sci
e
nce a
n
d
E
ngi
neeri
n
g
,
K L Un
iv
ersity
Em
ail: gopiare
p
alli2@gm
a
il.com
1.
INTRODUCTION
From
t
h
e l
a
st
few
deca
des,
t
h
ere
has
be
en d
r
ast
i
c
de
vel
o
pm
ent
and de
pl
oy
m
e
nt of
wi
rel
e
s
s
technology. T
h
is technologies
is already wit
n
esse
d w
ith the revo
lu
tion
a
ry co
m
p
u
tin
g
d
e
v
i
ces su
ch
as
PDAs,
sm
art phones
,
palm
tops and
note
b
ooks etc.
, whic
h creat
e
s
interaction a
m
ong each ot
her. This ha
bit
a
t has
creat
ed a
ne
w
para
di
gm
wi
t
h
ext
e
nsi
v
e a
ppl
i
cat
i
ons i
n
u
b
i
qui
t
o
us c
o
m
p
u
t
i
ng.
O
n
e s
u
ch
t
y
pe o
f
pa
ra
di
gm
i
s
m
obi
l
e
ad-h
oc
net
w
o
r
k
.
Pa
rt
i
c
ul
arl
y
, m
obi
l
e
ad
h
o
c
net
w
or
ks
ha
ve em
erge
d i
n
m
a
ny
fo
rm
s wher
e f
i
xed
in
frastru
ct
u
r
e i
s
no
t av
ailab
l
e or exp
e
n
s
i
v
e
to
d
e
p
l
o
y
th
e
ex
istin
g infrast
ru
ct
u
r
e. Moreov
er, m
o
b
ile ad-ho
c
net
w
or
ks a
r
e s
e
l
f-o
r
g
ani
z
e
d
i
n
f
r
ast
r
uct
u
re l
e
ss net
w
or
ks t
h
at
co
nsi
s
t
s
o
f
m
obi
l
e
no
des
,
whi
c
h are ca
p
a
bl
e o
f
m
a
i
n
t
a
i
n
i
ng
a
n
d fo
rm
i
ng
t
h
e net
w
or
k by
t
h
e
m
sel
v
es.
The unique fea
t
ures of these netw
o
r
ks e
n
abl
e
s several
ap
pl
i
cat
i
ons suc
h
as
go
ver
n
m
e
nt
, m
i
li
t
a
ry
and
heal
t
h
ser
v
i
ces
et
c., H
o
we
ver
,
t
h
e M
A
N
ET [
1
]
appl
i
cat
i
o
ns
pose a
ne
w r
o
ut
i
ng a
n
d sec
u
r
i
t
y
chal
l
e
nges
due t
o
t
h
e o
p
en
nat
u
r
e
of t
h
e net
w
o
r
ks
. I
n
deed
, t
h
e no
des i
n
M
ANE
T [
2
]
m
o
ve ar
bi
t
r
ari
l
y
whi
c
h m
a
y
experi
e
n
c
e
rapi
d an
d u
n
p
r
e
di
ct
abl
e
cha
n
ges i
n
t
h
e
net
w
or
k t
o
pol
ogy
.
Furt
her
,
est
a
bl
i
s
hi
n
g
t
h
e
ro
ut
i
ng i
n
suc
h
net
w
o
r
k i
s
one
of t
h
e c
h
allenge iss
u
e. Re
cently, resea
r
c
h
ers
are
de
si
gn
ed
se
veral
r
out
i
ng p
r
ot
ocol
s s
u
ch
as AO
D
V
,
DSR
,
DS
DV
, OL
SR
. H
o
we
ve
r, t
h
e
s
e ro
ut
i
n
g
pr
ot
ocol
s a
r
e m
o
re vul
nera
bl
e t
o
at
t
acks fr
om
the i
n
t
r
u
d
ers
,
whi
c
h
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
SN
:
2
088
-87
08
I
J
ECE Vo
l. 5
,
N
o
. 5
,
O
c
tob
e
r
20
15
:
111
1–
1
118
1
112
can easily pa
ralyze the
operation
of t
h
e n
e
twork du
e to
its inh
e
rited c
h
aracteri
s
tics of MANET
S
.
Fu
rt
h
e
rm
o
r
e, th
e secu
rity in
t
h
ese
n
e
two
r
k
s
is m
o
re ch
allen
g
i
n
g
wh
en
it’s co
m
e
s to
th
e wo
rm
h
o
l
e in
tru
s
ion.
Thi
s
w
o
rm
hol
e i
n
t
r
usi
on i
s
one
of t
h
e sev
e
re at
t
ack t
h
at
i
s
hard t
o
de
t
ect
and de
fen
d
d
u
e t
o
i
t
s
speci
al
p
r
op
erties [3
],
th
at can
i
n
tercep
t th
e
pac
k
et
s an
d q
u
i
c
kl
y
g
u
i
d
e t
h
e Pac
k
e
t
s t
o
an
ot
he
r
n
ode
wi
t
h
t
h
e
h
e
l
p
o
f
tu
nn
el as show
n
i
n
f
i
gur
e-1. Man
y
pr
opo
sals [
4
] of
th
is k
i
nd
of
attack
ar
e alr
e
ad
y
p
r
op
o
s
ed
.
Pr
ev
iou
s
ly,
exi
s
t
i
ng
wo
r
k
i
s
m
a
i
n
l
y
focused o
n
i
n
di
vi
d
u
al
ro
ut
i
n
g p
r
ot
oc
ol
s I
n
t
h
i
s
pape
r we c
o
m
p
ared t
w
o re
act
i
v
e
(A
OD
V,
DSR
)
and t
w
o p
r
oact
i
v
e (
D
SD
V, OL
SR
) r
o
ut
i
ng
pr
ot
oc
ol
s [5]
i
n
adve
rsari
a
l
en
vi
ro
nm
ent
.
Specifically, worm
hole attack is app
lied
to
th
ese
rou
ting
pro
t
o
c
o
l
s to ev
alu
a
te th
e
p
e
rform
a
n
ce th
rou
gh
sim
u
l
a
t
i
on. T
h
e rest
of
t
h
i
s
pa
per
i
s
or
gani
ze
d as
f
o
l
l
o
ws.
I
n
sect
i
o
n
2,
de
scri
bes
va
ri
o
u
s
exi
s
t
i
n
g m
echani
s
m
s
of
w
o
rm
hol
e det
ect
i
o
n
i
n
v
a
ri
o
u
s ro
ut
i
n
g
p
r
ot
ocol
s
.
Se
ct
i
on 3 we di
s
c
uss
t
h
e A
O
D
V
, DSR
,
DS
D
V
a
n
d
OLSR
r
out
i
n
g
prot
ocol
i
n
d
e
t
a
i
l
.
Sect
i
on 4 pr
o
v
i
d
es t
h
e
sim
u
l
a
t
i
on envi
r
onm
ent
and
resul
t
s
. Fi
nal
l
y
we
concl
ude
i
n
se
ct
i
on 5.
2.
RELATED WORK
The pa
rt
i
c
ul
ars
of v
a
ri
o
u
s e
x
i
s
t
i
ng w
o
rm
hol
e det
ect
i
on m
e
chani
s
m
s
on d
i
ffere
nt
r
out
i
n
g p
r
ot
oco
l
s
are as
follows:
S. Gupta [6] et
al
proposed
a Worm
hole Attack Detection
Prot
ocol
u
s
i
n
g
H
o
un
d p
acket
cal
l
e
d
WHOP
for d
e
t
ectin
g
co
llid
ing
attack
s witho
u
t
using
an
y
ex
cep
tion
a
l h
a
rdware
o
r
watch
i
ng
syste
m
s. In
th
i
s
m
e
thod a
f
ter
path disc
ove
ry
ope
ration
initiator
node
uses
a hound m
e
ss
age
pa
cket
to s
pot worm
hole
attacks
whi
c
h rec
k
oni
ngs
h
op
va
ri
an
ce bet
w
ee
n t
h
e
nei
g
hb
o
r
s o
f
t
h
e o
n
e
ho
p
di
s
t
ance n
ode
s i
n
t
h
e pat
h
. A
f
t
e
r t
h
e
pr
ocess t
h
e t
a
rget
n
ode
det
ect
s t
h
e worm
hol
e based
on t
h
e h
o
p
,
di
ffe
r
e
nce bet
w
ee
n
nei
g
hb
o
r
s of
no
des
exceeds the
ac
ceptance
level.
Um
esh Kum
a
r chaurasia [7]
et al proposes
MAODV,
a c
o
ncept t
o
detect
worm
hole attacks in t
h
e
net
w
or
k
by
col
l
ect
i
ng b
o
t
h
n
u
m
ber of h
o
p
s a
nd
del
a
y
pe
r h
op i
n
f
o
rm
at
i
o
n
fo
r di
ffe
rent
r
out
es
fr
om
i
n
i
t
i
a
t
o
r
to
targ
et, wh
ich
offers a
wide-ran
g
i
n
g
so
l
u
tio
n
for bo
th
d
i
v
e
rsities o
f
worm
h
o
l
e attack
s.
Ho
wev
e
r, u
n
d
e
r
genuine situation,
the delay
for eac
h
packet
is sim
i
lar along each
hop
in t
h
e pat
h
a
nd it
shoul
d
be e
x
ce
ssive
fo
r t
h
ose
no
d
e
s are i
n
vol
ve
d i
n
t
h
e c
o
l
l
u
di
n
g
at
t
ack b
e
cause t
h
e
r
e ca
n be m
a
ny
n
ode
s bet
w
een
t
h
em
ot
he
rwi
s
e ca
n
be c
o
n
n
ect
e
d
t
h
r
o
ug
h a
l
o
ng
l
i
nk
(
w
i
r
ed
o
r
wi
rel
e
ss)
.
Hu
[
8
]
et
al
p
r
op
ose
d
a
pac
k
e
t
l
eashes m
e
t
hod
t
o
d
e
fend
ag
ain
s
t co
llud
i
ng
attack
s. Th
e
main
co
n
c
ep
t
of t
h
i
s
m
e
t
hod
i
s
t
o
bou
n
d
t
h
e
m
a
xim
u
m
t
o
l
e
rabl
e com
m
u
n
i
cat
i
on
di
st
an
ce. Tw
o t
y
pes of l
eashe
s dat
a
were
use
d
Ge
o
g
ra
ph
i
cal
rest
rai
n
t
a
nd t
e
m
poral
re
st
rai
n
t
.
B
o
t
h
G
e
og
ra
phi
cal
an
d t
e
m
poral
l
eash m
e
t
hods
re
qui
re
authe
n
tication
of receive
d packets
.
For
Geographical leashes, eac
h
node m
u
st ha
ve its exact l
o
cation
inform
ation and requires
a loosely
cloc
k ha
rm
onization. For
tem
poral
le
ashes, each node
requires
a
precise
cl
ock
sy
nc
hr
on
i
zat
i
on a
n
d
re
q
u
i
r
es a
r
o
ug
hl
y
l
o
cat
i
o
n
i
n
fo
r
m
at
i
on.
Zu
bai
r
Ahm
e
d Kha
n
[9]
et
al
pr
op
oses t
h
e use
of t
h
e
m
odi
fi
ed r
out
i
ng i
n
f
o
rm
at
i
on t
a
bl
e
fo
r
recogn
itio
n
of th
e
m
i
stru
stful lin
k
s
, au
t
h
orizatio
n
of co
llud
i
ng
no
des ex
i
s
ten
ce, at th
e en
d
seg
r
eg
ating
the
dy
ed
-i
n-t
h
e-
w
ool
w
o
rm
hol
e
no
des
.
R
e
ga
r
d
i
n
g
at
t
h
e
ot
he
r alternatives
of the
worm
hole attack, t
h
at there is
one t
h
i
n
g c
o
m
m
on i
n
al
l
,
wh
i
c
h i
s
. a pat
h
i
s
adve
rt
i
s
ed
bet
w
een t
h
e
no
xi
ous
n
o
d
es, a
n
d al
l
t
h
e n
o
rm
al
host
s
are forced
to
mak
e
all th
eir p
a
th
s using
th
is m
a
licio
u
s
p
a
th
. M
o
d
i
fied rou
tin
g
tab
l
e th
at will h
e
lp
in
th
e
id
en
tificatio
n
o
f
m
a
lic
io
u
s
lin
k
s
. In
th
is pap
e
r writer mad
e
ch
an
g
e
s to
th
e p
a
th
s and
th
e fu
ll p
a
t
h
fro
m
in
itiato
r to
target n
o
d
e
. By
do
ing
th
is we can
strai
g
h
t
away d
e
tect a
p
r
o
s
p
ectiv
e
worm
h
o
l
e lin
k as
qu
ick
l
y as
it is created
. By g
i
v
i
ng
th
e
h
o
sts th
e ab
ility t
o
an
alyses
/sh
a
re o
n
e
ano
t
h
e
r’s rou
ting
informatio
n
tab
l
es we can
also detect
the latent
worm
holes.
Jai
n
[
10]
et
al
Pro
p
o
ses
w
o
r
m
hol
e det
ect
i
on u
s
i
n
g cha
n
ne
l
charact
eri
s
t
i
c
s det
ect
i
ng a
wo
rm
hol
e by
ex
p
l
o
itin
g
th
e
essen
tial eq
u
ilib
ri
u
m
o
f
electr
o
m
a
g
n
e
tic wave tran
sm
issio
n
in
th
e wireless en
v
i
ron
m
en
t.
It is
h
a
nd
s-on
eco
n
o
m
ica
l
m
e
th
od
to
d
e
tect collu
d
i
ng
attack u
s
ing
th
e essen
tial eq
u
ilib
ri
u
m
in
th
e wireless
channel.
We i
nve
stigated t
w
o
physical cha
r
acteristics of
t
h
e c
h
annel
rea
c
tion,
phase a
n
d m
a
gnitude
that can
b
e
u
s
ed
as sig
n
s in
o
u
r security sch
e
m
e
. W
e
v
a
lid
ated
th
at ch
ann
e
l qu
an
tities fro
m
IRIS sen
s
o
r
m
o
tes su
p
port
o
u
r assu
m
p
tio
ns on
ch
an
n
e
l ch
aracteristics.
Mah
d
i
No
ur
i [1
1
]
et al
pr
opo
ses t
w
o techn
i
qu
es
for t
o
detecting the
worm
hole attack.
The
first
pract
i
ce i
s
de
s
i
gne
d f
o
r det
e
ct
i
on
of
n
oxi
o
u
s
no
des i
n
a
com
m
uni
t
y
of no
des i
n
w
h
i
c
h i
n
di
vi
dual
l
y
pai
r
of
no
des i
n
t
h
e
ne
i
g
h
b
o
r
ho
o
d
i
s
sur
r
o
u
n
d
e
d
by
radi
o ass
o
rt
m
e
nt
o
f
eac
h
ot
he
r. T
h
e sec
o
nd
m
e
t
hod i
s
del
i
b
erat
e
for
recogn
itio
n of
n
o
x
i
ou
s nod
es i
n
a co
mmu
n
ity of
no
d
e
s,
in
wh
ich
i
n
d
i
vid
u
a
lly p
a
ir
o
f
n
o
d
e
s m
a
y n
o
t
b
e
in
br
oa
dcast
i
ng
r
a
nge
of eac
h o
t
her b
u
t
whe
r
e
t
h
ere i
s
a nod
e am
ong t
h
em
whi
c
h has al
l
the ot
he
r n
o
d
e
s
i
n
i
t
s
one
-
h
o
p
s
u
rr
o
u
n
d
i
n
g a
r
ea.
Sh
ort
c
om
i
ng o
f
t
h
ese
p
r
ac
tices is th
e im
p
r
acticalit
y o
f
i
d
en
tifying
wo
rm
h
o
l
e
attack
in
t
h
e us
age of
out of band
attack.
Evaluation Warning : The document was created with Spire.PDF for Python.
IJECE
ISS
N
:
2088-8708
Desi
g
n
i
n
g
a
n
Advers
a
ri
al
M
odel
Ag
ai
nst
R
e
act
i
ve a
n
d
Pr
oact
i
ve R
o
ut
i
n
g Pr
ot
oc
ol
s i
n
…
(
C
. N
a
g
a
R
a
j
u
)
1
113
3.
RO
UTING P
R
OTO
C
OLS
Ro
u
ting
[12
]
is on
e of th
e essen
tial and
ch
allen
g
i
ng
i
s
s
u
e i
n
m
obi
l
e
a
d
-
h
oc net
w
o
r
k
s
, as m
obi
l
e
n
o
d
e
s co
m
p
ri
ses with
b
a
ttery p
o
wer, low b
a
n
d
wid
t
h cap
ab
ilities, h
i
gh
erro
r
rates an
d
unp
red
i
ctab
le
m
ovem
e
nt
of t
h
e n
o
d
es. R
e
c
e
nt
l
y
, researc
h
ers p
r
o
p
o
se
d s
e
veral
r
o
ut
i
ng
pr
ot
oc
ol
s wi
t
h
di
ffe
rent
di
m
e
nsi
o
ns
su
ch
as efficien
cy,
q
u
a
lity of serv
ice, scalab
ility, etc.
Howev
e
r, th
ese
ro
u
ting
pro
t
o
c
ols [13
]
[14
]
are m
o
re
v
u
l
n
e
rab
l
e to attack
s fro
m
the in
tru
d
e
rs, wh
ich
can easily p
a
ralyze th
e
o
p
e
ration
o
f
the n
e
t
w
ork du
e to
t
h
e
in
h
e
rited
ch
aracteristics. He
nce, the
r
e is a
need to
pr
ov
ide th
e secu
rity
for th
ese rou
tin
g pro
t
o
c
o
l
s ag
ain
s
t
wo
rm
hol
e i
n
t
r
usi
o
n. I
n
t
h
i
s
pape
r,
we com
p
are
vari
o
u
s r
o
ut
i
ng
pr
ot
oc
ol
s
i
n
adve
rse en
vi
r
onm
ent
.
Th
ere are
t
w
o m
a
jo
r cat
e
g
o
r
i
e
s
of
r
out
i
n
g
p
r
ot
oc
ol
s i
n
M
obi
l
e
A
d
-
h
o
c
Net
w
o
r
ks
w
h
i
c
h are
p
r
oa
ct
i
v
e a
n
d
react
i
v
e
.
3.
1 Pr
o
a
cti
v
e
Ro
uti
n
g Pr
o
t
o
c
ol
s
Proactive
routing protoc
ols a
r
e encl
osed with routing
i
n
formation
ta
bles a
t
each a
n
d e
v
ery host.
And
all h
o
s
ts co
n
tinu
o
u
s
ly upd
ates th
e ro
u
ting
i
n
fo
rm
atio
n
tab
l
es to
m
a
in
tain
l
a
test v
i
ew on
t
h
e n
e
t
w
ork
topo
log
y
.
The e
x
i
s
t
i
n
g st
at
i
c
ro
ut
i
n
g
p
r
ot
oc
ol
s are:
D
S
D
V
,
OLSR
a
n
d
t
h
ese
are
de
scri
be
d
bri
e
fl
y
bel
o
w.
Destin
ati
o
n
Se
quenced
Dis
t
a
n
ce Vec
t
or
Ro
uting
(
D
S
D
V)
Prot
oc
ol
DS
DV
i
s
a
o
n
e
o
f
t
h
e
earl
i
e
st
ro
ut
i
n
g
pr
ot
ocol
p
r
o
p
o
sed
f
o
r
wi
rel
e
ss
net
w
or
ks,
pa
rt
i
c
ul
arl
y
f
o
r
m
obi
l
e
ad-h
oc
net
w
o
r
k
s
.
Th
e nat
u
re
o
f
t
h
e
r
out
i
n
g
p
r
ot
oc
ol
i
s
pr
oact
i
v
e
,
an
d t
h
e
ro
ut
e
s
are
p
r
e-e
s
t
a
b
l
i
s
hed
fro
m
o
n
e
to
all
in
th
e n
e
two
r
k. Du
e t
o
th
e pro
activ
e n
a
t
u
re, all h
o
s
ts
m
a
in
tain
co
m
p
lete
t
o
po
log
y
in
fo
rmatio
n
as r
out
i
n
g t
a
b
l
e. To
k
n
o
w
t
h
e f
r
es
hnes
s
of
a pa
rt
i
c
ul
ar pat
h
i
t
use
s
seq
u
e
n
ce n
u
m
bers. Al
l
h
o
s
t
s
are
cont
i
n
u
o
u
s
l
y
i
n
a t
i
m
el
y
manne
r
u
pdat
e
s
t
h
e
ro
ut
i
n
g t
a
bl
es.
H
o
we
v
e
r, t
h
i
s
r
o
ut
i
n
g
pr
ot
oc
ol
i
s
m
o
re
vul
nera
bl
e t
o
wo
rm
hol
e i
n
t
r
usi
o
n d
u
e t
o
i
t
s ope
nnes
s
and l
a
c
k
of ce
nt
ral
aut
h
o
r
i
t
y
. The ad
vers
ar
y
node
expl
oi
t
s
t
h
e
w
eakne
ss
of
t
h
i
s
r
out
i
n
g
p
r
ot
ocol
t
o
l
a
unc
h
w
o
rm
hol
e
by
si
m
p
l
y
forwa
r
di
ng
t
h
e
fal
s
e
l
i
n
k
in
fo
rm
atio
n
to
th
e ro
u
ting
tab
l
es. Th
is wi
ll resu
lt th
e
worm
h
o
l
e route b
e
tween
sou
r
ce an
d
d
e
stin
ation.
Mo
reo
v
e
r, th
e d
a
ta p
ack
ets will b
e
trav
el th
ro
ugh
th
e wo
rm
h
o
l
e rou
t
e, wh
ich
m
a
y
b
e
fu
lly o
r
selectiv
ely
discarded by t
h
e attacker t
h
at
results
de
nial of se
rvice attack.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
SN
:
2
088
-87
08
I
JECE Vo
l. 5
,
N
o
. 5
,
O
c
tob
e
r
20
15
:
111
1–
1
118
1
114
Opti
mi
z
e
d L
i
nk S
t
a
t
e
R
o
ut
i
n
g
(OL
S
R)
P
r
ot
oc
ol
Opt
i
m
i
zed Li
nk St
at
e R
out
i
n
g P
r
ot
ocol
[
1
5
]
i
s
pr
oact
i
v
e i
n
nat
u
re. T
h
e
nam
e
opt
im
i
z
ed l
i
n
k st
at
e
st
ands
fo
r re
du
ce t
h
e num
ber
of l
i
n
ks an
d re
duce t
h
e si
ze
of con
t
ro
l p
ack
ets in
th
e n
e
twork. For to
reduce th
e
num
ber o
f
l
i
n
k
s
i
t
uses
m
u
l
t
i
poi
nt
rel
a
y
s
(M
R
PS). T
h
e r
e
duct
i
o
n i
s
d
o
n
e by
st
at
i
ng a
subset
o
f
l
i
n
k
s
cal
l
e
d
m
u
l
tip
o
i
n
t
relays to
co
v
e
r all no
d
e
s in th
e
network.
Fun
c
tio
n
a
lly it wo
rks with two
co
ntro
l m
e
ssag
e
s
o
n
e
is
HELL
O a
n
d
ot
he
r i
s
T
o
p
o
l
ogy
C
ont
rol
(
T
C
)
m
e
ssage. OLSR
i
s
al
s
o
vul
nera
bl
e
wo
rm
hol
e at
t
ack, i
t
i
s
l
a
unc
hed
du
ri
n
g
t
h
e t
r
ansm
i
ssi
on o
f
r
out
i
n
g cont
rol
m
e
ssages. Due t
o
t
h
e
wo
rm
hol
e at
t
a
ck t
h
e fu
nct
i
o
n
i
ng o
f
t
h
e
pr
ot
oc
ol
i
s
al
t
e
red
an
d
t
h
e
per
f
o
r
m
a
nce o
f
t
h
e OL
SR
is decreas
ed. Due
t
o
worm
hole
attac
k
QOS
p
a
ram
e
ters are
affected trem
e
n
dou
sly, tho
s
e
are throug
hpu
t,
j
itter,
p
a
ck
et deliv
ery ratio and
en
d to
end
d
e
lay.
Evaluation Warning : The document was created with Spire.PDF for Python.
IJECE
ISS
N
:
2088-8708
Desi
g
n
i
n
g
a
n
Advers
a
ri
al
M
odel
Ag
ai
nst
R
e
act
i
ve a
n
d
Pr
oact
i
ve R
o
ut
i
n
g Pr
ot
oc
ol
s i
n
…
(
C
. N
a
g
a
R
a
j
u
)
1
115
Figure 10. Worm
hole
attack
3.
2 Reac
ti
ve
R
o
uti
n
g Pro
t
oc
ol
s
R
eact
i
v
e ro
ut
i
ng
pr
ot
ocol
s a
r
e n
o
t
m
a
i
n
t
a
in r
out
s t
o
ot
h
e
r n
o
d
es i
n
t
h
e net
w
or
k, t
h
e
y
creat
e t
h
e
ro
ut
es whe
n
e
v
er
r
e
q
u
i
r
e
d
by
ori
g
i
n
at
i
n
g
t
h
e
r
out
e di
sc
ove
r
y
pr
ocess
.
An
d
t
h
e ro
ut
es
a
r
e m
a
i
n
t
a
i
n
ed unt
i
l
t
h
e
willing nes
s
of the interm
ediate nodes a
nd the co
m
p
letion of the com
m
unication between c
o
m
m
unicating
part
i
e
s. The
ex
i
s
t
i
ng dy
nam
i
c
r
out
i
n
g pr
ot
oc
ol
s
are:
A
O
D
V
,
D
S
R
.
Dynamic
S
o
ur
ce (DSR)
Rou
t
ing
Dy
nam
i
c sour
ce ro
ut
i
n
g
pr
ot
oc
ol
[
16]
i
s
react
i
v
e
one
,
t
h
e r
o
ut
s are
b
u
i
l
d
s
base
d
o
n
se
nde
r
perce
p
t
i
o
n,
wh
en se
nde
r
wan
t
s t
o
com
m
uni
cat
e wi
t
h
ot
her
no
des i
n
t
h
e
net
w
or
k r
o
ut
s
are b
u
i
l
d
.
DS
R
[1
7]
,
t
h
e nam
e
i
ndi
cat
es i
t
i
s
a sou
r
ce ro
ut
i
n
g
pr
ot
ocol
.
DSR
is main
ly
co
m
p
osed
with
two
basic
m
ech
an
ism
s
ro
u
t
e
di
sco
v
ery
an
d
ro
ut
e
m
a
i
n
t
e
nance
.
R
o
ut
e di
sco
v
ery
i
s
ori
g
i
n
at
ed b
y
sender
,
w
h
eneve
r
i
t
want
s t
o
com
m
uni
cat
es wi
t
h
t
h
e
ot
her
no
de
by
br
oa
d
cast
i
ng R
R
E
Q
m
e
ssage gl
o
b
a
l
l
y
. Aft
e
r
reac
hi
n
g
R
R
E
Q m
e
ssage
receiver
will replay with the
RREP pack
et, then the route is well establi
s
he
d, transm
is
sion
of
data is taken
place betwee
n the bot
h of the
m
obile nodes.
Route m
a
intenan
ce is also one of the curtail ope
ration, in this the
st
at
us o
f
t
h
e l
i
nk i
s
k
n
o
w
n t
o
t
h
e com
m
uni
cat
i
ng
part
i
e
s.
An
d al
s
o
p
r
ese
n
ce
of t
h
e com
m
uni
cat
i
ng pa
r
t
i
e
s i
s
al
so kn
o
w
n t
o
nei
g
hb
o
r
s. H
o
weve
r, t
h
i
s
r
o
u
t
i
ng pr
ot
oc
ol
i
s
m
o
re vul
ne
ra
b
l
e t
o
worm
hol
e i
n
t
r
usi
o
n d
u
e t
o
i
t
s
ope
n
n
ess a
n
d l
ack
of c
e
nt
ral
aut
h
ori
t
y
. T
h
e
adve
rsa
r
y
n
o
d
e
ex
pl
oi
t
s
t
h
e
w
eakne
ss
of t
h
i
s
ro
ut
i
n
g
pr
ot
oc
ol
t
o
launc
h worm
hole
by just
fo
rwa
r
di
ng the
first RREQ
pa
cket which
is receive
d
from
the neighbor node.
Co
n
s
equ
e
n
tly, th
e ad
v
e
rsary will fo
rward
th
e sam
e
RRE
Q m
e
ssag
e
th
ro
ugh
fast ch
an
n
e
l to
th
e collid
in
g
n
o
d
e
, wh
ich intern
reach
e
s the sam
e
RREQ packet
to t
h
e
destination m
u
ch
faster t
h
an other RRE
Q
pa
cket
s
fro
m
d
i
fferen
t
n
e
ig
hbo
r
n
o
d
e
s. Th
is will resu
lt th
e wo
rm
h
o
l
e rou
t
e b
e
tween
source and
targ
et
n
o
d
e
.
Mo
reo
v
e
r, th
e d
a
ta p
ack
ets will b
e
trav
el th
ro
ugh
th
e wo
rm
h
o
l
e rou
t
e, wh
ich
m
a
y
b
e
fu
lly o
r
selectiv
ely
di
scar
ded
by
t
h
e at
t
acker t
h
a
t
resul
t
s
de
ni
al
of se
r
v
ice attack.
Due t
o
worm
hole attack QOS pa
ram
e
te
rs are
affected trem
e
n
dou
sly, tho
s
e
are throug
hpu
t, j
itte
r,
p
a
ck
et deliv
ery ratio and
en
d to
end
d
e
lay.
Ad
Hoc
On
D
e
mand
Dis
t
a
n
ce Vec
t
or
(
A
O
D
V
)
pr
o
t
oc
ol
AODV [18
]
is a reactiv
e rou
tin
g pro
t
o
c
o
l
it w
ill arranges ro
u
t
s on
d
e
man
d
fro
m
sen
d
e
r t
o
th
e
receiver.
AODV [19] m
a
inly
designe
d
for
to ha
ndle the
problem
s
of huge
m
e
ssage header i
n
on-de
m
and
pr
ot
oc
ol
s an
d
hu
ge
packet
ove
r
h
ead
d
u
e
t
o
t
h
e pe
ri
o
d
i
c
u
pdat
e
m
e
ssages i
n
st
at
i
c
rout
i
n
g
pr
ot
oc
ol
s
.
Fu
nct
i
oni
ng
o
f
AO
D
V
i
s
m
a
i
n
l
y
com
posed
wi
t
h
t
w
o l
e
v
e
l
’
s o
n
e i
s
r
o
ut
e di
sc
ove
ry
and a
n
ot
he
r i
s
ro
ut
e
m
a
i
n
t
e
nance.
Pri
m
ari
l
y
,
i
t
u
s
es gl
o
b
al
r
o
u
t
e di
scove
ry
p
r
oces
s by
b
r
oa
dcast
i
n
g R
R
E
Q m
e
ssage ov
er t
h
e
n
e
two
r
k
for to
find
ing
d
e
sired rou
t
e to th
e
destin
ati
on.
Wh
eneve
r
t
h
e rec
e
i
v
er
get
s
t
h
e
R
R
E
Q m
e
ssage fr
om
th
e n
e
i
g
hbo
r it rep
l
ays
b
ack to
th
e send
er with
RREP
messag
e
.
After g
e
tting
RREP m
e
ssag
e
form
th
e
receiver the
route is well-establishe
d,
and transm
ission of
data takes plac
e. Seconda
rily, route m
a
intenance is
com
posed
wi
t
h
t
h
ree o
p
erat
i
o
ns r
out
e er
r
o
r,
hel
l
o
an
d t
i
m
e
out
m
e
ssages. R
out
e er
ro
r m
e
ssage i
s
fi
re
d wh
e
n
th
e rou
t
e is n
o
t av
ailab
l
e o
r
failed
.
Hello
is u
s
ed
to
ch
eck
th
e co
nn
ection co
nd
itio
n
an
d ti
me o
u
t
is u
s
ed
t
o
id
en
tify th
e co
nn
ection
statu
s
, if a conn
ectio
n
is in
ac
tiv
e, it will b
e
d
i
scord
e
d
after ti
m
e
o
u
t
co
mp
letio
n
.
AO
D
V
r
o
ut
i
n
g
i
s
com
p
l
e
t
e
l
y
di
st
ur
be
d
whe
n
t
h
e
r
e i
s
a
w
o
rm
hol
e i
n
t
h
e
net
w
or
k.
Wor
m
hol
e [2
0]
at
t
ack i
s
l
a
unc
hed
d
u
r
i
n
g
t
h
e ro
ut
e di
sco
v
ery
p
r
o
cess,
a n
ode
(so
u
r
ce) wa
nt
s
t
o
c
o
m
m
uni
cat
e
wi
t
h
ot
he
r
n
o
d
e
(dest
i
n
at
i
o
n
)
n
o
rm
al
l
y
t
h
i
s
conve
rsat
i
o
n i
s
p
o
ssi
bl
e
wi
t
h
sh
ort
e
st
pat
h
w
h
i
c
h i
s
p
r
o
v
i
d
e
d
by
t
h
e
A
O
D
V
,
t
h
at
ro
ut
e i
s
cal
l
e
d as t
r
adi
t
i
onal
ro
ut
e. If
wo
rm
hol
e i
s
prese
n
t
i
n
t
h
e net
w
o
r
k t
w
o
no
xi
o
u
s
no
des are l
o
c
a
t
e
d at
two
d
i
fferen
t
lo
catio
ns and
im
p
e
rso
n
a
tes neig
hb
ors to
th
e so
urce and
d
e
stin
atio
n
.
So
th
e sou
r
ce is estab
lish
t
h
e r
o
ut
e t
h
ro
ug
h t
h
e
no
xi
o
u
s
no
des
t
o
m
a
ke c
o
m
m
uni
cat
i
on
wi
t
h
t
h
e
dest
i
n
at
i
o
n,
t
h
i
s
pat
h
i
s
cal
l
e
d as
worm
h
o
l
e p
a
th. It illu
m
i
n
a
tes
th
at wo
rm
h
o
l
e attack
is who
lly ag
g
r
av
ate AODV
rou
ting
.
Du
e to
worm
h
o
l
e
attack
QOS
perfo
r
m
a
n
e
p
a
ra
m
e
ters [21
]
are affected
tre
m
en
d
o
u
s
ly, t
h
o
s
e are t
h
rou
ghp
u
t
,
j
itter, p
a
ck
et
d
e
liv
ery
ratio
an
d end
t
o
en
d
d
e
lay.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
SN
:
2
088
-87
08
I
J
ECE Vo
l. 5
,
N
o
. 5
,
O
c
tob
e
r
20
15
:
111
1–
1
118
1
116
4.
PERFO
R
MA
NCE E
V
ALU
T
ION
A
N
D
S
I
MUL
A
TIO
N
A
NAL
YSI
S
The si
m
u
l
a
t
i
o
n
s
we
re
per
f
o
r
m
e
d
usi
n
g
Net
w
or
k
Si
m
u
l
a
t
o
r 2
(N
S-
2.
35
).
R
a
nd
om
way
p
o
i
n
t
m
odel
i
s
u
s
ed
to
g
e
n
e
rat
e
th
e
m
o
b
ility
scen
ari
o
s b
y
varyin
g
1
0
to
50
no
d
e
s m
o
v
i
n
g
in
a territory area o
f
10
00
X 1
000
meters. Hear
we uses m
oderate packet rate and va
ry
i
n
g p
a
use t
i
m
e
s t
o
sim
u
l
a
t
i
on and
we com
p
are di
ffe
rent
ad-
h
oc ro
ut
i
n
g
prot
oc
ol
s (DS
D
V
,
OLSR
, D
S
R
,
AO
D
V
) w
i
t
h
Wo
rm
hol
e at
t
ack and wi
t
h
o
u
t
w
o
rm
hol
e
at
t
ack
by
vary
i
n
g t
h
e
num
ber of w
o
rm
hol
e no
des i
n
t
h
e net
w
or
k.
An
d we cal
cul
a
t
e
vari
o
u
s per
f
o
r
m
a
nce
m
e
t
r
i
c
s of
p
ack
et
d
e
liv
ery fractio
n, th
ro
ugh
pu
t and
en
d
to
end
d
e
la
y. The sim
u
lation pa
ram
e
ters are summ
ariz
ed in
Tabl
e 1.
Tabl
e1
. Si
m
u
l
a
t
i
on
param
e
t
e
rs
Para
m
e
ter Values
T
r
a
ffic
ty
pe
Nu
m
b
er
of nodes
Si
m
u
lation ti
m
e
Pause ti
m
e
Si
m
u
lation area
Mobility
P
e
r
f
o
r
ma
n
c
e
me
t
r
i
c
s
CBR.
10 to 50.
1000 sec.
0,
1,
2,
3,
4 and 5.
1000 X 100
0
m
e
ter
s
.
0 to 20
m
e
ter
/
sec.
E
nd to E
nd Delay,
T
h
r
oughput and
Packet deliver
y f
r
a
c
tion.
4.
1 Per
f
or
ma
nce Me
tri
c
s
Thi
s
pape
r a
n
a
l
y
ze t
h
e M
A
N
ET r
o
ut
i
n
g
p
r
o
t
ocol
s
u
nde
r t
h
e f
o
l
l
o
wi
ng
t
h
r
ee pe
rf
orm
a
nce m
e
t
r
i
c
s.
1.
Packet deliver
y Fraction/Rat
i
o:
Ratio
b
e
tween
th
e am
o
unts o
f
d
a
ta r
ece
ived
by the target node t
o
the
am
ount
o
f
dat
a
sen
d
by
t
h
e
so
urce
h
o
st
i
s
cal
l
e
d pac
k
et
del
i
v
ery
fract
i
o
n.
2.
En
d-t
o
-e
nd
De
l
a
y:
T
h
e tim
e interval bet
w
ee
n se
nde
r a
n
d t
a
rget
node
to t
r
ansm
it a data packet
over the
n
e
two
r
k
.
It is th
e su
m
o
f
all
i
n
terv
als wh
ich are so
urce, interm
ed
iate
n
o
d
es, rou
t
e d
i
scov
ery d
e
lay and
que
ui
n
g
i
n
t
e
r
v
al
i
s
cal
l
e
d as e
n
d
t
o
e
n
d
del
a
y
.
3.
Th
ro
ugh
pu
t:
It
is the
portion
of cha
n
nel capacity
used for
s
u
ccess
f
ul data transm
ission.
Fi
gu
re 1
,
2 a
n
d 3 s
h
o
w
s t
h
e
gra
p
hs f
o
r e
n
d
-
t
o
-e
n
d
del
a
y
Vs pa
use t
i
m
e
i
n
1
0
, 3
0
a
nd
50
no
des E
n
d
to
End
d
e
lay
in
bo
th
leg
itimate an
d
un
der wo
rm
h
o
l
e
situ
atio
n
.
In
l
e
g
iti
m
a
te si
tu
atio
n
pro
a
ctiv
e rou
tin
g
pr
ot
oc
ol
s
has l
e
sser e
n
d t
o
e
n
d
del
a
y
t
h
a
n
c
o
m
p
ared t
o
rea
c
t
i
v
e p
r
ot
ocol
s
.
I
n
n
o
rm
al
si
tuat
i
o
n
ove
ral
l
OLSR
has m
i
nim
u
m
end t
o
e
nd del
a
y
and DSR
h
a
vi
n
g
m
o
re e
nd t
o
en
d del
a
y
.
B
u
t
by
i
n
creasi
ng n
u
m
b
er o
f
no
de
s
an
d h
i
g
h
m
o
b
ility situ
atio
n
reactiv
e pro
t
o
c
o
l
s h
a
v
i
ng
less en
d to
end
d
e
lay.
Un
de
r w
o
rm
h
o
l
e
at
t
ack al
so
Pr
oact
i
v
e r
o
u
t
i
ng
pr
ot
oc
ol
s
(O
LSR
&
D
S
D
V
)
per
f
o
rm
bet
t
e
r t
h
e
n
com
p
ared t
o
t
h
e react
i
v
e
r
out
i
n
g
p
r
ot
oc
ol
(
A
OD
V
&
DSR
)
.
A
O
D
V
a
n
d
D
S
R
sho
w
de
pri
v
e
d
del
a
y
ch
aracteristics as th
eir
p
a
th
s
are h
a
b
itu
ally
n
o
t
t
h
e sh
ortest. Du
e to node m
o
b
ilit
y th
e p
a
th
s
wh
ich
are find
s
sho
r
t
e
r
u
n
d
er e
a
rl
y
ro
ut
e
di
sc
ove
ry
pr
ocess
doe
s
not
rem
a
in sam
e
ove
r t
i
m
e
goes
o
n
.
B
y
i
n
creasi
n
g num
ber of
n
o
d
es AO
D
V
gi
ves bet
t
e
r
e
n
d
t
o
e
n
d
del
a
y
un
de
r wo
rm
hol
e
but
D
S
R
havi
ng
m
o
re e
n
d
t
o
e
n
d
del
a
y
i
n
bot
h t
h
e
si
t
u
at
i
o
n
s
.
Fi
gu
re 4
,
5 a
n
d
6 sh
ows t
h
e g
r
aph
s
fo
r P
D
F
Vs pa
use t
i
m
e
i
n
10
, 3
0
an
d 5
0
n
ode
s res
p
ec
t
i
v
el
y
unde
r
b
o
t
h
leg
itim
a
t
e
an
d wo
rm
h
o
l
e attack
. Dy
n
a
mic ro
u
ting
p
r
o
t
o
c
o
l
s (DSR
an
d
AODV) dro
p
a m
a
j
o
r
n
u
m
b
er o
f
packet
s d
u
r
i
n
g
t
h
e rout
e di
s
c
ove
ry
pha
se,
as rout
e acq
ui
rem
e
nt
t
a
kes t
i
m
e
prop
o
r
t
i
onal
t
o
t
h
e di
st
ance
bet
w
ee
n t
h
e s
o
urce a
n
d t
a
r
g
et
no
de.
Packet
dr
o
p
s are sca
r
c
e
r wi
t
h
st
at
i
c
r
out
i
n
g
pr
ot
oc
o
l
s (DS
D
V &
O
L
SR
)
as substitute
routing table e
n
t
r
ies ca
n alway
s
be
assigne
d
i
n
reaction to link failures.
Sta
tic routing
protocol
s
also
drop
h
uge n
u
m
b
e
r
o
f
data p
ack
ets
wh
en
t
h
e
n
u
m
b
e
r of nod
es are
m
o
re and
h
i
g
h
m
o
b
ility sit
u
atio
ns.
AO
D
V
has a s
l
i
ght
l
y
po
ore
r
packet
d
e
l
i
v
er
y
perf
orm
a
nce t
h
an DSR
bec
a
use o
f
g
r
eat
er
dr
op rat
e
s
.
A
O
D
V
uses
ro
ut
e ex
p
i
rat
i
on,
d
r
o
p
p
i
ng
fe
w pac
k
et
s w
h
en a
ro
ut
e terminates and a
ne
w ro
ute
m
u
st be ori
g
inate.
Un
de
r w
o
rm
hol
e DSR
ha
vi
n
g
sl
i
ght
i
n
c
r
ease
i
n
Pac
k
et
del
i
v
e
ry
rat
i
o
c
o
m
p
ared
t
o
A
O
D
V
,
DS
D
V
a
n
d
O
L
SR
.
Fi
gu
re 7,
8 and
9 sh
ows t
h
e gra
p
hs f
o
r
Thr
o
u
g
h
p
u
t
Vs pa
use t
i
m
e
for
10
, 30
and
50
no
de
s
r
e
sp
ectiv
ely un
d
e
r
bo
th
legiti
mate an
d
w
o
r
m
h
o
l
e attack
. Th
rou
ghpu
t is th
e m
e
asu
r
e
o
f
i
n
fo
rmatio
n
excha
n
ged
o
v
e
r t
h
e t
i
m
e o
f
t
i
m
e
co
m
m
uni
cat
ed i
n
ki
l
obi
t
s
pe
r eve
r
y
seco
nd
(K
bps
). T
h
ro
u
g
h
put
i
s
depe
n
d
ent
on
PDF, m
o
re t
h
e PD
F gi
ves
m
o
re t
h
r
o
u
g
h
p
u
t
,
u
n
d
er
n
o
rm
al
si
t
u
at
i
o
n DSR
havi
n
g
hi
g
h
t
h
r
o
u
g
h
p
u
t
co
m
p
ared t
o
al
l
ot
he
r r
out
i
n
g
pr
ot
oc
ol
s. A
O
DV
has sl
i
g
ht
decrease i
n
t
h
r
o
u
g
h
p
u
t
com
p
ared t
o
DSR
but
pr
oa
ct
i
v
e p
r
ot
ocol
s
(D
SD
V
& O
L
SR
)
has l
o
w
t
h
r
o
u
g
h
p
u
t
w
h
en
t
h
e
n
u
m
b
er o
f
n
odes
are
m
o
re.
Un
de
r wo
rm
ho
l
e
at
t
ack t
h
rou
g
h
p
u
t
of al
l
ro
ut
i
ng
pr
ot
oc
ol
s
decrease drast
i
cally co
m
p
ar
ed
to
n
o
rm
al s
i
t
u
atio
n.
C
o
m
p
ared t
o
a
l
l
ot
her
r
out
i
n
g
pr
ot
o
c
ol
s
DS
R
havi
n
g
b
e
tter throug
hpu
t an
d AODV is slig
h
tly lo
wer. On
o
t
h
e
r
si
de
P
r
oact
i
v
e ro
ut
i
n
g pr
ot
oc
ol
s have
l
o
wer t
h
r
o
u
g
h
p
u
t
wh
en
i
n
c
r
easi
n
g n
u
m
b
er
o
f
no
de
s.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
J
ECE
I
S
SN
:
208
8-8
7
0
8
Desi
g
n
i
n
g
a
n
Advers
a
ri
al
M
odel
Ag
ai
nst
R
e
act
i
ve a
n
d
Pr
oact
i
ve R
o
ut
i
n
g Pr
ot
oc
ol
s i
n
…
(
C
. N
a
g
a
R
a
j
u
)
1
117
5.
CO
NCL
USI
O
N
M
obi
l
e
a
d
hoc
net
w
o
r
ks
h
a
v
e
em
erged i
n
m
a
ny
fo
rm
s where
fi
x
e
d
i
n
f
r
a
st
ruct
u
r
e i
s
n
o
t
avai
l
a
bl
e
o
r
expe
nsi
v
e t
o
d
e
pl
oy
t
h
e e
x
i
s
t
i
ng i
n
f
r
ast
r
uct
u
re
. T
h
e e
x
i
s
t
i
n
g
r
o
ut
i
n
g
p
r
o
t
ocol
s
o
n
t
h
e
s
e net
w
o
r
ks
are
m
o
re
vul
nera
bl
e t
o
wo
rm
hol
e at
t
ack. B
eca
use o
f
i
t
s
severi
t
y
,
the worm
hole attack has attracted a gre
a
t deal of
atten
tio
n
in
th
e research
co
mm
u
n
ity. Th
is p
a
p
e
rs co
m
p
ares t
w
o react
i
v
e
and t
w
o p
r
oa
ct
i
v
e ro
ut
i
n
g pr
o
t
ocol
s
in
adv
e
rsarial en
v
i
ron
m
en
t. Sp
ecifically
, worm
h
o
l
e attack
is ap
p
lied
to
th
ese rou
ting
pro
t
o
c
o
l
s to
ev
aluate th
e
per
f
o
r
m
a
nce t
h
r
o
ug
h si
m
u
l
a
ti
on.
C
o
m
p
rehe
nsi
v
el
y
t
h
e
resu
lts shows th
e co
m
p
ara
tive perform
a
nce of
thes
e
pr
ot
oc
ol
s agai
nst
wo
rm
hol
e at
t
ack i
s
hard t
o
det
ect
and ea
sy
t
o
im
pl
em
ent
.
As a fut
u
re
wor
k
, i
t
i
s
necessary
t
o
de
si
g
n
a m
echani
s
m
t
o
av
o
i
d t
h
e
w
o
rm
hol
e i
n
t
r
usi
o
n
usi
n
g
som
e
cry
p
t
o
g
r
a
phi
c m
e
t
hods
.
REFERE
NC
ES
[1]
C.E.
Perkins.
Ad
Hoc Ne
tworkin
g
. Addison-W
e
sl
e
y
Professional
,
first ed
ition
,
200
0.
[2]
S. Basagni, M.C
onti, S. Giordan
o
a
nd I. Stojmenovic, “Mobile Ad Hoc Netw
orking”, A. John W
iley
& Sons, Inc.,
Publication, 200
4,
ISBN 0- 471-
37313-3.
[3]
E.
S.
Babu,
“An Implementation
and
Performance Evaluation Study
of AODV,
MAOD
V,
RAO
DV in Mobile Ad
hoc Networks”,
vol. 4
,
no
. 9
,
pp
.
691–695, 2013
.
[4]
Thaier Hay
a
jn
eh, Prashant Krishnamurth
y
, David Tipper
,
“DeWorm: A
Simp
le Protoc
ol
to Detec
t
W
o
rm
hole
Attacks
in
Wireless Ad hoc Networ
ks”, 978-0-7
695-3838-9/09 $
26.00 ©
2009 IEEE
[5]
E.S. Babu and
M.L.R. Ch
andr
a, “A comprehensive stud
y
of R
outing
protoco
l
s in Mobile Ad hoc Networks
:
Research
Survey”. vo
l.
7, no. 7, p
p
. 77–83
, 2012
.
[6]
Saurabh Gupta, Subrat Kar
an
d S
Dharmaraja, “WHOP: Wor
m
hole Attack
Detection Proto
c
ol using
Hound
Packet”, 978-1-4
577-0314-0/11/$
26.00 ©2011
IEEE.
[7]
Umesh ku
mar chaurasia, Mrs. Va
rsha singh, “MAODV: Modified Worm
hole Detection AODV Protocol”, 978-1-
4799-0192-0/13/$31.00 ©2013
I
EEE.
[8]
Yih-Chun Hu, Adrian Perrig
and David B. Jo
hnson, “Pack
et
Leashes: A Def
e
nse against Wormhole Attacks
in
Wireless Networ
ks”.
[9]
Zubair Ahmed
Khan, M. Has
a
n Is
lam, “Wormhole Attack:
A new de
tectio
n techn
i
que”, 9
78-1-4673-4451-
7/12/$31.00
©20
12 IEEE.
[10]
Shalabh Jain,
Tuan Ta, John S. Baras, “Wormh
o
le
Detection U
s
ing Channel C
h
aracteristics”, 978-1-4577-2053-
6/12/$31.00
©20
12 IEEE.
[11]
Mahdi Nouri, S
o
may
e
h Abazar
i Aghda
m, Sajjad Abazari Ag
hdam, “Colla
bo
rativ
e Techniqu
es for Detectin
g
Wormhol
e
At
t
a
ck i
n
MANE
T
s
”.
[12]
Sunil Tan
e
ja,
an
d Ashwani Kush, “A Survey
of
R
outing Proto
c
ols in Mobile A
d
Hoc Network
s
”,
Internationa
l
Journal of Innovation, Managem
e
nt and
Techno
log
y
,
Vol. 1
,
No.
3, August 2010
I
SSN: 2010-0248.
[13]
E.S. Babu
, C. N
a
gara
ju, and M.
H.M.K.
Prasad,
“
A
Com
p
arative
Stud
y
of Tre
e
based Vs. Mesh based Multic
ast
Routing Proto
c
o
l
s in Mobile Ad
hoc Networks”,
vol. 2
,
no
. 6
,
pp
.
6–11, 2013
.
[14]
T.P
.
Kum
a
r,
E.
S
u
resh, B.V. R
a
mana, and
B.S.
Shashank, “Survey
: Routing Protocols in Cogn
itive Rad
i
o Mesh
Networks”, vo
l.
6, no
. 1
,
pp
. 603
–608, 2015
.
[15]
Farid Na
¨
ı
t-Abd
e
sselam, Brah
im Bens
aou and Jink
y
u
Yoo1,
“
Detecting
and
Avoid
i
ng Wormhole Attacks
in
Optimized
Link State Routing Protocol
”, IEEE
Communications Society
subject
matter
exper
t
s for publication
in
the WCNC 2007
proceedings.
[16]
D.B. Johnson, D.A. Maltz, Y.
Hu, and J.G. Jetchev
a
. Th
e d
y
n
a
mic sour
ce rou
ting protoco
l
for mobile ad hoc
networks (DSR). Intern
et draft, F
e
br
uar
y
2002
. D
r
aft-ietf-manet-d
sr-08.txt.
[17]
E.S. Babu and
M.H.M.K. Pras
ad, “
A
n Im
plem
entation Anal
ys
is
and Eval
uation
Stud
y
of DSR with Inactive DoS
Attack
in
Mobile Ad ho
c Netwo
r
ks”, vol. 2
,
no
.
6, pp
. 501–507
,
2013.
[18]
Eliz
abe
t
h M. Be
lding-Ro
yer
,
Charles E
.
Perkins Evoluti
on
and future directions of
the ad hoc on
demand distance-
vector
routing
pr
otocol-
E
lsevier,
2003
[19]
E.S. Babu, C. N
a
garaju, a
nd M
.
H.M
.
K. P
r
as
ad, “
A
n Im
plem
entation and P
e
rform
ance Evalu
a
tio
n of P
a
ss
ive DoS
Attack
on AODV Routing Proto
c
ol
in Mobile A
d
hoc N
e
tworks
PROTOCOL OF”, vo
l. 2, no. 4, 2
013.
[20]
Yang Shengju*,
Shi Shaoting,
Zh
ao Xinhui, “Research o
n
S
ecurity
of Rou
ting Pro
t
ocols Against
Wormhole Attack
in the
Ad Hoc N
e
tworks”,
TELK
OMNIKA Indon
esian Journal of
Electrica
l
Eng
i
n
eering
ISSN: 23
02-4046, Vol.12
,
No.3, Mar
c
h 20
14, pp
. 2110
~ 2
117.
[21]
Jogendra Kumar, “ Broadcasting
Traffi
c Lo
ad Performance Analy
s
is of 802.11
MAC in Mobile Ad hoc Networ
ks
(MANET) Using Random Way
point Model (R
WM)”,
International Journal of Info
rmation &
Network
S
ecurity
(I
J
I
N
S
)
ISSN: 2089-3299 Vol. 1
,
No. 3, August
2012, pp
. 223~2
27.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
SN
:
2
088
-87
08
I
JECE Vo
l. 5
,
N
o
. 5
,
O
c
tob
e
r
20
15
:
111
1–
1
118
1
118
BIOGRAP
HI
ES OF
AUTH
ORS
M
r
.
A
.
P
e
da Gopi
received his
B.Tech degr
ee in Info
rmation Technolog
y
from
KLCE Colleg
e
of Engineering
,
Guntur, pursuing M.Tech d
e
g
r
ee in Computer Networks and Security
from
K.L.University
Guntur. He has pub
lished 5 research papers in v
a
ri
ous Internatio
nal Journal. He
has attend
ed 8 seminars and workshops. His areas
of interests are wire
less networks, security
issues in MANETs and v
e
hicular
networks.
M
r
.
E.
Sur
e
s
h Babu
received
his
B.Tech degr
ee in Com
puter S
c
ienc
e from
RGM
College of
Engineering, Nand
y
a
l, M.Tech
d
e
gree
in Com
put
er S
c
ien
c
e
from
V.T. Univ
ers
i
t
y
Belgaum
and
pursuing PhD in Computer Science & Eng
i
neer
i
ng from J.
N.
T.
U
n
ive
r
sity
K
a
kinada. Curr
ently
,
he is
working
as
an As
s
o
ciate P
r
ofes
s
o
r in
the Departm
e
nt
of CS
E in
K L Univers
i
t
y
Vija
y
a
wad
a
, He
has got 12
y
e
a
r
s of teaching
exp
e
rien
ce
. He has published 8 rese
arch pap
e
rs in
various International Journal
a
nd 10 research
papers in
var
i
ous National and Intern
ation
a
l
Conferences. He has attend
ed 3
2
seminars and
workshops. His areas of
in
terests are Wir
e
less
Networks, Network Security
,
an
d
MANETs.
He is member of vari
ous professional societies like
IAENG,
CSTA,and CSI
Dr. C. Naga Ra
ju
is
curren
t
l
y
working as
As
s
o
cia
t
e P
r
of
essor and Head of
th
e Depar
t
ment of
Computer Science and Engin
e
ering at YSR Engi
neer
ing College of Yogivemana University
,
Poddatur, Kadapa District,
and
Andhra Pradesh,
India. He r
e
ceiv
e
d his B.Tech Degree in
Com
puter S
c
ien
ce from
J
.
N.T
.
Univers
i
t
y
,
Anant
a
pur,
and M
.
T
e
c
h
Degree
in Co
m
puter S
c
ienc
e
fromJ.N.T.Univ
e
rsity
H
y
derab
a
d and PhD in d
i
gita
l Im
age pro
cessing from
J.N.T.Unive
r
sit
y
H
y
der
a
bad
.
He has
got 18
y
e
ars
of teach
ing exp
e
rien
ce
. He rec
e
i
ved res
e
arch ex
cel
lenc
e award
,
teaching ex
cellence award
and Ray
a
laseemavidh
y
ar
atn
a
award fo
r his credit. He
wrote text book
on & Data structures. He has six
PhD scholars. He has published fifty
three res
earch p
a
pers in
various National and Internation
a
l
Journals and
about th
irty
resear
ch p
a
pers in
v
a
rious National
and Intern
ation
a
l Conferen
ces.
He has attended
tw
enty
seminar
s
and workshops. He is member
of various p
r
ofes
sional societie
s
like I
E
EE, ISTE
and CSI.
M
r
. S.
Ashok
K
u
mar
rec
e
iv
ed
his
B.T
ech d
e
gr
ee in
Inform
atio
n Techno
log
y
fr
om
RVR & J
C
College of
Engineering
,
Guntur, pursuing M.Tech
degree in Co
mputer Networks and Security
from K.
L.
University
Guntur. He
ha
s published
3 r
e
search
pap
e
rs in
various In
ternational Journal.
He has attended 10 se
minars
a
nd workshops.
His areas of i
n
terests are wir
e
less networks,
security
issues in MANETs and
vehicu
lar n
e
twor
ks.
Evaluation Warning : The document was created with Spire.PDF for Python.