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.
9
, No
.
5
,
Octo
ber
201
9
, pp.
4326
~
43
35
IS
S
N:
20
88
-
8708
,
DOI: 10
.11
591/
ijece
.
v
9
i
5
.
pp
4326
-
43
35
4326
Journ
al h
om
e
page
:
http:
//
ia
es
core
.c
om/
journa
ls
/i
ndex.
ph
p/IJECE
Novel m
odel fo
r boostin
g securit
y streng
th and en
ergy
effici
ency
in in
ter
n
et
-
of
-
thi
ngs using mul
ti
-
s
taged g
am
e
Bhagy
as
hree
Amb
ore,
Sure
sh L
.
Depa
rtment
o
f
C
om
pute
r
Scie
n
ce a
nd
Eng
in
e
eri
n
g
,
Cambridg
e
In
st
it
ute of Te
chno
log
y
,
Ind
ia
Art
ic
le
In
f
o
ABSTR
A
CT
Art
ic
le
history:
Re
cei
ved
A
ug
8
, 2
01
8
Re
vised
A
pr 15
, 2
01
9
Accepte
d
Apr 30
, 201
9
Secur
ity
as
wel
l
as
ene
rg
y
eff
i
ci
en
c
y
is
one
o
f
the
m
ost
ine
v
it
able
an
d
cha
l
le
nging
pro
ble
m
s
when
it
c
om
es
it
l
arg
e
sc
al
e
net
work
d
ep
lo
y
m
ent
li
k
e
INter
net
-
of
-
Thi
n
gs
(IoT
).
Aft
er
rev
ie
wing
exi
st
i
ng
rese
ar
ch
wo
rk
on
IoT
,
it
was
found
that
the
r
e
are
discr
et
e
set
of
soluti
o
n
for
sec
ur
ity
as
well
as
fo
r
ene
rg
y
.
How
ever,
th
ere
is
littl
e
rese
arc
h
work
t
hat
h
as
joi
n
tly
i
nvesti
gated
both
th
e
probl
e
m
s
with
respe
c
t
to
IoT
.
Apar
t
fro
m
thi
s,
th
ere
ar
e
al
so
var
ious
form
of
attac
ks
that
c
ost
en
erg
y
of
sensors
th
at
consti
t
u
te
s
c
ore
ph
y
sic
al
devi
c
es
in
IoT.
The
ref
ore
,
thes
e
m
anusc
ript
s
pre
sent
a
novel
idea
for
ide
nti
f
y
i
ng
and
resisti
ng
th
e
sec
urity
bre
ac
h
wit
hin
an
Io
T
s
y
st
e
m
ensuring
ene
rg
y
eff
ic
i
ency
too
.
Harne
ss
in
g
the
m
odel
li
ng
ca
pab
il
i
t
y
of
g
ame
-
the
o
r
y
,
the
proposed
sy
s
te
m
off
ers
a
joi
nt
s
olut
ion
towar
ds
th
ese
proble
m
s.
The
sim
ulated
o
utc
om
e
of
the
st
ud
y
is
found
to
offe
r
ba
la
n
ce
p
e
rform
anc
e
for
bet
t
er
en
erg
y
eff
icien
c
y
an
d
robust
threat
m
it
iga
ti
on
ca
p
a
bil
ity
wh
en
compare
d
wit
h
e
xisti
ng
appr
oac
h
es.
Ke
yw
or
d
s
:
Atta
cks
Energy
Gam
e theo
ry
In
te
r
net
-
of
-
thi
ng
s
Secu
rity
Copyright
©
201
9
Instit
ut
e
o
f Ad
vanc
ed
Engi
n
ee
r
ing
and
S
cienc
e
.
Al
l
rights re
serv
ed
.
Corres
pond
in
g
Aut
h
or
:
Bhagyas
hr
ee
A
m
bo
re
,
Dep
t
of Com
pu
te
r Sci
ence a
nd
E
ng
in
e
eri
ng
,
Cam
br
idg
e
Ins
ti
tute of
Tech
bnol
og
y,
Chik
kab
asa
va
na
pura,
Krish
na
raj
a
pura,
Ben
ga
lur
u,
Karnata
ka 560
036, I
nd
ia
.
Em
a
il
: l
sn
tl
@c
cu.
e
du.tw
1.
INTROD
U
CTION
In
te
r
net
-
of
-
T
hi
ng
s
(IoT
)
offers a l
arg
e chain of
c
onnecti
on a
m
on
g diffe
re
nt
f
or
m
s o
f
physi
cal
syst
e
m
that
finall
y
le
a
ds
to
a
rob
us
t
cy
ber
-
physi
cal
syst
e
m
[1
]
.
O
wing
to
f
or
m
ation
of
net
worki
ng
am
on
g
di
fferen
t
nu
m
ber
of
heteroge
neous
ph
ysi
cal
dev
ic
es
over
va
rio
us
com
m
un
ic
at
ion
str
at
egies,
there
fore,
de
sig
ning
a
gen
e
ric
sec
ur
it
y
so
luti
on
is
not
feasible
i
n
I
oT.
At
prese
nt,
the
sec
ur
it
y
syst
e
m
of
IoT
f
ocuses
on
sec
uri
ng
ei
ther
ap
plica
ti
on lay
er, or
tr
a
ns
po
rtat
ion
lay
er, or
pe
rcep
ti
on lay
er [2]. T
he
re ar
e als
o dif
fer
e
nt r
e
view
s
tud
ie
s
carried
ou
t
t
owar
ds
a
ddres
sing
sec
ur
it
y
pro
tocols
i
n
Io
T
[
3
-
7],
howe
ver,
there
are
va
ri
ou
s
qu
est
io
ns
that
ar
e
ye
t
le
ft
unso
l
ve
d
from
the
ap
proac
hes
i
n
e
xi
sti
ng
sec
ur
it
y
so
luti
on.
T
he
f
irst
quest
io
n
w
il
l
be
–
is
the
re
any
good
al
te
rn
at
i
ve
f
or
str
ong
encr
y
pt
ion
m
echan
ism
?
T
he
seco
nd
quest
io
n
will
be
w
hy
the
existi
ng
s
ecur
it
y
so
luti
ons
a
re
s
o
at
ta
ck
s
pecifi
c.
O
wing
t
o
th
e
novel n
at
ure of
t
he
te
ch
nolo
gy,
a
ns
we
rs
t
o
su
c
h
quest
io
n
are
ye
t
to
be
e
xplo
red.
If
t
his
ans
we
r
s
wer
e
eve
r
f
ound,
t
ha
n
the
n
nex
t
quest
ion
wi
ll
be
w
hy
th
e
researc
he
rs
ha
ve
no
t
e
m
ph
asi
zed
on
their s
olu
ti
on
by consi
der
in
g ene
rg
y
facto
r.
The
I
oT
de
vices
are
usual
ly
wireless
a
nd
low
-
pow
ere
d
hard
war
e
wh
ic
h
can
not
exec
ute
com
ple
x
secur
it
y
protoc
ols.
He
nce,
exi
sti
ng
at
ta
c
ks
e.
g.
de
nial
of
ser
vice,
Sy
bil
at
ta
ck,
r
ou
ti
ng
at
ta
ck,
as
well
as
m
any
oth
e
r
un
known
at
ta
cks
to
o
co
st
the
netw
ork
resou
rce
as
we
ll
as
node
batte
ry
just
to
resist
it
.
More
ov
e
r,
t
here
are
var
i
ou
s
ty
pes
of
at
ta
cks
that
are
on
ly
m
eant
fo
r
ene
r
gy
dep
le
ti
on
[
8].
Ju
st
li
ke
secur
it
y
prob
le
m
s,
the
pro
blem
s
associat
ed
with
e
nergy
al
so
e
xi
sts
at
pr
esent
.
Re
cent
re
view
w
ork
e.
g.
[10]
offers
co
ncr
et
e
inf
or
m
at
ion
ab
ou
t
dif
fer
e
nt
f
or
m
s
of
e
ne
rgy
eff
ic
ie
ncy
te
chn
i
qu
e
s.
B
ut
unf
or
tu
natel
y,
none
of
the
e
xi
sti
ng
stud
ie
s
on
Io
T
hav
e
ev
e
r
as
soc
ia
te
d
ene
rg
y
pro
blem
s w
it
h
s
ecur
it
y p
roble
m
s.
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
Novel
mo
del fo
r boost
ing sec
uri
ty
streng
t
h a
nd en
e
rg
y
eff
ic
ie
ncy
…
(
Bh
ag
yas
hr
ee A
m
bo
r
e
)
4327
It
is
know
n
ve
r
y
well
that
sen
so
rs
co
ns
ti
tute
a
m
ajo
r
pa
rt
of
the
physi
cal
de
vices
in
IoT
wh
ic
h
w
orks
on
the
pr
i
ncipl
e o
f
ra
dio
-
ene
r
gy
m
od
el
[
10]
.
A
cco
rd
i
ng
to
t
his p
ri
nciple, it i
s stat
ed
that e
ver
y com
m
un
ic
at
ion
proces
s
is
di
re
ct
ly
li
nk
ed
up
with
the
al
loca
te
d
ene
r
gy
f
rom
it
s
batte
ry.
This
e
nergy
de
m
and
s
a
re
very
of
te
n
ov
e
rlo
oked
ev
en
i
n
the
are
a
of
sen
sory
a
pp
l
ic
at
ion
as
they
are
fo
c
us
e
d
on
sm
a
ll
-
scal
e
i
m
plem
entat
ion
and
not
m
uch
on
la
rge
scal
e
i
m
plem
entat
ion
.
T
he
dem
a
nd
s
of
energy
e
ff
ic
ie
ncy
is
not
m
uch
on
sm
al
l
scal
e
a
s
com
par
ed
t
o
la
rg
e
scal
e
of
de
plo
ym
ent
e.g
.
i
n
I
oT
.
T
her
e
fore,
it
is
nec
essa
ry
to
dev
el
op
a
com
pr
ehe
ns
iv
e
an
d
li
gh
twei
ght
protoc
ol
that
ca
n
balance
both
t
he
e
nergy
nee
ds
as
well
as
s
ecur
it
y
dem
and
s
of
I
oT.
At
pr
ese
nt
gam
e
-
theor
y
is
on
e
of
t
he
widely
acce
pt
ed
m
od
el
ing
c
on
ce
pts
that
is
capab
le
of
f
r
a
m
ing
up
a
com
plex
pro
blem
s too
. T
he pr
opose
d s
yst
e
m
h
arn
esse
s this
po
te
ntial
f
or m
od
el
ing.
Hen
ce
,
t
his
pa
per
prese
nts
a
novel
te
ch
niq
ue
w
he
re
ga
m
e
theor
y
has
b
ee
n
us
e
d
for
m
od
el
i
ng
a
si
m
ple
decisi
on
m
aking
f
ram
ewo
rk
with
capa
bili
ty
of
isolat
ing
c
om
pr
omi
sed
IoT
de
vices.
Se
ct
ion
2
discusse
s
ab
out
the
existi
ng
resea
rc
h
w
ork
fo
ll
owe
d
by
pr
oble
m
identific
at
ion
in
Sect
ion
3.
Se
ct
ion
4
discusse
s
ab
out
pr
opose
d
m
e
thodo
l
og
y
f
ollow
e
d
by
el
ab
orat
ed
disc
us
sio
n
of
syst
em
de
sign
with
respec
t
to
assum
ption
&
de
pe
nd
e
ncies,
al
gorithm
co
ns
tr
uction
strat
egy,
a
nd
al
go
r
it
h
m
i
m
ple
m
e
ntati
on
in
Sect
ion
5.
Com
par
at
ive a
naly
sis o
f
acc
om
pl
ished res
ult i
s d
isc
us
se
d u
nd
e
r Sec
ti
on 6
and
co
nc
lu
sio
n i
n
Sect
io
n 7.
The
pro
blem
s
associat
ed
wit
h
Io
T
are
m
any
and
the
re
a
re
dif
fer
e
nt
resea
rch
e
rs
a
ddressi
ng
di
ff
e
ren
t
pro
blem
s
associat
ed
with
it
.
This
sect
io
n
bri
efs
of
li
te
ratu
r
es
towa
r
ds
sec
ur
it
y
as
well
as
ene
rg
y
pro
bl
e
m
s
in
Io
T
.
As
m
ajor
it
y
of
the
I
oT
dev
ic
es
a
re
usi
ng
se
nsors
,
th
eref
or
e
,
there
i
s
a
deep
relat
ion
s
hi
p
betwe
e
n
the
secur
it
y
feature
s
and
en
er
gy
eff
ic
ie
ncies.
The
prese
nt
sta
te
of
li
te
rat
ur
es
has
bee
n
witnessin
g
m
ai
nly
fun
dam
ental
d
isc
us
sio
n
f
ocusi
ng
ov
e
r
the
theo
reti
cal
aspe
ct
of
I
oT
(e.
g
.
Wo
lf
a
nd
Ser
panos
[
11]
,
Be
rti
no
et
al. [12
]
, Si
ngh et
al.
[13],
Bhatt
arai an
d Wan
g [
14
]
, B
urg
et al
.[15
]
,
Nur
se
et al
. [1
6],
Szym
ansk
i [17] et
c.).
These
re
view
li
te
ratur
es
assist
s
to
introduc
e
var
io
us
updates
te
chn
i
ques
pr
ese
nted
by
diff
e
re
nt
reearc
her
s
em
ph
a
siz
ing
on
di
ff
ere
nt
te
ch
ni
qu
e
s.A
uni
qu
e
stud
y
has
bee
n
pr
ese
nted
by
X
u
et
al
[18]
wh
e
re
on
t
ology
has
be
en
us
e
d
f
or
m
od
el
in
g
net
wor
k
threats
over
Io
T
.
The
stu
dy
has
al
so
form
ulate
d
va
rio
us
ru
le
s
and
reasonin
g
m
echan
ism
to
resist
ing
sec
ur
i
ty
threats
in
IoT.
Secu
rity
prob
le
m
s
cou
ld
al
so
be
so
l
ve
d
us
in
g
so
ft
war
e
def
i
ne
d
net
wor
k
w
her
e
i
ntege
r
li
near
pro
gr
am
m
ing
was
pro
ven
t
o
be
be
st
appr
oach
t
o
s
olv
e
t
he
pro
blem
(Liu
et
al
.
[
19
]
,
Vil
la
ri
et
al
.
[
20]
)
.
S
uch
sec
ur
it
y
featu
res
c
ould
be
f
ur
the
r
up
gr
a
de
d
by
en
h
ancin
g
conve
ntion
al
di
gital
sign
at
ur
e
(Mu
gh
al
et
al
.
[21]).
Ap
a
rt
from
dig
it
al
sign
at
ur
e,
sym
m
e
tric
encr
ypti
on,
oth
e
r
has
hing
m
echan
ism
,
and
pu
blic
key
encr
y
ption
a
re
al
s
o
f
ound
help
fu
l
in
resist
ing
l
ow
e
nd
t
hr
eat
s
over
IoT
dev
ic
es
(
Pereir
a
et
al
.
[2
2],
Ra
za
et
al
.
[2
3],
Xiao
an
d
Y
u
[
24
]
)
.
It
was
al
so
seen
that
us
a
ge
of
ho
m
om
o
rphi
c
encr
y
ption
c
ou
ld
increase
t
he
pr
i
vacy
featu
re
in
Io
T
de
vices
(S
on
g
et
al
.
[25]).
Ap
a
rt
fro
m
encr
ypti
on,
it
al
so
i
m
pr
oves
pe
rfor
m
ance
of
r
e
crypti
on
too.
Usage
of
gam
e
theor
y
ha
s
b
een
repo
rted
to
assist
in
m
od
el
in
g
so
luti
on t
ow
a
r
ds
lear
ning a
nd
r
esi
sti
ng th
rea
t (
Wu
a
nd
Wang
[26]).
Anothe
r
un
i
que
stud
y
was
presented
by
Z
ha
ng
et
al
.
[
30]
wh
e
re
po
te
ntial
of
public
key
encr
y
pti
on
has
bee
n
cl
ai
m
ed
with
le
sse
r
siz
e
of
secret
key.
Existi
n
g
li
te
ratur
es
ha
ve
discuss
e
d
var
i
ou
s
st
ud
ie
s
t
owar
ds
secur
i
ng
physi
cal
la
ye
r
in
IoT
(Hu
et
al
.
[27])
by
ad
ding
arti
fici
al
no
ise
.
Secur
it
y
-
base
d
co
nnect
ivit
y
betwee
n
Io
T
and
upcom
ing
i
ndus
try
4.0 is
quit
e h
ig
h.
A
rece
nt
stu
dy
sh
ows
that
Hidden
Ma
rko
v
Mo
del
co
ul
d
be
us
e
d
for
const
ru
ct
in
g
i
nt
el
li
gen
ce
to
resist
secu
rity
br
eac
hes
i
n
I
oT
a
pp
li
cat
ions
w
orkin
g
on
Ind
us
try
4.0
(Mo
us
ta
fa
et
al
.
[28]).
The
m
os
t
adv
a
nce
d
ver
si
on
in
c
rypto
gra
ph
y
cal
le
d
as
bl
ock
c
hain
is
re
centl
y
inv
est
ig
at
ed
by
m
any
r
esearche
rs
a
nd
wer
e
cl
aim
ed
to
of
fe
r
po
te
ntial
resist
ance
for
I
oT
dev
ic
es
(
Q
u
et
al
.
[2
9])
.
The
re
are
al
so
so
m
e
recent
w
orks
be
ing
carried
ou
t
to
wards
ene
rg
y
eff
ic
ie
ncy
in
I
oT
us
i
ng
diff
e
r
ent
appr
oach
es
.
It
was
seen
that
op
ti
m
iz
ation
-
base
d
appr
oach
assist
s
in
dev
el
op
i
ng
e
ne
r
gy
-
a
ware
m
od
el
ing
f
or
IoT
wit
h
bette
r
qual
it
y
of
ser
vice
pe
rfo
rm
ance
too
(A
lsa
ryrah
et
al
.
[30]).
Wor
k
car
ried
out
by
aga
h
et
al
.
[31]
an
d
Ha
m
di
[3
2]
ha
ve
al
so
em
ph
asi
zed
on
stren
gth
in
g sec
ur
it
y feat
ures i
n Io
T
.
Anothe
r
optim
iz
at
ion
-
base
d
appr
oach
was
in
tro
duced
in
existi
ng
syst
em
fo
r
a
ddressi
ng
posit
io
n
-
base
d
pro
blem
s
with
powe
r
con
t
ro
l
m
anage
m
ent
of
upli
nk
tran
sm
issi
on
(Mozaffari
et
al
.
[33]).
Discussion
about
e
nergy
-
ba
sed
c
omm
un
i
cat
ion
syst
em
us
in
g
se
nsors
has
been
car
ried
out
m
os
t
re
centl
y
by
Roy
et
a
l.
[34].
The
a
uthors
hav
e
pr
e
se
nted
a
so
l
utio
n
that
is
m
ea
nt
for
ene
rg
y
-
eff
ic
ie
nt
r
ou
ti
ng
op
e
rati
on
to
offe
r
increase
d
packet
fo
r
wa
rd
i
ng
perform
ance
and
i
ncr
ea
sed
ne
twork
li
feti
m
e.
Ha
rdware
-
ba
sed
s
olu
ti
on
i
s
al
so
pr
ese
nted
m
os
t
rece
ntly
with
an
ai
d
of
Re
ct
enn
a
.
T
he
st
ud
y
carried
ou
t
by
Sh
a
fiq
ue
et
al
.
[
35
]
ha
ve
s
how
n
that
energy
ha
rv
est
in
g
ca
n
be
realy
fr
uitf
ul
wh
e
n
w
orke
d
al
ong
with
R
ect
enn
a.
A
par
t
from
this,
res
earche
r
e.g
.
Bi
sa
di
et
al
.
[36],
Ca
r
uso
et
al
.
[
37
]
,
Ma
ns
il
la
et
al
.
[38],
Zh
ai
et
al
.
[39],
an
d
J
u
et
al
.
[
40
]
ha
ve
al
s
o
e
m
ph
asi
zed
on
energy
pr
ob
le
m
s
in
Io
T
.
T
he
refor
e
,
it
can
be
see
n
that
t
her
e
a
re
diff
e
r
ent
set
of
li
te
rau
res
towa
rd
s
s
ol
ving
sec
ur
it
y
pro
blem
s
and
en
erg
y
prob
le
m
s
ver
y
discretel
y
wh
il
e
no
co
nn
ect
ivit
y
has
bee
n
est
ablished
ti
ll
d
at
e
bet
ween t
hem
in
Io
T
. Riahi an
d
Ri
ahi
[
41
]
hav
e
d
isc
usse
d
a
bout
ga
m
e theo
ry
for r
eso
ur
ce
distrib
ution
i
n
a
hu
ge
al
loc
at
ed
te
chn
i
qu
e
s.
Sahn
oun
et
al
.
[4
2]
pres
ented
a
m
od
el
cal
le
d
A
Coali
ti
on
-
Fo
rm
at
ion
Ga
m
e
m
od
el
f
or
powe
r
e
ff
ic
ie
nt
r
outi
ng
in
MANET
.
A
huj
a
a
nd
Be
di
[
43
]
ha
ve
dev
e
lop
e
d
a
te
chn
iq
ue
w
hi
ch
is
se
m
i
blin
d
dig
it
al
water
m
aking
te
ch
niq
ue
us
in
g
f
or
vid
e
o
de
velo
pin
g
MPE
G
-
2
st
and
a
r
d.
Evaluation Warning : The document was created with Spire.PDF for Python.
IS
S
N
:
2088
-
8708
In
t J
Elec
&
C
om
p
En
g,
V
ol.
9
, N
o.
5
,
Oct
ober
201
9
:
4
3
2
6
-
4
3
3
5
4328
The
st
ud
y
ou
tc
om
es
of
ab
ove
discu
ssed
li
te
ratur
es
ha
ve
pre
sented
so
l
ution
for
s
om
e
of
th
e
pote
ntial
secur
it
y
threats
an
d
e
ne
rg
y
prob
le
m
s
diff
e
re
ntly
and
it
was
f
ound
cl
aim
ing
it
s
su
ccess
fu
l
op
e
r
at
ion
usi
ng
nu
m
erical
validat
io
n.
H
oweve
r,
a
par
t
from
adv
anta
ges,
the
re
are
certai
n
assoc
ia
te
d
lim
it
at
io
ns
that
are
bri
efly
highli
gh
te
d
i
n nex
t
sect
ion f
ol
lowed b
y
disc
us
sio
n of t
he
p
rop
os
ed
so
l
utio
n
to
add
ress
s
uc
h pro
blem
s.
Fr
om
the
pri
or
sect
io
n,
it
ca
n
be
see
n
that
existi
ng
resea
rch
te
c
hin
i
qu
e
s
has
disti
nctive
f
oc
us
on
secur
it
y
pr
ob
le
m
s
as
well
as
for
e
nergy
pro
blem
s.
However,
t
he
po
s
sibl
e
co
nn
ect
i
vity
betwee
n
sec
ur
i
ty
and
energy
pro
ble
m
s
is
ver
y
few
to
fi
nd
fro
m
existi
ng
li
te
ratur
e
.
T
he
fac
t
that
existi
ng
secur
it
y
prot
oc
ols
us
es
com
plex
encr
y
pt
ion
te
c
hnqi
ue
that
re
qu
ire
d
higher
res
our
ce
de
pende
ncies
are
no
t
ine
sti
gated
by
e
xi
sti
ng
researc
hers.
At
the
sam
et
i
m
e,
ene
rg
y
e
ff
ic
ie
ncy
ap
proac
he
s
does
nt
ha
ve
any
co
ns
i
der
at
ion
of
the
sec
ur
it
y
featur
e
s
le
adin
g
to
a
big
trade
-
off
betwee
n
s
ecur
it
y
an
d
e
ne
rg
y
prob
le
m
s
in
I
oT.He
nce
the
pr
ob
le
m
state
m
ent
is
"
Design
i
ng
a
non
-
cry
ptogr
aphic
so
l
ution
tha
t
br
i
dg
e
s
th
e
trad
e
-
off
bet
we
en
securit
y
and
en
ergy
ef
fi
ci
ency
amo
ng the
I
oT
nodes
is a co
m
pu
t
ationall
y c
hall
eng
i
ng task
"
. T
he next secti
on
s
briefs
of
propose
d
s
olu
ti
on.
The
c
or
e
goal
of
pro
pose
d
sy
stem
is
to
resis
t
al
l
so
rts
of
at
ta
ck
in
I
oT
t
hat
m
akes
the
de
vi
ces
de
plete
it
s
ener
gy
.
T
he
pro
posed
sy
stem
aim
s
fo
r
intr
oducin
g
a
novel,
sim
ple
an
d
ye
t
r
ob
ust
fr
am
ewo
r
k
that
is
capab
le
of
ide
ntifyi
ng
a
nd
i
so
la
ti
ng
the
c
om
pr
om
ise
d
I
oT
de
vices
co
ns
ide
rin
g
t
he
fact
that
the
re
is
no
pr
e
def
i
ned in
form
ation
a
bout t
he
th
reat.
The
pro
pose
d
syst
e
m
i
m
ple
ments
gam
e
theo
ry
co
nce
pt
t
hat
al
lows
the
Io
T
de
vice
t
o
perf
or
m
certai
n
vu
l
ner
a
bili
ty
c
al
culat
ion
f
r
om
it
s
neigh
bo
rin
g
no
de,
ass
um
ing
that
it
do
e
sn
’
t
know
the
intenti
on
of
it
s
neig
hbor
node
as sho
wn in F
i
gure
1
. Usi
ng
pro
bab
il
it
y conc
ept and
de
pendin
g upo
n
the
extracte
d i
nfo
r
m
at
ion
of
vulne
ra
bili
t
y
as
well
a
s
le
gitim
ac
y
,
the
pro
posed
sys
tem
m
akes
a
decisi
on
to
is
olate
al
l
the
act
ive
connecti
on f
r
om
any
com
pr
om
ise
d
I
oT
de
vi
ce.
By
doin
g
t
hi
s,
only
t
he
nec
essary
am
ount o
f
e
ner
gy
is
spe
nt
to
cat
er
up
data
pa
cket
f
orwa
rd
i
ng
pr
ocess.
He
nce,
pro
pose
d
syst
e
m
is
capa
ble
of
resist
in
g
any
form
s
of
t
hr
eat
s
towa
rd
s
act
ive
com
m
un
ic
at
ion
proce
ss
i
n
I
oT
.
T
he
ne
xt
se
c
ti
on
bri
efs
a
bout
t
he
al
gorith
m
i
m
ple
m
entation
f
or
this p
ro
ce
ss
.
Figure
2
highli
gh
ts
the
syst
e
m
arch
it
ect
ur
e
wh
ic
h
ex
hib
it
s
that
propose
d
syst
e
m
a
ga
m
e
log
ic
base
d
on
wh
ic
h
it
for
m
ula
te
s
bo
th
uniq
ue
an
d
disc
rete
set
of
act
ion
s
t
o
be
e
xec
u
te
d
by
norm
al
and
m
al
ic
iou
s
node.
The
syst
em
per
f
or
m
s
analysis
of
vune
ra
bi
li
t
y
and
le
giti
m
acy
of
the
node
in
com
pliance
of
seq
ue
ntial
rati
on
al
it
y
of
m
ulti
-
sta
ged
gam
e
fo
ll
owed
by
ide
nt
ific
at
ion
of
in
tru
der
a
nd
preve
ntio
n
strat
egy.
The
il
lustrati
on
of
syst
em
d
esi
gn is car
ried
out in
ne
xt secti
on.
χ
χ
χ
P
c
P
c
P
c
χ
χ
P
c
P
c
C
o
m
p
r
o
m
i
s
e
d
I
o
T
D
e
v
i
c
e
N
o
r
m
a
l
I
o
T
D
e
v
i
c
e
L
i
n
k
G
e
n
e
r
a
t
e
d
b
y
N
o
r
m
a
l
I
o
T
D
e
v
i
c
e
L
i
n
k
G
e
n
e
r
a
t
e
d
b
y
C
o
m
p
r
o
m
i
s
e
d
I
o
T
D
e
v
i
c
e
S
t
a
g
e
-
1
S
t
a
g
e
-
2
S
t
a
g
e
-
3
Figure
1
C
omm
un
ic
at
ion
establi
sh
m
ent in pr
opos
e
d
syst
e
m
G
a
m
e
L
o
g
i
c
N
o
r
m
a
l
N
o
d
e
M
a
l
i
c
i
o
u
s
N
o
d
e
C
o
m
m
o
n
D
i
s
t
i
n
c
t
A
c
t
i
o
n
f
o
r
m
u
l
a
t
i
o
n
N
e
i
g
h
b
o
r
D
e
v
i
c
e
M
o
n
i
t
o
r
i
n
g
V
u
l
n
e
r
a
b
i
l
i
t
y
A
n
a
l
y
s
i
s
L
e
g
i
t
i
m
a
c
y
a
n
a
l
y
s
i
s
S
e
q
u
e
n
t
i
a
l
r
a
t
i
o
n
a
l
i
t
y
P
r
e
v
e
n
t
i
o
n
T
a
c
t
i
c
I
d
e
n
t
i
f
i
c
a
t
i
o
n
o
f
I
n
t
r
u
d
e
r
Figure
2 Sy
ste
m
arch
it
ect
ur
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
Novel
mo
del fo
r boost
ing sec
uri
ty
streng
t
h a
nd en
e
rg
y
eff
ic
ie
ncy
…
(
Bh
ag
yas
hr
ee A
m
bo
r
e
)
4329
2.
SY
STE
M
I
M
PLE
MENT
A
TION
The
pro
po
se
d
syst
e
m
aim
s
fo
r
co
ns
tr
uct
in
g
a
novel
decisi
on
m
aking
m
echan
ism
us
in
g
gam
e
theor
y
that
offe
rs
a
n
e
nh
a
nce
intel
li
gen
ce
am
ong
th
e
I
oT
nodes
to
capt
ur
e
t
he
la
t
ent
be
ha
viour
of
the
m
al
ic
iou
s
I
oT
nodes
.
I
n
c
ompli
ance
of
t
he
gam
e
theor
y
c
on
ce
pt,
t
he
sys
tem
design
im
plem
ents
m
ulti
-
sta
ge
d
gam
e
t
o
asses
s
the
r
obus
t
ness
and
sust
ai
nailt
y
of
t
he
pro
posed
c
oncept
t
owar
d
i
den
ti
fyi
ng
the
i
ntr
us
io
n
as
well
as
i
nt
ruder.
This secti
on
di
scusses
abo
ut
diff
e
re
nt esse
ntial
inf
orm
at
ion
conside
red to i
m
ple
m
ent the
pro
po
se
d
syst
e
m
.
2.1
.
Assu
m
pt
i
on
&
depen
denci
es
The
pr
im
e
ass
um
ption
of
the
propose
d
syst
e
m
is
that
it
of
fe
rs
a
com
plete
ind
epe
ndenc
e
from
any
apr
i
or
i
in
form
at
ion
ab
out
the
at
ta
cker
.
No
norm
al
no
de
is
assum
ed
to
po
sses
any
disti
nc
t
inform
ation
about
the m
alici
ou
s nod
e
. T
he
pri
m
e
d
epe
ndency
w
il
l be that in or
der
t
o
fin
d o
ut the presen
c
e of
att
acker
no
de i
n
it
s
transm
issi
on
pr
ox
im
ity, the
norm
al
n
od
e
will
n
eed
to pe
rform
n
ei
gh
bor
hood m
on
it
or
i
ng.
2.2
.
Algori
th
m
co
nst
ruc
tio
n str
at
e
gy
The
pr
im
e
const
ru
ct
io
n
strat
e
gy
of
al
gorith
m
is
that
it
co
ns
ide
rs
node
-
A
as
tra
ns
m
itt
er
no
de
a
nd
node
-
B
as
receiver
node
.
As
there
is
no
ap
rior
i
inf
orm
ati
on
a
bout
the
m
al
ic
iou
s
node
;
theref
ore,
e
ach
IoT
nodes
will
be
r
equ
i
red
to
cal
c
ulate
the
de
gr
e
e
of
sec
ur
e
nes
s
an
d
vulner
ab
il
ity.
It
does
s
o
by
m
on
it
or
in
g
t
w
o
esse
ntial
inf
orm
at
ion
e.g.
B
1
an
d
B
2
i.e.
t
ot
al
nu
m
ber
of
pack
et
s
t
ransm
it
te
d
and
total
num
ber
of
pa
ckets
dro
pp
e
d.
This
is
beca
us
e
th
is
act
ion
ca
n
be
belo
ng
i
ng
to
both
no
rm
a
l
and
m
al
iciou
s
node
.
Hence
,
th
e
pro
po
se
d
al
gor
it
h
m
design
m
akes
a
ver
y
cl
ear
sta
tem
ent
of
set
of
act
io
ns
f
or
m
ulate
d
in
m
ulti
-
sta
ged
gam
es
i.e.
A={
A
1
,
A
2
,
A
3
,
A
4
},whe
r
e
A
1
,
A
2
,
A
3
,
A
4
will
repres
ents
w
hen
t
he
node
c
hoos
e
t
o
f
orward
data,
dro
p
data,
raises
an
al
arm
abo
ut
m
al
ic
iou
s
node
,
and
la
unc
h
an
at
ta
ck
resp
ect
i
vely
.
A
cl
os
er
look
into
th
is
set
of
act
ion
s
will
show
that
A
3
an
d
A
4
are
the
on
l
y
discrete
act
ion
that
represen
ts
sp
eci
fical
ly
norm
al
Io
T
no
de
an
d
m
al
ic
iou
s
IoT
node
res
pecti
vely
.
T
he
al
gorithm
al
so
c
on
si
der
that
e
ach
play
er
(
or
IoT
nodes
)
will
be
execu
ti
ng t
heir
set o
f
act
io
n o
ne
a
fter a
no
t
he
r
a
nd not at a s
a
m
e tim
e.
2.3
.
Algori
th
m
im
plem
ent
at
i
on
The
pr
im
e
pur
po
s
e o
f
t
he
pro
po
s
ed
al
gorith
m
is
to
ide
ntify
the p
rese
nce
of
the
m
alici
ou
s
I
oT
node
i
n
the
net
work
of
sm
art
city.
Th
e
al
gorithm
i
mp
le
m
ents
the
log
ic
of
gam
e
theo
ry
in
orde
r
to
exec
ute
se
quentia
l
rati
on
al
it
y
for
bo
t
h
no
rm
al
a
nd
m
al
ic
iou
s
node
.
T
his
is
done
i
n
order
t
o
assess
t
he
powe
r
of
withst
and
t
he
adv
e
rsa
ry
in
presence
of
pote
ntial
and
un
kn
own
at
ta
cke
r.
The
al
gorithm
ta
kes
the
in
pu
t
of
n
(t
otal
nu
m
ber
of
Io
T
nodes
)
an
d
A
(sim
ulati
on
area
)
that
after
processi
ng
le
ads
to
ide
ntific
at
ion
of
vuln
erab
le
I
oT
node
.
Th
e
ste
ps
of the
pro
po
s
ed
alg
or
it
hm
are
as f
ollo
w:
Algori
th
m
for
ca
p
tu
ri
n
g vul
nerable
Io
T
n
od
e
Inpu
t
:
n
,
A
Out
p
ut
: i
den
ti
ficat
ion
of vul
ner
a
ble IoT
no
de
St
ar
t
1.
i
nit
n, A
2.
r
a
nd(
un
i
(
n
))
z
3.
F
or
z
=
1:
m |
m
is
m
axi
m
u
m
num
ber
of z
one
4.
Whil
e
m
on
(
data)<th
res
hold
do
5.
If
vul
<c
os
t(
data_tra
ns)
th
en
6.
Sele
ct
A
1
a
nd opt
p
1
=1
7.
El
se
8.
Sele
ct
A
1
a
nd opt
p
2
=Δ
A
4
9.
End
If
10. U
pd
at
e
vul
param
and
co
m
pu
te
χ
11.
E
nd
W
h
il
e
12. I
den
it
ify
nod
e
-
A
a
s c
om
pr
om
ise
d
I
oT n
od
e
13.
En
d
F
or
End
The
ste
p
-
wise
discuss
i
on
of
the
above
al
gorithm
i
m
p
leme
ntati
on
is
as
fo
ll
ows:
Th
e
al
go
rithm
form
ulate
s
diff
ere
nt
num
ber
of
tra
ns
m
issio
n
z
ones
z
wi
thin
the
sim
ul
at
ion
area
very
un
if
or
m
ly
(
Line
-
1)
wh
ic
h
is
a
dire
ct
rep
re
sentat
ion
of
a
cat
eg
ori
zed
transm
issio
n
a
rea
within
a
sm
art
c
it
y.
All
the
norm
al
n
ode
s
are
then
distri
bu
te
d
ra
ndom
l
y
in
co
m
plete
si
m
ulati
on
area
A
in
su
ch
a
way
that
un
if
or
m
nu
m
ber
s
of
I
oT
nodes
a
re
dep
l
oyed
in
al
l
the
transm
issi
on
z
on
e
s
z
(Li
ne
-
2).
It
will
al
so
m
ean
that
z=(z
1
,
z
2
,
….
.z
k
),
w
h
ere
k
represe
nts
k
=n
r
x
n
c
(n
r
=n
um
ber
of
r
ows,
n
c
=
nu
m
ber
of
c
ol
um
ns
,
an
d
(
n
r
,
n
c
)
A.
T
he
pro
pose
d
com
pu
ta
ti
on
Evaluation Warning : The document was created with Spire.PDF for Python.
IS
S
N
:
2088
-
8708
In
t J
Elec
&
C
om
p
En
g,
V
ol.
9
, N
o.
5
,
Oct
ober
201
9
:
4
3
2
6
-
4
3
3
5
4330
towa
rd
s
e
xp
l
ori
ng
an
d
co
nfi
r
m
ing
the
pr
ese
nce
of
m
a
li
ci
o
us
node
is
car
r
ie
d
ou
t
f
or
al
l
the
com
m
un
ic
at
ing
nodes
within
z
(Line
-
3).
Th
e
al
gorithm
than
e
xecu
te
s
a
m
on
it
or
ing
f
unct
ion
mon
(
)
consi
der
i
ng
th
e
input
argum
ents o
f
data
(
Line
-
4). B
asi
cal
ly
, th
e
m
on
it
ori
ng fu
nction
mon
(
)
c
ompu
te
s scala
r
pr
oduct of tw
o
e
ntit
ie
s,
wh
e
re
the
first
entit
e
is
relat
ed
to
pro
bab
il
it
y
of
c
om
pr
om
i
sed
I
oT
node
i
.e.
P
c
a
nd
seco
nd
e
ntit
y
repre
sents
non
-
vulne
rab
le
eve
nts.
T
he
vulne
rab
il
it
y
in
the
pr
opos
e
d
s
yst
e
m
is
def
ine
d
as
the
e
ve
nt
of
m
on
it
or
in
g
durin
g
wh
ic
h
t
he
m
on
it
or
i
ng
no
de
(source
node
)
is
not
a
ble
to
confirm
the
le
gitim
acy
of
th
e
ot
her
no
de
bein
g
m
on
it
or
ed.
Howev
e
r,
in
orde
r
to
com
pu
te
vu
l
ner
a
bili
ty
,
t
he
pro
pose
d
s
yst
e
m
is
req
ui
red
to
c
om
pu
te
tw
o
essenti
al
pa
ra
m
et
ers
i.e.
B
1
and
B
2
,
wh
il
e
do
i
ng
nei
ghbo
rho
od
m
on
it
or
ing
us
i
ng
prob
a
bili
ty
fu
nctio
n.
Thes
e
par
am
et
ers
are
basical
ly
util
i
zed
f
or
com
puti
ng
posit
ive
le
gitim
acy
P
L
as
well
as
ne
gative
le
giti
m
ac
y
of
t
he
m
on
it
or
ed
no
de
.
The
posit
iv
e
le
gitim
acy
P
L
is
cal
culat
e
d
as
B
1
/B
1
+B
2
wh
il
e
neg
at
iv
e
le
gitim
ac
y
N
L
is
com
pu
te
d
as
(
1
-
χ)
-
P
L
.
Furth
er,
us
in
g
pro
ba
bili
ty
,
the
com
pu
ta
ti
on
of
χ
is
carrie
d
out
in
the
f
or
m
of
f
unct
io
n
f
(B
1
,
B
2
,
c
),
w
her
e
c
re
pr
ese
nts
a
ne
twork
c
oe
ff
i
ci
ent.
A
cl
os
er
lo
ok
into
the
f
or
m
ulati
on
of
PL
(B
1
/(B
1
+B
2
).
(
1
-
χ)
),
N
L
((1
-
χ)
-
P
L
=(B
2
/B
1
+B
2
).
(
1
-
χ
)),
a
nd
χ
will
show
that
P
L
is
ne
ve
r
en
ough
to
a
s
certai
n
the
le
giti
m
ac
y
of
the
node
if
B
1
=B
2
.
This
w
il
l
m
ean
that
P
L
will
al
ways
ha
ve
a
sam
e
value
in
case
of
B
1
=B
2
.
Ther
e
f
or
e,
the
param
et
er
of
vu
l
ner
a
bili
ty
χ
assist
s
to
off
erin
g
m
or
e
dis
cl
os
ure
a
bout
the
le
giti
m
ac
y
-
bae
d
inf
o
rm
at
ion
abou
t t
he vu
l
ner
a
ble no
de.
Applyi
ng
the
c
on
ce
pt
of
se
qu
entia
l
rati
on
al
it
y
in
gam
e
theo
ry,
a
re
gula
r
node
will
al
way
s
at
tem
pt
to
increase
it
s
pa
yoff
by
capt
uri
ng
m
or
e
i
nfo
r
m
at
ion
ab
out
the
m
al
ic
iou
s
node
w
hile
the
m
al
ic
iou
s
node
will
at
tem
pt
to
inv
oke
le
thal
at
ta
cks
as
m
any
as
po
ssible.
T
he
id
ea
is
to
ob
se
r
ve
if
the
pro
pos
ed
syst
em
is
ac
tuall
y
able
to
capt
ure
su
ch
dynam
ic
inform
ation
us
in
g
gam
e
t
heory.
T
her
e
f
or
e
,
to
m
ake
the
process
sli
gh
tl
y
pr
act
ic
al
,
the
stud
y
co
ns
i
der
thres
ho
l
d
of
vu
l
ner
a
bili
ty
a
nd
c
hoos
e
s
t
o
com
par
e
with
the
m
on
it
or
data
(Line
-
4).
T
his
is
po
ssi
ble
bec
ause
if
the
us
e
r
ad
op
ts
a
s
pec
ific
app
li
cat
ion
of
I
oT
,
they
will
be
awar
e
of
th
e
sit
uation
of
a
dversa
ries
an
d
non
-
ade
versari
es.
He
nce,
us
e
r
can
init
ia
li
ze
the
value
of
t
hr
es
hold
dep
e
nd
i
ng
upon the
criti
cal
it
y of
their
appli
cat
ion
bein
g r
unning
over
I
oT.
The
nex
t
ste
p
of
t
he
pro
pose
d
al
gorithm
is
to
f
ur
the
r
c
om
pu
te
the
degree
of
vulne
ra
bili
ty
on
the
basis
of
da
ta
tr
ansm
issi
on
.
T
he
pro
pose
d
sys
tem
m
akes
it
pract
ic
al
by
ass
ociat
ing
cost
w
it
h
the
data
t
ra
ns
fe
r.
The
pri
m
e
log
ic
i
m
ple
m
ent
ed
here
is
–
ever
y
com
m
un
ic
at
ion
ta
sk
has
co
nsum
pti
on
of
s
pecific
set
of
resou
rces
(call
ed
as
c
os
t)
f
or
bo
t
h
norm
al
as
well
as
m
alicio
us
node.
T
his
will
m
ean
that
f
or
eve
ry
act
ion
of
at
ta
cker
, t
her
e
is a co
st a
sso
ci
at
ed
with
it
.
Ag
ai
n,
base
d
on
the
c
on
ce
pt
of
seq
ue
ntial
r
at
ion
al
it
y,
an
a
tt
acker
will
ne
ver
wa
nt
that
their
c
os
t
of
at
ta
ck
sh
ould
increase
a
nd
in
ste
ad
shou
l
d
loo
k
f
or
m
or
e
prof
it
to
be
m
ade
by
la
un
chi
ng
an
at
ta
ck.
The
r
efore
,
the
at
ta
cker
no
de
wil
l
no
t
la
unch
it
s
m
alici
ou
s
c
odes
in
th
e
be
ginnin
g
w
hich
will
res
ul
t
in
inc
rease
of
tr
us
t
le
vel
of
the
at
ta
cker
am
on
g
t
he
norm
al
no
de
s
an
d
he
nce
it
will
ex
hib
it
A
1
an
d
A
2
act
ions
that
are
ne
arl
y
sam
e
as
that
of
norm
al
no
de
.
H
ow
e
ver,
at
ta
cker
w
il
l
no
t
cho
os
e
t
o
co
ntinu
e
e
xe
rcisi
ng
this
act
ion
f
or
long
as
it
will
be
agai
ns
t
seq
uen
ti
al
rati
onal
it
y
ru
le
in
Ba
ye
sia
n
gam
e.
They
will
stop
e
xecu
ti
ng
A
1
an
d
A
2
un
ti
l
they
fi
nd
that
they
can
m
ake
m
or
e
prof
it
by
la
unch
ing
a
n
at
ta
ck
in
com
par
iso
n
to
cost
to
be
bear
e
d
by
th
e
m
for
la
un
c
hing
that
at
ta
ck.
So,
the
propose
d
syst
e
m
co
m
pu
te
s
antic
ipate
d
co
s
t
of
transm
issio
n
of
data
pac
ket
by
us
in
g
pro
ba
bili
ty
theor
y
(Line
-
5).
F
or
that,
it
first
ob
ta
in
t
he
total
ou
tc
om
e
wh
ic
h
is
a
su
m
m
at
ion
of
total
cost
as
well
as
pro
f
it
inv
olv
e
d
i
n
the
m
aking
the
data
transm
issi
on.
It
the
n
c
ompu
te
s
t
he
fa
vor
able
outc
om
e
wh
ic
h
is t
he diffe
renc
e of
prof
it
fo
r m
aking
t
he
tra
ns
m
issi
on
w
it
h cost i
nvolv
e
d
i
n
tra
ns
m
itti
ng
t
he data
p
a
cket.
It
shou
l
d
be
underst
ood
t
hat
for
norm
al
ci
rcu
m
sta
n
ces,
the
gai
n
involve
d
in
m
aking
data
transm
issi
on
is antic
ipate
d
to b
e m
or
e than
co
st i
nvolv
e
d
f
or d
oi
ng
the sa
m
e. Th
is pr
oce
ss
m
aps
with b
oth
the
norm
al
no
des
and
m
al
ic
iou
s
nodes
as
wel
l.
This
is
al
so
the
em
pirical
form
of
A
1
a
ct
ion
that
c
ould
be
m
i
m
ic
ked
by
both
m
al
i
ci
ou
s
node
as
well
as
norm
al
no
de
in
I
oT.
Howe
ve
r,
the
re
is
a
sl
igh
t
d
i
ff
e
ren
ce
in
it
.
If
the
vu
l
ner
a
bi
li
t
y
pr
obabili
ty
vul
(=P
c
)
is
f
ound
to
be
le
ss
than
the
c
os
t
involve
d
in
the
data
transm
issio
n
i.e
.
cost
(
data_tra
ns)
than
it
repre
sents
the
case
of
norm
a
l
no
de
it
sel
f
(Line
-
5).
In
s
uc
h
case,
the
node
opts
for
exer
ci
sin
g
A
1
act
ion
a
nd
set
the
hi
gh
est
pro
bab
il
it
y
p
1
as
1
(
Line
-
6)
ot
he
rw
ise
it
sti
ll
chooses
A
1
act
i
on
but
m
ark
that
no
de
as
vulnera
ble
node
with
re
-
c
om
pu
ta
ti
on
of
the
pro
ba
bili
ty
p
2
.
T
he
va
riab
le
p
2
is
com
pu
te
d
as
diff
e
re
nce
of
c
os
t
of
la
unchi
ng
an
at
ta
ck
with
cost
of
forwardi
ng
data
pa
cket
an
d
the
e
ntire
thin
g
is
di
vid
e
d
by
pro
fit
that
it
m
akes
in
la
un
c
hing
a
n
at
ta
ck
(Li
ne
-
8).
The
al
gorit
hm
finall
y
update
s
B
1
and
B
2
,
wh
il
e
it
perform
s
upda
ti
ng
op
e
rati
on
of
P
c
a
nd
χ
(Line
-
9).
Final
ly
,
the
no
de
-
A
is
i
den
ti
fie
d
as
m
alici
ou
s
no
de
(Line
-
12)
.
On
e
of
t
he
int
eresti
ng
points
to
be
ob
s
er
ve
d
in
propose
d
al
gorithm
is
that
the
pro
po
se
d
al
gorithm
m
akes
the
sou
rce
node
c
om
pu
te
the
intenti
on
of
the
e
ntir
e
nei
ghbori
ng
node.
If
it
fin
ds
any
m
al
ic
iou
s
node
with
no
i
ntenti
on
of
la
unc
hing
a
n
at
ta
ck
tha
n
it
al
lows
t
hat
node
t
o
f
orwa
rd
t
he
data
pac
ket
an
d
al
s
o
fl
ag
that
node
as
m
alic
iou
s
node
.
T
he
refor
e
,
the
pro
posed
syst
em
co
m
pletely
ex
plo
it
s
the
netw
ork
beh
a
vioura
l
inf
or
m
at
ion
of
al
l
no
des,
w
hi
ch
is
abso
l
utely
no
t
at
al
l
a
c
om
pu
ta
ti
on
al
ly
intensive
proc
ess.
H
ow
e
ver,
if
the
m
al
ic
iou
s
node
is
fo
und
wit
h
co
nf
irm
ed
intenti
on
to
la
un
c
h
at
ta
ck,
it
isolat
es
the
t
arg
et
m
alici
ou
s
node
i
m
m
ediat
el
y.
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
Novel
mo
del fo
r boost
ing sec
uri
ty
streng
t
h a
nd en
e
rg
y
eff
ic
ie
ncy
…
(
Bh
ag
yas
hr
ee A
m
bo
r
e
)
4331
2.4
.
Br
idging
t
r
ade
-
off
be
tween
Ener
gy
an
d
S
ecuri
ty
Ther
e
a
re
m
an
y
ways
the
pr
opose
d
al
gorit
hm
br
idg
es
th
e
trade
-
off
betwe
en
the
ene
rg
y
-
eff
ic
ie
ncy
an
d
le
ver
a
ging sec
ur
it
y st
re
ng
t
h
a
s foll
ow
s:
2.4.1.
N
on
-
cry
pt
ogr
ap
hic
o
ri
gin
The
c
om
plete
i
m
ple
m
entat
i
on
doesn
’t
use
any
form
s
of
e
ncr
y
ption
al
gorithm
,
wh
ic
h
res
ults
i
n
m
axi
m
u
m
saving
of
al
locat
e
d
po
wer
t
o
pe
rfor
m
recu
r
siv
e
operati
on
of
en
cry
ption
as
well
as
dec
ryption.
The
c
om
plete
resist
ance
po
li
cy
is
based
on
inc
reasin
g
value
of
vu
l
ne
rab
il
it
y
facto
r
i.e.
χ.
U
nlik
e
any
conve
ntion
al
e
nc
ry
ption
m
eth
od,
w
he
re
th
e
key
-
value
s
will
require
d
t
o
be
sa
ve
d
a
nd
the
n
proce
ss
ed
(that
consum
es
m
e
m
or
y as well
a
s en
er
gy to
o), the
pr
opos
e
d
syst
e
m
is co
m
ple
te
ly
ind
epe
nd
e
nt of an
y s
uch
stora
ge
util
iz
at
ion
.
2.4.2.
Greed
y
na
t
ure
of exec
ut
ion
Existi
ng
i
ntrus
ion
detect
io
n
a
nd
pr
e
ve
ntion
syst
e
m
wo
rk
s
on
the
pr
i
ncipl
e
of
ide
ntific
at
ion
f
ollo
wed
by
isolat
ion
of
ad
ver
sa
ry.
H
ow
e
ve
r,
di
ff
e
r
ent
from
any
existi
ng
sec
ur
i
ty
pr
act
ic
es
on
I
oT,
the
pro
po
s
ed
syst
e
m
per
m
its
m
al
iciou
s
node
s
to
assist
s
in
data
t
ransm
issi
on
proc
ess
un
ti
l
and
un
le
ss
the
c
om
pu
te
d
intensio
n
of
t
he
at
ta
cker
node
is
no
t
m
al
ic
i
ou
s
.
T
he
ide
ol
og
y
be
hind
thi
s
is
–
a
ny
m
ali
ci
ou
s
node
wil
l
resist
them
getti
ng
caught
by
la
unc
hing
at
ta
ck
i
n
new
en
vir
on
m
ent.
Hen
ce
,
th
ey
assist
in
f
orwardin
g
data
pa
ckets
that
directy
be
nef
it
s
t
he
tra
nsm
issi
on
proces
s.
A
si
gn
ific
a
nt
am
ou
nt
of
e
xt
ra
tra
ns
m
i
tt
ance
ene
rg
y
is
sa
ved
in
this p
ro
ce
ss.
2.4.3.
E
xt
re
m
el
y
le
sser pr
oc
essing
dem
ands
Ap
a
rt
f
ro
m
stan
da
r
d
re
qu
i
re
m
ent
of
data
proces
sin
g,
the
pro
po
se
d
al
go
r
it
h
m
do
es
n’
t
ha
ve
any
oth
e
r
dep
e
ndencies
in
order
t
o
e
xe
cute
this
al
go
r
it
h
m
.
A
cl
os
e
r
look
int
o
the
al
gorithm
wil
l
sh
ow
pr
e
sen
ce
of
diff
e
re
nt
num
ber
of
par
am
et
e
rs
e.
g.
Pc,
χ
,
B
1,
B
2,
et
c
ca
n
be
e
xtracted
from
any
beacon
head
e
rs
as
t
he
y
are
form
ulate
d
directl
y
fr
o
m
the
inform
at
ion
exch
a
nged
by
be
acons
duri
ng
routin
g
proces
s.
This
tra
ns
ac
ti
on
al
inf
or
m
at
ion
is
al
so
sto
red
in
any
gate
way
node
in
IoT
an
d
the
refore
,
th
ere
is
no
e
xtra
effor
t
is
re
qu
i
red
t
o
retrieve t
his in
f
or
m
at
ion
and
he
nce it sa
ves
l
ot
o
f
en
e
rg
y.
2.4.
4.
N
on
-
conven
tional pre
ve
nt
io
n stra
tegy
Ma
j
ori
ty
of
th
e
existi
ng
sec
ur
it
y
al
gorith
m
s
fo
cuses
on
first
identific
at
ion
an
d
the
n
pr
e
ven
ti
on
exer
ci
se.
H
ow
ever,
pre
ven
ti
on
strat
e
gy
will
be
require
d
to
al
locat
e
extra
resou
rces
al
on
g
wit
h
ene
r
gy
and
it
al
so
de
pe
n
ds
how
le
thal
is
th
e
at
ta
ck.
I
n
short,
pr
e
ve
ntional
appro
ac
h
re
qu
i
res
m
or
e
en
erg
y
as
c
om
par
ed
t
o
the
ide
ntific
at
ion
exe
rcise.
H
ow
e
ve
r,
pro
posed
syst
em
doesn’
t
ha
ve
a
ny
su
c
h
lo
gic
im
plem
entat
ion
.
On
the
basis
of
com
pu
ta
ti
on
of
vu
l
ner
a
bili
ty
par
am
et
ers,
wh
e
n
the
m
a
li
ci
ou
s
node
a
nd
it
s
ha
rm
fu
l
intenti
on
a
re
identifie
d,
it
si
m
pl
y
isolat
es
them
fr
om
existi
ng
ongoin
g
c
omm
un
ic
at
ion
an
d
updates
i
ts
entire
m
on
it
or
i
ng
var
ia
ble
to
le
t
know
it
s
neig
hbori
ng
nodes
a
bout
th
e
ide
ntifie
d
at
ta
cke
r
node
.
Hen
c
e,
a
good
pro
port
io
nal
of
energy i
s sa
ve
d becau
se
of
t
hi
s.
2.4.5.
A
c
ost
-
e
ff
ec
tive
sec
ure
intell
igence
mecha
nism
A
cl
os
er
lo
ok
at
the
al
go
rithm
ic
ste
ps
sh
ows that
propose
d
al
gorithm
has
hi
gh
e
r
de
pe
nd
e
nc
ie
s
on
th
e
thres
ho
l
d.
H
oweve
r,
if
the
netw
ork
bec
om
es
hig
hly
dynam
ic
i
n
fu
tur
e
(b
y
introd
uc
ing
dif
fe
ren
t
m
ob
il
e
platfo
rm
s/no
de
s),
it
is
no
t
fe
asi
ble
for
us
e
r
to
change
the
threshol
d
accor
dingly
.
Be
cause
in
s
uch
ca
se
of
al
te
ring
the
t
hresh
old
will
be
against
the
c
oncept
of
se
que
ntial
rati
on
al
it
y.
This
pro
ble
m
can
be
so
l
ve
d
if
a
cost
eff
ect
i
ve
intel
li
gen
ce
is
buil
t
up
in
s
uch
a
way
that
pr
e
ci
sion
,
e
nergy,
and
rob
us
tnes
s
is
well
m
ai
nt
ai
ned.
Fo
ll
owin
g
ste
ps has
b
ee
n
a
do
pted f
or
t
his r
e
aso
n:
-
In
order
to
m
ai
ntain
pr
eci
si
on
in
ide
ntifyi
ng
m
alici
ou
s
no
de,
the
pro
po
s
ed
al
gorithm
us
es
a
var
ia
ble
for
false
posit
ive
U
as
a
pe
nalty
factor.
T
his
wi
ll
m
ean
that
if
a
norm
al
no
de
flags
a
nother
norm
al
no
de
m
or
e
m
al
ic
iou
s
than
it
will
be
al
l
ocated
U
as
a
pe
nalty
.
The
r
efore,
a
sli
ght
a
m
end
m
ent
i
s
create
d
f
or
t
his
pur
po
se
of
cat
erin
g
up
t
he
l
og
ic
of
se
qu
e
ntial
rati
on
al
it
y.
In
this
case
,
the
al
gorith
m
sh
ou
ld
com
pu
t
e
ϕ(
A
3)>ar
gm
ax{
ϕ(
A
1),
ϕ
(A2
)
}
w
her
e
ϕ
re
pr
ese
nts
antic
i
pation
f
un
ct
io
n.
The
value
of
this
functi
o
n
w
il
l
be
e
qu
i
valent
to
scal
ar
m
ulti
plica
ti
on
between
J
1
a
nd
J2
,
wh
e
re
J1
r
epr
ese
nts
Pc(
1
-
χ)
.ΔA
3
a
nd
J2
represe
nts((1
-
P
c).(1
-
χ)+
χ)
.(U+cost
(A3
))
.
The
a
bove
ex
pr
essi
on
of
ϕ(A3
)>ar
gm
ax{
ϕ(
A
1),
ϕ(A2
)
}
represe
nts
a
c
onditi
on
on
w
he
n
node
-
B
sho
uld
flag
or
up
d
at
e.
Howe
ver,
if
ϕ
(A1
)>0,
node
-
B
s
hould
no
t
op
t
f
or
A
1
act
ion
.
He
nce,
dynam
ic
threshol
ding
is
carrie
d
ou
t
by
updati
ng
t
hr
es
hold
a
s
L1/L2,
w
he
r
e
L1
U+c
os
t(
A
3)
an
d
L2
prof(A3)+
U.
He
nce,
w
he
n
reducti
on
in
U
al
so
reduce
th
re
sh
ol
d
m
aking
it
po
s
sible
f
or
dy
nam
ic
threshol
ding.
Hen
ce
,
without
usi
ng
any
pote
ntial
am
ou
nt
of
e
nergy
al
locat
ion,
the
al
gorithm
o
ff
e
r
s intel
li
gen
ce
buil
ding
for resi
sti
ng
m
ajo
rity
of thr
eat
s
.
Evaluation Warning : The document was created with Spire.PDF for Python.
IS
S
N
:
2088
-
8708
In
t J
Elec
&
C
om
p
En
g,
V
ol.
9
, N
o.
5
,
Oct
ober
201
9
:
4
3
2
6
-
4
3
3
5
4332
2.4.6.
Higher
s
ecuri
ty enc
ap
s
ulat
i
on
Un
li
ke
a
ny
ex
ist
ing
secur
it
y
al
go
rithm
s
that
fo
cuses
on
sp
ec
ific
form
s
of
threats,
th
e
pr
op
os
e
d
syst
e
m
of
fer
ss
ecur
it
y
against
al
l
fo
rm
s
of
adv
e
rsa
ries
tha
t
directl
y
or
ind
irect
ly
resu
lt
s
in
dep
le
ti
on
of
the
energy
f
ro
m
the
Io
T
nodes
.
T
her
e
fore,
with
out
involvi
ng
a
ny
extra
ene
rg
y
consum
ption
,
t
he
pro
pose
d
syst
e
m
off
ers
h
i
gh
e
r
le
vel of sec
uri
ty
tow
a
rd
s
IoT.
3.
RESU
LT
A
N
ALYSIS
This
sect
ion
di
scusses
a
bout
the
res
ults
being
acc
om
plished
f
ro
m
the
propose
d
im
ple
m
entat
ion
in
order
to
as
sess
the secu
rity
stren
gt
h
of the pr
opos
e
d
syst
em
.
The
pro
posed l
og
ic
d
isc
us
se
d i
n
pr
io
r
sect
io
n
has
been
im
ple
m
e
nted
with
50
0
I
oT
nodes
dis
per
se
d
i
n
1000x1
200m
2
si
m
ulati
on
area.
T
he
c
om
plete
analy
sis
was
rec
orde
d
f
or
600
sim
ulatio
n
rou
nd
s
on
increasin
g
sta
ge
s
of
gam
es.
The
a
naly
sis
ha
s
bee
n
car
rie
d
out
co
nsi
der
i
ng
t
he
perform
ance
par
am
et
er
of
le
gitim
acy
and
vu
l
ner
a
bili
ty
factor
wit
h
res
pe
ct
to
prob
a
bili
ty
of
com
pr
om
ise
d
Io
T
dev
ic
e.
Dis
cussion
of
pro
cess
of
cal
cula
ti
ng
le
giti
m
ac
y
as
well
as
vulnera
bili
ty
factor
has
been
br
ie
fe
d
in
pr
i
or
sect
io
n.
Fo
r
a
n
eff
e
ct
ive
analy
sis,
the
stud
y
outc
om
e
has
been
com
par
ed
with
work
carried
out
by
Ag
a
h
et
al
.
[
31]
and
Ham
di
et
al
.
[3
2].
Agah
et
al
.
[31]
has
prese
nted
a
def
init
ive
te
c
hn
i
que
wh
e
re
each
node
(
norm
al
and
com
pr
om
ised
)
ca
n
increase
it
s
resp
ect
ive
capab
il
it
y
based
on
it
s
ty
pe
(n
orm
al
node
protect
s
and
m
alici
ou
s
node
at
ta
ck
s).
Si
m
il
arly
,
wo
r
k
of
Ham
di
et
al
.
[
32
]
is
sli
ghtl
y
enh
a
nce
d
ver
si
on
of
Ag
a
h
et
al
.
[31]
wh
e
re
the
syst
em
al
locat
es
prob
a
bili
ty
to
each
node
w
orkin
g
on
de
finiti
ve
st
rategy.
In
orde
r
to
pe
r
form
co
m
par
at
ive
analy
sis,
only
the
c
or
e
a
s
pect
of
th
e
al
gorithm
has
being
im
ple
m
ented
ov
e
r
the
si
m
il
ar
te
s
t
-
en
vironm
ent
wh
e
re
the
pr
opose
d
syst
em
was
in
vestigat
ed.
A
cl
os
er
l
ook
int
o
the
outc
ome
sh
ows
that
pro
po
s
ed
syst
em
offer
s
re
duced
threats
t
o
Io
T
dev
ic
es
in
incr
easi
ng
sta
ge
d
gam
es
as
com
par
e
d
t
o
existi
ng
syst
em
as sh
ow
n
in
Figure 3
. T
he
pr
im
e reaso
n
be
hind this is existi
ng
m
echan
i
sm
cal
ls fo
r
on
e ro
un
d
of
c
hec
k
for
a
ll
the
node
s
in
com
m
un
ic
at
ion
in
orde
r
t
o
a
scertai
n
the
fa
ct
s
of
le
gitim
acy
of
t
he
node
,
but
pro
po
se
d
syst
e
m
per
f
or
m
s
progressi
ve
strat
egy
to
m
on
it
or
the
m
alici
ou
s
beh
a
viou
r
of
com
pr
om
ise
d
Io
T
dev
ic
e
by
us
i
ng
em
pirical
value
of
vu
l
ne
rab
il
it
y.
The
r
efore,
i
n
a
long
r
un
of
m
ul
ti
-
sta
ged
gam
es,
the pr
opos
e
d
s
yst
e
m
w
il
l al
ways reduce t
hr
e
at
level (
reduc
t
ion
i
n
P
c
)
A
disti
nct
perf
or
m
ance
of
lo
wer
i
ng
th
reat
le
vel
by
propo
sed
syst
em
ca
n
be
see
n
in
Figure
4
i
n
com
par
ison
t
o
existi
ng
syst
e
m
.
W
it
h
increa
sing
sim
ulati
on
tria
ls,
the
vulnera
bili
ty
sp
on
ta
ne
ously
m
i
nim
iz
es
and
hen
ce
it
can
be
al
so
s
ai
d
that
the
ene
r
gy
dissipati
on
al
s
o
m
inim
iz
es
too
.
As
the
pr
op
os
e
d
syste
m
consi
ders
energy
bein
g
dissi
pated
owin
g
to
energy
-
base
d
at
ta
cker
s,
s
o
the
reducti
on
in
threat
le
vel
is
equ
i
valent
to
m
ini
m
iz
at
ion
of
unwa
nted
(
or
il
le
giti
m
a
te)
ene
rg
y
de
pleti
on
.
T
he
refore
,
a
go
od
b
al
ance
i
s
m
ai
ntained
f
or
energy
dep
le
t
ion
due
to
se
cur
it
y
pro
blem
s
in
I
oT.
A
pa
rt
from
the
secur
it
y
stren
gth,
th
e
pro
po
se
d
syst
e
m
is
al
so
assessed
f
or
it
s
ene
r
gy
eff
ic
ie
ncy
t
oo.
Fig
ur
e 5
hi
gh
li
ghts
the
c
om
par
at
ive
analy
sis
of
the pr
opos
e
d
s
yst
e
m
to
existi
ng
syst
em
w
it
h
res
pect to
util
it
y fact
or
.
Figure
3
.
Com
par
at
ive
analy
s
is of le
giti
m
ac
y
Figure
4
.
Com
par
at
ive
analy
s
is of vulne
ra
bili
ty
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
Novel
mo
del fo
r boost
ing sec
uri
ty
streng
t
h a
nd en
e
rg
y
eff
ic
ie
ncy
…
(
Bh
ag
yas
hr
ee A
m
bo
r
e
)
4333
(a)
(b)
(c)
(d)
Figure
5
C
om
par
at
ive
An
al
ysi
s of
Util
it
y
,
(a)
Reg
ular No
de Uti
li
ty
,
(b
)
Ma
l
ic
iou
s
N
od
e
U
t
il
ity
,
(c)
Re
gula
r Node
Util
it
y
,
(d
)
Ma
li
ci
ou
s No
de
U
ti
li
ty
The
outc
om
e
i
s
interp
reted
w
it
h
resp
ect
to
norm
al
no
de
a
nd
m
alici
ou
s
no
de
util
it
y.
A
cl
os
er
l
ook
at
the
util
it
y
of
t
he
re
gu
la
r
node
(F
ig
ur
e
5(a)
,
(c
))
show
s
that
pro
posed
syst
em
of
fer
s
al
l
oca
ti
on
of
hi
gh
e
r
util
it
y
for
the
no
rm
al
nodes
as
c
ompare
d
to
the
e
xitsi
ng
a
ppr
oa
ches.
It
act
ually
m
eans
that
adoptio
n
of
Ba
ye
sia
n
equ
il
ib
rium
con
cept
by
pr
opose
d
syst
em
of
f
ers
be
tt
er
ene
r
gy
ef
fici
ency
a
s
com
par
ed
t
o
Ag
a
h
et
al
.
[31
]
who
has
us
e
d
def
i
ni
ti
ve
app
r
oac
h
and
Ham
di
et
al
.
[32]
who
ha
ve
us
e
d
oppo
rtu
nisti
c
app
r
oa
ch.
Mo
re
ov
e
r
,
with
increase
of
ga
m
e
sta
ge
(in
x
-
axis
),
the
outc
om
es
loo
ks
quit
e
pr
act
ic
al
a
nd
be
nef
ic
ia
l
f
ro
m
resour
ce
s
avin
g
too
.
O
n
the
oth
er
ha
nd
,
(F
i
gure
5(b
)
,
(d))
shows
t
hat
irres
pe
ct
ive
of
a
ny
a
ppr
oach,
the
va
lue
of
the
util
it
y
fo
r
m
al
ic
iou
s
node
is
ke
pt
c
on
st
ant
an
d
le
ss
th
an
wh
at
has
be
en
receive
d
by
norm
al
no
de
.
T
her
e
is
a
r
e
aso
n
beh
i
nd
this.
Lo
ok
i
ng
at
the
diff
e
ren
ce
bet
we
en
the
util
it
y
val
ues,
it
can
be
seen
t
hat
ther
e
is
a
good
va
r
ia
ti
on
with
achie
ving
higher
util
it
y
value
for
no
r
m
al
no
de,
but
util
it
y
of
the
m
al
ic
iou
s
node
is
no
t
al
lo
w
ed
to
be
increase
d
f
or
bo
t
h
pr
opos
e
d
as
well
as
ex
ist
ing
syst
em
.
Howe
ver,
in
orde
r
to
ob
ta
in
this
resu
lt
,
a
sing
l
e
form
ulati
on
of
util
it
y
m
a
trix
has
bee
n
car
ried
out
for
al
l
the
syst
e
m
ov
erlookin
g
the
util
it
y
m
at
rix
create
d
in
existi
ng syst
em
.
Hen
ce
,
the
m
alici
ou
s
no
de
is
nev
e
r
al
locat
ed
increasin
g
util
it
y
and
this
is
best
way
to
dis
coura
ge
any
act
ion
tak
en b
y
the m
al
iciou
s
node. T
he best
par
t
of the im
ple
m
entat
ion
is
if the m
al
ic
iou
s nod
e
is assist
ing
i
n
forw
a
r
ding
the
data
pack
et
,
there
is
no
im
pact
on
it
s
al
l
ocated
util
it
y
by
the
syst
e
m
.
Howe
ver
,
e
ve
n
in
com
pliance
of
seq
uen
ti
al
rati
on
al
it
y,
if
the
m
al
ic
iou
s
node
su
ccessf
ully
la
un
c
hes
an
at
ta
ck
with
ex
pe
ct
at
ion
of
hi
gh
e
r
prof
i
t
than
it
is
al
lo
cat
ed
with
c
onsta
nt
util
it
y
on
l
y.
This
c
oncep
t
create
s
f
urt
he
r
obfu
s
cat
ion
a
m
on
g
the
m
a
li
ci
ou
s
node
by
decli
ni
ng
the
i
dea
of
la
un
c
hing
at
ta
ck
an
d
acce
pts
to
for
ward
the
data
pac
ket
in
ste
ad.
Ther
e
f
or
e,
t
he
pro
po
se
d
syst
e
m
po
te
ntial
ly
and
ta
ct
ic
al
y
m
anag
es
the
pe
rfor
m
ance
of
secur
it
y
stren
gt
h
an
d
energy ef
fici
en
cy
.
Evaluation Warning : The document was created with Spire.PDF for Python.
IS
S
N
:
2088
-
8708
In
t J
Elec
&
C
om
p
En
g,
V
ol.
9
, N
o.
5
,
Oct
ober
201
9
:
4
3
2
6
-
4
3
3
5
4334
4.
CONCL
US
I
O
N
A
c
om
pl
i
a
nc
e
of
s
e
c
u
r
i
t
y
a
s
w
e
l
l
a
s
e
ne
r
gy
e
f
f
i
c
i
e
nc
y
i
s
hi
gh
l
y
e
s
s
e
nt
i
al
e
s
pe
c
i
a
l
ly
i
f
it
i
s
a
s
e
ns
or
de
vi
c
e
t
ha
t
ha
s
l
im
i
te
d
c
om
pu
t
a
t
i
on
a
l
c
a
pa
bi
l
it
y
w
i
t
h
r
e
s
ou
r
c
e
c
on
s
t
r
a
i
nt
.
T
hi
s
m
a
nu
s
c
r
i
pt
ha
s
p
r
e
s
e
nt
e
d
a
no
ve
l
a
pp
r
oa
c
h
w
he
r
e
b
ot
h
de
t
e
c
ti
on
a
s
w
e
l
l
a
s
i
s
ol
a
ti
on
of
i
nt
r
ud
e
r
n
od
e
i
s
c
a
r
r
i
e
d
ou
t
b
y
us
i
ng
ga
m
e
th
e
or
y
.
T
he
i
nt
e
r
e
s
t
i
ng
po
i
nt
of
i
m
pl
em
e
nt
at
i
on
i
s
t
ha
t
it
c
ou
l
d
of
f
e
r
s
i
gn
i
f
i
c
a
nt
s
e
cu
r
i
t
y
w
i
t
ho
ut
e
ve
n
us
i
n
g
a
ny
t
y
pi
c
a
l
e
nc
r
y
pt
i
on
-
ba
s
e
d
s
e
c
ur
i
t
y
s
ch
e
m
e
.
T
he
po
w
e
r
of
s
e
q
ue
n
t
i
al
r
a
ti
on
a
l
i
ty
i
nt
r
od
uc
e
d
i
n
t
hi
s
pa
pe
r
a
ll
ow
t
he
no
r
m
a
l
no
de
to
i
nc
r
e
a
s
e
i
t
s
pa
y
of
f
by
c
a
t
ch
i
ng
h
ol
d
of
a
t
t
a
c
ke
r
no
d
e
w
hi
l
e
it
al
w
a
y
s
r
e
s
t
r
i
c
t
s
a
ny
for
m
of
a
t
t
a
c
ke
r
no
de
t
o c
e
r
t
a
i
n c
e
i
l
i
ng o
f
pa
y
o
f
f
.
H
e
nc
e
,
a
t
no
p
oi
nt
of
t
i
m
e
a
n a
dv
e
r
s
a
r
y
no
de
wi
l
l
be
hi
g
hl
y
s
pe
nd
i
n
g
t
he
i
r
e
nt
i
r
e
r
e
s
ou
r
c
e
t
o
i
ni
t
i
at
e
a
n
a
t
t
a
c
k
bu
t
w
i
l
l
ne
ve
r
be
s
uc
c
e
s
s
f
ul
i
n
i
t
s
a
tt
em
pt
s
.
A
s
w
i
t
ho
ut
o
b
t
a
i
ni
ng
pa
y
of
f
va
l
ue
,
t
he
a
dv
e
r
s
a
r
y
c
a
nn
ot
de
c
i
de
w
ha
t
a
c
ti
on
i
t
s
houl
d
a
c
t
ua
l
l
y
ta
ke
.
T
he
s
im
ul
a
t
i
on
ou
t
c
om
e
of
t
he
s
t
ud
y
ha
s
pr
ov
e
d
t
ha
t
pr
op
os
e
d
s
y
s
t
em
of
f
e
r
s
be
t
t
e
r
r
e
s
i
sta
nc
e
f
r
om
a
ny
f
or
m
of
e
ne
r
g
y
-
de
pl
e
t
i
on
a
t
ta
c
ks
a
s
w
e
l
l
a
s
i
t
al
s
o
of
f
e
r
s
go
od
e
ne
r
gy
e
f
f
i
c
i
e
nc
y
in
c
om
pa
r
i
s
on
t
o
f
r
e
qu
e
nt
l
y
e
xe
r
c
i
s
e
d
c
on
c
e
pt
s
.
REFERE
NCE
S
[1]
Olof
Li
b
erg
,
Marte
n
Sundbe
rg,
Er
ic
W
ang,
Johan
Bergma
n,
Joac
h
im
Sac
hs,
Cellular
Int
erne
t
o
f
Things
:
Technol
ogi
es,
St
andards
,
and
P
e
rform
ance
,
Ac
ad
emic
Press
,
2017
.
[2]
Bhadori
a
Robin
Singh,
Chaudh
ar
i
Nare
ndr
a,
Tom
ar
Gee
ta
m
Singh
,
Singh
Sha
il
end
ra,
Ex
p
loring
En
te
rpr
ise
Serv
ice
Bus
in the
Serv
i
c
e
-
Or
ie
nte
d
Arch
i
te
c
ture
Paradig
m
,
IGI Global,
2
017
[3]
A.
Hum
a
y
ed
,
J.
Li
n,
F.
Li
and
B
.
Luo,
"C
y
b
er
-
Ph
y
sic
al
S
y
s
te
m
s
Secur
ity
—
A
Sur
ve
y
,
"
in
I
EE
E
In
te
rnet
o
f
Things
Journal
,
vo
l. 4,
no.
6
,
pp
.
1802
-
1831,
De
c
2017
.
[4]
S.
Benzart
i
,
B.
T
riki
and
O.
Korb
aa
,
"A
surve
y
on
at
t
ac
ks i
n
Inte
rn
et
of Things ba
s
ed
net
works
,
"
20
17
Inte
rnationa
l
Confe
renc
e
on
E
ngine
ering
&
MI
S
(
ICEMI
S)
,
Monastir, 2017, pp.
1
-
7.
[5]
D.
M.
Mena
,
I
.
Papapa
nag
iot
ou,
B.
Yang,
"Int
er
net
of
thi
ngs:
Su
rve
y
on
se
cur
i
t
y
,
"
Journal
of
Info
rm
ati
on
Sec
urity
Journal:
A
Glob
al
P
erspec
tive
,
v
ol
.
27
,
no
.
3
,
201
8
.
[6]
M.
Sain, Y.
J
.
K
ang,
H
.
J.
Lee, "S
urve
y
on
sec
ur
i
t
y
in
Inte
rn
et of Things:
Sta
te of the art
an
d
cha
l
l
enge
s,"
2017
19t
h
Inte
rnational
Co
nfe
renc
e
on
Advance
d
Comm
uni
cat
ion
Technol
o
gy
(
ICACT)
,
Bongp
y
eong
,
2017
,
pp.
699
-
704.
[7]
R.
Bena
bd
essalem
,
M.
Ham
di
and
T.
H.
Kim
,
"A
Survey
on
S
ec
uri
t
y
Mode
ls,
Te
chni
qu
es,
an
d
Tool
s
for
the
Inte
rne
t
of
Th
in
gs,"
2014
7
th
In
te
rnational
Conf
ere
nce
on
Adv
a
nce
d
Sof
tware
E
ngine
ering
and
Its
Appl
i
cat
ions
,
Haikou,
2014
,
p
p.
44
-
48
.
[8]
V.
Shakhov,
I.
Koo
and
A.
Ro
dionov,
"Ene
rg
y
exha
ustion
at
t
a
cks
in
wire
le
ss
net
works
,
"
2017
Inte
rnational
Mult
i
-
Conf
ere
nc
e
on
Engi
n
ee
rin
g,
Computer
and
Information
S
cienc
es
(
SIBI
RCO
N)
,
Novos
ibi
rsk,
2017,
pp.
1
-
3.
[9]
F.
Jala
li,
S.
Kh
odadusta
n,
C.
Gra
y
,
K.
Hinton
and
F.
Suits,
"G
ree
ning
IoT
with
Fog:
A
Su
rve
y
,
"
2017
IEEE
Inte
rnational
Co
nfe
renc
e
on
Edg
e
Computing
(
EDGE)
,
Honolulu,
HI,
2017,
pp.
2
5
-
31.
[10]
Baoq
ia
ng
Kan,
Li
Cai
and
Lei
Zha
o,
"A
n
ac
cu
rat
e
en
erg
y
m
o
del
for
ws
n
nod
e
and
it
s
opti
m
al
design,
"
200
7
Inte
rnational
Co
nfe
renc
e
on
Co
mm
unic
ati
ons,
C
ircui
ts and
System
s
,
Kokura,
200
7,
pp
.
328
-
332
.
[11]
W
olf,
Marily
n
,
and
Dim
it
rios
S
erp
anos.
"S
af
ety
and
se
cur
ity
in
c
y
ber
-
ph
y
si
ca
l
s
y
stems
and
Int
ern
et
-
of
-
Thi
ngs
s
y
stems
,
"
Proc
e
edi
ngs of
the IEEE
,
vol
.
106
,
no
.
1
,
pp.
9
-
20
,
201
8
.
[12]
E.
B
ert
ino
,
N
.
Is
la
m
,
"Botn
et
s a
n
d
Inte
rn
et of Thi
ngs Sec
urity
,
" i
n
Computer
,
vol.
50,
no
.
2
,
pp
.
76
-
79,
Feb
2017
.
[13]
Singh,
Jat
inde
r
,
et
al.
,
"Twenty
sec
urity
consid
e
rat
ions
for
cl
oud
-
supported
Inte
r
net
of
Thi
ngs
,
"
IEE
E
Inte
rn
et
of
Things
Journal
,
vol.
3
,
no
.
3
,
pp.
269
–
284
,
Jun 2
016.
[14]
S.
Bhat
t
ara
i
and
Y.
W
ang,
"En
d
-
to
-
End
Trust
and
Secur
i
t
y
for
Inte
rne
t
of
Th
i
ngs
Applic
ation
s,"
in
Computer
,
vol.
51
,
no
.
4
,
pp
.
20
-
27
,
Apr 201
8.
[15]
A.
Burg,
A.
Ch
at
top
adh
y
a
y
and
K.
Y.
La
m
,
"
W
ire
le
ss
Com
muni
cation
and
Secur
i
t
y
Iss
ues
f
or
C
y
b
er
–
Ph
y
si
ca
l
S
y
stems
and the
Inte
rne
t
-
of
-
Thi
n
gs,"
in
Proceedi
ngs of
th
e
I
EE
E
,
vol.
106
,
no
.
1
,
p
p.
38
-
60
,
Jan
20
18.
[16]
J.
R.
C.
Nur
se
,
S.
Cree
se
and
D.
De
Roure
,
"S
ec
urity
R
isk
As
sessment
in
Int
ern
et
of
Thi
ngs
S
y
stems
,
"
in
I
T
Profe
ss
ional
,
vo
l.
19
,
no
.
5
,
pp
.
2
0
-
26,
2017
.
[17]
Sz
y
m
anski
T
ed
H.
,
"S
ec
ur
ity
and
privac
y
for
a
gre
en
Int
ern
et
of
Thi
ngs,
"
IT
Profe
ss
ional
,
vol.
19
,
no
.
5
,
pp.
34
-
41
,
2017
.
[18]
Xu Guangqua
n,
et
al.
,
"N
et
work
sec
urity
situ
at
io
n
awa
ren
ess ba
s
ed
on
sem
ant
ic
o
ntol
og
y
and
user
-
def
in
ed
ru
le
s fo
r
Inte
rne
t
of
Thi
n
gs,
"
IEEE
A
ccess
,
vol. 5,
pp.
210
46
-
21056
,
2017
.
[19]
Y.
Li
u
,
Y.
Kua
ng,
Y.
Xi
ao
an
d
G.
Xu,
"S
DN
-
Based
Dat
a
Tr
ansfe
r
S
ec
ur
ity
for
Inte
rn
et
of
Thi
ngs,"
in
IE
E
E
Inte
rnet
of
Things
Journal
,
vol. 5, no. 1, pp. 257
-
2
68,
Feb
2018.
[20]
Vill
ari
Mass
imo,
et
al.
,
"S
oftwa
re
def
ine
d
m
embrane
:
polic
y
-
dri
ven
edge
and
In
te
rne
t
of
Thi
ngs
sec
urity
,
"
IEEE
Cloud
Computin
g
,
vol
.
4
,
no
.
4
,
p
p.
92
-
99
,
2017
.
[21]
M.
A.
Mughal,
X.
Luo,
A.
Ullah,
S.
Ulla
h
and
Z.
Mahm
ood,
"A
Li
ghtwei
ght
Digit
al
Signa
tur
e
Based
Secur
i
t
y
Scheme
for
Hu
m
an
-
Cent
ere
d
In
te
rne
t
of
Thi
ngs,
" i
n
I
EE
E
A
cc
ess
,
vol
.
6
,
pp
.
3163
0
-
31643,
2018
.
[22]
Pere
ira
Geova
n
dro
CCF
,
e
t
a
l.
,
"P
erf
orm
ance
ev
al
u
at
ion
of
cr
y
ptogr
aphic
a
lg
orit
hm
s
over
Io
T
pl
at
form
s
an
d
oper
ating
s
y
s
te
m
s,
"
Sec
uri
ty
and
Comm
unic
ati
on
Net
works 2017
,
2017
.
[23]
Raz
a
Shah
id,
et
al.
,
"S
3K:
sca
l
abl
e
se
cur
i
t
y
wi
th
s
y
m
m
et
ric
ke
y
s
—
DTLS
ke
y
esta
bli
sh
m
ent
fo
r
the
In
te
rn
et
o
f
thi
ngs,
"
IE
EE
Tr
ansacti
ons on A
utomati
on
S
ci
en
ce
and
Eng
ine
er
ing
,
vo
l.
13
,
no
.
3
,
pp
.
1270
-
128
0
,
2016
.
[24]
Xiao
Dian
y
a
n
a
nd
Yang
Yu,
"C
r
y
pt
anal
y
s
is
of
Com
pac
t
-
LWE
and
Relat
ed
L
i
g
htwei
ght
Publ
ic
Ke
y
Enc
r
y
p
ti
on,
"
Sec
urit
y
and
Co
mm
unic
ati
on
N
e
tworks
2018
,
20
18.
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
Novel
mo
del fo
r boost
ing sec
uri
ty
streng
t
h a
nd en
e
rg
y
eff
ic
ie
ncy
…
(
Bh
ag
yas
hr
ee A
m
bo
r
e
)
4335
[25]
Song
W
ei
-
Ta
o,
B
in
Hu
and
Xiu
-
Feng
Zha
o,
"P
ri
vacy
Prote
ct
ion
of
IoT
Based
on
Full
y
Hom
om
orphic
Encr
y
pti
on
,
"
Wirel
ess Comm
unic
ati
ons
and
M
obil
e
Computing
2018
,
2018
.
[26]
H.
W
u
and
W
.
W
ang,
"A
Gam
e
Th
eor
y
Based
Coll
abor
ative
S
ec
uri
t
y
Det
ectio
n
Method
for
In
te
rne
t
of
Thi
ngs
S
y
st
ems
,
" i
n
IE
EE
Tr
ansacti
ons
on
Information
Forensic
s and
S
ec
urit
y
,
vol. 13,
no.
6
,
pp
.
1432
-
1445,
Jun 2018
.
[27]
L.
Hu
,
e
t
al
.
,
"
Coopera
t
ive
Ja
m
m
ing
for
Phy
sical
Lay
e
r
Secu
rity
Enh
anc
eme
nt
in
Internet
of
Thi
ngs,"
in
IE
E
E
Inte
rnet
of
Things
Journal
,
vol. 5, no. 1
,
pp.
219
-
2
28,
Feb
2018
[28]
N.
Mous
ta
fa,
E.
Adi,
B.
Turnbul
l
and
J.
Hu,
"A
New
Thre
at
Int
el
li
g
ence
Scheme
for
Safe
guar
di
ng
Industr
y
4.
0
S
y
stems
,
" i
n
IE
EE
Ac
c
ess
,
vo
l.
6,
pp
.
32910
-
32
924,
2018
[29]
Qu
Chao,
et
a
l.
,
"Bloc
kchain
Bas
ed
Cred
ibi
lit
y
V
eri
fi
ca
t
ion
Meth
od
f
or
IoT
Entiti
es.
"
Se
curit
y
and
Comm
unic
ati
on
Net
works 2018
,
2018
.
[30]
O.
Alsar
y
r
ah,
I
.
Mashal
and
T.
Y
.
Chung,
"Bi
-
Objective
Optimi
zation
for
Ene
rg
y
Aw
are
Inte
rne
t
o
f
Thi
ngs
Service
Com
positi
on,
" in
IEEE Access
,
vol.
6
,
pp
.
26809
-
26819,
2018
.
[31]
A.
Agah,
S.
K.
Das
and
K.
Basu,
"A
game
the
or
y
base
d
appr
oa
ch
for
sec
urity
i
n
wire
le
ss
sensor
net
works
,
"
IE
EE
Inte
rnational
Co
nfe
renc
e
on
Pe
rf
orm
ance
,
Comp
uti
ng,
and
Com
municat
ions 2
00
4
,
2004
,
pp
.
259
-
263.
[32]
M.
Ham
di
and
H.
Abie,
"G
a
m
e
-
base
d
ada
p
tive
sec
uri
t
y
in
t
he
Inte
rn
et
of
Thi
ngs
for
eHe
al
th
,
"
2014
IE
E
E
Inte
rnational
Co
nfe
renc
e
on
Co
mm
unic
ati
ons (
ICC)
,
S
y
dne
y
,
N
SW
,
2014,
pp
.
9
20
-
925.
[33]
M.
Moza
ffa
ri
,
W
.
Saad,
M.
Benni
s
and
M.
Debba
h,
"M
o
bil
e
Unm
anne
d
Aeri
al
Vehic
l
es
(UA
V
s)
for
Ene
rg
y
-
Eff
ic
i
ent
Inte
rne
t
of
Th
in
gs
Comm
unic
at
i
ons,"
in
IEEE
Tr
ansacti
ons
on
W
irel
ess
Comm
unic
ati
ons
,
vo
l.
16
,
no.
11
,
pp
.
7574
-
7589,
Nov
2017
.
[34]
S.
S.
Ro
y
,
D.
Puthal,
S.
Sharm
a,
S.
P
.
Mohant
y
and
A.
Y.
Zo
m
a
y
a
,
"Build
ing
a
Sus
ta
in
abl
e
I
nte
rne
t
of
Th
ing
s:
Ene
rg
y
-
Eff
ic
i
ent
Routi
ng
Us
ing
L
ow
-
Pow
er
Sensors
W
il
l
Me
et
th
e
Ne
ed,
"
i
n
IEE
E
Consum
er
El
e
ct
ronics
Magazine
,
vo
l. 7
,
no
.
2
,
pp
.
42
-
4
9,
Mar
2018.
[35]
K.
Shafique
,
e
t
al.
,
"Ene
rg
y
H
a
rve
sting
Us
ing
a
Low
-
Cost
Rect
enna
for
In
te
rn
e
t
of
Th
ings
(IoT
)
Applic
a
ti
ons,"
in
IE
EE A
c
ce
ss
,
vol.
6
,
pp
.
3093
2
-
30941,
2018
.
[36]
M.
Bisadi,
A.
Akram
i,
S.
Teim
ourz
ade
h
,
F.
Am
ini
far
,
M.
Karg
ah
i
and
M.
Shahid
ehpour
,
"Io
T
-
En
abl
ed
Hum
ans
in
the
Loop
for
En
erg
y
Mana
g
ement
S
y
st
ems
:
Prom
oti
ng
Buil
ding
Occ
upan
ts'
Par
t
ic
ip
at
ion
in
Opt
imizi
ng
En
er
g
y
Consum
pti
on,
" in
IEEE Electri
f
i
cat
ion
Magazine
,
vol
.
6
,
no
.
2
,
pp
.
64
-
72
,
Jun
201
8.
[37]
A.
Caruso,
S.
Chessa,
S.
Esc
ola
r,
X
.
del
To
ro
and
J.
C.
L
ópez
,
"A
D
y
na
m
ic
Program
m
i
ng
Algorit
hm
for
High
-
Le
ve
l
Ta
s
k
Schedul
ing
in
Ene
rg
y
Harve
s
ti
ng
IoT
,
"
in
I
EE
E
In
te
rnet
o
f
Things
Journal
,
vol
.
5,
no
.
3,
pp.
2234
-
2248
,
J
une
2018.
[38]
D.
Casado
-
Mans
il
la
,
et
a
l.
,
"A
Hum
an
-
Cent
ric
&
Conte
xt
-
Aw
ar
e
IoT
Fram
ework
for
Enha
n
ci
ng
E
ner
g
y
Eff
ic
i
ency
in
Buil
d
ings o
f
P
ubli
c
Us
e,
" i
n
IE
EE
Ac
c
ess
,
vo
l.
6,
pp
.
31444
-
31
456,
2018
.
[39]
D.
Zha
i
,
R.
Zh
ang,
L
.
Ca
i,
B
.
Li
and
Y
.
J
ia
n
g,
"Ene
rg
y
-
Eff
i
ci
en
t
Us
er
Sche
duli
ng
and
Pow
er
Allocati
on
fo
r
NOMA
-
Based
W
ire
le
ss
Networks
W
it
h
Mass
iv
e
IoT
Devi
ce
s,"
in
IEEE
Inte
rne
t
of
Things
Journal
,
vo
l
.
5,
no
.
3,
pp.
1857
-
1868
,
J
un
2018.
[40]
Q.
Ju,
H.
Li
an
d
Y.
Zha
ng,
"Powe
r
Mana
gement
for
Kinet
ic
E
n
erg
y
Harv
esti
n
g
IoT,
"
in
IEE
E
Sensors
Journa
l
,
vol.
18
,
no
.
10
,
p
p.
4336
-
4345
,
M
a
y
2018.
[41]
Sara
Ria
h
i,
A
zzeddi
ne
R
ia
hi
,
"
Gam
e
the
or
y
fo
r
resourc
e
shari
ng
in
l
arg
e
d
ist
ribut
ed
s
y
stems
,
"
Inte
rnational
Journal
of
Elec
t
rical
and
Computer
Eng
ine
ering
(
IJE
CE)
,
vol.
9,
no.
2
,
pp
.
1249
-
1257
,
2019
.
[42]
Sahnoun,
Abde
lka
bir
,
Ahm
ed
Habba
ni,
and
Jam
al
El
Ab
badi
,
"A
Coali
ti
on
-
Form
at
ion
Gam
e
Model
for
Ene
rg
y
-
Eff
ic
i
ent
R
outi
ng
in
M
obil
e
Ad
-
hoc
Network,
"
Int
ernati
onal
Journal
of
Elec
tri
cal
and
Compute
r
Engi
ne
ering
(
IJ
ECE
)
,
vo
l
.
8
,
no
.
1
,
pp.
26
-
33,
20
18
.
[43]
Ahuja
Rake
sh
a
nd
S.
S.
Bedi,
"Robus
t
Video
W
at
ermarki
ng
Scheme
Based
on
Intra
-
Coding
Pr
oce
ss
in
MP
EG
-
2
St
y
l
e,
"
In
te
rnat
i
onal
Journal
of
El
e
ct
rica
l
&
Co
mputer
Engi
n
ee
r
ing
(
IJE
CE)
,
vol
.
7
,
no
.
6
,
pp
.
20
88
-
8708,
2017
.
BIOGR
AP
H
I
ES
OF
A
UTH
ORS
Bh
agy
ash
re
e
A
mbore
comple
t
ed
her
B.
E
in
Com
pute
r
Scie
n
ce
and
Eng
ine
e
ring
in
2006
a
nd
M.T
ec
h
in
Com
pute
r
Scie
nc
e
and
Engi
ne
ering
in
2012
and
awa
rde
d
as
“
y
oung
Inve
stiga
t
or”
.
Curre
ntly
she
i
s
pursuing
her
PhD
in
comp
ute
r
scie
n
ce
an
d
Engi
nee
ring
from
Visvesvar
a
y
a
Te
chno
logi
c
al
Univer
sit
y
.
She
is
working
as
As
sistant
Profess
or
in
th
e
Depa
r
t
m
ent
of
Com
pute
r
Scie
nc
e
and
En
gine
er
ing
at
Ca
m
bridge
Instit
ut
e
of
T
ec
hnolog
y
,
Bangaluru.
S
he
has
m
ore
than
7
y
e
ars
of
expe
r
ience
in te
a
chi
ng
.
Su
re
sh
L
Obtai
ned
his
B.
E
de
gre
e
in
Com
pute
r
Scie
n
ce
and
Engi
ne
eri
ng
fro
m
GIT
Bel
agu
m
,
Karna
ta
k
a
Univ
ersity
in
1990
and
M.E
in
C
om
pute
r
Scie
nc
e
and
Engi
n
ee
r
ing
in
St.
Peter’s
Univer
sit
y
,
Che
nnai
.
He
r
ecei
ve
d
Ph.D
degr
ee
i
n
Com
pute
r
Sci
e
nce
and
Engi
ne
e
ring
in
2010.
R
i
ght
from
1990
he
i
s
working
in
th
e
Depa
rtment
o
f
Com
pute
r
Scie
nce
&
Engi
n
eering
under
var
io
u
s
designa
ti
ons
.
Pr
ese
ntly
h
e
is
working
as
Princ
ipal
and
Profess
or
in
Depa
rtment
of
Com
pute
r
Scie
n
ce
and
Eng
i
nee
r
ing
at
Cambridge
I
nstit
ute
of
Tech
nolog
y
,
B
enga
lu
ru.
He
has
m
ore
tha
n
28
y
e
ars
of
expe
ri
ence.
Evaluation Warning : The document was created with Spire.PDF for Python.