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
194
~120
1
I
S
SN
: 208
8-8
7
0
8
1
194
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
Investigating Op
en Issu
es in Sw
arm Intelligen
c
e for Mitigating
Securit
y
Threats
in MANET
Pradee
p K
u
m
a
r K
*
,
B
.
R. P
r
as
ad B
a
bu
*
*
* Dept of
CSE, J
N
TUK, Kakinad
a
(AP), Ind
i
a
** Dept. of CSE, SEA Colleg
e o
f
E
ngg & Techn
o
log
y
Bang
alore,
India
Article Info
A
B
STRAC
T
Article histo
r
y:
Received Feb 22, 2015
Rev
i
sed
Jun
11,
201
5
Accepted
Jun 28, 2015
The ar
ea o
f
Mobile Adhoc Network
(MANET) has being
a demanded topic
of res
ear
ch for
m
o
re than a d
e
c
a
de be
caus
e
of
i
t
s
attr
act
ive
com
m
unication
featur
es
as
s
o
cia
t
ed with va
rious
i
s
s
u
es
. This paper primarily
d
i
scu
sses on the
securit
y
issues,
which has b
een
still unsolv
e
d af
ter
abundant
res
earch
work.
The paper basically
stresses on
the potenti
al fe
a
t
ures
of S
w
arm
Intell
igen
ce
(SI) and i
t
s associa
t
ed
techn
i
que
s to m
itiga
t
e
the
securi
t
y
issues.
Majorit
y
o
f
the previous researches based
on SI
has used Ant Colon
y
O
p
tim
izat
io
n
(ACO) or P
a
rt
icl
e
S
w
arm
Optim
izat
ion (P
S
O
) extens
ivel
y.
Elabora
t
ed
discussion on SI
with respect to trust
management, auth
entication, and attack
m
odels are m
a
de with support of som
e
of the recen
t studies d
one in sam
e
area. Th
e pap
e
r
finally
concludes b
y
discussing the open issues and problem
identif
ic
ation
of
the r
e
view
.
Keyword:
An
t co
lon
y
o
p
t
i
m
izat
io
n
M
obi
l
e
a
d
h
o
c
net
w
or
k
Particle swarm op
ti
m
i
zatio
n
Security
Swarm
in
tellig
en
ce
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
:
Pr
ad
eep Ku
m
a
r
K,
Dept
o
f
C
S
E
,
J
N
TU
K,
Ka
ki
n
a
da
(A
P),
I
n
di
a.
Em
a
il: p
r
ad
eepk
u
m
ark
r
ishn
app
a
@g
m
a
il.co
m
1.
INTRODUCTION
In M
o
bi
l
e
Ad
hoc Net
w
o
r
k
s
(M
AN
ET)
[
1
]
,
n
odes a
r
e sel
f
-
o
r
g
ani
z
e
d
and u
s
e wi
rel
e
ss l
i
nks f
o
r
com
m
uni
cat
i
on bet
w
ee
n t
h
e
m
sel
v
es. They
dy
nam
i
cal
ly
form
a t
e
m
porar
y
net
w
o
r
k wi
t
h
out
usi
n
g a
n
y
e
x
i
s
t
i
n
g
net
w
or
k i
n
fras
t
ruct
u
r
e o
r
ce
nt
ral
i
zed a
d
m
i
ni
st
rat
i
o
n
.
T
h
e
s
e are o
f
t
e
n c
a
l
l
e
d i
n
fra
st
ru
ct
ure-l
e
ss
net
w
o
r
ki
n
g
si
nce t
h
e m
obi
le no
des i
n
t
h
e net
w
or
k dy
n
a
m
i
cal
ly
est
a
bl
ish r
out
i
n
g pat
h
s bet
w
ee
n t
h
em
sel
v
es. Exam
pl
es are
confere
n
ce, bat
tlefield, resc
ue
scena
r
ios, sensor net
w
or
ks placed in a
n
a
r
e
a
to m
onitor t
h
e environm
ent, m
e
sh
networks for
wireless Internet access et
c.
Routing sol
u
tions m
u
st address th
e nature
of the
network, and aim
at
m
i
nim
i
zi
ng cont
rol
t
r
a
ffi
c,
t
o
p
r
eser
ve
bo
t
h
ba
nd
wi
dt
h a
nd e
n
e
r
gy
at
n
ode
s. O
n
e
of t
h
e m
a
jor i
s
s
u
e
s
t
h
at
affect
s t
h
e
per
f
o
r
m
a
nce of
a
n
a
d
h
o
c
net
w
or
k i
s
t
h
e
wa
y
ro
ut
i
n
g i
s
i
m
pl
em
ent
e
d i
n
a
net
w
o
r
k
.
R
out
i
n
g
alg
o
rith
m
s
u
s
ed
in
con
v
e
n
tion
a
l wired
n
e
two
r
k
s
is im
p
r
actical in
ad
ho
c
network
s
du
e to its in
ab
ility to
ad
ap
t
t
o
t
h
e c
h
an
gi
n
g
t
o
pol
ogy
i
n
a
m
obi
l
e
en
vi
r
onm
ent
.
Ge
ner
a
l
l
y
, rout
i
n
g i
s
t
h
e p
r
oce
ss
of
di
sco
v
ery
,
sel
ect
i
n
g
,
an
d m
a
in
tain
in
g
p
a
th
s fro
m
a
so
urce
no
de to d
e
stin
ation
nod
e d
e
liv
er d
a
ta
p
a
ck
ets. Th
e
go
al
of
ev
er
y
rou
ting
al
go
ri
t
h
m
i
s
to di
rect
t
r
af
fi
c from
sourc
e
s t
o
dest
i
n
at
i
ons
,
m
a
xim
i
zi
ng net
w
o
r
k per
f
o
r
m
a
nce whi
l
s
t
minimizing costs. This is a
main
challenge in MANET. Be
cause t
h
e M
A
NET p
o
sse
sses
dy
nam
i
c and rand
om
characte
r
istics. Nodes
m
ove i
n
a
n
a
r
b
itrarily m
a
n
n
e
r an
d at ch
ang
i
ng
sp
eed
,
often
resu
ltin
g
in conn
ect
iv
ity
p
r
ob
lem
s
. Th
e h
i
gh
m
o
b
ility a
n
d
t
h
e arb
itrari
l
y
m
o
v
e
m
e
n
t
o
f
no
d
e
s in
MANET cau
s
es link
s
b
e
t
w
een
ho
sts to
brea
k fre
q
u
ent
l
y
.
Th
e
self-org
an
izin
g
features
o
f
rap
i
d
d
e
p
l
o
y
m
e
n
t
m
a
k
e
MANET very attractiv
e in
militar
y
appl
i
cat
i
o
ns a
n
d ea
rt
h
qua
ke
p
r
o
n
e
regi
o
n
s
w
h
ere
fi
xed
i
n
f
r
a
st
ruct
u
r
e i
s
n
o
t
av
ai
l
a
bl
e.
H
o
we
ve
r, t
h
e
dy
nam
i
c
n
a
ture of MANETs is easily v
u
l
n
e
rab
l
e to attack
. Misb
eh
av
i
o
r is
on
e
o
f
t
h
e m
a
j
o
r
prob
lem
s
in
M
A
NET
im
pl
em
ent
a
t
i
o
n.
It
m
a
y
seri
o
u
sl
y
de
gra
d
e
t
h
e
per
f
o
r
m
a
nce
of th
e network. It
can b
e
categ
o
rized
i
n
to selfish
[2
] and
m
a
lici
o
u
s
m
i
sb
eh
av
i
o
r [3
]. Selfish
n
o
d
e
s in
ten
tion
a
lly
misu
se th
e MAC p
r
o
t
oco
l
ru
les to
g
a
i
n
m
o
re
access than well behave
d node
s so that they can try
to save their bat
t
ery powe
r
wi
thout forwa
r
di
ng the
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
:
119
4
–
12
01
1
195
relayin
g
m
e
ssag
e
s.
In
ad
d
ition
,
t
h
ey do
no
t in
ten
d
to
i
n
vo
l
v
e th
em
selv
es
in
th
e
n
e
two
r
k d
a
m
a
g
i
n
g
acti
v
ities.
In case
of m
a
l
i
ci
ous m
i
sbeha
v
i
o
r, m
a
l
i
c
i
ous
no
des i
n
t
e
n
d
t
o
di
s
r
u
p
t
t
h
e
n
o
rm
al
net
w
or
k
ope
rat
i
o
n l
i
k
e
deni
al
of se
rvice attac
k
s, tim
eout
m
e
chanism
,
choosing the sm
all
back
o
ff
val
u
e
and
jam
m
i
ng t
h
e wi
rel
e
s
s
cha
nnel
t
o
pre
v
e
n
t
com
m
uni
cat
i
o
n.
Th
ere ex
ist
sev
e
ral
p
r
op
osals th
at attem
p
t to
arch
it
ect
a s
ecure
r
out
i
n
g
pr
ot
oc
ol
f
o
r m
obi
l
e
a
d
h
o
c
net
w
or
k, i
n
o
r
der t
o
o
ffe
r p
r
ot
ect
i
on agai
ns
t
t
h
e at
t
acks. There are se
ver
a
l
sol
u
t
i
ons
pr
op
ose
d
by
rese
arche
r
they are either com
p
letely new stan
d-al
o
n
e
pr
ot
oc
ol
or i
n
som
e
cases
in
co
rpo
r
ation
of s
ecurity m
echanis
m
in
to
ex
isting
on
e lik
e DSDV
an
d
AODV [4
]
.
Sin
ce
rou
ti
ng is an
essen
tial fun
c
tion
fo
r ad
ho
c
n
e
two
r
ks, th
e
in
teg
r
ated
secu
rity p
r
o
cedu
r
es sh
ou
ld
no
t h
i
nd
er its
ope
rat
i
o
n
.
An
ot
h
e
r im
port
a
nt
pa
rt
of anal
y
s
i
s
i
s
t
h
e
exam
i
n
at
i
on o
f
assum
p
t
i
on a
n
d t
h
e
re
q
u
i
r
em
ent
s
t
h
at
eac
h
sol
u
t
i
o
n
de
pen
d
on
.
Al
t
h
o
u
g
h
a p
r
ot
oc
ol
m
i
ght
b
e
ab
le to
satisfy certain
secu
rity co
n
s
trai
n
t
s, its
o
p
e
ratio
n
a
l requ
iremen
ts
mig
h
t
th
wart its su
ccessfu
l
em
pl
oym
ent
.
In or
de
r t
o
an
al
y
ze exi
t
i
ng sol
u
t
i
o
n i
n
st
ructure way we have cla
ssified
th
em in
to
th
ree
categ
ories;
So
l
u
tio
n
b
a
sed
on
Symmetric
cryp
tog
r
ap
h
y
, so
lu
tion
b
a
sed
o
n
Asymmetric
cryp
tog
r
ap
hy
an
d
Hyb
r
i
d
so
lu
tion
.
Ho
wev
e
r, t
h
is classificatio
n
is
on
ly in
d
i
cativ
e sin
ce
a l
o
t of so
l
u
tio
n
can
b
e
classifi
ed
in
t
o
m
o
re
than one category.
a.
Symme
tri
c
Cr
ypt
o
gr
aph
y
S
o
l
u
ti
ons
Secure E
fficie
n
t Ad
hoc
Di
stance Vector
(SEAD) [5]
Secu
re R
o
ut
i
n
g P
r
ot
oc
ol
(SR
P
)
[6]
A
r
iad
n
e
[7
]
b.
Asymmetric Cryptography
Solutions
Aut
h
ent
i
cat
e
r
out
i
n
g f
o
r
a
d
h
o
c net
w
or
k (A
R
A
N
)
[
8
]
SAR [9]
c.
Hy
brid So
luti
o
n
s
Secure Ad
hoc On-dem
and
Di
stance
Vector (SAODV) [10]
In
th
e
p
r
op
osed
rev
i
ew,
we hig
h
ligh
t
a Swarm
In
tellig
en
ce ap
pro
a
ch
in
secu
ri
n
g
th
e co
mm
u
n
i
catio
n
sy
st
em
i
n
M
ANET by
re
vi
ewi
n
g t
h
e pri
o
r
t
echni
q
u
es a
p
p
l
i
e
d. Sect
i
on I
I
di
scusses ab
o
u
t
t
h
e back
gr
o
u
n
d
o
f
t
h
e st
udy
si
gn
i
f
y
i
ng t
h
e
pri
o
r
researc
h
at
t
e
m
p
t
s
fol
l
o
we
d Pr
o
b
l
e
m
descri
pt
i
o
n o
f
t
h
e pr
op
ose
d
st
udy
i
n
Sectio
n
III. Sectio
n
IV d
i
scu
s
ses abo
u
y
th
e swarm
in
tellig
e
n
ce appro
a
ch
wh
ile Section
V d
i
scu
sses abo
u
t
the
ap
p
licab
ility of Tru
s
t m
a
n
a
ge
m
e
n
t
u
s
ing
Swarm
In
tellig
en
ce. Secti
o
n
VI
b
r
iefs ou
t
th
e arri
v
e
d
pro
b
l
em
state
m
en
t o
f
th
e stud
y. Su
gg
estion
fo
r
research
wo
rk
in
fu
ture d
i
rectio
n
is m
a
d
e
as well fo
llowed
by
concl
udi
ng
re
m
a
rks i
n
Sect
i
o
n
V
I
I
.
2.
BA
C
KGR
OUN
D
Tru
s
t
m
a
nagem
e
nt
schem
e
s ha
ve
bee
n
de
vel
o
ped
f
o
r s
p
eci
fi
c
pu
r
pos
es suc
h
as se
cure
r
out
i
n
g
,
au
th
en
ticatio
n
,
in
trusion
d
e
tectio
n
,
and
access con
t
ro
l (auth
o
rizatio
n). Th
is p
a
p
e
r su
mmarizes ex
isting
tru
s
t
m
a
nagem
e
nt
schem
e
s by
schem
e
nam
e
,
m
e
t
h
o
dol
ogy
, at
t
a
cks t
a
r
g
et
ed,
p
e
rf
orm
a
nce m
e
t
r
i
c
s used
, an
d
ot
her
n
o
t
ab
le ch
aracteristics o
f
t
h
e propo
sed sch
e
m
e
s. In
ex
i
s
tin
g
system
, it is to
b
e
no
ted
t
h
at how th
e
m
e
t
hod
ol
o
g
y
expl
ai
n
s
t
h
e p
r
oces
s
t
h
at trust evide
n
ce is
collected a
n
d
per
f
o
rm
ance m
e
trics refers
to the
m
e
t
r
i
c
s used t
o
eval
uat
e
t
h
e
pr
o
pose
d
t
r
ust
m
a
nagem
e
nt
schem
e
. A nar
r
at
i
v
e des
c
ri
pt
i
on
o
f
t
h
ese sc
hem
e
s
an
d
an o
v
e
rv
iew o
f
so
m
e
ex
istin
g
fram
e
wo
rk
s for
tru
s
t
ev
i
d
en
ce d
i
st
ribu
tio
n
and
ev
alu
a
tio
n
will b
e
i
n
clu
d
e
d
in
th
e jo
urn
a
l
version
o
f
th
is pap
e
r.
Som
e
t
r
ust
m
a
nagem
e
nt
sche
m
e
s have
bee
n
pr
o
p
o
s
ed i
n
o
r
de
r t
o
p
r
o
v
i
d
e
a ge
neral
fra
m
e
wor
k
fo
r
t
r
ust
e
v
i
d
e
n
ce
di
st
ri
b
u
t
i
o
n
o
r
eval
uat
i
o
n i
n
M
A
N
ETs.
Ji
ang
an
d B
a
ras
[1
1]
p
r
op
ose
d
a t
r
ust
di
st
ri
but
i
o
n
sch
e
m
e
cal
led
ABED (An
t
-Based
tru
s
t Evid
en
ce Dist
ri
bu
tio
n) b
a
sed
on
th
e swarm
i
n
tellig
en
ce p
a
rad
i
g
m
,
wh
ich
is clai
med
to
b
e
h
i
gh
ly d
i
stri
b
u
t
ed and
ad
ap
tiv
e
to
m
o
b
ility. Th
e swarm
in
tellig
en
ce
p
a
rad
i
g
m
is
wi
del
y
use
d
i
n
dy
nam
i
c opt
i
m
i
zat
i
on pr
obl
em
s (e.g.
,
t
r
a
v
el
i
ng sal
e
sm
an pr
o
b
l
e
m
,
rout
i
ng i
n
com
m
un
i
cat
i
on
n
e
two
r
k
s
) and
is in
sp
ired
from artificial an
t
co
lon
y
t
echni
que
s t
o
s
o
l
v
e c
o
m
b
i
n
at
ori
a
l
o
p
t
i
m
i
zat
i
on pr
obl
em
.
The
key
pri
n
ci
pl
e i
s
cal
l
e
d
st
i
g
m
e
rgy
,
i
ndi
r
ect
com
m
uni
cat
i
on t
h
r
o
u
g
h
t
h
e e
nvi
r
o
nm
ent
.
In
AB
E
D
,
no
des
interact with each othe
r through “ag
e
n
ts” called “ants” that deposit inform
ation called “phe
rom
ones”; base
d
o
n
th
is t
h
e ag
en
ts can
iden
tify an
op
ti
m
a
l p
a
th
for acc
um
ulating trust e
v
idence
.
Howe
ver,
no s
p
ecific
attacks
were c
onsi
d
ere
d
i
n
[1
1]
. The
o
d
o
r
ak
o
p
o
u
l
o
s
and B
a
ras [
1
2
]
pro
pose
d
a t
r
ust
evi
d
e
n
ce e
v
al
uat
i
o
n sche
m
e
for
M
ANET
s
. T
h
e
eval
uat
i
o
n
p
r
ocess i
s
m
odel
e
d as a
pat
h
p
r
o
b
l
e
m
i
n
a di
rect
ed
gra
p
h
whe
r
e
no
des
i
ndi
cat
e
en
tities an
d edg
e
s
represen
t tru
s
t
relatio
n
s
.
Th
e au
tho
r
s
em
p
l
o
y
th
e th
eo
ry
o
f
Sem
i
rin
g
s
t
o
sh
ow
how two
n
o
d
e
s
can estab
lish
tru
s
t
relatio
n
s
h
i
p
s
withou
t prior
d
i
r
ect
interactions. T
h
eir case
study
uses
the
GP
web of
t
r
ust
t
o
ex
p
r
ess
an exam
pl
e t
r
ust
m
odel
based o
n
Sem
i
ri
ngs
and s
h
o
w
s t
h
a
t
t
h
ei
r pr
op
ose
d
schem
e
i
s
robust
i
n
th
e presen
ce
of attack
ers. Howev
e
r, th
eir wo
rk
assu
m
e
s th
at tru
s
t is transitiv
e. Fu
rth
e
r, tru
s
t and
con
f
iden
ce
values
are
re
presente
d as
bi
nary
rathe
r
than as
a
co
n
t
i
n
u
o
u
s
-
v
al
u
e
d var
i
ab
le.
Ev
en
t
h
oug
h no
cen
t
r
alized
Evaluation Warning : The document was created with Spire.PDF for Python.
I
J
ECE
I
S
SN
:
208
8-8
7
0
8
In
vestiga
ting
Op
en
Issu
es i
n
S
w
a
r
m
In
telligen
ce for Mitiga
tin
g S
e
cu
rity
Th
rea
t
s in MANET (Prad
e
ep
K.K.)
1
196
tru
s
ted th
ird
party ex
ists, their wo
rk
m
a
k
e
s u
s
e
of
a s
o
urce
node as
a truste
d infrastructure. Re
cently
B
u
cke
r
che
an
d
R
e
n [
1
3]
p
r
o
pos
ed a
di
st
ri
but
e
d
re
p
u
t
a
t
i
o
n
eval
uat
i
o
n
pr
ot
ot
y
p
e c
a
l
l
e
d
GR
E (
G
e
n
er
al
i
zed
Rep
u
t
ation
Evalu
a
tio
n) to effectiv
ely prev
en
t m
a
lic
i
ous n
ode
s f
r
o
m
ent
e
ri
ng
t
h
e
t
r
ust
e
d c
o
m
m
uni
t
y
.
Howev
e
r,
n
o
sp
ecific attack m
o
d
e
l was
ad
dressed
.
Furth
e
r, tran
sitivity, asy
mmetry, and
subj
ectiv
it
y
characte
r
istics of trust conc
ept were
not specifically
expl
ai
ned i
n
b
u
i
l
d
i
ng t
h
ei
r t
r
u
s
t
m
odel
.
R
a
je
sh a
n
d
Su
bram
ani
a
n
[1
4]
al
so
pe
rf
orm
e
d si
m
u
l
a
ti
on st
u
d
y
o
n
wi
rel
e
ss
net
w
or
k
usi
n
g e
v
o
l
ut
i
ona
ry
al
g
o
r
i
t
h
m
.
Sim
i
l
a
r st
udy
on
wi
rel
e
ss
ne
t
w
o
r
k
t
o
war
d
s
com
m
uni
cat
i
on
pr
ot
oc
ol
was
al
so ca
rri
e
d
o
u
t
by
H
u
i
[
1
5]
. T
h
e
syste
m
s that are prese
n
ted i
n
this work are c
a
tegori
zed
pri
m
arily accordi
ng t
o
th
e a
d
opt
e
d SI technique. The
two m
a
in categories that acc
rue a
r
e: (a
) IDS that m
a
ke u
s
e o
f
A
n
t
C
o
l
ony
Opt
i
m
i
zati
on a
n
d (
b
)
I
D
S t
h
at
e
m
ploy Particle Swa
r
m
Optimization.
This
section
will present som
e
of
t
h
e
recent
work done
using SI:
a.
Recent W
o
rk
in ACO
The
basi
c p
r
i
n
ci
pl
e of
an a
n
t
ro
ut
i
n
g al
g
o
ri
t
h
m
i
s
t
h
at
ants de
posi
t
on t
h
e g
r
ou
n
d
a
h
o
rm
one, t
h
e
phe
r
o
m
one, w
h
i
l
e
t
h
ey
roam
l
o
o
k
i
n
g f
o
r
fo
o
d
. I
n
[1
6]
, t
h
e
aut
h
ors
ha
ve u
s
ed a ve
ry
si
m
p
l
e
an
d ef
fect
i
v
e way
of
pr
o
v
i
d
i
n
g s
ecuri
t
y
agai
n
s
t
bl
ack
hol
e at
t
a
ck by
i
n
t
r
o
d
u
c
i
ng s
o
m
e
m
odi
fi
cat
i
ons t
o
A
C
O. K
u
m
a
r an
d Ka
u
r
[1
7]
ha
ve
p
r
es
ent
e
d
a
wo
rk
t
o
i
d
e
n
t
i
f
y
a c
o
m
p
rom
i
si
ng
pat
h
so
t
h
at
t
h
e
rel
i
a
bl
e c
o
m
m
uni
cat
i
on
can
be
per
f
o
r
m
e
d i
n
M
ANET
.
S
h
ar
m
a
et
al
. [18]
pr
op
ose
d
m
e
chani
s
m
t
h
at
pr
ot
ect
s t
h
e n
e
t
w
o
r
k t
h
r
o
u
g
h
a sel
f
o
r
g
a
n
i
zed
,
fu
lly d
i
strib
u
t
ed
an
d
l
o
calized
pro
c
edu
r
e.
Th
e
p
r
op
o
s
ed
work will redu
ce the n
e
two
r
k
loss an
d
im
pro
v
e t
h
e co
m
m
uni
cat
i
on o
v
er t
h
e
net
w
or
k. I
ndi
rani
an
d
Sel
v
ak
um
ar [19]
ha
ve exam
i
n
ed pe
rf
o
r
m
a
nce o
f
swarm
base
d i
n
trusion
detection system
under 3 m
obility
m
odels by
varying the
spe
e
d a
n
d attacke
r
s
i
n
MA
N
E
T using A
C
O.
b.
Prior W
o
rk in PSO
PSO is a techn
i
qu
e
o
f
o
p
t
i
m
izin
g
th
e
rou
t
es,
resu
lts iterativ
e an
d tryin
g
t
o
g
r
o
w
t
h
t
o
ward
s th
e
concl
udi
ng
res
u
l
t
.
San
d
h
y
a
et
al
. [2
0]
ha
ve
opt
i
m
i
zed
m
u
lt
i
p
at
h r
out
e
by
sel
ect
i
ng t
h
e
best
pat
h
usi
n
g
PS
O
.
Key
m
a
nagem
e
nt
schem
e
wi
th M
D
5
has
h
encry
p
t
i
on i
s
pr
op
ose
d
t
o
im
pr
ove t
h
e sec
u
re
dat
a
com
m
uni
cat
i
on.
Ji
ndal
[
2
1]
has
pr
op
ose
d
a w
o
r
k
t
o
i
d
e
n
t
i
f
y
t
h
e br
o
k
e
n
l
i
n
k
pr
obl
em
i
n
a M
obi
l
e
Net
w
o
r
k
usi
n
g PS
O.
Ko
na
k
et
al
. [
2
2]
i
n
t
r
od
uces
a
dy
na
m
i
c M
ANET
m
a
nagem
e
nt
sy
st
em
t
o
im
prove
net
w
or
k c
o
n
n
ect
i
v
i
t
y
by
usi
n
g
cont
rol
l
e
d
net
w
o
r
k
n
ode
s c
a
l
l
e
d agent
s
u
s
i
ng P
S
O
.
De
ngi
z et
al
. [
2
3]
i
n
t
r
o
d
u
ced
.
A ne
w ap
p
r
oach t
o
m
easuri
n
g co
n
n
ect
i
v
i
t
y
usi
n
g
a
m
a
xim
u
m
flow
fo
rm
ul
a
tio
n
.
A p
a
rticle swarm
o
p
timiza
tio
n
(PSO) algo
rith
m
u
s
es t
h
e m
a
x
i
m
u
m
flo
w
ob
jectiv
e to
ch
oo
se op
ti
m
a
l lo
cat
io
n
s
of th
e ag
en
ts during
each
tim
e step
o
f
n
e
two
r
k
ope
rat
i
o
n. Ka
v
i
t
h
a et
al
. [24]
prese
n
t
e
d a f
r
am
ework
on
fi
n
d
i
n
g t
h
e o
p
t
im
u
m
m
e
m
b
ershi
p
fu
nct
i
o
ns
of a
fu
zzy system
u
s
in
g p
a
rticle swarm
o
p
tim
iza
tio
n
(PSO) algo
rith
m
.
3.
PROBLEM DESCRIPTION
A
lth
oug
h th
er
e ar
e
v
a
r
i
ou
s
nu
m
b
er
of
th
e i
ssu
es i
n
v
a
r
i
ous p
r
ob
lem
d
o
m
ain
in
MANET u
s
i
n
g SI,
hence
i
n
o
r
de
r
t
o
na
rr
o
w
do
w
n
t
h
e
f
o
cu
s
of
expl
ori
n
g
o
p
e
n
i
ssues,
we
co
nsi
d
e
r
t
h
e
f
o
l
l
o
wi
ng
are t
h
e
cri
t
i
cal
o
p
e
n
issu
es aft
e
r rev
i
ewi
n
g the literatu
res t
h
at h
a
s
b
e
en
in
t
r
o
d
u
c
ed
in th
e past:
a.
Energy
Due t
o
dy
nam
i
c t
opol
o
g
y
an
d affect
o
f
re-t
ransm
i
ssi
on, e
ach m
obi
l
e
nodes are hi
ghl
y
depl
et
ed o
f
en
erg
y
wh
ich
co
m
e
s fro
m
battery in
corpo
r
ated
in
t
h
e m
o
b
ile
d
e
v
i
ce. In
itially, it
m
a
y b
e
o
n
l
y thou
gh
of
raisin
g
q
u
a
lity o
f
serv
ice issues lik
e lin
k
b
r
eak
a
g
e
, no
d
e
failu
re etc, b
u
t
, carefu
lly stu
d
y
in
g
th
e fact will lead
to
d
i
scov
ery o
f
th
e fact th
at
when nodes
a
r
e depleted of power,
it
leads to affect the com
m
unication between
so
urce and
d
e
stin
atio
n
,
i
n
case th
e
n
o
d
e
is actin
g
as i
n
termed
iate no
d
e
. Th
e situ
ation
is
so
m
e
wh
at simi
lar
t
o
distributed
denial of service attack to
a larg
e ex
ten
t
.
Hen
c
e, for th
is reason,
if th
ere is an
y
lin
k
d
i
srup
tion, it is
har
d
t
o
fi
n
d
o
u
t
t
h
e real
cause of i
t
(whet
h
er
i
t
i
s
caused by
po
we
r depl
et
e
d
n
ode
or m
a
l
i
ci
ous n
o
d
e)
. N
one
of
t
h
e wo
r
k
di
sc
usse
d i
n
p
r
evi
ous sect
i
o
ns
h
a
s act
ual
l
y
put
for
w
ar
d any
ro
bust
sec
u
ri
t
y
schem
e
whi
c
h i
s
considers this
fact.
b.
Sca
l
ability
On
e of t
h
e yet
u
n
a
n
s
wered
issu
es i
n
th
e area of
MANET is to
acco
m
p
lish
an
efficien
t scalab
ility o
f
t
h
e net
w
or
k.
An e
x
am
pl
e of t
h
e w
o
r
k
[
2
5
]
[26]
[
27]
[
2
8] shows that the ope
n
issu
e is
associated with
the
highest dim
e
nsionality of the m
obile
nodes that shoul
d be c
onsi
d
ere
d
in m
obile adhoc
ne
twork at the tim
e of
eval
uat
i
n
g sec
u
ri
t
y
i
ssues.
R
e
vi
ewi
n
g Se
ct
i
on I, i
t
can
be seen t
h
at
m
obi
l
e
adhoc net
w
or
k has l
ack o
f
in
frastru
ct
u
r
e
with
less co
m
p
u
t
ation
a
l capab
ility an
d
reso
urce con
s
trai
n
t
. Max
i
mizati
o
n of
nu
m
b
er
o
f
nod
es
in
MANET h
a
s sub
s
tan
tial effect in
th
e si
m
u
la
tio
n
resu
lt, wh
ich
is still fo
und
no
t st
u
d
i
ed
effectiv
ely with
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
:
119
4
–
12
01
1
197
suf
f
i
c
i
e
nt
em
pi
ri
cal
pr
o
o
f
wi
t
h
resp
ect t
o
as
sessing sec
u
rit
y
problem
s
.
M
o
r
e
ov
er
, if
m
o
b
ile no
d
e
s are
f
oun
d
with
in
creased
m
o
b
ili
ty, it can
lead
to d
e
gradatio
n
o
f
scalab
i
lity.
c.
Qual
i
t
y
of
Ser
v
i
ce (
Q
o
S
)
Th
e in
co
rp
orat
ed
prop
erties of th
e MANET syste
m
are th
e so
le reason
fo
r
q
u
a
lity o
f
serv
ices too
.
Al
t
h
o
u
gh
va
ri
ous
w
o
r
k
l
i
k
e
[2
8]
[
29]
,
[3
0]
, et
c has a
d
d
r
e
sses t
h
e r
o
ut
i
n
g sec
u
ri
t
y
, b
u
t
i
t
fai
l
e
d t
o
ad
dres
s
sp
ecifically
mo
re critical issu
es lik
e ch
an
nel cap
acity (p
ack
et d
e
liv
ery ratio
, b
a
ndwid
t
h
, j
itter,
d
e
lay etc). It
can
b
e
easily seen
fro
m
all th
ese abov
e m
e
n
tio
n
e
d work that alth
ou
gh
t
h
e op
ti
m
a
l secu
ri
ty is estab
lish
e
d
,
bu
t
it h
a
s n
o
po
sitiv
e effect on
QoS p
a
ram
e
ters. Alm
o
st v
e
ry less/l
i
m
ited
fo
cu
s on
Qo
S
issu
es are seen wh
en
g
a
m
e
th
eo
ry is
ap
p
lied.
4.
SWARM INT
ELLIGENCE
APPROACH
Th
e term
Swarm
In
tellig
en
ce (SI) was first in
tro
d
u
c
ed
by Ben
i
in
th
e
co
n
t
ex
t o
f
cellu
lar ro
bo
tics
syste
m
[31]. Methodol
ogies
, techni
ques
and al
gorithms that this
research
field e
m
braces draw thei
r
in
sp
iration
from th
e b
e
h
a
v
i
or of in
sects, b
i
rd
s and
fish
es, an
d
t
h
eir
u
n
i
qu
e ab
ility to
solv
e co
m
p
lex
task
s i
n
th
e fo
r
m
o
f
swar
m
s
, alth
o
ugh th
e sam
e
th
ing
w
o
u
l
d seem
i
m
p
o
ssib
l
e i
n
i
n
d
i
v
i
du
al lev
e
l
.
Ind
eed, sing
l
e
an
ts,
b
ees
o
r
ev
en bird
s and
fish
es app
ear to h
a
ve v
e
ry
limited
in
tellig
en
ce as
in
d
i
v
i
d
u
a
ls,
b
u
t wh
en th
ey socially
in
teract with each
o
t
h
e
r an
d
with
th
ei
r en
v
i
ron
m
en
t th
ey
see
m
to
b
e
ab
le to
acco
m
p
lish
h
a
rd
task
s
such
as
fi
n
d
i
n
g t
h
e sh
o
r
t
e
st
pat
h
t
o
a fo
o
d
so
urce
, o
r
ga
ni
zi
n
g
t
h
ei
r
nest
, sy
nc
hr
o
n
i
ze t
h
ei
r m
ovem
e
nt
and t
r
a
v
el
as a
sin
g
l
e coh
e
ren
t
en
tity with
h
i
g
h
sp
eed
etc. This ach
iev
e
m
e
n
t
b
eco
m
e
s ev
en
m
o
re sig
n
i
fican
t
if it
is tak
e
n
in
to
account that they accom
p
lish su
c
h
tasks
without the
prese
n
c
e
of a ce
nt
raliz
ed aut
h
ority (e.g., t
h
e
quee
n
of the
hi
ve
) di
ct
at
i
n
g
any
of t
h
i
s
be
havi
or
. Ap
pl
i
c
at
i
ons o
f
t
h
i
s
can be f
o
u
n
d
i
n
NP
-ha
r
d opt
im
i
zati
ons pr
o
b
l
e
m
s
su
ch
as t
h
e trav
elin
g salesm
a
n
, t
h
e
q
u
a
dratic
assi
g
n
m
e
nt
, sched
u
l
i
n
g,
ve
h
i
cl
e ro
ut
i
n
g
et
c.
Th
e un
iqu
e
characteristics o
f
SI m
a
k
e
it
id
eal fo
r t
h
is purpose. M
o
re s
p
ec
ifically, SI techni
que
s aim
at so
lv
ing
co
mp
lex
prob
lem
s
b
y
th
e e
m
p
l
o
y
men
t
o
f
m
u
ltip
le b
u
t
si
m
p
le a
g
en
ts withou
t th
e n
e
ed
o
f
an
y fo
rm
o
f
sup
e
rv
ision to
ex
ist. Ev
ery ag
en
t co
llab
o
rates
with
oth
e
rs t
o
ward
fin
d
i
ng
t
h
e
o
p
t
i
m
al so
lu
tio
n
.
Th
is
hap
p
e
n
s
vi
a di
rect
or i
ndi
rect
com
m
uni
cat
i
ons (i
nt
eract
i
ons) wh
ile th
e agen
ts con
s
tan
tly ro
am
in
th
e search
space. In this respect, a
g
ents
can be use
d
for se
vera
l ha
rd tasks like findi
ng classific
a
tion rules for
m
i
suse
det
ect
i
o
n
,
di
sc
ove
r cl
u
s
t
e
rs
fo
r a
nom
al
y
det
ect
i
on,
keep
t
r
ack
of
i
n
t
r
ude
r t
r
ai
l
s
et
c
.
I
ndee
d
,
t
h
es
e sel
f
-
or
ga
ni
zi
ng a
n
d
di
st
ri
b
u
t
e
d at
t
r
i
b
ut
es are
hi
g
h
l
y
app
r
eci
abl
e
by offeri
ng the m
ean
s to break down a
di
fficult
IDS
p
r
ob
lem i
n
to
m
u
ltip
le si
m
p
le
o
n
e
s assig
n
e
d
to
ag
en
ts. Th
is po
ten
tially
mak
e
s th
e IDS au
t
o
no
mo
u
s
,
h
i
gh
ly ad
ap
tive, p
a
rallel, self-org
an
izing
and
co
st efficien
t
.
In
the literatu
re th
e efficien
cy o
f
su
ch
system
s
is
usu
a
l
l
y
eval
ua
t
e
d agai
nst
o
n
e
of
t
h
e e
x
i
s
t
i
n
g
be
nc
hm
ar
ks that speci
fically target IDS. T
h
e
next s
ection
th
or
oug
h
l
y su
rv
eys SI
-b
ased
ap
pr
oaches
use
d
for sec
u
ri
ng
comm
unication system
in MANE
T.
5.
TRUST
M
A
N
A
GE
MENT
U
S
ING
SI
The c
o
ncept
of
t
r
ust
i
s
i
m
port
a
nt
t
o
c
o
m
m
uni
cat
i
on an
d
net
w
o
r
k
p
r
ot
ocol
des
i
gne
rs
wh
ere
establishing trust relations
hi
ps am
ong
parti
c
ipating nodes is
critical
to
enabling c
o
llaborative optim
ization
of
system
m
e
trics
.
Acc
o
rding to
Esche
n
au
e
r
et al. [32], trust i
s
defi
ned as
“a
set of relations am
ong e
n
tities that
part
i
c
i
p
at
e i
n
a
p
r
ot
ocol
.
T
h
es
e rel
a
t
i
o
n
s
are
base
d
on
t
h
e e
v
i
d
e
n
ce
ge
nera
t
e
d by
t
h
e
pr
ev
i
ous
i
n
t
e
ract
i
o
ns
o
f
en
tities with
in a pro
t
o
c
o
l
.
In g
e
n
e
ral, if t
h
e in
teraction
s
h
a
v
e
b
e
en faith
fu
l to th
e
proto
c
o
l
, t
h
en
trust will
accum
u
late between these e
n
t
ities.” Trus
t
ha
s also
been de
fined as the
de
gr
ee of
belief a
b
out t
h
e
beha
vi
or
of
o
t
h
e
r en
tities (o
r ag
en
ts) [3
3
]
, o
f
ten
with
an e
m
p
h
a
sis on
co
n
t
ex
t [34
]
.
Du
e t
o
th
e un
i
q
u
e
ch
aracteristics o
f
MANETs and
th
e in
h
e
ren
t
unreliab
ility o
f
th
e wireless
m
e
d
i
u
m
,
th
e co
n
c
ep
t o
f
tru
s
t in
MANETs shou
ld
b
e
caref
ul
l
y
defi
n
e
d.
The
m
a
i
n
feat
ures
o
f
t
r
ust
i
n
M
A
NE
Ts a
r
e as
f
o
l
l
o
ws
[
32]
[3
3]
[
3
4]
[
35]
:
A d
ecisi
o
n
m
e
th
od
to
d
e
termin
e tru
s
t ag
ainst an
en
tity sho
u
l
d
b
e
fu
lly d
i
stribu
ted
si
nce th
e ex
isten
c
e o
f
a
t
r
ust
e
d
t
h
i
r
d
pa
rt
y
(s
uch
as a t
r
ust
e
d ce
nt
ral
i
zed
certificatio
n au
thority) cann
o
t
b
e
assu
m
e
d
.
Trust shou
ld
b
e
d
e
term
in
ed
in
a
h
i
gh
ly cu
sto
m
izab
le man
n
e
r
withou
t ex
cessiv
e
co
m
p
u
t
atio
n
and
co
mm
u
n
i
catio
n
lo
ad
, wh
ile also
cap
t
u
r
i
n
g t
h
e co
m
p
lex
itie
s of th
e tru
s
t relatio
n
s
h
i
p
.
A trust decision fram
ework for M
A
N
ETs sh
ou
ld
no
t assume th
at all n
o
d
es are c
o
operative. In
resourc
e
-
rest
ri
ct
ed e
nvi
r
onm
ent
s
, sel
f
i
s
hne
ss i
s
l
i
k
el
y
t
o
be
pre
v
al
e
n
t
o
v
er c
o
ope
r
a
t
i
on,
fo
r exa
m
pl
e, i
n
orde
r
t
o
save
bat
t
e
ry
l
i
f
e o
r
c
o
m
put
at
ional
p
o
we
r.
Trust is d
y
n
a
mic an
d no
t static.
Trust is su
bj
ect
iv
e.
Trust is no
t
n
e
cessarily tran
si
tiv
e. Th
e fact th
at A tru
s
t
s
B
and
B
t
r
ust
s
C
doe
s
not
i
m
pl
y t
h
at
A
t
r
ust
s
C
.
Trust is asymmetric an
d
no
t
n
ecessarily recip
r
o
cal.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
J
ECE
I
S
SN
:
208
8-8
7
0
8
In
vestiga
ting
Op
en
Issu
es i
n
S
w
a
r
m
In
telligen
ce for Mitiga
tin
g S
e
cu
rity
Th
rea
t
s in MANET (Prad
e
ep
K.K.)
1
198
Trust is con
t
ext-d
e
p
e
nd
en
t.
A m
a
y tru
s
t B as a wi
n
e
e
xpe
rt
but
n
o
t
as a ca
r
fi
xe
r.
Si
m
i
l
a
rly
,
i
n
M
A
NET
s
,
i
f
a gi
ve
n t
a
sk
req
u
i
r
es
hi
g
h
c
o
m
put
at
i
onal
p
o
we
r,
a
no
de
wi
t
h
hi
gh c
o
m
put
at
i
o
nal
p
o
w
e
r i
s
rega
rde
d
as
tru
s
ted wh
ile a
n
o
d
e
t
h
at h
a
s l
o
w co
m
p
u
t
ation
a
l power bu
t i
s
no
t m
a
lic
io
u
s
(i.e.,
h
o
n
e
st) is d
i
stru
sted.
a.
Trust Metrics
f
o
r MA
NETs
Eve
n
t
h
o
u
gh
m
a
ny
t
r
ust
m
a
nagem
e
nt
sche
m
e
s have bee
n
pr
op
ose
d
, n
o
wo
rk cl
earl
y
a
d
d
r
esses
what
sh
ou
l
d
b
e
m
e
a
s
u
r
ed
to
ev
al
u
a
te tru
s
t. Liu
et al. [36
]
d
e
fin
e
d
tru
s
t in
th
eir
m
o
d
e
l as relia
b
ility, t
i
m
el
in
ess, and
i
n
t
e
gri
t
y
of m
e
ssage del
i
v
ery
t
o
t
h
ei
r i
n
t
e
n
d
e
d ne
xt
-
h
o
p
.
A
l
so m
o
st
t
r
ust
-
base
d pr
ot
oc
ol
s fo
r secu
re r
o
ut
i
n
g
cal
cul
a
t
e
a t
r
us
t
val
u
e
ba
sed
o
n
c
h
aract
e
r
i
s
t
i
c
s o
f
wel
l
be
ha
vi
n
g
no
des
[
3
6
]
[3
7]
[
3
8]
. T
r
ust
m
easurem
ent
ca
n
b
e
app
licatio
n
-
d
e
p
e
nd
en
t an
d will b
e
d
i
fferen
t
b
a
sed
on
th
e d
e
si
g
n
g
o
a
l
s
o
f
th
e
p
r
o
posed
n
e
t
w
ork. In
th
i
s
st
udy
, t
w
o t
y
p
e
s of t
r
ust
bas
e
d o
n
t
r
ust
rel
a
t
i
ons
hi
ps a
r
e
di
scuss
e
d t
h
at
req
u
i
r
e m
easur
em
ent
s
of
di
f
f
e
rent
aspects of
trust.
Fi
rst
,
s
o
ci
al
t
r
u
s
t
refe
rs t
o
p
r
o
p
ert
i
e
s
deri
ved
fr
om
soci
al
re
l
a
t
i
onshi
ps.
Ex
am
pl
es of
soci
al
net
w
or
ks a
r
e
strong s
o
cial relationshi
ps s
u
ch as
colleagues or
re
lativ
es or loo
s
e so
ci
al relatio
n
s
h
i
ps su
ch
as schoo
l
al
um
ni
or f
r
i
e
n
d
s
wi
t
h
c
o
m
m
on
i
n
t
e
rest
s
[
3
9]
. S
o
ci
al
t
r
ust
m
a
y
i
n
cl
ude
f
r
i
e
n
d
shi
p
,
h
o
n
e
st
y
,
pri
v
acy
, a
n
d
soci
al
re
p
u
t
a
t
i
on/
recom
m
endat
i
on
deri
ved
f
r
om
di
rect
or
i
ndi
rect
i
n
t
e
ract
i
ons
f
o
r
“so
c
i
a
bl
e” p
u
r
p
o
se
.
I
n
MANET
s
, s
o
me
m
e
trics to
measure these
social tr
ust
pr
ope
rt
i
e
s
can b
e
fre
qu
ency
of
com
m
uni
cat
i
ons
,
malig
n
or b
e
n
i
g
n
b
e
h
a
v
i
ors (e.g
., false
accusati
o
n
,
im
p
e
rson
atio
n), and
quality o
f
rep
u
t
at
io
n
.
Secon
d
,
QoS tru
s
t
rep
r
esen
ts co
m
p
eten
ce,
d
e
p
e
nd
ab
i
lity, reliab
ilit
y, su
ccessfu
l
exp
e
rien
ce,
an
d
rep
u
t
a
t
i
on/
reco
m
m
e
ndat
i
on o
n
t
a
sk pe
rf
or
m
a
nce for
w
a
r
ded f
r
o
m
di
rect
or i
ndi
rect
i
n
t
e
ract
i
o
n
s
w
i
t
h
ot
he
rs. In desi
gni
ng net
w
o
r
k
pr
ot
oc
ol
s,
m
a
ny
p
r
i
o
r w
o
r
k
s
m
easured
t
h
e t
r
ust
val
u
e of a
no
de base
d on
per
f
o
r
m
a
nce m
e
t
r
i
c
s suc
h
as t
h
e
n
ode
’s e
n
e
r
gy
o
r
c
o
m
put
at
i
onal
p
o
we
r,
l
i
f
et
im
e, pac
k
et
del
i
v
ery
rat
e
,
o
r
eval
uat
i
o
ns
usi
ng
re
put
at
i
o
n
or
rec
o
m
m
e
nd
at
i
on f
r
o
m
ot
her n
o
d
es a
b
o
u
t
t
a
sk pe
rf
orm
a
nce. T
h
e t
e
rm
QoS tru
s
t is
u
s
ed
in th
is
wo
rk to
d
e
fi
n
e
tru
s
t
ev
alu
a
tion
m
a
i
n
ly in
term
s o
f
task
p
e
rform
a
n
ce cap
ab
ility.
b.
Mitig
a
tin
g
A
t
t
a
cks
M
a
ny
t
r
ust
m
a
nagem
e
nt
sche
m
e
s are de
vi
se
d t
o
det
ect
m
i
sbeha
v
i
n
g
n
ode
s, b
o
t
h
sel
f
i
s
h
no
des a
n
d
m
a
l
i
c
i
ous n
ode
s. S
p
eci
fi
c e
x
a
m
pl
es of net
w
or
k l
a
y
e
r at
t
a
c
k
s a
r
e as
f
o
l
l
o
ws
[3
2]
[
3
3]
[
4
0]
[
41]
:
Rou
tin
g loo
p
a
tta
ck
:
A
m
a
lici
ous
n
o
d
e
m
a
y
m
odi
fy
r
o
u
t
i
ng
p
ackets
in s
u
ch a
way that the
pac
k
ets
traverse a cycl
e, s
o
that t
h
e
packet do
es
not
reach the i
n
te
nded de
stination.
Wor
m
hole att
a
ck
: A
gr
oup
o
f
co
op
er
atin
g malicio
u
s
nod
es
can
pretend t
o
connect two
distant points in
t
h
e net
w
o
r
k wi
t
h
a l
o
w-l
a
t
e
nc
y
com
m
uni
cat
ion
l
i
n
k
cal
l
e
d
wo
rm
hol
e l
i
n
k
,
causi
ng
di
sr
u
p
t
i
ons i
n
n
o
r
m
a
l
traffic l
o
ad and flow.
Bla
ck ho
le
a
tta
ck
: A m
a
licio
u
s
n
o
d
e
, th
e so
called
b
l
ack
h
o
l
e
no
d
e
, m
a
y respon
d
al
ways p
o
sitiv
ely for
ro
ut
e re
q
u
est
s
even
wi
t
h
o
u
t
p
r
o
p
er
r
out
i
ng i
n
f
o
rm
at
i
on. T
h
e bl
ack
h
o
l
e
ca
n
dr
op
al
l
pac
k
et
s fo
rwa
r
ded
t
o
it.
Gray
-
hol
e at
t
a
ck
: A
m
a
lic
io
us n
o
d
e
m
a
y
sel
ectiv
ely d
r
op
pack
et
s, as a special case of black hole attack.
Variations include
the
sinkhol
e
attacker
t
h
at
selectively routes pac
k
ets.
Deni
al
-
o
f
-
Se
rv
i
ce (
D
oS)
at
t
a
ck
:
A m
a
l
i
c
ious
n
ode m
a
y
bl
ock t
h
e n
o
rm
al
use or
m
a
nagem
e
nt of
co
mm
u
n
i
catio
n
s
facilities, for ex
am
p
l
e, b
y
cau
sing
ex
cessiv
e
resou
r
ce con
s
u
m
p
tio
n.
Fa
lse i
n
fo
rmatio
n
o
r
fa
lse recommenda
tio
n
:
A m
a
l
i
c
ious
no
de m
a
y
col
l
u
de a
n
d
pr
o
v
i
d
e
fal
s
e
recom
m
endat
i
ons/
i
nf
orm
a
t
i
on t
o
i
s
ol
at
e g
o
od
n
odes
w
h
i
l
e
keepi
ng m
o
r
e
m
a
l
i
c
i
ous n
o
d
es. T
h
i
s
at
t
ack
also called a
bl
ack-m
ounting
attack.
In
comp
lete in
f
o
rma
tion
: A
malicio
u
s
n
ode
m
a
y n
o
t
co
op
er
ate in
pr
ov
id
i
n
g
p
r
oper
or
co
m
p
let
e
in
fo
rm
atio
n
.
Usu
a
lly co
m
p
ro
m
i
sed
n
o
d
e
s co
llu
d
e
to
perfo
r
m
th
is at
tack
. Disting
u
ish
i
ng
m
a
licio
u
s
beha
vi
o
r
s
fr
om
n
o
rm
al
beha
vi
ors
i
s
di
ffi
c
u
l
t
i
n
M
A
NET
s
.
Packet modification/insertion
:
A m
a
l
i
c
i
ous no
de m
a
y
m
o
d
i
fy
pac
k
et
s
or i
n
sert
m
a
l
i
c
i
ous pac
k
et
s s
u
ch
a
s
p
ack
ets with inco
rrect rou
tin
g in
fo
rm
atio
n
.
Newco
m
er a
t
t
a
ck
:
A
m
a
l
i
c
i
ous
no
de
m
a
y
r
e
m
ove t
h
ei
r
b
a
d
rep
u
t
a
t
i
on/
d
i
st
rust
by
re
gi
s
t
eri
n
g
as a
ne
w
user. T
h
e m
a
licious
node si
m
p
ly leaves the system
and
j
o
i
n
s agai
n
f
o
r
t
r
ust
re
voca
t
i
on, fl
us
hi
n
g
ou
t
pre
v
i
o
us
ba
d
h
i
st
ory
an
d
st
art
i
ng t
o
acc
um
ul
at
e new
t
r
ust
.
S
y
b
il a
tta
ck
:
A m
a
l
i
cio
u
s
no
d
e
can
offer
m
u
l
tip
le id
en
titie
s to
th
e n
e
twork
wh
ich
can
affect to
po
log
y
main
ten
a
n
ce an
d fau
lt to
lerant sch
e
m
e
s su
ch as m
u
lti-p
a
th
ro
u
ting
.
Bla
ckma
ilin
g
:
A m
a
l
i
c
i
ous n
ode
can
bl
ac
k
m
ai
l
anot
her
n
ode
by
fal
s
el
y
cl
aim
i
ng t
h
at
an
ot
he
r
no
de
i
s
m
a
l
i
c
i
ous or
m
i
sbehavi
n
g
.
Thi
s
ca
n
gene
rat
e
si
g
n
i
f
i
can
t
am
ount
o
f
t
r
affi
c a
n
d
ul
t
i
m
a
t
e
ly
di
sru
p
t
t
h
e
fun
c
tion
a
lity o
f
th
e en
tire n
e
t
w
ork.
Repl
ay at
t
a
cks
:
A m
a
li
ci
ous
no
de m
a
y
repl
ay
earl
i
e
r t
r
an
s
m
i
t
t
e
d pac
k
et
s
t
o
t
h
e
net
w
or
k.
If t
h
e a
dve
rsar
y
repl
ay
s
ro
ut
e r
e
que
st
s,
ol
d l
o
cat
i
ons a
n
d r
o
u
t
i
ng i
n
f
o
rm
at
i
on m
i
ght
m
a
ke no
des
u
n
reac
h
a
bl
e.
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
:
119
4
–
12
01
1
199
Selective misbehavi
n
g
attack
: Th
is attack
is d
e
ri
v
e
d
from
th
e subj
ectiv
e ch
aracteristic o
f
th
e t
r
ust
m
a
nagem
e
nt
fr
am
ewor
k.
A
m
a
l
i
c
i
ous
no
de
m
a
y
sel
ect
i
v
ely
pr
o
v
i
d
e
or
de
ny
p
r
ope
r se
rvi
ces.
On-o
ff a
tta
ck
:
A m
a
l
i
c
i
ous
no
de m
a
y
al
t
e
rnat
i
v
el
y
be
ha
ve wel
l
a
nd
b
a
dl
y
t
o
st
ay
u
ndet
ect
e
d
w
h
i
l
e
di
sr
upt
i
n
g ser
v
i
ces.
Co
n
flictin
g
b
e
h
a
v
i
o
r a
tta
ck
:
A m
a
li
ci
ous n
ode m
a
y
beha
ve di
ffe
rent
l
y
t
o
n
ode
s i
n
di
f
f
ere
n
t
g
r
o
u
p
s t
o
mak
e
th
e
o
p
i
n
i
on
s
f
r
o
m
d
i
f
f
e
r
e
n
t
g
ood g
r
ou
ps conf
lictin
g
,
an
d u
l
ti
m
a
tely lead
to
non
-
t
r
u
st
ed
rel
a
t
i
ons
hi
ps
.
6.
ARRIVED PROBLEM ST
ATEME
N
T
Fro
m
th
e j
u
stificatio
n
laid
d
o
wn
b
y
th
e
m
i
ti
g
a
tio
n
techn
i
qu
es u
s
i
n
g
Swarm in
tellig
en
ce to
g
e
n
e
rate
o
p
tim
al secu
rity in
MANET, th
e
p
r
ob
lem
i
d
en
tified
fro
m
th
e
rev
i
ew is
th
at--“It is
h
i
gh
ly co
m
p
u
t
atio
n
a
lly
ch
allen
g
i
ng
task
to d
e
sign
a
math
e
m
atic
mo
d
e
l t
o
ex
h
i
b
it an
ex
trem
ely
u
npred
ictab
l
e
malicio
u
s
b
e
h
a
v
i
or
of
the m
a
licious m
obile nodes i
n
m
u
ltiples under
dive
rse
vul
nera
ble security conditi
on
in MANET and
t
h
ere
b
y
p
o
s
i
n
g
th
reat to
d
e
sign
a
d
e
cisio
n
m
a
k
i
n
g
m
o
d
e
l fo
r ensu
ri
n
g
m
itig
ati
n
g
of attack
ev
en
ts and
d
e
po
rting
mechanism
”
.
The
a
b
o
v
e di
s
c
usse
d pr
obl
e
m
st
at
em
ent
has
va
ri
o
u
s rat
i
onal
e
t
o
just
i
f
y
t
h
e di
scusse
d poi
nt
. One
o
f
the critical de
merits of MANET syst
em
is
its decentraliz
ation as
well as its ongoi
ng
node m
obility
whic
h
con
s
um
es un
w
a
nt
ed
p
o
we
r a
nd
deci
si
o
n
of
ro
ut
i
n
g p
r
ot
oc
ol
t
h
ere
b
y
pos
ses a g
r
eat
cha
l
l
e
ngi
n
g
t
a
sk
.
Due t
o
t
h
i
s
un
want
e
d
po
we
r drai
nag
e
as wel
l
as
l
i
m
i
t
a
t
i
on of ch
annel
capaci
t
y
,
t
h
ere are som
e
gro
u
p
s o
f
no
des t
h
a
t
m
a
y
chose
t
o
reject
f
o
r
w
ar
di
ng
o
r
c
a
r
r
y
i
ng
any
re
quest
f
r
om
i
t
s
nei
g
hb
or
h
o
o
d
n
ode
s
due
t
o
i
t
s
res
o
urc
e
con
s
t
r
ai
nt
. S
u
c
h
n
ode
s are ba
si
cal
l
y
t
e
r
m
ed as Err
one
o
u
s
No
des
whi
c
h r
i
ses due t
o
t
e
c
hni
cal
i
ssues
o
f
p
o
we
r
or
so
ft
wa
re/
h
a
r
d
w
are
p
r
obl
e
m
s. Exi
s
t
e
nce
of
suc
h
n
o
d
e
s
can
be
easi
l
y
t
a
ken
a
dva
nt
a
g
es
by
t
h
e
m
a
l
i
c
i
ous
n
o
d
e
wh
ich
will always h
a
v
e
certain
h
a
rm
fu
l in
ten
tio
n in
o
r
d
e
r to
paralyze th
e o
p
eratio
n
a
l asp
e
cts o
f
MANET
system
. Howeve
r, t
h
ere is a
prese
n
ce of
othe
r
typ
e
s
o
f
no
d
e
i
n
MANET wh
ich
m
a
j
o
rly imit
ates th
e
beha
vi
o
r
of
Er
r
one
o
u
s
No
de
c
a
l
l
e
d as sel
f
i
s
h
no
de.
Th
e ch
aracteri
s
tics ad
op
ted
b
y
selfish
n
odes targets
to gain
th
e b
e
n
e
fit of
n
e
two
r
k
at
th
e co
st
o
f
ot
he
r
n
ode res
o
u
r
ces op
p
o
rt
uni
st
i
cal
l
y
.
Sel
f
i
s
h no
des
do
not
t
a
ke
part
i
n
pac
k
et
f
o
r
w
ardi
ng a
nd t
h
e
y
are
con
s
i
d
ere
d
t
o
be
have
ve
ry
m
u
ch rat
i
o
na
l
l
y
as t
h
ey
act o
ppo
rt
u
n
i
stically to
g
a
in
network
reso
urces as
adva
nt
age
s
.
H
e
nce t
h
e
prese
n
ce o
f
sel
f
i
s
h no
de i
s
p
o
t
e
nt
i
a
l
l
y
harm
ful
as t
h
e si
m
i
l
a
r behavi
or
of t
h
e
sel
f
i
s
h
no
de ca
n
be
e
a
si
l
y
im
i
t
a
t
e
d by
m
a
li
ci
ous
n
ode
,
whi
c
h i
s
t
h
e
poi
nt
o
f
c
o
ncer
n
of
m
a
ny
secu
ri
t
y
aspec
t
s. As
t
h
ere i
s
no p
r
e
s
ence o
f
i
n
t
e
gr
at
ed di
gi
t
a
l
cert
i
f
i
cat
e based no
de ve
ri
fi
cat
i
on sy
st
em
am
o
ng t
w
o m
obi
l
e
no
de
s
in MANET
,
hence it becomes alm
o
st im
p
o
ssible task to
id
en
tify th
e n
o
d
e
s to
b
e
reg
u
l
ar, or selfish
,
or
malicio
u
s
.
A m
a
l
i
c
i
ous no
de can easi
l
y
fur
n
i
s
h fal
s
e i
n
f
o
rm
at
i
on at
t
h
e t
i
m
e
of rout
e
di
sco
v
ery
p
r
o
c
ess by
ot
her
regu
lar
n
o
d
e
s; th
ey ch
oo
se to
p
a
rticip
ate ev
en
in
nod
e forwardi
ng in the
prelim
inary pha
ses. This treac
herous
act o
f
m
a
lic
io
u
s
m
o
b
ile
n
ode will ev
en
t
u
ally g
a
in
the tru
s
t an
d
b
e
lief system
o
f
th
e n
e
t
w
ork
wh
ere the
malicio
u
s
n
odes seek
s
fo
r an o
p
tim
al o
p
p
o
r
tu
n
ity to
in
itiate a b
r
u
t
al attack
on
t
h
e n
e
t
w
ork. It is to
b
e
n
o
t
ed
th
at o
n
ce th
e
malicio
u
s
n
ode g
a
in
s th
e tru
s
t, th
e m
o
re is th
e in
ten
s
ity o
f
th
e attack
po
ten
tially
cau
sed
dam
a
gi
ng
vari
ous
res
o
urces i
n
M
A
NET
sy
st
em
. One
of t
h
e m
o
st
cri
t
i
cal i
ssues
of s
u
c
h
phe
n
o
m
e
non i
s
t
h
e
i
d
ent
i
f
i
cat
i
on
o
f
be
havi
or
of
d
i
ffere
nt
t
y
pes o
f
n
ode
s. E
v
ent
u
al
l
y
, usi
n
g cr
y
p
t
o
g
r
a
phy
or
any
ot
he
r t
ech
ni
q
u
e
s
will do
st
o
p
an
d m
i
t
i
g
a
te such
attack
s
b
u
t
canno
t so
lv
e
if th
e
attack
ing
strateg
y
is
c
h
ang
e
d
b
y
m
a
licio
us
n
o
d
e
s. Hen
ce,
work
i
n
g
on
in
t
r
u
s
i
o
n
d
e
tection
system o
r
d
e
tectin
g
a
m
a
lic
io
u
s
n
o
d
e
will b
r
o
a
d
e
n
th
e sco
p
e
o
f
study a
n
d
opti
m
al results on security on large
scal
e MANET ca
nnot
be accom
p
lished.
He
nce, t
h
e
current
researc
h
w
o
r
k
cho
o
ses t
o
si
m
u
l
a
t
e
t
h
e deci
si
ons ad
o
p
t
e
d b
y
vari
ou
s t
y
pes of n
ode
s usi
ng
gam
e
-t
heor
y
t
h
at
g
i
v
e
s a
b
e
tter statistica
l
p
r
o
b
a
b
ility o
f
eq
u
ilib
ri
u
m
stag
es.
7.
CO
NCL
USI
O
N
I
t
h
a
s
b
e
en
seen
th
at m
a
j
o
r
ity o
f
th
e above m
e
n
tio
n
e
d
w
o
r
k
is fo
cu
sed
o
n
i
n
tro
d
u
c
in
g
a stro
ng
securi
t
y
sy
st
em
t
h
at
eit
h
er add
r
esses
ro
ut
i
ng
beha
vi
o
r
or s
o
m
e
ot
her
fact
ors t
h
at
d
i
rect
l
y
i
n
fl
uen
ce no
de
m
i
sbehavi
o
r u
s
i
ng S
I
. H
o
we
ver
,
alm
o
st
m
a
jo
ri
t
y
of t
h
e w
o
r
k
i
s
fo
un
d t
o
have use
d
cry
p
t
o
gra
p
hi
c app
r
oac
h
whi
c
h al
way
s
has s
o
m
e
or
ot
he
r sec
u
ri
t
y
l
oop
h
o
l
e
s w
h
en i
t
c
o
m
e
s
t
o
wi
rel
e
ss
ne
t
w
o
r
ki
ng
. O
n
e
of t
h
e
in
terestin
g ex
plo
r
ation
was t
h
at ev
en g
a
m
e
th
eory
h
a
s a
v
a
lu
ab
le co
n
t
ri
b
u
tion
i
n
security o
f
MANET [4
2
]
[43
]
wh
ere
v
a
rio
u
s
app
r
o
a
ch
es are
u
s
ed
t
o
mitig
ate a
ttack
s o
r
an
y m
a
l
i
cio
u
s
activ
ities in
MANET.
Hence, th
e
fut
u
re
w
o
r
k
c
o
ul
d
be
o
n
t
h
e
di
rect
i
o
n
of i
n
t
r
o
duci
n
g
a n
o
v
el
m
odel
bas
e
d
on
gam
e
t
h
eory
as
wel
l
S
w
arm
in
tellig
en
ce, wh
ich
no
on
e h
a
s ev
er atte
m
p
ted
b
e
fore. Th
e
n
o
t
ab
le co
n
t
ribu
tio
n
o
f
th
e swarm in
tellig
en
ce can
produce a
n
e
ffi
cient security syste
m
whi
c
h c
a
n be
f
u
rt
her
m
o
re enha
nced
by
i
n
t
e
g
r
at
i
n
g
wi
t
h
gam
e
t
h
eoret
i
c
Evaluation Warning : The document was created with Spire.PDF for Python.
I
J
ECE
I
S
SN
:
208
8-8
7
0
8
In
vestiga
ting
Op
en
Issu
es i
n
S
w
a
r
m
In
telligen
ce for Mitiga
tin
g S
e
cu
rity
Th
rea
t
s in MANET (Prad
e
ep
K.K.)
1
200
conce
p
t
o
f
vi
s
u
al
i
z
i
ng a
n
d di
scret
i
z
i
ng m
o
b
i
l
e
node
s.
We
st
ro
ngl
y
bel
i
e
v
e
t
h
at
suc
h
f
r
a
m
ewor
k
desi
g
n
can
ove
rc
om
e vari
ous
i
ssue
s
by
e
l
i
c
i
t
i
ng vari
ou
s
hi
d
d
e
n
t
r
ai
t
s
o
f
no
de
be
havi
o
u
r
i
n
M
A
N
ET
i
n
f
u
t
u
re.
REFERE
NC
ES
[1]
J
.
Loo
,
e
t
al
.,
“
M
obile
A
d
H
o
c N
e
tw
or
ks: Current
Status and
Futur
e
Tr
ends”,
CRC
Press
, 2012, pp.
538.
[2]
I. Aad
,
et
al
.,
“
D
enia
l of
servic
e r
e
silien
c
e
in
ad
h
o
c ne
tworks
”, In
Proc. of ACM
MobiCom,
2004
, pp. 202-215.
[3]
A.A. Carden
as,
et al., “Evolu
tio
n of Detection Algorithms
for MAC Lay
e
r Misbehavior: Th
eor
y
and Experiments”,
IEEE/ACM Tran
sactions on N
e
tworking (
T
oN
)
, Vol. 17
, No. 2, 2
009, pp
. 605-61
7.
[4]
M.
Akhlaq,
et al.,
“Addressing Security
Con
cerns of Data Exchange in AODV Protocol”,
W
o
rld Academy o
f
Scien
c
e, Eng
i
neering and Techn
o
logy
, 2006, pp.
29-33.
[5]
YC Hu, et
al.
,
“
S
EAD: s
ecure e
ffici
ent dis
t
anc
e
v
ector
routing
for mobile wireless ad hoc networks”,
Els
evi
er
,
Adhoc N
e
tworks
, 2003
, pp
. 175-
192.
[6]
K. S
a
nzgiri
, et
al
., “
A
S
ecure Ro
u
ting Protocol f
o
r Ad Hoc Networks”,
IEEE International Confer
ence on N
e
twork
Protocols
, 2002, pp. 78-87.
[7]
YC Hu, et
al
.,
“
A
riadne: A S
e
cure On-Dem
an
d Routing Protocol for AdHoc Networks”,
Springe
r,
Wirele
ss
Networks
, 2005
,
pp. 21-38
.
[8]
K. Sanzgiri, et al., “Authenticated
Routing for Ad hoc
Networks”,
IEEE Journal on S
e
lected Areas in
Communications
, Vol. 23
, Issue.
3, 2005
, pp
. 598
-610.
[9]
S
.
Yi, et a
l
.
,
“
A
S
ecurit
y
-Aware
Routi
ng Protocol for Wireless AdHoc Networks”,
ACM Sympo
s
ium on Mobile
Adhoc N
e
tworking
&
Computing
, 2001
.
[10]
M.
G.
Zapata,
“Secure Ad hoc On-D
emand Distance Vector Ro
uting”,
Mobile
Computing and Communications
Rev
i
ew
, Vol. 6,
No. 3, 2002, pp.
106-107.
[11]
T. Jiang
and J.S
.
Bar
a
s, “Ant-based Adaptiv
e
Tr
ust Ev
id
ence Distribution
in M
ANET”, Proc. 2
nd Int’l Conf. o
n
Mobile Distributed Computing
S
y
st
ems Workshops (
M
DC
)
,
Tokyo, Japan
,
2004
, pp.
588-593
.
[12]
Theodorakopou
los and J.S. Ba
ras, “On Trust Mo
dels and Trust Eval
uation Metrics for Ad
Hoc Networks”,
IE
EE
Journal on S
e
lected
Areas in
Co
mmunications,
Vol. 24
, No. 2, 2
006, pp
. 318-32
8.
[13]
Boukerche
and Y. Ren, “A
Security
Management Sche
me using a Novel Computation
a
l Repu
tation Model fo
r
Wireless and Mobile Ad Hoc Networks”,
Proc.
Int’l Workshop on Modeling An
al
ysis and Simulation of Wireles
s
and Mobil
e
S
y
st
ems, Van
c
ouver
, British
Columbi
a
, Canada,
2008
, pp
. 88-95
.
[14]
J. Rajesh, DV,
Subramanian, “
F
alse Node Recover
y
Algorithm
fo
r a Wir
e
less
Sensor Network”,
TE
LKOMNIKA
Indonesian Jour
nal of El
ectrical Engineering
, 20
15, vol. 13
, No
.
2, pp
. 379-386
.
[15]
L. Hiu
,
“
A
Novel QoS Routing
Algorithm
in W
i
reless Mesh Net
w
ork”,
TE
LKOMNIKA
, 2013
, v
o
l. 11
, NO. 3
,
p
p
.
1652-1664.
[16]
K.S. Sowmy
a
,
et al., “Detectio
n and Preven
tio
n of Blackhole
Attack
in MANET Using ACO”,
Internationa
l
Journal of Computer Scie
nce and
Network Security
, 2012
, Vol. 12
, No. 5
.
[17]
D.
Kumar,
S.
Kaur,
“A Two Way
ACO approach to
Id
entif
y
N
e
xt Secur
e
Promising path in MANET”,
International Jo
urnal of Co
mputer Networks and
Wirele
ss Communications (
I
JC
NWC)
,
2013, Vol. 3
,
No. 3
,
Jun
e
2013.
[18]
P.
Sharma,
N.
Sharma,
R.
Singh,
“A Secure Intrusi
on detection s
y
stem against DDOS
attack in Wireless Mobile
Ad-hoc Network
”
,
In
ternational Journal
of
Computer App
lica
tion
s
,
(0975
– 8887)
Vol. 41, No. 21
, 2012.
[19]
G.
Indi
ra
ni
, K.
Se
l
v
a
kuma
r
, “Pe
rforma
n
c
e
of Swa
r
m ba
se
d Int
r
usi
on De
t
e
c
t
i
o
n Sy
st
e
m
Usi
ng
Va
ri
ous Mobi
lity
Models in Mane
t”,
Internationa
l Journal of Advanced Research
in Computer Science and Softwa
r
e Engineering
,
2013, Vol. 3
,
Issue. 4
.
[20]
P. Sandh
y
a
, et al., “Ensuri
ng data conf
identiality in Man
e
t b
y
co
mbin
ing emphatic
cr
y
p
tograph
y
techn
i
que with
PSO”
,
Journal o
f
Theoretical an
d Applied
Information Techno
lo
gy
, 2013
, Vol. 5
6
No. 1
.
[21]
J. Jindal, et al.,
“An Agent Based PSO for
Rou
t
e Reconstru
c
tio
n in Mobile Network”,
International Journal of
Advanc
ed
Res
e
a
r
ch in Comput
er
Science and
Softw
are Eng
i
neering,
2013
, Vol. 3
,
Issue 6.
[22]
A. Konak, et al., “I
mproving Network Connectivity
in
Ad Hoc Networks Using
Parti
c
le Swarm
Optim
izat
ion an
d
Agents
”,
Wire
less Ne
twork
De
si
gn. Springer
New
Y
o
rk
, 2011
, pp
. 247-267
.
[23]
O. Dengiz, et al., “Connectiv
ity
management
in mobile
ad hoc networks using par
ticle swarm optimization
,
Els
e
vi
er”,
Ad
Ho
c Ne
twor
ks
, Vol. 9, 2011, pp. 131
2–1326.
[24]
K. Kavith
a,
et
al
., “
P
arti
cl
e S
w
ar
m
Optim
ization
F
o
r Adaptive A
nom
al
y
-
B
a
s
e
d I
n
trus
ion Det
ect
i
on S
y
s
t
em
Us
in
g
Fuzzy
Contro
ller
”
,
In
ternational
Journal of Comput
er Trends and
Technology (
I
JCTT)
, 2013, Vol.
4, Issue 10
.
[25]
M. Dasgupta,
et
al., “Routing Mi
sbehavior in Ad
Hoc Network”,
I
n
ternational
Jou
r
nal of Computer Applications
,
2010, Vol. 1
,
No
. 18
.
[26]
V. Kadam,
et al., “An Acknow
ledgement-Based Approach
fo
r
th
e Detection of
R
outing Misbeh
av
iour in
Manets”,
International Jo
urnal of
Ad
van
c
es
in Embedded
Systems
, 2011
, p
p
04-06, Vol. 1,
Issue 1.
[27]
A.K. Gupta
.,
et
al.
,
“
D
ete
c
ting
a
nd Dealin
g with
Malicious Node
s Problem in MANET”,
In
terna
tional Journal
o
f
Scien
tifi
c
&
Engineering
Rese
arc
h
, 2013
, Vol. 4
,
Issue 7.
[28]
J. Sengathi
r
, R
.
Manoharan
,
“Securit
y
Algor
it
hm
s for M
itigating Self
ish an
d Shared Root
Node Attacks i
n
MANETs”,
I. J.
Computer Netwo
r
k
and Information Security,
Vol. 10, 2013, pp.1-
10.
[29]
J. Karjee,
et
al., “Tracing
the Abnormal
Behav
i
or of Malicious
Nodes in MANET”,
Wire
le
ss Communic
a
tions,
Networking
and
Mobile Computing, WiCO
M
'08.
4th International Conferen
ce
, 20
08, pp
. 1-7
.
[30]
M. Schutte, “Detecting Self
ish an
d Malicious Nod
e
s in MANETs”,
Seminar Pap
e
r
, 2006.
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
:
119
4
–
12
01
1
201
[31]
G. Beni, et al
., “Swarm
intelligence in cel
lular robotics s
y
stem
s”,
In: Proceedings of NATO Advanced Workshop on
Robots and
Biological System
, 1
989, pp
. 703-71
2.
[32]
L.
Es
chenau
er,
et a
l
.
,
“
O
n Trus
t
Es
tabl
is
hm
ent i
n
M
obile
Ad H
o
c Networks,” Proc. 10
th Int’
l Security
Protoco
l
s
Workshop, Cambridge, U.K, Vol. 2845
, pp
. 47-6
6
, 2002
.
[33]
L. Capra, “Toward a Human Trust Model for Mobile
Ad-hoc Networks,” Proc. 2nd UK-Ub
iNet Workshop,
Cambridge Univ
ersity
, Cambridg
e, UK, 2004.
[34]
W
.
J
.
Adam
s
,
et al.
,
“
T
oward a
Decentr
ali
zed
Trus
t-bas
e
d Acc
e
s
s
Control S
y
s
t
em
for D
y
nam
i
c
Collabor
atio
n,
”
Proc. 6
t
h
Annua
l IEEE SMC Info
rmation Assu
rance Workshop
(
I
AW’05)
, West Po
int, N
Y
, 2005, pp. 317-324.
[35]
Y.L. Sun, et al., “Information Theo
retic Framework of Trust
Modeling an
d
Evaluation for
Ad Hoc Network
s
,”
IEEE Journal on
Sel
ect
ed
Ar
eas
i
n
Communicatio
ns
, Vol. 24, No.
2, 2006
, pp
. 305
-317.
[36]
R. Li, e
t
al.
,
“
A
n Objective
Trust Management Framework f
o
r Mobile Ad
Hoc Networks”,
Proc. IEEE 65
th
Vehicular Techn
o
logy Con
f
. (
V
TC’07)
, 2007, pp
. 56-60.
[37]
B.L.
Zourid
aki, et al., “Robust Coopera
tive Tr
ust Establis
hment for MANETs”,
Proc. 4th
AC
M Workshop on
Security of Ad
Hoc and S
e
nsor N
e
tworks,
Alexan
d
ria
,
VA
, 2006,
pp. 23-34
.
[38]
A. P
i
rzada and
C. M
c
Donald, “
E
s
t
ablis
hi
ng Tru
s
t in Pure Ad
Hoc Networks”,
Proc. 27th Australasian Computer
Scien
c
e Conf. (
A
CSC)
, Vol. 26, 2
004, pp
. 47-54
.
[39]
H. Yu, et al., “S
y
b
ilGuard
: Def
e
nding Agains
t
S
y
bil Att
acks
vi
a S
o
cial Networ
ks
”,
IEEE/ACM
Transactions o
n
Networking
, Vol. 16
, No. 3, 2008
, pp
. 576-589
.
[40]
K. Inkinen, “New Secure Routin
g in Ad Hoc Ne
tworks: Study
an
d Evaluation of
Proposed Schemes,”
Seminar on
Internetworking, Sjöku
lla, Finlan
d
, spring
2004.
[41]
C. Kardof and D. Wagner, “Secure
Routing in
Wireless Sensor Netw
orks: Attacks and Counter
measures
,”
Pr
oc.
1st IEEE In
t’l W
o
rkshop on Sens
or Network
Pr
otocols
and Applications, Anchora
g
e, AK,
USA,
20
03, pp
. 113-117
.
[42]
P. Michiardi
et
al., “A Game Theoretical Approach to
Ev
aluateCooperation Enforcem
ent Mechanisms in Mob
ile
Ad Hoc Networks,
"
Modeling a
nd Optimization
in Mobile, Ad
H
o
c and W
i
reless Networks (
W
iOpt'03)
, 2003.
[43]
R. Mahajan, et al., “Exper
i
en
ces
Apply
i
ng Game
Theor
y
to S
y
stem Design”,
Pr
oceed
ings
of the
ACM SIGCOMM
Workshop on Pr
actice and
Theor
y
of Ince
ntives
in
Networked S
y
stems (
P
IN'04)
, 2004, pp
. 183-190
.
BIOGRAP
HI
ES OF
AUTH
ORS
Mr. Pradeep
Ku
m
a
r
K
. is curr
ently working as Associate Prof
essor in Govt. Sri Krishnarajendra Silve
r
Jubilee Technological Institute, h
o
lding its respon
sibilities in Depa
rt
m
e
nt of Co
m
p
uter Science
&
Engineering, Bangalore, Ka
rn
ataka, I
ndia. He received
the B.E. de
gree in
co
m
puter s
c
ience
and engineering
fro
m
Gulbarga U
n
iversity, Gulbara
g
a,
I
ndia,
in 20
00
,
and the M
.
T
ech
,
degree in co
m
puter science and
engineer
ing fr
om
the Visvesvar
a
y
a
T
echnological Univ
er
sity
,
Belgau
m
,
in 200
6 r
e
spectively
.
Cur
r
e
ntly
pursuing research in the ar
ea of
adh
o
c
networ
k secur
ity
in Jawahar
l
al Nehr
u technical univer
s
ity
,
Kakinada,
I
ndia.
His r
e
sear
ch inter
e
sts includ
e networ
k secu
r
ity
,
wir
e
less co
m
m
unications an
d ne
twor
king,
gam
e
theory, sw
ar
m
inte
lligence and cyber
security.
He
is acti
v
e
m
e
m
b
er of
the i
eee co
mm
uni
catio
ns society.
Dr. B.R. P
r
asad Babu
is cur
r
e
ntly
wor
k
ing as Pr
o
f
es
sor
and Head
of
Depar
t
m
e
nt in SE
A
College o
f
E
ngg.
&
Technology
, Ba
ngalore. He
receiv
e
d th
e B.E. degree
in elect
rical
engin
eering fro
m
Banga
lore Universit
y
,
Bangalor
e
,
I
ndia,
in 198
3,
and the
M
.
E
,
degr
ee in electr
i
cal engineer
in
g fr
o
m
the My
so
r
e
Univer
sity
,
M
y
sor
e
,
in 1989 r
e
spectively
.
He
obtained his Ph.
D
degr
ee in co
m
p
uter
science fr
o
m
the M
a
ngalor
e
Univer
sity
,
M
a
ngalor
e
,
I
ndia,
in 2007.
His r
e
sear
ch
inter
e
sts include
M
obile adhoc n
e
twor
ks,
m
obile
co
m
m
unications,
and wir
e
less secur
ity
.
He published va
r
i
ous r
e
sear
ch paper
s
in leadi
ng inter
n
ational
Jour
nals,
inter
n
ational and national
confer
ences.
Dr
Prasad babu is a
lif
e
m
e
m
b
er of
ISTE
, CS
I and
institution of engineers India. He
is
holding responsibi
lities of BOS and
BOE
m
e
m
b
er of t
h
e visves
varaya
technological univ
e
r
s
ity,
Belgau
m
,
I
n
dia and T
u
m
kur
Univer
sity
,
I
ndia.
Evaluation Warning : The document was created with Spire.PDF for Python.