Int
ern
at
i
onal
Journ
al of Ele
ctrical
an
d
Co
mput
er
En
gin
eeri
ng
(IJ
E
C
E)
Vo
l.
10, N
o. 5,
O
ct
obe
r 202
0, pp.
4956
~
4964
IS
S
N:
20
88
-
8708
,
DOI: 10
.11
591/
ij
ece
.
v
10
i
5
.
pp
4956
-
49
64
4956
Journ
al h
om
e
page
:
http:
//
ij
ece.i
aesc
or
e.c
om/i
nd
ex
.ph
p/IJ
ECE
A
no
ve
l
se
cure routin
g sch
eme usin
g probabili
stic modelli
ng fo
r
better r
esistivit
y against l
ethal att
ac
ks
Jyoti
N
eel
i
1
, N
. K
.
Cau
ver
y
2
1
Dep
art
m
ent
of
I
nform
at
ion
Sci
e
nce
and
Engi
ne
e
ring,
Glob
al A
cadem
y
of
T
ec
hno
log
y
,
Visvesvara
y
a
Technol
ogi
ca
l
Uni
ver
sit
y
(VTU)
,
I
ndia
2
Depa
rtment of I
nform
at
ion
Sci
e
nce
of
Eng
ine
e
ri
ng,
RV Col
le
g
e of
Engi
n
ee
rin
g,
Visvesvara
y
a
Technol
ogi
ca
l
Uni
ver
sit
y
(VTU)
,
I
ndia
Art
ic
le
In
f
o
ABSTR
A
CT
Art
ic
le
history:
Re
cei
ved
J
ul
10
, 2
019
Re
vised
Feb
2
9
,
2020
Accepte
d
Ma
r
1
8
, 202
0
Stud
y
tow
ard
s
wire
le
ss
adho
c
net
work
dates
t
wo
dec
ad
es
back
with
var
ious
rese
arc
h
ers
evo
l
ving
up
with
ne
w
soluti
ons
tow
ard
s
addr
essing
i
ts
proble
m
s.
Irre
spec
t
ive
of
v
ari
ous ot
her
pro
ble
m
s,
the
issues re
la
t
ed
to
th
e
se
cur
e
rout
ing
i
s
y
e
t
u
n
s
o
l
v
e
d
o
w
i
n
g
t
o
m
a
s
s
i
v
e
l
y
i
n
c
r
e
a
s
i
n
g
f
a
t
a
l
s
t
r
a
t
e
g
i
e
s
o
f
t
h
e
a
d
v
e
r
s
a
r
y
.
R
e
v
i
e
w
o
f
e
x
i
s
t
i
n
g
l
i
t
e
r
a
t
u
r
e
s
h
o
w
s
t
h
a
t
t
h
e
e
x
i
s
t
i
n
g
s
e
c
u
r
e
routi
ng
s
che
m
e
ca
n
onl
y
gove
rn
over
the
stated
att
ac
ks
red
uci
ng
t
he
appl
i
ca
bi
li
t
y
in
ca
se
of
d
y
nami
c
atta
cks.
The
re
fore
,
thi
s
m
anusc
ript
int
ro
duce
s
a
nov
el
pr
obabi
li
st
i
c
m
odel
which
offe
r
s
the
ca
pability
to
wire
l
ess
no
des
to
ide
nti
f
y
t
he
m
al
ic
ious
beha
vior
and
r
eact
accordi
ngl
y
.
Diffe
ren
t
from
e
xisti
ng
int
rusion
pre
vent
ion
s
y
stem,
the
pro
posed
sy
st
em
al
lows
the
m
al
icious
node
to
par
ti
ci
p
ate
in
the
data
forwar
ding
proc
ess
and
exha
ust
it
s
r
e
source
s
with
no
cha
nce
of
l
a
u
n
c
h
i
n
g
a
n
a
t
t
a
c
k
.
T
h
e
s
i
m
u
l
a
t
e
d
o
u
t
c
o
m
e
o
f
t
h
e
s
t
u
d
y
s
h
o
w
s
t
h
a
t
t
h
e
p
r
o
p
o
s
e
d
s
e
c
u
r
e
r
o
u
t
i
n
g
s
c
h
e
m
e
o
f
f
e
r
s
b
e
t
t
e
r
d
a
t
a
f
o
r
w
a
r
d
i
n
g
c
h
a
r
a
c
t
e
r
i
s
t
i
c
i
n
c
o
n
t
r
a
s
t
t
o
t
h
e
e
x
i
s
t
i
n
g
s
y
s
t
e
m
i
n
t
h
e
a
s
p
e
c
t
o
f
i
n
t
r
u
s
i
o
n
d
e
t
e
c
t
i
o
n
a
n
d
s
e
c
u
r
e
d
a
t
a
t
r
a
n
s
m
i
s
s
i
o
n
.
Ke
yw
or
d
s
:
Atta
ck
In
tr
us
i
on
Ma
li
ci
ou
s
Secu
re ro
uting
Secu
rity
W
i
reless
a
dhoc
n
et
w
ork
Copyright
©
202
0
Instit
ute of
Ad
v
ance
d
Engi
ne
eri
ng
and
Sc
ie
n
ce
.
Al
l
rights re
serv
ed
.
Corres
pond
in
g
Aut
h
or
:
Jyoti
N
eel
i,
Dep
a
rtm
ent o
f Info
rm
at
i
on
Sc
ie
nce and
En
gi
neer
i
ng,
Global
A
ca
de
m
y of
Tec
hnol
og
y,
Visv
es
va
raya
Tech
no
l
og
ic
al
Un
i
ver
sit
y (
VT
U)
,
Be
ng
al
uru,
VT
U,
Bel
a
gav
i,
Karnata
ka,
India
.
Em
a
il
: jyotirne
el
i@gm
ail.co
m
1.
INTROD
U
CTION
W
i
reless
A
dhoc
network
is
char
act
erize
d
by
the
la
ck
of
su
pp
or
ti
v
e
in
frast
ru
ct
ure
an
d
con
sist
s
of
var
i
ou
s c
omm
un
ic
at
in
g
de
vic
es (
al
so
call
ed peers
)
in a ver
y dynam
ic
m
a
nn
e
r.
T
hese s
el
f
-
orga
nizing pe
ers
are
capab
le
of
m
ain
ta
inin
g
c
onne
ct
ivit
y
a
m
on
g
t
hem
by
sh
ari
ng
thei
r
wireles
s
capa
bili
ti
es
[1
]
.
T
his
c
har
ac
te
risti
c
assi
sts
the
wire
le
ss
com
m
un
ic
at
ion
dev
ic
e
t
o
est
ablish
c
onne
ct
ivit
y
a
m
on
g
each
oth
e
r
where
the
sour
ce
node
can
forw
a
r
d
th
e
data
pac
ket
to
the
de
sti
nation
no
de
ei
the
r
directl
y
or
i
ndirect
ly
thr
ough
inte
rm
ediat
e
relay
node
[
2
-
3].
Due
to
this
dece
nt
rali
zed
m
echan
ism
of
com
m
un
ic
at
io
n
est
a
bl
ishm
ent
and
r
ou
ti
ng,
the
re
is
le
ss
po
s
sibil
it
y
of
the
avail
in
g
ke
y
distribu
ti
on
c
enter
in
the
a
d
-
ho
c
wireless
ne
twork
[4
]
.
Ne
it
her
it
is
feasible
for
avail
ing
a
r
ob
us
t
certi
ficat
e
auth
or
it
y
bec
ause
of
w
hich
reason
ad
-
hoc
wireless
net
work
la
c
ks
pr
eci
se
identific
at
ion
of
node
s
[
5].
W
irel
ess
A
dhoc
net
work
is
one
s
uitable
for
the
dece
ntrali
zed
a
rch
i
te
ct
ur
e
d
e
p
l
o
y
m
e
n
t
i
n
t
h
e
w
i
r
e
l
e
s
s
n
e
t
w
o
r
k
[
6
]
.
A
c
c
o
r
d
i
n
g
t
o
t
h
e
t
h
e
o
r
e
t
i
c
a
l
s
t
u
d
y
,
i
t
i
s
b
e
l
i
e
v
e
d
t
h
a
t
n
o
d
e
s
i
n
t
h
e
a
d
-
hoc
wireless netw
o
rk
al
ways
ass
um
e
that
any
ne
w
node
t
hat
joi
ns
it
s n
et
w
ork
has
to
f
ollo
w
t
he
ce
rtai
n
protoco
l of
cond
uct.
U
nfort
un
at
el
y,
this
log
ic
does
not
ho
l
d
good
in
the
m
ajo
rity
of
the
pr
act
ic
al
com
m
un
ic
at
ion
syst
e
m
as there
are
v
a
r
iou
s
d
y
nam
ic
a
tt
acks in
t
he
a
d
-
hoc
w
irel
ess
ne
twork
evolvi
ng
[7
]
.
Ow
i
ng
t
o
the
decen
t
rali
zed
s
chem
e,
there
are
va
rio
us
c
ha
ll
eng
es
ass
ocia
te
d
with
c
omm
un
ic
at
ion
.
Ma
j
ori
ty
of
the
chall
eng
es
a
re
ei
ther
assoc
ia
te
d
with
data
fo
r
wardi
ng
/t
raffic
relat
ed
op
e
rati
on
w
hile
oth
e
r
Evaluation Warning : The document was created with Spire.PDF for Python.
In
t J
Elec
&
C
om
p
En
g
IS
S
N:
20
88
-
8708
A novel
sec
ur
e
ro
uti
ng sch
e
me
u
si
ng p
r
obabil
ist
ic
m
odel
li
ng for bett
er re
sis
ti
vi
ty
a
ga
i
ns
t ..
.
(
Jyoti
Neel
i
)
4957
form
s
of
pro
ble
m
s
are
relat
ed
to
sec
ur
it
y
pro
blem
s
in
the
ad
-
ho
c
wirele
ss
netw
ork
[
8
-
11
]
.
At
present
,
there
are
m
any
secu
rity
schem
es
evo
l
ved
to
ward
secu
rity
ap
plica
ti
on
s
of
the
a
d
-
hoc
wireles
s
net
work
[
12
-
16]
,
bu
t
ver
y
few
a
ppr
oach
es
to
w
ard
s
safe
guar
di
ng
t
he
ge
ne
rali
zed
arc
hit
ect
ure
of
the
ad
-
hoc
wireless
net
work.
It
is
becau
se
there
are
di
fferent
ty
pes
of
app
li
cat
ion
s
in
an
ad
-
hoc
w
irel
ess
net
w
ork
with
res
pe
ct
to
the
pe
rs
pecti
ve
of
a
com
m
un
ic
at
io
n
protoco
l;
the
refore
,
the
a
pp
li
ca
bili
ty
of
secu
rity
so
luti
on
of
one
app
li
cat
io
n
i
s
nev
e
r
ap
plica
bl
e
to
so
lve
the
sa
m
e
secur
ity
pr
oble
m
in
an
ot
her
ap
plic
at
ion
.
F
or
exa
m
ple,
the
sam
e
securi
ty
so
luti
on
cannot
be
offe
re
d
towa
rds
secu
rin
g
black
hole
at
ta
ck
in
the
m
ob
il
e
ad
-
hoc
ne
twork
and
wireless
sens
or
netw
ork
as
their
r
outi
ng
m
anag
e
m
ent
s
yst
e
m
is
ver
y
di
ff
e
r
ent
from
each
oth
e
r.
At
the
sam
e
tim
e,
ano
the
r
sign
i
ficant
pro
bl
e
m
is
that
m
ajo
rity
of
the
sec
ur
e
r
outi
ng
pro
tocol
is
dev
el
oped
on
the
top
of
c
on
ven
ti
onal
r
outi
ng
protoc
ol,
e.
g.
,
a
dhoc
on
-
d
e
m
a
n
d
d
i
s
t
a
n
c
e
v
e
c
t
o
r
(
A
O
D
V
)
,
d
e
s
t
i
n
a
t
i
o
n
s
e
q
u
e
n
c
e
d
i
s
t
a
n
c
e
v
e
c
t
o
r
(
D
S
D
)
,
d
y
n
a
m
i
c
s
o
u
r
c
e
r
o
u
t
i
n
g
(
D
S
R
,
e
t
c
.
U
n
f
o
r
t
u
n
a
t
e
l
y
,
a
l
l
t
h
e
s
e
p
r
o
t
o
c
o
l
s
a
l
r
e
a
d
y
h
a
v
e
c
h
a
l
l
e
n
g
e
s
i
n
i
t
s
r
o
u
t
i
n
g
o
p
e
r
a
t
i
o
n
[
1
7
]
.
T
h
e
r
e
f
o
r
e
,
w
i
t
h
o
u
t
a
d
d
r
e
s
s
i
n
g
s
u
c
h
c
h
a
l
l
e
n
g
e
s
,
i
t
i
s
q
u
i
t
e
u
n
w
i
s
e
a
n
d
u
n
p
r
a
c
t
i
c
a
l
t
o
u
s
e
s
u
c
h
p
r
o
t
o
c
o
l
s
f
o
r
s
e
c
u
r
i
n
g
t
h
e
n
e
t
w
o
r
k
.
F
o
r
e
x
a
m
p
l
e
,
A
O
D
V
su
f
fer
s
f
ro
m
the
pro
blem
of
r
et
ai
nin
g
sta
le
r
ou
ti
ng
inf
or
m
at
ion
wh
ere
the
up
da
te
s
are
le
ss
fr
equ
e
ntly
carried
out.
The
a
dv
e
rsa
ry
can
easi
ly
m
isuse
su
c
h
pro
per
ti
es
of
r
ou
ti
ng
pro
blem
s b
y a
ny m
eans.
Var
i
ou
s
enc
ry
pti
on
-
based
sc
hem
es
hav
e
be
en
e
vo
l
ved
up
for
sec
ure
r
ou
ti
ng
sc
hem
e,
but
the
re
are
ver
y
le
ss
be
nc
hm
ark
ed
stu
di
es
in
this
re
gards.
Hen
c
e,
the
r
e
is
a
need
for
su
ch
a
secu
rity
so
luti
on
that
offer
s
a
secu
rity
so
l
ut
ion
base
d
on
the
m
al
iciou
s
beh
a
vior
of
th
e
ad
-
hoc
node
s,
wh
ic
h
wor
ks
on
t
he
a
ren
a
of
al
l
app
li
cat
io
ns
in
the
a
d
-
ho
c
wireless
net
work.
T
her
e
fore,
the
pro
posed
syst
em
introdu
ces
a
si
m
pl
ifie
d
analy
ti
cal
m
od
el
that
is
m
eant
fo
r
ta
king
a
dy
nam
ic
decisi
on
ba
sed
on
cu
r
ren
t
local
a
nd
global
trust
i
n
order
to
asse
ss
the
intenti
on
of
th
e
nodes
prese
nt
in
the
netw
ork.
T
he
c
urre
nt
w
ork
al
so
pr
ese
nts
prob
a
bili
sti
c
m
od
el
ing
to
wa
rd
s
assessi
ng vario
us
c
riti
cal
sit
uations
of the
thr
eat
s
.
Ther
e
are
var
i
ou
s
ap
proac
he
s
witnesse
d
in
the
existi
ng
syst
e
m
towar
ds
ad
dr
essi
ng
t
he
s
ec
ur
it
y
pro
blem
s
in
the
ad
-
hoc
wi
reless
netw
ork
[
18]
.
This
sect
io
n,
th
e
ap
proac
hes
ass
ociat
ed
with
the
m
al
i
ci
ou
s
beh
a
vior
of
t
he
node
is
re
view
ed.
T
he
w
ork
of
S
har
m
a
et
al
.
[19]
has
prese
nt
ed
an
a
ut
hen
ti
cat
ion
protoc
ol
for
it
s
neig
hbor
i
ng
node
s
f
or
re
sist
i
ng
black
hole
at
ta
ck
in
the
a
d
-
hoc
wireless
env
i
ronm
ent.
I
t
has
al
s
o
been
se
e
n
that
fr
e
qu
e
ntly
us
ed
r
ou
ti
ng
s
chem
es,
e.g
.,
a
dhoc
on
-
dem
a
nd
distance
ve
ct
or
(
A
ODV)
has
been
m
od
i
fied
t
o
offer
dual
ac
knowle
dgm
ent
schem
e
fo
r
aut
hen
ti
cat
io
n.
Stud
y
t
ow
a
r
ds
i
ncor
po
rati
ng
bi
o
-
ins
pire
d
al
gorithm
has
bee
n
see
n
in
the
w
ork
of
Chintal
apall
i
and
A
na
nthula
[
20
]
,
w
hich
is
ab
ou
t
the
sel
ect
ion
of
the
se
cur
e
routes
in
t
he
m
ob
il
e
ad
-
hoc
netw
ork.
C
on
siderati
ons
of
the
be
ha
vioura
l
se
m
antic
s,
Y
adav,
a
nd
Ga
ur
[
21
]
hav
e
presente
d
a
fr
am
ewo
r
k
that
is
dev
el
ope
d
base
d
on
t
he
al
gebraic
co
nc
ept
for
sec
ur
e
data
com
m
un
ic
at
ion
in
the
m
ob
il
e
ad
-
hoc
netw
ork.
A
uniq
ue
stud
y
c
ar
ried
ou
t
on
Z
he
ng
et
al
.
,
[
22]
has
in
tro
du
ce
d
a
stra
te
gic
m
echan
ism
us
i
ng
a
hy
br
id
duplex
recei
ver
.
This
log
ic
co
nf
us
es
the
m
alicio
us
node
to
pe
rfor
m
eavesd
r
oppi
ng
fo
ll
owe
d by f
orwa
rd
i
ng as
we
ll
as j
am
m
ing
t
he
a
dv
e
rsa
ry sign
al
.
Ali
an
d
Pr
asa
d
[23].
T
he
w
ork
of
Girn
a
r
and
K
au
r
[24]
ha
ve
st
udie
d
the
sec
ur
it
y
of
the
a
d
-
ho
c
netw
ork
with
r
espect
to
a
ne
ur
al
netw
ork
wh
e
re
t
he
s
im
ulate
d
ou
tc
ome
show
s
that
t
he
pro
po
se
d
s
yst
e
m
is
resist
ive
of
bl
ackhole
at
ta
ck
an
d
worm
ho
le
at
ta
ck.
T
he
stud
y
to
wa
rd
s
en
han
ce
d
dat
a
for
wardin
g
s
chem
e
pr
ese
nted
by
Kaura
v
an
d
Joshi
[25]
is
sho
wn
to
offe
r
res
ist
ance
from
e
aves
droppin
g
a
tt
ack
to
pro
ve
that
the
pr
ese
nted
sch
e
m
e
of
fe
rs
be
tt
er
thr
oughput,
ove
rh
ea
d,
and
data
de
li
ver
y
pe
rform
ance.
A
dopt
ion
of
a
rein
forcem
ent
le
arn
in
g
sc
he
m
e
has
bee
n
witnesse
d
in
the
work
of
M
ay
adunn
a
et
al
.
,
[
26]
w
her
e
a
secu
re
routin
g
sc
hem
e
has
bee
n
de
velo
ped
usi
ng
tr
us
t
factor
there
by
c
on
t
rib
uted
t
ow
a
r
ds
m
al
ic
iou
s
node
identific
at
ion.
P
r
e
v
e
n
t
i
o
n
m
e
c
h
a
n
i
s
m
t
o
w
a
r
d
s
c
o
n
f
l
i
c
t
i
n
g
b
e
h
a
v
i
o
r
w
a
s
d
i
s
c
u
s
s
e
d
b
y
S
a
m
r
e
e
n
a
n
d
J
a
b
b
a
r
[
2
7
]
wh
e
re
a
n
el
im
inati
on
strat
eg
y
of
t
he
m
al
iciou
s
node
is
de
velo
ped
ba
se
d
on
the
t
ru
st
facto
r.
A
naly
sis
of
s
ecur
it
y
stren
gth
of
co
nven
ti
on
al
ad
-
hoc
routin
g
schem
e
is
carried
out
by
Sh
a
bu
t
et
al
.
,
[2
8]
wh
e
r
e
the tec
hniq
ue
i
s claim
ed
of
be
tt
er p
er
f
or
m
ance on det
ect
ion o
f
ea
vesdr
oppi
ng
att
ac
k
m
ain
ly
.
The
e
xisti
ng
s
yst
e
m
has
al
so
noti
ced
the
usa
ge
of
cl
assif
ie
r
-
ba
s
e
d
ap
proach
to
wards
detect
ion
of
the
a
dv
e
rsar
y
i
n
the
a
d
-
ho
c
ne
twork
.
T
he
w
ork
of
S
ham
s
and
Ri
zane
r
[
29
]
hav
e
use
d
suppo
rt
vect
or
m
achine
to
show
t
hat
it
can
resist
po
te
ntial
at
ta
c
ks
with
bette
r
data
for
ward
ing
perform
ance.
Usa
ge
of
trust
m
anag
em
ent h
as b
e
en
see
n
in the s
tud
y of
Guo
et al
. [
30]
w
her
e an
inte
gr
a
te
d
approac
h
of f
uzzy lo
gic as w
el
l
as
inf
or
m
at
ion
qu
a
ntific
at
ion
con
ce
pt
for
re
s
ist
ing
pote
ntial
at
ta
cks
in
t
he
ad
-
hoc
wi
reles
s
netw
ork
.
T
he
w
ork
of
T
rive
di
et
al
.
[31]
has
us
e
d
re
puta
ti
on
-
based
m
ode
li
ng
to
wards
the
ide
ntific
at
ion
of
int
rusion
i
n
the
prese
nce
of
m
ob
il
it
y
in
t
he
ad
-
ho
c
net
work
en
vir
onm
ent.
The
wor
k
prese
nted
by
Patwar
dhan
et
al
.
[32]
has
us
e
d
en
cr
ypti
on
a
nd
ke
y
-
base
d
m
anag
em
ent
towards
stre
ngthe
ni
ng
the
a
uth
e
nt
ic
at
ion
pr
oces
s.
A
pa
rt
f
r
om
this,
the
oth
e
r
ap
proac
he
s
are
pr
e
dicti
ve
(So
wah
et
al
.
,
[33]),
m
od
if
ie
d
AOD
V
bas
ed
(Za
nt
et
al
.
,
[34]),
s
t
u
d
y
-
b
a
s
e
d
(
C
h
a
n
d
a
n
e
t
a
l
.
[
3
5
]
)
,
r
o
u
t
i
n
g
-
b
a
s
e
d
(
V
a
d
a
v
i
e
t
a
l
.
,
[
3
6
]
)
a
n
d
s
i
g
n
a
l
s
t
r
e
n
g
t
h
-
b
a
s
e
d
(
F
a
i
s
a
l
e
t
a
l
.
,
[
3
7
]
)
.
Abd
ullah
et
al
.
,
[38]
ha
ve
il
l
us
trat
ed
data
ga
therin
g
al
gori
thm
fo
r
wirele
ss
sen
sor
netw
orks
by
us
in
g
j
oi
nt
m
ob
il
e aspects.
Bhati
a
and
T
om
ar
[39]
hav
e
pr
ese
nted
ba
ndwidth
optim
iz
a
ti
on
an
d
po
wer
eff
ic
ie
nt
dyna
m
ic
so
ur
c
e
routin
g
protoc
ol
in
MANET
s.
Jyoti
Neeli
et
al
.
,
[4
0]
ha
ve
pr
e
sente
d
var
i
ou
s
a
ppro
a
ches
unde
rtak
en
by
Evaluation Warning : The document was created with Spire.PDF for Python.
IS
S
N
:
20
88
-
8708
In
t J
Elec
&
C
om
p
En
g,
V
ol. 10,
No.
5,
Oct
ob
e
r 2
020
:
49
56
-
49
64
4958
e
x
i
s
t
i
n
g
l
i
t
e
r
a
t
u
r
e
t
o
a
d
i
s
c
r
e
t
e
s
e
c
u
r
i
t
y
i
s
s
u
e
a
n
d
a
l
s
o
e
x
a
m
i
n
e
t
h
e
e
f
f
e
c
t
i
v
e
n
e
s
s
p
o
i
n
t
o
f
t
h
e
s
e
c
u
r
i
t
y
.
T
h
e
r
e
s
e
a
r
c
h
s
t
u
d
y
w
a
s
d
o
n
e
b
y
T
u
b
e
r
q
u
i
a
a
n
d
H
e
r
n
a
n
d
e
z
[
4
1
]
a
n
o
v
e
l
a
p
p
r
o
a
c
h
i
n
c
o
g
n
i
t
i
v
e
r
a
d
i
o
s
b
y
u
s
i
n
g
a
n
al
gorithm
cal
le
d
evo
l
ution
a
ry.
The
w
ork
of
T
his
stud
y
m
ai
nly
fo
cuses
on
r
econfig
ur
a
ble
f
ault
tolerant
on
chip
arc
hitec
tur
with
hierar
c
hical
ag
ent
base
d
m
on
it
or
in
g
syst
em
for
en
ha
ncin
g
the
pe
rfor
m
ance
of
netw
ork
ba
sed
m
ulti
pr
oc
essor
syst
e
m
on
chip
agai
ns
t
f
ault
y
li
nk
s
and
no
des.
Jat
i
et
al
.
,
[42]
this
wor
ks
m
ai
nly
fo
cuse
on
cl
assifi
cat
ion
m
et
ho
ds
to
e
nhance
the
sec
ur
it
y
te
ch
niqu
e
base
d
on
th
e
hum
n
gaint.
The
G
AIT
is
one
of
t
he
biom
et
ric
te
chn
iq
ues
tha
t
m
igh
t
be
em
plo
ye
d
to
rec
ognize
the
pe
rs
on.
T
he
ne
xt
s
ect
i
on
br
ie
fs
of
pro
blem
s
that
are
ta
rg
et
ed
to be a
ddresse
d
i
n
the
prop
os
ed
syst
e
m
.
Existi
ng
syst
e
m
towar
ds
sec
ur
i
ng
the
r
outi
ng
m
echan
ism
in
the
ad
-
hoc
wireless
netw
ork
is
m
or
e
or
le
ss
sy
m
pto
m
a
ti
c
wh
ere
the
pr
im
e
incli
natio
n
of
the
pr
es
ented
ap
proac
hes
are
f
o
c
us
e
d
on
offe
rin
g
secur
it
y
so
luti
on
to
wards
s
pecific
at
ta
cks.
Af
te
r
re
viewin
g
the
wor
k
car
ried
ou
t
t
ow
a
r
ds
the
sec
ur
e
c
omm
un
ic
at
ion
in
the ad
-
hoc w
ir
el
ess n
et
wor
k,
it
w
as seen
tha
t
m
ajo
rity
o
f
th
e w
ork
car
ried ou
t i
s tow
a
rds ad
dressi
ng
par
t
ic
ular
secur
it
y
br
eac
h wh
ic
h
loses it
s ap
plica
bili
ty
tow
a
rd
s
re
sist
ing
oth
e
r
f
or
m
s o
f
at
ta
cks.
It is b
ecau
se eve
r
y
a
t
t
a
c
k
h
a
s
d
i
f
f
e
r
e
n
t
s
t
r
a
t
e
g
i
e
s
,
b
u
t
t
h
e
m
o
d
e
o
f
i
n
i
t
i
a
t
i
n
g
t
h
e
a
t
t
a
c
k
s
a
r
e
m
o
r
e
o
r
l
e
s
s
t
h
e
s
a
m
e
.
I
f
t
h
e
m
a
l
i
c
i
o
u
s
be
ha
vior
of
the
no
de
ca
nnot
be
accu
ratel
y
confirm
ed,
then
offe
rin
g
protect
ive
m
easur
es
will
be
quit
e
a
dif
ficult
ta
sk
.
A
n
o
t
h
e
r
e
s
s
e
n
t
i
a
l
r
e
v
i
e
w
f
i
n
d
i
n
g
i
s
t
h
a
t
t
h
e
r
e
a
r
e
v
e
r
y
l
e
s
s
j
o
u
r
n
a
l
s
r
e
p
r
e
s
e
n
t
i
n
g
s
e
c
u
r
i
t
y
p
r
o
b
l
e
m
s
i
n
t
h
e
a
d
-
h
o
c
wireless
net
work
an
d
the
re
is
a
nu
m
ber
of
researc
h
on
spe
ci
fic
app
li
cat
ion
s
,
e.g.,
m
ob
il
e
ad
-
hoc
net
work,
veh
ic
ular
net
w
ork,
se
ns
or
net
work,
et
c.
Ir
r
e
sp
ec
ti
ve
of
al
l
of
these
fall
un
der
the
dom
ai
n
of
ad
-
hoc
net
work,
bu
t
th
ei
r
r
outi
ng
m
echan
ism
v
ary
from
each
oth
e
r.
It
s
how
s
that
secu
re
r
outi
ng
schem
e
of
sen
sor
ne
tw
ork
has
le
sser
a
pp
li
cab
il
ity
on
t
he
m
ob
il
e
ad
-
hoc
net
work
an
d
vice
-
ve
rsa.
He
nce,
a
ge
ne
rali
zed
schem
e
is
requ
ired.
T
h
e
r
e
a
r
e
f
e
w
s
t
u
d
i
e
s
w
h
e
r
e
a
t
t
a
c
k
r
e
s
i
s
t
i
v
i
t
y
s
t
r
a
t
e
g
y
i
s
d
e
v
e
l
o
p
e
d
b
a
s
e
d
o
n
g
e
n
e
r
a
l
i
z
i
n
g
o
r
c
o
m
p
l
e
x
m
a
l
i
c
i
o
u
s
b
e
h
a
v
i
o
r
.
T
h
e
r
e
f
o
r
e
,
t
h
e
r
e
s
e
a
r
c
h
p
r
o
b
l
e
m
i
s
"
D
e
v
e
l
o
p
i
n
g
a
r
e
s
i
s
t
i
v
i
t
y
a
g
a
i
n
s
t
m
a
x
i
m
u
m
a
t
t
a
c
k
u
s
i
n
g
c
o
s
t
-
e
f
f
e
c
t
i
v
e
m
o
d
e
l
i
n
g
a
p
p
r
o
a
c
h
i
n
t
h
e
a
d
-
h
o
c
w
i
r
e
l
e
s
s
n
e
t
w
o
r
k
u
s
i
n
g
t
h
e
u
n
i
q
u
e
f
e
a
t
u
r
e
s
o
f
m
a
l
i
c
i
o
u
s
b
e
h
a
v
i
o
r
”
.
The
pro
po
se
d
stud
y
c
onsider
analy
ti
cal
research
m
et
hodo
l
og
y
i
n
or
der
t
o
in
vestigat
e
t
he
be
hav
i
or
of
the
le
thal
at
ta
cks
in
t
he
a
d
-
hoc
wireless
net
work
as
well
as
de
velo
p
a
str
at
egy
for
r
esi
sti
ng
t
he
sprea
d
of
s
uc
h
intru
si
on
f
ur
th
er.
T
he
bl
ock
diag
ram
of
the
pr
opos
e
d
s
yst
e
m
is
sh
own
in
Fi
gure
1.
The
blo
c
k
di
agr
am
exh
i
bits
the
sc
he
m
e
towards
the
ide
ntific
at
ion
an
d
pr
e
ve
nt
ion
of
va
riant
s
of
at
ta
cks
on
the
a
d
-
ho
c
wi
reless
netw
ork.
T
he
pro
po
se
d
m
od
el
dev
el
op
an
adv
e
rsa
rial
m
od
el
us
in
g
thre
e
diff
e
ren
t,
wh
i
ch
is
about
ob
serv
i
ng
the m
al
iciou
s
be
hav
i
or of the
destinat
io
n/interm
ediat
e n
od
e
i
n
the
n
ei
ghbo
rho
od.
A
d
v
e
r
s
a
r
i
a
l
M
o
d
e
l
l
i
n
g
S
t
r
a
t
e
g
y
P
r
i
m
a
r
y
S
t
r
a
t
e
g
y
S
e
c
o
n
d
a
r
y
S
t
r
a
t
e
g
y
T
e
r
t
i
a
r
y
S
t
r
a
t
e
g
y
T
r
u
s
t
M
o
d
e
l
l
i
n
g
P
o
s
i
t
i
v
e
T
r
u
s
t
N
e
g
a
t
i
v
e
T
r
u
s
t
C
o
n
f
i
r
m
e
d
T
r
u
s
t
M
a
l
i
c
i
o
u
s
B
e
h
a
v
i
o
u
r
I
d
e
n
t
i
f
i
c
a
t
i
o
n
R
e
s
i
s
t
i
v
i
t
y
t
o
w
a
r
d
s
A
d
v
e
r
s
a
r
y
A
w
a
r
d
A
l
l
o
c
P
e
n
a
l
t
y
A
l
l
o
c
Figure
1
.
Bl
oc
k diag
ram
o
f
pro
posed
m
et
ho
do
l
og
y
The
c
om
plete
ob
s
er
vation
is
carried
out
bas
ed
on
t
ru
st
m
anag
em
ent,
w
he
re
tr
us
t
is
cal
culat
ed
us
in
g
the
pro
bab
il
it
y
con
ce
pt.
The
f
inal
sta
ge
of
th
e
stud
y
i
m
ple
m
entat
ion
is
about
identify
in
g
t
h
e
m
a
l
i
c
i
o
u
s
,
w
h
i
c
h
i
s
f
u
r
t
h
e
r
f
o
l
l
o
w
e
d
b
y
e
i
t
h
e
r
c
o
n
t
i
n
u
i
n
g
t
h
e
c
o
m
m
u
n
i
c
a
t
i
o
n
o
r
s
t
o
p
p
i
n
g
t
h
e
c
o
m
m
u
n
i
c
a
t
i
o
n
u
s
i
n
g
t
h
e
a
l
l
o
c
a
t
i
o
n
o
f
t
h
e
a
w
a
r
d
/
p
e
n
a
l
t
y
.
T
h
e
f
o
r
m
u
l
a
t
i
o
n
o
f
t
h
e
a
w
a
r
d
a
n
d
p
e
n
a
l
t
y
i
s
d
e
v
e
l
o
p
e
d
b
a
s
e
d
o
n
v
a
r
i
o
u
s
e
x
t
r
i
n
s
i
c
f
a
c
t
o
r
s
,
e
.
g
.
,
a
m
o
u
n
t
o
f
r
e
s
o
u
r
c
e
s
u
t
i
l
i
z
e
d
in
unde
rtaki
ng
a
sp
eci
fic
ta
sk
,
prof
it
obta
in
ed
by
unde
rtakin
g
a
sp
eci
fic
ta
sk
,
the
pe
nalty
for
false
al
arm
(f
or
regular
no
de
),
et
c.
T
hese
par
am
et
ers
are
devel
oped
i
n
su
c
h
a
m
ann
er
that
com
pu
ta
ti
on
of
them
wil
l
al
ways
giv
e
a
n
out
com
e
in
the
ran
ge
of
0
a
nd
1.
This
is
car
ried
ou
t
to
us
e
th
e
sco
pe
of
sta
ti
sti
cal
in
fer
e
ncin
g
syst
em
fo
r
the
num
erical
ou
tc
om
e
ob
ta
ine
d.
T
he
pr
im
e
con
tribut
ion
of
the
pro
po
s
e
d
syst
e
m
is
that
it
i
m
ple
m
ents
a
un
iq
ue
ad
ver
sa
ria
l
m
odel
wh
ic
h
not
on
ly
increase
s
the
app
li
cabi
li
ty
of
the
propose
d
s
yst
e
m
bu
t
al
so
intro
duces
a
s
chem
e
to
resist
su
ch
le
thal
t
hr
e
at
s.
T
he
ne
xt
sect
ion
disc
us
ses
the alg
or
it
hm
desi
gn.
Evaluation Warning : The document was created with Spire.PDF for Python.
In
t J
Elec
&
C
om
p
En
g
IS
S
N:
20
88
-
8708
A novel
sec
ur
e
ro
uti
ng sch
e
me
u
si
ng p
r
obabil
ist
ic
m
odel
li
ng for bett
er re
sis
ti
vi
ty
a
ga
i
ns
t ..
.
(
Jyoti
Neel
i
)
4959
2.
ALGO
RITH
M
I
MPLEME
NTATIO
N
The
dev
el
op
m
ent
of
the
c
om
ple
te
al
go
rithm
is
car
ried
ou
t
base
d
on
the
obser
va
ti
on
to
ward
s
the
secu
re
d
tr
us
t
com
pu
ta
ti
on
by
t
he
s
our
ce
node
t
ow
a
r
ds
the
i
nterm
e
diate
node
sel
ect
ed
f
or
f
orw
ard
i
ng
the
da
ta
pac
ke
t.
The
m
echan
ism
of
co
nf
i
rm
i
ng
the
no
de
to
be
com
m
un
ic
at
ed
wit
h
is
a
n
at
ta
cker
,
or
re
gu
la
r
node
de
pends
upon
novel a
na
ly
ti
cal
m
od
el
ing
of the t
hr
ee t
es
t en
vironm
ent as foll
ows:
a.
Test
-
En
vir
onm
ent
-
1:
In
this
te
st
env
ir
on
m
ent,
the
m
od
el
will
con
side
r
that
bo
t
h
at
ta
ck
er
an
d
the
re
gula
r
node
will
ad
opt
an
a
ct
ion
t
ha
t
offer
s
t
ha
n
m
axi
m
u
m
awar
d
t
ow
a
r
ds
the
i
r
m
otive.
It
m
eans
that
re
gu
l
ar
node
will
be
awarde
d
m
axi
m
um
wh
en
they
choose
to
capt
ur
e
the
at
ta
cke
r
wh
il
e
the
at
ta
cker
no
de
will
get
the
m
axi
m
u
m
award
wh
e
n
t
hey
can
su
cce
ssfu
ll
y
la
unch
the
at
ta
ck.
T
hi
s
te
st
env
i
ron
m
ent
is
op
te
d
for
chall
eng
i
ng m
od
el
in
g o
f
a
dy
nam
ic
att
ack scen
ari
o.
b.
Test
-
En
vir
onm
ent
-
2:
I
n
this
te
st
env
i
ronm
ent,
the
act
io
n
a
dopte
d
by
the
ne
xt
no
de
is
un
know
n
a
nd
ca
nn
ot
be
pr
e
dicte
d
by
the
oth
e
r
node.
It
al
so
e
nsures
that
act
io
n
a
dopted
by
a
sp
eci
fic
node
is
sel
ect
ed
with
a
hidde
n
age
nda
of
obta
inin
g
the
m
axim
u
m
awar
d.
T
he
dif
fer
e
nce
in
al
l
the
te
st
env
i
ronm
ents
are:
In
the
1s
t
te
st
env
i
ronm
ent,
on
ce
a
node
e
xecu
te
s
it
s
act
ion
s
t
hen
th
e
act
ion
of
ne
xt
node
is
s
om
ewh
at
pr
e
dicta
ble a
nd d
e
fine
d,
w
hich
is
dif
fer
e
nt in
the
2nd
te
st e
nvir
on
m
ent.
c.
Te
st
-
En
vir
onm
ent
-
3:
In
t
his
te
st
env
ir
on
m
ent,
the
inf
or
m
at
ion
asso
ci
at
ed
with
t
he
exec
utio
n
of
the
act
ions
of
ei
ther
of
t
he
node
s
is
com
plete
ly
un
kn
own
or
im
par
ti
al
.
It
offers
a
balan
ce
betwee
n
bo
th
the
regular
node
an
d
at
ta
cke
r
in
te
rm
s
of
obta
inin
g
m
or
e
awards.
T
he
diff
e
ren
ce
betwe
en
the
1
st
-
2
nd
te
st
env
i
ronm
ent
a
nd
3
rd
te
st
env
i
ronm
ent
is
that
the
inform
at
io
n
is
qu
it
e
com
plete
in
1
st
-
2
nd
te
st
e
n
v
i
r
o
n
m
e
n
t
w
h
i
l
e
3
rd
t
e
s
t
e
n
v
i
r
o
n
m
e
n
t
d
o
e
s
n
o
t
h
a
v
e
a
n
y
f
o
r
m
o
f
t
h
e
d
e
f
i
n
i
t
i
o
n
o
f
a
t
t
a
c
k
.
T
h
i
s
m
a
k
e
s
t
h
e
3
rd
t
e
s
t
e
n
v
i
r
o
n
m
e
n
t
m
o
r
e
l
e
t
h
a
l
a
n
d
a
p
p
r
o
p
r
i
a
t
e
t
o
a
s
s
e
s
s
t
h
e
i
d
e
n
t
i
f
i
c
a
t
i
o
n
o
f
d
i
f
f
e
r
e
n
t
f
o
r
m
s
o
f
a
t
t
a
c
k
s
.
Ap
a
rt
f
r
om
the
te
st
-
en
vir
onm
ent
m
entione
d
a
bove,
the
pro
posed
stu
dy
def
i
nes
the
te
r
m
ac
ti
on
as
a
sp
eci
fic
ta
sk
carried
out
by
nodes.
F
or
cl
arit
y
in
i
m
p
lem
entat
ion
,
the
pro
posed
m
od
el
con
side
rs
that
there
are
two
set
s
of
act
ion
s
viz
.
A
co
mm
and
A
dist
.
It
m
eans
that
there
a
re
a
cert
ai
n
com
m
on
set
of
act
io
ns
A
com
m
betwee
n
regul
ar
a
nd
at
ta
cker
node
w
hile
th
ere
is
a
sp
eci
fic
set
of
act
io
n
A
dist
,
w
hich
is
highly
u
ni
qu
e
a
nd
diff
e
re
nt
from
each
ot
her
.
It
will
al
so
m
ean
that
an
at
ta
cker
node
will
no
t
ea
sil
y
execu
te
A
dist
as
the
pro
bab
il
it
y
of
them
being
caught
will
be
hig
h.
S
o,
an
at
ta
cker
will
at
te
m
pt
execu
ti
on
of
A
comm
in
ord
er
to
gain
the
tr
us
t
of
a
re
gu
la
r
node
.
H
e
nce,
there
are
var
i
ous
com
plex
scenari
os
arti
fici
al
ly
and
analy
ti
cal
ly
dev
el
op
e
d
i
n
orde
r
to
de
velo
p
a
sec
ure
r
outi
ng
sc
hem
e.
The
fi
rst
al
gorit
hm
is
design
e
d
f
or
ide
ntific
a
ti
on
of
the att
acker
no
de,
a
nd it
s st
ep
s of e
xecu
ti
on
are as
f
ollow
:
Algorithm for
Identification of Attacker Node
Input
:
n
(number of nodes),
C
(Cut
-
off)
Output
: identification of the attacker node
Start
1.
while
H
1
<C
Do
2.
If
H
2
≤G
then
3. Choose
M
(prob
1)
4.
Else
5. Choose
M
(prob
x)
6.
End
7. re
-
compute P
1
, P
2
, H
2
, and P
4
8.
End
9. Flag
i
node as the attacker
End
The
al
gorithm
init
ia
ll
y
check
s
for
a
c
ondi
ti
on
H
1
t
o
be
le
sser
c
om
par
ed
with
t
he
c
ut
-
off
val
ue
C
(Line
-
1).
T
he
com
pu
ta
ti
on
of
H1
is
car
ried
out
by
obta
inin
g
the
product
of
two
sig
nifican
t
info
rm
at
ion
vi
z.
i)
pro
bab
il
it
y
of
intr
us
io
n
a
nd
ii
)
com
plete
in
f
or
m
at
ion
of
pro
ba
bili
ty
(i.e.
,
certai
nty).
T
he
nex
t
ste
p
of
the
al
gorithm
is
to
c
heck
if
H
2
is
le
sser
th
an
the
em
pirical
value
of
G
(
Line
-
2).
H
ere,
H
2
can
be
de
fined
as
the
pr
ob
a
bili
ty
of
intr
us
i
on
wh
il
e
th
e
em
pirical
var
ia
ble
G
dep
e
nds
up
on
va
rio
us
e
xt
ern
al
param
et
e
rs,
e
.g.,
the
pro
fit
received
by
a
node
after
assist
in
g
it
to
forw
a
rd
a
data,
res
ources
dep
l
oyed
by
a
node
afte
r
assi
sti
ng
in
forw
a
r
ding
data,
an
d
pro
fi
t
ob
ta
ine
d
after
la
un
c
hing
an
at
ta
ck.
The
va
riable
G
can
al
so
be
de
fine
d
a
s
a p
r
oba
bili
ty
o
f
m
axi
m
al
p
ro
f
it
d
uri
ng the
in
trusion.
In s
uc
h
a case
, the
al
gorithm
ch
oos
es M
as a set
of act
io
n
represe
nting
f
orwa
rd
i
ng
of
th
e
data
pack
et
with
m
axi
m
u
m
pro
bab
il
it
y
(L
ine
-
3)
;
oth
e
rw
i
se,
it
com
pu
te
s
a
ne
w
pro
bab
il
it
y
(Line
-
5).
Finall
y,
the
al
go
rithm
updates
the
pro
bab
il
it
y
sc
or
e
,
i.e.,
P
1
(
Pr
oba
bili
ty
of
reg
ula
r
node
),
P
2
(
pro
bab
il
it
y
of
dat
a
dro
pp
i
ng),
a
nd
H
2
(
Pro
bab
i
li
ty
of
intr
us
io
n)
a
nd
P
4
(P
r
obabili
ty
of
inc
om
plete
inf
or
m
at
ion
)
(
Line
-
7).
All
this
com
pu
ta
ti
on
is
carried
out
by
the
so
ur
ce
node
f
or
it
s
i
m
m
e
diate
neig
hbor
node
and
base
d
on
this
pr
oba
bili
ty
co
m
pu
ta
ti
on
;
the
al
gorith
m
m
akes
a
decisi
o
n
of
fla
gg
i
ng
the
node
to
be
a
m
a
li
ci
ou
s
no
de.
Af
te
r
the
i
den
ti
ficat
io
n
of
the
node
is
over
,
the
ne
xt
ta
sk
is
to
offe
r
pr
e
ve
ntive
m
easure
against
th
e
m
al
ic
iou
s
no
de.
The
al
gorith
m
resp
on
si
ble
for
pr
e
ve
ntin
g
the
node
f
r
om
fu
rthe
r
int
rudin
g
is
as fo
ll
ows:
Evaluation Warning : The document was created with Spire.PDF for Python.
IS
S
N
:
20
88
-
8708
In
t J
Elec
&
C
om
p
En
g,
V
ol. 10,
No.
5,
Oct
ob
e
r 2
020
:
49
56
-
49
64
4960
Algorithm for prevention of attacker node
Input
: i (node), A (Award), P (Penalty)
Output
: isolation of i
Start
1.
If
i=attacker
2.
If
i
j
3. Allocate A
—
4.
Else
5. Allocate P
++
6.
update
all neighboring nodes & isolate
i
;
7.
End
End
The
a
bove
al
gorithm
is
respon
si
ble
f
or
res
ist
ing
the
further
s
pread
of
the
at
ta
ck.
T
his
al
gorithm
beco
m
es
f
un
ct
ion
al
only
afte
r
the
ide
ntific
a
ti
on
of
the
i
th
node
as
a
n
at
t
acker
no
de
fro
m
the
pr
io
r
al
gorith
m
(Line
-
1).
Dif
fe
ren
t
from
any
existi
ng
intr
usi
on
preve
ntio
n
a
ppro
ac
h,
th
e
pro
posed
syst
e
m
do
es
n'
t
directl
y
stop
t
he
m
al
ic
i
ou
s
no
de,
but r
at
her
,
it
ch
ec
ks t
he
inte
ntion o
f
the m
al
ic
iou
s nod
e
. If
t
he
pr
ob
a
bili
ty
calc
ulati
on
carried
out
by
the
re
gu
la
r
s
ource
node,
s
ugge
st
that
a
m
al
ic
iou
s
no
de
is
assist
ing
in
forw
a
r
ding
the
data
pack
et
tha
n
it
is
al
lowe
d
to
do
s
o.
I
nteresti
ng
ly
,
once
t
he
re
gu
la
r
node
has
i
den
ti
fie
d
t
hat
the
ot
her
node
is
m
al
ic
iou
s
(Lin
e
-
1)
an
d
has
a
har
m
fu
l
intenti
on,
it
cal
culat
es
the
pro
ba
bili
t
y
of
at
ta
ck.
If
t
he
pr
ob
a
bili
ty
o
f
a
n
at
ta
ck
is
ver
y
low
(irr
es
pec
ti
ve
of
bein
g
a
m
al
ic
iou
s
node
),
it
is
pe
r
m
itted
to
f
orward
the
data
pack
et
.
Howe
ver,
wh
il
e
do
in
g
so,
the
m
alici
ou
s
ob
t
ai
ned
a
reduce
d
am
ou
nt
of
a
ward
(Lin
e
-
3)
from
the
so
urc
e
node.
Hen
ce
, th
is m
e
chan
ism
o
ptim
iz
es even
t
he
m
al
ic
iou
s n
ode
in
a h
ig
hly co
ntr
olled envir
onm
ent to assist i
n
data
pack
et
f
orwa
r
ding.
Mo
re
ov
e
r,
bette
r
c
on
t
r
ol
over
the
vulnera
ble
sit
uation
is
m
ade
by
al
locat
ing
the
on
ly
r
e
d
u
c
e
d
v
a
l
u
e
o
f
i
n
c
e
n
t
i
v
e
a
s
a
n
a
w
a
r
d
;
o
t
h
e
r
w
i
s
e
,
t
h
e
y
a
r
e
a
l
l
o
c
a
t
e
d
w
i
t
h
p
e
n
a
l
t
y
v
a
l
u
e
(
L
i
n
e
-
5
)
.
O
n
t
h
e
o
t
h
e
r
s
i
d
e
,
t
h
e
al
gorithm
a
lso
chec
ks
for
if
there
was
a
ny
fo
rm
of
err
or
in
flag
ging
the
oth
e
r
no
de
as
a
m
alici
ou
s
node.
In
orde
r
to
a
vo
id
any
form
of
false
posit
ive
i
n
fla
gg
i
ng
the
oth
e
r
no
de
as
t
he
m
al
iciou
s
node
,
the
re
gu
la
r
no
de
double
ch
eck
the
local
as
well
as
a
global
tr
us
t
fact
or
f
or
the
ta
r
geted
no
de
from
al
l
the
neig
hbori
ng
node
of
the
ta
rget
ed
node.
I
t
is
beca
use
as
pe
r
the
te
st
-
en
vironm
ent
-
1,
t
he
re
gula
r
node
sho
uld
g
et
the
hi
gh
est
a
w
ard
i
f
they
can
posit
ively
captu
re
th
e
at
ta
cker
node
;
howe
ver
,
thi
s
m
igh
t
be
c
ha
ll
eng
in
g
du
e
t
o
te
st
env
ir
onm
ent
-
2
and
te
st
en
vir
on
m
ent
-
3.
I
n
s
uch
a
case
,
th
e
at
ta
ck
infor
m
at
ion
will
be
vague
an
d
im
pro
per
,
a
nd
th
ere
are
pro
bab
il
it
ie
s
of
er
ror
in
flag
ging
co
rr
ect
ly
.
Hen
ce
,
in
s
uc
h
case,
t
he
re
gu
la
r
node
is
al
so
pe
naliz
ed
if
they
m
ake a
m
ist
ak
e of f
la
gg
i
n
g a
wrong n
ode int
o
m
al
ic
iou
s.
The
com
plete
idea
of
the
pr
e
ve
ntion
te
c
hn
i
qu
e
a
dopte
d
in
the
propose
d
syst
e
m
i
s
as
fo
ll
ows:
Wh
e
ne
ver
a
node
m
akes
any
decisi
on
of
unde
rtaki
ng
a
ta
sk
(it
co
uld
be
rel
at
ed
to
f
orwardin
g
beac
on/data
,
rej
ect
in
g
f
orwa
rd
i
ng
data,
rais
ing
a
n
al
arm
of
m
a
li
ci
ou
s
no
de,
la
unc
hing
a
n
at
ta
ck,
et
c.)
,
there
is
an
ince
ntive
al
locat
ion
for
i
t.
This
ince
ntive
is
al
locat
ed
in
the
form
of
awa
rd
an
d
pe
nalty
.
He
nce,
base
d
on
t
he
1
st
te
st
e
nv
i
ronm
ent,
bo
th
re
gula
r,
as
well
as
the
m
al
ic
iou
s
node
,
will
try
to
be
do
m
inant
with
each
oth
e
r;
ho
wev
e
r
m
al
ic
iou
s
node
does
so
wit
h
the
ca
utio
n
of
not
getti
ng
ca
ught
if
the
inc
om
plete
ness
a
bout
t
he
tr
us
t
f
act
or
is
sp
onta
neously
fo
un
d
to
be
increasi
ng
wit
h
increase
of
si
m
ula
ti
on
than
it
is
a
bette
r
scenari
o
to
te
ll
that
the
no
de
is
m
al
ic
iou
s
node.
I
nteresti
ngly
,
di
rect
detect
io
n
of
t
he
m
al
ic
io
us
node
m
akes
the
m
al
iciou
s
node
m
uch
m
or
e
a
war
e
of
the
s
urveil
la
nce
syst
e
m
;
hen
ce,
the
al
gorithm
cov
ertl
y
com
pu
te
s
an
d
co
nfi
r
m
about
the
il
le
gitim
ac
y
of
the
no
de
and
harness
them
to
hig
he
st
extent
to
f
or
ward
data
pa
cket.
I
n
su
c
h
case,
if
the
m
al
ic
iou
s
node
assist
s
in
f
orwardi
ng
data,
thei
r
m
otive
of
pr
es
enc
e
in
the
net
work
ne
ver
f
ulfill
s,
a
nd
instea
d,
t
hey
will
be
j
us
t
drai
ne
d
of
their
resource
s
onl
y
fo
r
as
sist
ing
in
data
f
orw
ard
i
ng.
The
m
om
ent
the
pr
ob
a
bili
ty
com
pu
ta
ti
on
pr
e
dicts
that
a
sp
eci
fic
m
alic
iou
s
no
de
c
ou
l
d
la
unc
h
a
n
at
ta
ck
in
it
s
ne
xt
ta
s
k
execu
ti
on,
the
y
are
offer
e
d
with
t
he
pen
al
ty
.
Once
the
m
al
ic
iou
s
n
ode
is
isolat
ed
,
t
he
routin
g
is
c
on
ti
nue
d,
and
in
form
at
io
n
ab
ou
t
the
su
c
cessf
ully
est
ablished
r
ou
ti
ng p
at
h
is
giv
e
n
m
or
e
weigh
ta
ge
,
and
al
l
inter
m
ediat
e
node
in
volves
get
increa
sed
t
ru
st
value
.
Thi
s
pr
i
nciple
of
secur
e
r
ou
ti
ng
by
ide
ntifyi
ng
m
al
ic
iou
s
beha
vi
or
app
li
es
to
any
form
of
ad
vers
aries
in
the
ad
-
hoc
wireless
netw
ork.
It
is
because
irre
spe
ct
ive
of
any
s
pecific
char
act
e
risti
cs
of
the
ad
ve
rsa
ry,
al
l
m
a
li
ci
o
us
node
s
init
ia
ll
y
m
i
m
ic
the
regular
no
de
to
gain
tr
us
t
an
d
then
init
ia
te
at
ta
ck
after
s
uitably
f
ind
in
g
an
ap
pr
opriat
e
ti
m
e.
The
ne
xt
sect
io
n
of
the
pa
pe
r
discusse
s
t
he
r
esults
ob
ta
ine
d
a
fter
im
ple
m
enting
t
he pr
opos
e
d
l
ogic
.
3.
RESU
LT
S
ANA
L
YS
I
S
The
pr
im
e
strat
egy
of
the
propose
d
a
naly
sis
is
to
assess
the
pe
rfor
m
ance
of
the
ide
nt
ific
at
ion
of
the
m
alic
iou
s
node
as
well
as
trace
out
the
resp
ect
ive
pe
rfor
m
ance
of
the
data
f
orwardi
ng
featu
res.
A
secure
routin
g
pr
oto
c
ol
can
be
only
sai
d
to
be
rob
us
t
it
is
capab
le
of
m
ain
ta
inin
g
a
good
bala
nce
be
tween
the
secur
it
y
as
well
as
the
data
fo
r
wardin
g
pe
rfor
m
ance.
The
scriptin
g
of
the
pr
op
os
ed
l
og
ic
was
car
ri
ed
out
in
MATL
AB
over
the
norm
al
64
-
bit
wind
ows
platf
or
m
.
The
sim
ulatio
n
env
i
ronm
ent
c
on
sist
s
of
20
0
m
ob
il
e
Evaluation Warning : The document was created with Spire.PDF for Python.
In
t J
Elec
&
C
om
p
En
g
IS
S
N:
20
88
-
8708
A novel
sec
ur
e
ro
uti
ng sch
e
me
u
si
ng p
r
obabil
ist
ic
m
odel
li
ng for bett
er re
sis
ti
vi
ty
a
ga
i
ns
t ..
.
(
Jyoti
Neel
i
)
4961
nodes
c
om
bin
ing
bo
t
h
re
gu
la
r
an
d
m
a
li
ci
ou
s
nodes
with
no
direct
in
pu
t
of
node
ide
ntit
y
fo
r
m
al
icious
n
ode
pr
i
or
to
sim
ula
ti
on
.
T
he
asses
sm
ent
is
carried
out
with
res
pect
to
thr
oughput,
r
outi
ng
over
hea
d,
la
te
nc
y,
and
processi
ng
ti
m
e.
A
com
par
at
ive
analy
sis
is
carried
out
w
it
h
resp
ect
to
SEAD
[
43
]
an
d
SRP
[
44
]
protoc
ol,
wh
ic
h
is al
s
o
s
ecur
e
d routi
ng
schem
es
in the a
d
-
hoc
wireles
s n
et
work.
The
gr
a
phic
al
ou
tc
om
e
sh
ow
s
that
the
pro
pose
d
s
yst
em
of
fe
rs
bette
r
th
r
oughput
see
Fi
gure
2
a
nd
lowe
r
r
outi
ng
ov
e
r
head
see
F
igure
3
com
pared
to
existi
ng
SRP
an
d
SEAD
pr
oto
c
ol.
T
he
pr
im
e
reason
be
hind
the
thr
oughput
i
m
pr
ov
em
en
t
is
that
the
propose
d
syst
e
m
of
fer
s
bette
r
f
orm
ula
ti
on
s
of
r
ou
te
s
in
faster
track
as
it
has
fr
e
quent
updates
a
bout
the
global
tr
ust
values.
M
oreov
e
r,
t
he
ad
opti
on
of
pro
ba
bili
ty
based
m
od
el
in
g
furthe
r boosts
up the
proces
s
of ex
plorin
g
a
nd c
onfirm
ing
t
he
sec
ur
e
d pat
h.
T
h
e
o
u
t
c
o
m
e
s
h
o
w
n
i
n
F
i
g
u
r
e
4
e
x
h
i
b
i
t
s
t
h
a
t
t
h
e
r
e
i
s
a
c
o
n
s
i
d
e
r
a
b
l
y
l
o
w
e
r
r
o
u
t
i
n
g
o
v
e
r
h
e
a
d
.
A
c
l
o
s
e
r
l
oo
k
into
Fi
gures
2
-
4
s
hows
that
i
ncr
ease
of
m
alici
ou
s
nodes
in
te
rm
s
of
pe
rce
ntil
e
do
e
sn
'
t
offer
m
any
chall
eng
e
s
to
com
m
un
ic
at
ion
pe
rfor
m
anc
e.
A
s
the
m
ob
il
e
node
s
acc
ess
their
r
ou
ti
ng
ta
ble
from
their
s
har
e
d
m
e
m
or
y,
hen
ce
,
obta
ini
ng
global
trust
factor
is
quit
e
faster.
Mo
reover
,
the
pro
po
sed
syst
em
of
f
ers
faster
proc
essing
tim
e
see
Figu
r
e
5
as
it
has
no
incl
us
io
n
of
any
it
erati
ve
operati
on,
e.
g.
,
encr
y
ption
as
well
as
it
does
n'
t
have
any
d
e
p
e
n
d
e
n
c
y
o
f
s
t
o
r
i
n
g
a
n
y
s
e
c
r
e
t
k
e
y
s
a
s
a
u
t
h
e
n
t
i
c
a
t
i
o
n
i
s
a
l
w
a
y
s
d
o
n
e
w
h
e
n
d
e
m
a
n
d
e
d
.
T
h
e
r
e
f
o
r
e
,
t
h
e
p
r
o
p
o
s
e
d
syst
e
m
can
be sa
id to
off
e
r be
tt
er s
ecu
rity
o
pt
ion
s c
os
t
-
e
ff
ec
ti
vely
.
Figure
2. Com
par
at
ive
an
a
ly
s
is of th
rou
ghpu
t
Figure
3. Com
par
at
ive
an
al
ys
is of r
outi
ng ov
erh
ea
d
Figure
4
.
Com
par
at
ive
an
al
ys
is of r
outi
ng lat
ency
Figure
5
.
Com
par
at
ive
an
al
ys
is of pr
ocessin
g
ti
m
e
Evaluation Warning : The document was created with Spire.PDF for Python.
IS
S
N
:
20
88
-
8708
In
t J
Elec
&
C
om
p
En
g,
V
ol. 10,
No.
5,
Oct
ob
e
r 2
020
:
49
56
-
49
64
4962
4.
CONCL
US
I
O
N
S
e
c
ur
i
t
y
br
e
a
c
h
a
n
d
v
ul
ne
r
a
b
i
l
it
y
ha
s
a
l
w
a
ys
be
e
n
a
s
i
g
ni
f
i
c
a
nt
t
hr
e
a
t
t
o
t
he
a
d
-
ho
c
w
i
r
e
l
e
s
s
ne
t
w
or
k
ow
i
n
g
t
o
t
he
l
ac
k
of
c
e
nt
r
a
l
i
z
e
d
a
r
c
hi
t
e
c
t
ur
e
.
E
xi
s
t
i
ng
a
pp
r
o
a
c
he
s
a
r
e
qu
i
t
e
s
pe
c
i
f
i
c
t
o
t
he
f
or
m
s
of
t
he
t
hr
e
a
t
s,
a
nd
he
nc
e
,
t
he
y
a
r
e
s
l
i
gh
t
ly
no
n
-
p
r
a
c
t
i
c
a
l
w
he
n
t
he
a
pp
l
i
c
a
t
i
on
of
t
he
a
d
-
h
oc
w
i
r
e
l
e
s
s
ne
t
w
or
k
i
s
e
x
po
s
e
d
t
o
t
he
di
f
f
e
r
e
nt
a
d
ve
r
s
a
r
y
.
H
e
nc
e
,
t
he
pr
op
os
e
d
s
y
s
t
em
a
dd
r
e
s
s
e
s
t
hi
s
pr
o
bl
em
by
de
ve
l
o
pi
ng
a
pr
ob
a
bi
l
i
ty
m
od
e
l
t
ha
t
i
s
c
a
pa
bl
e
of
i
de
nt
i
f
y
i
ng
t
he
m
a
li
c
i
ou
s
be
ha
vi
or
of
n
od
e
a
n
d
he
nc
e
i
s
e
f
f
e
c
t
i
ve
a
ga
i
ns
t
t
he
m
a
xi
m
u
m
nu
m
be
r
of
a
t
t
a
c
ks
.
T
he
c
on
t
r
i
b
ut
i
on
of
t
he
p
r
op
os
e
d
s
t
u
dy
a
r
e
a
s
f
ol
l
ow
s
:
i
)
w
i
t
ho
ut
a
ny
us
a
ge
of
e
nc
r
y
pt
i
on
,
t
he
pr
op
os
e
d
s
y
s
t
em
i
s
c
a
pa
bl
e
of
i
de
nt
i
f
y
i
ng
a
n
d
r
e
s
i
s
t
i
ng
t
he
t
hr
e
a
t
,
i
i
)
a
s
uc
c
e
s
s
f
ul
i
m
pl
em
e
nt
a
ti
on
of
a
n
a
t
t
a
c
ke
r
m
od
ul
e
un
de
r
t
hr
e
e
c
ha
l
l
e
ng
i
ng
t
e
s
t
e
nv
i
r
on
m
en
t
i
s
c
a
r
r
i
e
d
ou
t
t
o
s
ho
w
e
nh
a
nc
e
d
s
c
o
p
e
a
nd
a
pp
l
i
c
a
bi
l
it
y
,
ii
i
)
it
a
l
s
o
of
f
e
r
s
f
a
s
t
e
r
up
d
a
t
e
d
of
n
on
-
s
t
a
l
e
i
nf
or
m
a
t
i
on
un
l
i
ke
t
he
c
on
ve
nt
i
on
a
l
s
e
c
ur
e
d
r
ou
t
i
ng
a
pp
r
oa
c
he
s
,
a
nd
i
v)
p
r
op
os
e
d
s
y
s
t
e
m
of
f
e
r
s
be
t
t
e
r
da
t
a
f
or
w
a
r
di
n
g
pe
r
f
or
m
a
nc
e
i
n
c
on
t
r
a
s
t
t
o
e
xi
s
t
i
ng
s
e
c
ur
i
t
y
s
c
he
m
e
.
REFERE
NCE
S
[1]
H.
Sedjelm
ac
i
,
e
t
al.
,
“
Intrusion
det
e
ct
ion
and
ejec
t
ion
fra
m
ewor
k
against
l
et
ha
l
at
t
ac
ks
in
UA
V
-
ai
ded
net
works
:
A
Ba
y
esi
an
ga
m
e
-
the
ore
t
ic
m
e
thodol
og
y
,
”
in
I
EE
E
Tr
ansacti
o
ns
on
Inte
ll
ige
n
t
Tr
anspo
rtati
on
Syste
ms
,
vol.
18
,
no.
5
,
p
p
.
1143
-
1153,
Ma
y
2017
.
[2]
L.
P
y
cro
f
t
and
T
.
Z.
Aziz,
“
Se
cur
ity
of
implan
ta
bl
e
m
edi
c
al
d
evi
c
es
with
wir
el
ess
conn
ec
t
ion
s:
The
dangers
of
c
y
b
er
-
a
tt
a
cks,
”
i
n
Ex
p
ert Re
v
ie
w
of
Me
d
ic
al
Dev
i
ce
s
,
vo
l. 15, no.
6,
pp
.
403
-
406
,
2018.
[3]
X.
Geng,
e
t
al.
,
“
Defe
nding
wire
le
ss
infra
struc
tur
e
against
the
ch
al
l
enge
of
DD
oS
at
tacks,
”
Mob
i
le
Net
wor
ks
and
Appl
ic
a
ti
ons,
vo
l.
7
,
no
.
3
,
pp
.
21
3
-
223,
2002
.
[4]
H.
Deng,
et
al.
,
“
Thre
shold
and
ide
ntit
y
-
base
d
k
e
y
m
ana
gement
and
au
the
nt
ic
a
tion
for
wire
le
ss
a
d
hoc
n
et
works
,
”
in
Inte
rnat
ional
C
onfe
renc
e
on
I
nformation
Tech
nology
:
Coding
and
Computing,
2004.
Proc
ee
di
ngs.
ITCC
2004
,
vol.
1
,
pp
.
107
-
1
11,
2004
.
[5]
S.
Yi
and
R
.
Kra
vet
s,
“
MO
CA:
Mobile
ce
rt
ifica
t
e
au
thori
t
y
for
wire
l
ess a
d
ho
c
n
e
tworks,”
IDE
ALS
,
2004
.
[6]
H
.
F.
R
ashva
nd
and
H
.
C
.
Ch
ao,
“
D
y
na
m
ic
Ad
Hoc
Networks,”
The
Insti
tut
ion
of
Engi
n
ee
ring
and
Technol
og
y
,
p
p.
447
,
2013
.
[7]
S.
Kuros
awa
,
et
al
.
,
“
Detect
ing
bla
ckho
le
attac
k
on
A
OD
V
-
base
d
m
obil
e
ad
hoc
net
works
by
d
ynamic
le
arn
ing
m
et
hod,
”
Inte
rn
ati
onal Journal of
Ne
twork
Se
cu
rity
,
vol
.
5
,
no
.
3
pp.
338
-
346,
20
07.
[8]
S.
Sharm
il
a
and
T.
Shanth
i,
“
A
s
urve
y
on
wire
le
s
s
ad
hoc
n
et
wor
k:
Iss
ues
and
implementation,
”
2
016
Inte
rnationa
l
Confe
renc
e
on
E
merging
Tr
ends
in
Eng
ine
ering
,
Technol
ogy
and
Sci
en
ce (
ICETETS)
,
Pudukkotta
i
,
pp
.
1
-
6
,
2016
.
[9]
S.
Megue
rdic
h
ia
n,
et
a
l.
,
“
Cover
age
probl
ems
in
wire
le
ss
ad
-
hoc
sensor
net
works
,
”
Proceedi
ngs
I
EE
E
INFOCOM
2001.
Conf
ere
nc
e
on
Comput
er
Comm
unic
ati
ons.
Tw
entiet
h
Ann
ual
Jo
int
Con
fe
r
enc
e
of
the
IE
E
E
Computer
and
Comm
unic
ati
ons Soc
i
et
y
(
Cat.
N
o.
01CH37213)
,
Anchora
ge
,
AK
,
U
SA
,
vol. 3, pp. 1380
-
1387,
200
1.
[10]
V.
Ramasam
y
,
“
Rec
en
t
adva
n
ce
s
in
ad
-
hoc
net
w
orks,
”
2017
6th
Inte
rnational
Co
nfe
renc
e
on
Re
liabili
t
y,
Info
com
Technol
ogi
es
an
d
Optimizati
on
(
Tr
ends
and
Fut
u
re
Direc
t
ions)
(
I
CRITO)
,
Noida,
pp.
132
-
132
,
20
17.
[11]
A.
Vij
and
V.
S
ha
rm
a,
“
Secur
ity
issues
in
m
obil
e
adhoc
net
work:
A
survey
pap
er,
”
2016
Inte
rnati
onal
Confe
renc
e
on
Computing,
Comm
unic
ati
on
and
Aut
omat
ion (
ICCCA
)
,
Noida, pp. 561
-
566,
20
16.
[12]
M.
S.
Athul
y
a
a
nd
V.
S.
Sheeb
a,
“
Secur
ity
in
Mo
bil
e
Ad
-
Hoc
Ne
t
works
,
”
2012
Thir
d
Int
ernati
ona
l
Confe
renc
e
on
Computing,
Co
mm
unic
ati
on
an
d
Net
work
ing
Te
chnol
ogi
es
(
ICCCNT
'12
)
,
Coim
bat
ore
,
pp
.
1
-
5
,
2
012.
[13]
R.
K.
Singh
and
P.
Nand,
“
Li
ter
at
ure
rev
i
ew
of
routi
ng
a
ttacks
i
n
MA
NET,
”
20
16
Inte
rnationa
l
Confe
renc
e
on
Computing,
Co
mm
unic
ati
on
an
d
Au
tomat
ion
(
ICCCA)
,
Noida,
pp.
525
-
530
,
20
16
.
[14]
Margi,
Cíntia
B.
,
Marc
os
A.
Simpl
ic
io
Jr,
Mats
Naslund,
Bruno
T.
de
Oliveira
,
Paulo
SLM
Barr
e
to,
Ric
h
ard
Gold,
Gus
ta
vo
T.
d
e
Sous
a,
and
T
er
ez
a
CMB
Carv
al
ho,
“
Im
pac
t
o
f
oper
ating
s
y
st
ems
on
wire
le
ss
sensor
net
work
s
(sec
urity
)
a
ppl
i
ca
t
ions
and
te
s
tbe
ds,”
In
201
0
Proceedi
ngs
of
19th
Inte
rna
ti
onal
Con
fe
ren
ce
on
Compute
r
Comm
unic
ati
ons and
Ne
tworks
,
I
EE
E
,
pp
.
1
-
6
,
20
10.
[15]
A.
Kanna
m
m
al
and
S.
S.
Ro
y
,
“
Surve
y
on
s
ec
ure
rou
ti
ng
i
n
m
obil
e
ad
ho
c
net
works
,
”
2
016
Inte
rnation
a
l
Confe
renc
e
on
A
dvanc
es
in
Hum
an
Mac
hin
e
In
ter
act
ion
(
HMI)
,
Doddaba
llapur,
pp.
1
-
7
,
2016
.
[16]
V
.
S
.
B
h
a
r
g
a
v
i
,
e
t
a
l
.
,
“
A
h
y
b
r
i
d
s
e
c
u
r
e
r
o
u
t
i
n
g
s
c
h
e
m
e
f
o
r
M
A
N
E
T
S
,
”
2
0
1
6
I
n
t
e
r
n
a
t
i
o
n
a
l
C
o
n
f
e
r
e
n
c
e
o
n
E
m
e
r
g
i
n
g
T
r
e
n
d
s
i
n
E
n
g
i
n
e
e
r
i
n
g
,
T
e
c
h
n
o
l
o
g
y
a
n
d
S
c
i
e
n
c
e
(
I
C
E
T
E
T
S
)
,
P
u
d
u
k
k
o
t
t
a
i
,
p
p
.
1
-
5
,
2
0
1
6
.
[17]
H.
Yang,
et
al.
,
“
Secur
ity
in
m
obi
le
ad
hoc
ne
tworks:
cha
llenges
a
nd
soluti
ons,
”
in
IEE
E
Wireless
Comm
unic
ati
ons
,
vol.
11
,
no
.
1
,
pp
.
38
-
47
,
2004
.
[18]
J.
Nee
li
and
N.
K.
Cauve
r
y
,
“
Insight
to
rese
a
rch
progre
ss
on
sec
ure
routi
ng
in
wire
le
ss
A
d
H
oc
net
work,
”
Inte
rnational
Jo
urnal
of Adv
an
c
ed
Computer
S
cienc
e
and
Appl
i
c
ati
ons,
vo
l. 8, no
.
6
,
2017
.
[19]
N.
Sharm
a,
et
al
.
,
“
Provisioning
of
Qualit
y
of
Servic
e
in
MA
NETs
per
form
anc
e
an
aly
s
is
&
compari
s
on
(AO
DV
and
DSR),
”
2010
2nd
Inte
rnational
C
onfe
renc
e
on
Computer
Engi
ne
ering
and
Technol
ogy
,
Chengd
u
,
pp.
V7
-
243
-
V7
-
248,
2010
.
[20]
R.
M.
Chint
alap
al
li
and
V
.
R
.
Ananthula,
“
M
-
Li
onW
hal
e:
m
ult
i
-
obje
c
ti
ve
opti
m
i
sati
on
m
odel
for
sec
ure
routi
ng
i
n
m
obil
e
ad
-
ho
c
n
et
work,
”
IET
Co
mm
unic
ati
ons
,
v
ol.
12
,
no
.
12
,
pp
.
1406
-
1415
,
20
18.
[21]
P.
Yada
v
and
M
.
Gaur,
“
A
b
eha
viour
al
the
or
y
for
int
rusion
det
e
ct
ion
s
y
st
e
m
in
m
obil
e
ad
-
hoc
net
works
,
”
i
n
Proce
ed
ings
of
the
2nd
Inter
nati
onal
Conf
ere
nce
on
Hig
h
Pe
rform
ance
Compilat
ion,
Computing
and
Comm
unic
ati
ons
,
pp
.
51
-
60
,
201
8.
Evaluation Warning : The document was created with Spire.PDF for Python.
In
t J
Elec
&
C
om
p
En
g
IS
S
N:
20
88
-
8708
A novel
sec
ur
e
ro
uti
ng sch
e
me
u
si
ng p
r
obabil
ist
ic
m
odel
li
ng for bett
er re
sis
ti
vi
ty
a
ga
i
ns
t ..
.
(
Jyoti
Neel
i
)
4963
[22]
T.
Zhe
ng
,
e
t
a
l.
,
“
Ph
y
sic
al
Layer
Secur
ity
in
W
ire
le
ss
Ad
Hoc
Networks
U
nder
A
H
y
brid
Full
-
/Hal
f
-
Dupl
e
x
Rec
e
ive
r
Deplo
ym
ent
Strateg
y
,
”
in
IE
EE
Tr
ansac
ti
ons
on
W
irel
es
s
Comm
unic
ati
o
ns
,
vol.
16,
no.
6
,
pp.
3827
-
3839
,
Jun
.
2017.
[23]
S
.
S
.
A
l
i
a
n
d
B
.
V
.
V
.
S
.
P
r
a
s
a
d
,
“
S
e
c
u
r
e
a
n
d
e
n
e
r
g
y
a
w
a
r
e
r
o
u
t
i
n
g
p
r
o
t
o
c
o
l
(
S
E
A
R
P
)
b
a
s
e
d
o
n
t
r
u
s
t
-
f
a
c
t
o
r
i
n
M
o
b
i
l
e
Ad
-
H
o
c
n
e
t
w
o
r
k
s
,
”
J
o
u
r
n
a
l
o
f
S
t
a
t
i
s
t
i
c
s
a
n
d
M
a
n
a
g
e
m
e
n
t
S
y
s
t
e
m
s
,
v
o
l
.
2
0
,
n
o
.
4
,
p
p
.
5
4
3
-
5
5
1
,
2
0
1
7
.
[24]
N.
Girna
r
and
S.
Kaur,
“
Intrus
ion
det
e
ct
ion
fo
r
Adhoc
net
works
in
I
OT,
”
2017
Inte
rnational
Confe
renc
e
on
Inte
lligen
t
Comp
uti
ng
and
Contr
ol
Syst
ems (
ICICCS)
,
Madura
i, p
p.
110
-
114
,
201
7.
[25]
H
.
K
a
u
r
a
v
a
n
d
K
.
K
.
J
o
s
h
i
,
“
I
m
p
r
o
v
e
d
r
o
u
t
i
n
g
s
e
c
u
r
i
t
y
u
s
i
n
g
i
n
t
r
u
s
i
o
n
d
e
t
e
c
t
i
o
n
s
y
s
t
e
m
i
n
m
o
b
i
l
e
A
d
H
o
c
n
e
t
w
o
r
k
,
”
i
n
2017
I
n
t
e
r
n
a
t
i
o
n
a
l
C
o
n
f
e
r
e
n
c
e
o
n
T
r
e
n
d
s
i
n
E
l
e
c
t
r
o
n
i
c
s
a
n
d
I
n
f
o
r
m
a
t
i
c
s
(
I
C
E
I
)
,
T
i
r
u
n
e
l
v
e
l
i
,
p
p
.
1
7
2
-
1
7
6
,
2
0
1
7
.
[26]
H.
Ma
y
adunn
a,
et
al.
,
“
Im
proving
truste
d
routi
ng
b
y
ide
nt
if
y
ing
m
al
ic
ious
nodes
in
a
MA
NET
using
rei
nforc
emen
t
le
arn
ing,
”
2017
Sev
en
teenth
In
te
rnational
Con
fe
renc
e
on
Ad
v
ance
s
in
ICT
f
or
Eme
rging
R
egi
ons
(
ICTer
)
,
Colom
bo,
pp.
1
-
8,
2017
.
[27]
S.
Sam
ree
n
an
d
M.
A.
Jabba
r,
“
Counte
rm
eas
ure
s
for
Confli
ct
ing
B
eha
v
ior
Atta
ck
in
a
T
rust
Mana
geme
nt
Fram
ework
for
a
Mobile
Ad
ho
c
Network,
”
20
17
IEE
E
Inte
rn
ati
onal
Confe
re
nce
on
Computa
ti
onal
Intelli
g
en
ce
and
Computing Re
search
(
ICCIC)
,
Coim
bat
ore
,
pp.
1
-
4
,
2017
.
[28]
A.
M.
Shabut,
et
al
.
,
“
Mali
ci
ous
inside
r
thre
a
ts
in
ta
ctic
al
MA
NET:
The
p
erf
or
m
anc
e
ana
l
y
sis
of
DS
R
routi
ng
protoc
ol
,
”
2
017
IEE
E
Re
g
ion
10
Hum
anit
arian Tec
hnolog
y
Conf
e
renc
e
(
R1
0
-
HT
C)
,
Dhaka
,
pp.
1
87
-
1
9
2
,
2017
.
[29]
E.
A.
Sham
s
and
A
.
Riz
ane
r
,
“
A
novel
support
vec
tor
m
ac
hin
e
base
d
int
rusion
det
e
ct
ion
s
y
s
te
m
for
m
obil
e
ad
hoc
net
works
,
”
Wire
le
ss
Net
works
,
v
ol.
24
,
no
.
5
,
pp
.
1821
-
1829,
201
8.
[30]
J.
Guo,
et
a
l.
,
“
A
new
trust
m
ana
gement
fra
m
ework
for
det
e
ct
ing
m
al
ic
ious
and
se
lfi
sh
beha
viour
f
or
m
obil
e
ad
ho
c
net
works
,
”
201
1
IEE
E
10th
I
nte
rnational
Co
nfe
renc
e
on
Tr
ust,
Se
curit
y
a
nd
Priv
ac
y
in
Computing
and
Comm
unic
ati
ons
,
Changsha
,
pp
.
142
-
149,
2011
.
[31]
A.
K.
Tri
v
edi,
et
al
.
,
“
A
sem
i
-
distri
bute
d
rep
ut
at
i
on
base
d
int
rusi
on
det
e
ct
ion
s
y
s
te
m
for
m
obil
e
adhoc
ne
tworks,
”
arXiv
:1006.
1956
,
2010
.
[32]
S.
H.
Schnei
d
er
,
et
a
l.,
“
As
sess
i
ng
ke
y
vulne
r
ab
il
ities
and
the
r
i
sk
from
cl
imate
cha
nge
,
”
C
li
mat
e
Change
2007:
Impact
s,
Adapt
a
ti
on
and
Vul
n
erabil
ity.
Contrib
uti
on
of
Workin
g
Gr
oup
II
to
the
Fourth
Assess
ment
Re
port
o
f
the
In
te
rgov
ernment
al Pane
l
on
Cli
mate
Change, Cambridge
Uni
ve
rs
it
y
Press,
Ca
mbr
idge
,
UK,
pp
.
779
-
810
,
2007
.
[33]
R.
A.
Sow
ah,
et
a
l.
,
“
Detect
io
n
and
Prev
ent
io
n
of
Man
-
in
-
th
e
-
Middle
Spoofing
Attacks
in
M
AN
ET
s
Us
in
g
Predic
ti
v
e
T
ec
hn
ique
s in
Arti
ficia
l
Neura
l
Networ
ks (ANN
),
”
Journal
of
Computer
Net
works and
C
omm
unic
ati
ons
,
vol.
2019
,
pp
.
1
-
14,
2019
.
[34]
M.
A
.
Z
ant
and
A
.
Yasin,
“
Avoiding
and
Isol
at
ing
Flood
ing
Atta
ck
b
y
Enh
a
nci
ng
AO
DV
MA
NET
Protocol
(AIF
_AODV)
,
”
Sec
urit
y
and
Co
mm
unic
ati
on
N
e
tworks,
vol
.
201
9,
pp
.
1
-
12
,
201
9.
[35]
R
.
R
.
Chanda
n
a
nd
P
.
K
.
Mishra,
“
A
Revi
ew
of
S
ec
uri
t
y
Ch
al
l
eng
es
in
Ad
-
Hoc
Ne
twork,
”
Inte
rnat
i
onal
Journal
of
Appl
ie
d
Eng
inee
ring R
ese
arch
,
v
ol.
13
,
no
.
22
,
pp
.
16117
-
16126
,
2018.
[36]
J.
V.
Vad
a
vi
an
d
A
.
G.
Sugav
i,
“
Dete
ction
of
b
la
ck
hole
atta
ck
in
enh
anced
ao
dv
protoc
o
l,
”
20
17
Inte
rnationa
l
Confe
renc
e
on
Computing
and
Comm
unic
ati
on
Technol
og
ie
s
for
Smar
t
Nati
on
(
IC3
TSN
)
,
Gurgaon,
pp.
118
-
123
,
20
17.
[37]
M.
Faisal
,
e
t
al.
,
“
Ide
nti
t
y
atta
ck
det
ection
s
y
s
tem
for
802.
11
-
base
d
ad
h
o
c
n
e
t
w
o
r
k
s
,
”
E
U
R
A
S
I
P
J
o
u
r
n
a
l
o
n
W
i
r
e
l
e
s
s
C
o
m
m
u
n
i
c
a
t
i
o
n
s
a
n
d
N
e
t
w
o
r
k
i
n
g
,
v
o
l
.
2
0
1
8
,
p
p
.
1
2
8
-
1
4
4
,
2
0
1
8
.
[38]
A
.
Abdulla
h,
et
al
.
,
“
Data
col
l
ection
al
gori
thm
for
wire
le
ss
sens
or
net
works
usin
g
col
la
bor
at
iv
e
m
obil
e
el
ements
,
”
Inte
rnati
onal
Jo
urnal
of El
e
ct
ro
nic
al
and
Comp
ute
r E
ng
ine
ering
(
IJE
CE)
,
vol
.
9
,
no.
3,
pp.
2131
-
3140,
2019
.
[39]
B.
Bhatia
,
et
al.
,
“
Ext
end
ed
Ba
ndwidth
Optimize
d
and
Ene
rg
y
Eff
icient
D
y
n
a
m
ic
Source
Ro
uti
ng
Protocol
i
n
Mobile
Ad
-
hoc
Networks,
”
Inter
nati
onal
Journ
al
of
Ele
ct
ri
cal
and
Computer
Engi
nee
ring
(
IJECE)
,
vol.
8,
no
.
3,
pp.
1460
-
1466
,
2018.
[40]
J.
Nee
li
and
N.
K.
Cauve
r
y
,
“
Fram
ework
for
Ca
pturi
ng
th
e
Intru
der
s
in
W
ire
l
ess
Adhoc
Networ
k
Us
ing
Zombie
Node,
”
i
n
Comp
ute
r Sc
ie
nc
e
On
-
li
ne
Confe
ren
ce
,
vol. 765, pp. 34
6
-
355,
20
18
.
[41]
M.
Tube
rqu
ia
and
C
.
He
rna
n
dez
,
“
New
Approac
hes
in
Co
gnit
ive
Radi
os
using
Evol
ut
ion
ar
y
Algorit
hm
s,
”
Inte
rnational
Jo
urnal
of El
e
ct
ri
c
al
and
Comput
er
Engi
n
ee
ring
(
IJE
CE)
,
vol
.
8
,
no
.
3,
pp.
1636
-
164
6,
2018
.
[42]
A.
N.
Jati
,
et
a
l.
,
“
Com
par
ison
Anal
y
sis
of
Gai
t
Cla
ss
ifi
ca
t
ion
f
or
Hum
an
Motion
Ide
nti
fi
ca
t
ion
Us
ing
Embedd
ed
Com
pute
r,
”
Inter
nati
onal
Journal
of
El
ectric
al
and
Computer
E
ngine
ering
(
IJECE)
,
vol.
8,
no.
6,
pp.
5014
-
5020,
2018.
[43]
Y.
C.
Hu,
et al.
,
“
SEAD
:
Secur
e
e
ffic
i
ent
dist
ance
vec
tor
rou
ti
ng
fo
r
m
obil
e
wire
le
s
s
ad
hoc
ne
twor
ks,
”
Proc
ee
ding
s
Fourth
IE
EE Wo
rkshop on
Mobile
Computing
Sys
te
ms
and
App
lic
ati
ons
,
C
al
l
ic
oo
n,
NY
,
US
A,
pp
.
3
-
13,
2002.
[44]
Z.
L
iu,
e
t
al.
,
“
Secur
e
rou
ti
ng
pr
otoc
ol
bas
ed
tru
st
for
ad
hoc
netw
orks,
”
Ei
ghth
ACIS
Inte
rnatio
nal
Confe
renc
e
o
n
Soft
ware
Engi
n
ee
ring,
Arti
f
ic
ia
l
Inte
l
li
gen
ce,
Net
working
,
an
d
Parall
el/Distribute
d
Computi
ng
(
SNPD
200
7)
,
Qingdao,
pp
.
27
9
-
283,
2007
.
Evaluation Warning : The document was created with Spire.PDF for Python.
IS
S
N
:
20
88
-
8708
In
t J
Elec
&
C
om
p
En
g,
V
ol. 10,
No.
5,
Oct
ob
e
r 2
020
:
49
56
-
49
64
4964
BIOGR
AP
H
I
ES
OF
A
UTH
ORS
Jy
oti
Nee
l
i
,
is
cur
ren
t
l
y
a
r
ese
arc
h
schol
ar
in
RVCE
working
as
an
As
socia
t
e
profe
s
sor
in
Depa
rtment
of
I
nform
at
ion
scie
n
ce
&
Engi
ne
eri
n
g
Global
Aca
d
e
m
y
of
Technol
o
g
y
Beng
al
uru
.
She
has
completed
M
.
T
ec
h
in
Com
pute
r
Scie
n
ce
&
Engi
n
ee
rin
g
from
VTU.
She
has
a
tot
a
l
expe
ri
ence
of
17
y
e
ars
in
t
ea
ch
ing
and
6
y
e
ars
in
R
&D.
H
er
ar
ea
of
intere
st
inc
lud
es
Com
pute
r
net
works
,
Softw
are
te
sting
,
M
at
h
emati
c
al m
odel
s.
Dr.
N
.
K
.
Cau
very
,
is
Profess
or
in
Depa
rtmen
t
of
Inform
at
on
scie
nc
e
&
Eng
i
nee
ring
,
R
V
Coll
ege
of
Enginee
ring
,
B
enga
l
uru.
She
h
as
co
m
ple
te
d
Ph.
D
fr
om
VTU
with
re
sea
rch
ti
t
le
as
“
Rou
ti
ng
in
Co
m
pute
r
Network
using
Gene
ti
c
Algorit
hm
”.
She
has
to
ta
l
exp
er
ie
nc
e
of
20
y
e
ars
in
t
ea
ch
in
g
and
7
y
ea
rs
in
R&D.
Her
publ
ic
a
ti
ons
in
c
lude
s
pape
rs
both
in
nat
ion
al
and
int
ern
at
ion
al
co
nfe
ren
c
es
and
j
ourna
ls.
Her
a
rea
of
int
er
est
i
ncl
udes
Com
put
er
ne
twork
,
Com
pil
er
Desig
n,
Gen
et
i
c
Algor
it
hm
Evaluation Warning : The document was created with Spire.PDF for Python.