Int
ern
at
i
onal
Journ
al of Ele
ctrical
an
d
Co
mput
er
En
gin
eeri
ng
(IJ
E
C
E)
Vo
l.
10
,
No.
5
,
Octo
be
r
2020
,
pp.
4863
~
4871
IS
S
N: 20
88
-
8708
,
DOI: 10
.11
591/
ijece
.
v10
i
5
.
pp
4863
-
48
71
4863
Journ
al h
om
e
page
:
http:
//
ij
ece.i
aesc
or
e.c
om/i
nd
ex
.ph
p/IJ
ECE
Energy
-
a
war
e
s
t
rateg
y for
d
ata
f
orw
ar
din
g in IoT
e
cos
yste
m
K. Nag
arath
n
a
El
e
ct
roni
cs
and
Com
m
unic
at
ion D
epa
rtment,
Bas
ave
shvara
Eng
in
ee
ring
Coll
ege
,
I
ndia
Art
ic
le
In
f
o
ABSTR
A
CT
Art
ic
le
history:
Re
cei
ved
Oct
3
, 2
019
Re
vised
Ma
r
1
2
,
2020
Accepte
d
Ma
r
30
, 202
0
The
Inte
rn
et
of
Thi
ngs
(IoT
)
is
looming
te
c
hnolog
y
r
api
dl
y
at
tracti
n
g
m
an
y
industries
and
dra
wing
rese
arc
h
at
t
ent
i
on.
Although
t
he
sca
l
e
of
IoT
-
applications
is
ver
y
l
arg
e
,
th
e
ca
p
abi
l
it
i
es
of
the
IoT
-
dev
ices
are
li
m
ited,
espe
cially
in
te
r
m
s
of
ene
rg
y
.
How
eve
r,
var
io
us
rese
arc
h
works
have
been
done
to
al
l
evia
te
th
ese
shortc
om
ings,
but
th
e
sche
m
es
int
r
oduce
d
i
n
the
li
t
erature
ar
e
complex
and
di
ffic
ul
t
to
imple
m
ent
in
pra
ct
i
c
a
l
sce
nar
ios.
The
ref
or
e,
consi
der
ing
th
e
en
er
g
y
consum
pti
on
of
heteroge
n
eo
us
nodes
in
IoT
ec
o
-
s
y
st
em,
a
sim
ple
ene
r
g
y
-
e
fficie
nt
rout
ing
technique
i
s
proposed.
The
proposed
s
y
stem
has
al
so
emplo
y
ed
an
SD
N
cont
roll
er
tha
t
acts
as
a
c
ent
ra
li
z
ed
m
ana
ger
to
co
ntr
ol
and
m
onit
or
net
work
servi
c
es,
th
ere
b
y
restr
icting
th
e
a
cc
ess
of
selfi
sh
nodes
to
the
n
etw
ork.
The
prop
osed
s
y
stem
construc
ts
an
a
naly
tica
l
al
gori
t
hm
tha
t
provide
s
rel
ia
ble
da
ta
t
ran
sm
ission
oper
ations
and
cont
rols
ene
rg
y
consum
pti
on
u
sing
a
str
at
eg
i
c
m
ec
hani
sm
where
th
e
p
at
h
select
ion
proc
ess
is
per
form
ed
b
ase
d
on
the
remai
n
ing
en
e
r
g
y
of
adjac
en
t
no
des
locate
d
in
the
d
irecti
on
of
the
desti
n
at
ion
nod
e
.
The
proposed
en
erg
y
-
eff
i
cient
d
a
ta
forward
ing
m
ec
han
ism
is
compare
d
wi
th
the
ex
isti
ng
AO
DV
routi
ng
tec
hnique
.
The
si
m
ula
ti
on
resul
t
demons
tra
te
s
tha
t
the
proto
co
l
is
superior
to
AO
D
V
in
te
r
m
s
of
pac
ket
del
iv
er
y
r
at
e
,
throughput
,
and
end
-
to
-
end
de
lay.
Ke
yw
or
d
s
:
Energy
c
onsum
pt
ion
Energy
-
e
ff
ic
ie
ncy
IoT
Rou
ti
ng
p
r
oto
c
ol
SDN
c
on
tr
oller
Copyright
©
202
0
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
:
K.
Na
gar
at
hn
a
,
Ele
ct
ro
nics
and
C
omm
un
ic
ation
De
par
tm
ent,
Ba
saves
hv
a
ra
En
gin
eeri
ng C
ollege,
Ba
galk
ot,
I
ndi
a
.
Em
a
il
:
nag
arat
hn
a
vtu@
gm
ail
.co
m
1.
INTROD
U
CTION
The
i
nter
net
of
thin
gs
-
(IoT
)
is
a
gr
oup
of
str
uctu
res
th
at
en
able
ne
w
f
or
m
s
of
netw
orkin
g
to
pr
ov
i
de
cost
-
e
ff
ect
ive
,
fast
data
sh
a
rin
g
an
d
c
omm
un
ic
at
ion
se
rv
ic
es
i
n
var
i
ou
s
a
ppli
cat
io
n
area
s.
It
re
pr
ese
nts
a
netw
ork
co
nt
ai
nin
g
hete
rog
eneous
de
vices
-
(T
hings
)
to
se
rv
e
i
ntell
igent
serv
ic
es
to
us
e
rs.
A
l
ot
of
res
earch
and
de
velo
pm
e
nt
w
ork
has
be
en
do
ne
in
t
he
fiel
d
of
I
nter
ne
t
of
T
hings
[1
]
.
W
it
h
this
de
ve
lop
m
ent,
the
I
oT
is
at
tract
ing
m
assive
at
te
ntio
n
f
r
om
m
any
app
li
cat
ion
a
reas
li
ke
sm
art
ho
m
e,
sm
art
secur
it
y
syst
e
m
,
s
m
art
ro
a
d
traff
ic
m
on
it
ori
ng
,
healt
hca
re
syst
e
m
s,
and
m
any
m
or
e
[2
,
3].
The
I
oT
ne
twork
is
m
assive
an
d
com
plex
an
d
con
ta
in
s
thin
gs
li
ke
RFID
ta
gs,
sm
artph
ones
,
and
wireless
sens
or
s
for
cap
turing
data
f
rom
the
su
rroun
dings.
Since
I
oT
co
nsi
sts
of
heter
ogene
ous
netw
orks
a
nd
m
os
t
de
vices
in
IoT
ty
pical
ly
hav
e
lo
wer
com
pu
ti
ng
capaci
ty
, lower
pro
ces
sin
g power
, a
nd lim
it
e
d batt
ery p
owe
r
[
4].
Power
c
on
s
um
pt
ion
is
on
e
of
the
crit
ic
al
con
cer
ns
f
or
the
sea
m
le
ss
data
transm
is
sion
proces
s
.
Inform
at
ion
re
la
y
fr
om
the
s
ource
point
to
the
ta
r
get
poin
t
is
one
of
t
he
vita
l
operati
on
s
to
be
perf
orm
ed
in
a
la
rg
e
-
scal
e dy
nam
ic
Io
T
e
nvir
on
m
ent.
D
ue
to
the
li
m
it
ed
transm
issi
on
ra
ng
e
of
se
nsor
s,
the
sens
or
f
orwa
rd
s
the
colle
ct
ed
da
ta
throu
gh
t
he
interm
ediat
e
no
de
.
A
n
in
te
rm
ediat
e
node
th
en
util
iz
es
unintenti
onal
pow
er
f
or
the
data
t
ran
s
m
issi
on
f
ro
m
the
s
ource
node
,
w
hich
le
ads
to
higher
e
ne
r
gy
de
pleti
on
a
nd
ther
eby
acc
el
erates
factor
to
ca
us
e
netw
ork
li
feti
m
e
sh
ort
er.
Th
eref
or
e
,
ef
fici
ent
po
wer
util
iz
at
ion
by
node
s
is
a
sig
nifican
t
factor
aff
ect
in
g
pe
rfo
rm
ances
of
the
network
in
th
e
Io
T
ecosyst
e
m
[5
]
.
Hen
ce,
an
optim
al
ap
proac
h
an
d
effi
ci
ent
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.
10
, No
.
5
,
Oct
ob
e
r 2
020
:
48
63
-
48
71
4864
routin
g
strat
eg
ie
s
are
requir
ed
to
assist
s
long
-
te
rm
inter
-
c
omm
un
ic
at
i
on
am
on
g
the
diff
e
ren
t
de
vi
ces.
Also
,
t
he
data
or
pa
cket
tran
s
m
issi
on
shou
l
d
be
execu
te
d
in
su
c
h
a
way
that
it
reaches
it
s
destinat
ion
us
in
g
the
m
os
t
su
it
a
ble
or
s
hortest
path.Vari
ou
s
researc
h
w
orks
and
e
ffor
ts
are
m
ade
in
past
few
ye
ars
to
a
ddres
s
energy
prob
le
m
in sm
art senso
r
n
et
wor
ks
[6
-
8].
Existi
ng
wireless
se
ns
or
r
outi
ng
protoc
ols
are
in
her
e
nt
ly
com
plex,
r
equ
i
rin
g
e
xten
sive
us
e
of
processi
ng
power
a
nd
m
e
m
or
y,
wh
ic
h
is
natu
rall
y
a
limit
ed
resour
ce
i
n
d
e
vices
invo
lved
in
I
oT
ne
twork
.
If
a
la
r
ge
num
ber
of
route
di
sco
ver
ie
s
a
re
i
niti
at
ed,
the
e
ne
rg
y
of
nodes
in
the
net
wor
k
quic
kly
dr
ai
ns
out
because
it
requ
ires
an
unnece
s
saril
y
forw
a
rd
i
ng
of
a
la
r
ge
num
ber
of
r
ou
te
-
re
qu
e
sts.
It h
a
s
al
so
b
een see
n
that
m
os
t
of
the
ex
ist
ing
routin
g
t
echn
i
qu
e
s
us
e
hop
c
ount
to
de
te
rm
ine
the
s
hortest
r
oute
be
tween
sou
rce
an
d
destinat
io
n
no
des.
F
or
dyna
m
ic
top
ol
ogie
s
in
the
Io
T
,
it
is
no
t
feasibl
e
to
us
e
hop
c
ounts
only
as
routin
g
m
et
rics
becau
s
e
it
does
no
t
consi
der
m
any
sensiti
ve
fact
or
s
s
uch
as
pa
cket
los
s,
li
nk
qu
al
it
y,
data
rate,
channel
div
e
rs
it
y,
et
c
[
9
,
10
]
.
Ther
ef
ore,
there
is
a
need
fo
r
a
cost
-
ef
f
ect
ive
and
str
ai
gh
tf
orwa
rd
r
ou
ti
ng
m
echan
ism
that can e
ff
ect
ivel
y save
IoT
devi
ces energy.
This
pap
e
r
int
rod
uces
a
sim
ple
an
d
e
nerg
y
-
eff
ic
ie
nt
rou
ti
ng
protoc
ol
with
a
n
S
DN
con
t
ro
ll
er
i
n
the
net
work
th
at
ac
ts
as
a
uni
fied
le
a
der
pro
vid
in
g
sec
uri
ty
an
d
po
wer
-
aw
are
ser
vices
by
rej
ect
i
ng
ac
ce
ss
to
sel
fish
no
des
in
the
net
wor
k.
Her
e,
t
he
SDN
co
ntr
oller
knows
t
he
topolo
gy
in
th
e
entire
net
work
a
nd
identifie
s
the
be
st
ro
ute
to
tra
ns
fe
r
data
fro
m
so
ur
ce
to
de
sti
nat
ion
no
de.
The
pro
po
se
d
pap
e
r
is
orga
nized
as
fo
ll
ows:
Sect
io
n
1
pr
ese
nts
rel
at
ed
w
orks
to
w
ard
s
op
ti
m
iz
in
g
ene
rg
y
co
nsu
m
pt
ion
al
so
de
scribes
the
pro
ble
m
sta
tem
ent
fo
r
the
pro
posed
st
ud
y.
Sect
io
n
2
pr
ese
nts
the
de
sign
of
the
pr
opos
e
d
syst
em
.
Sect
ion
2
pr
e
sen
ts
the
al
gorithm
desc
riptio
n.
Re
su
lt
s
an
d
di
scussions
a
re
pr
e
sente
d
Se
ct
ion
3.
Fi
nally
,
the
co
nclu
sion
is
pr
ese
nted
in Se
ct
ion
4.
The
Ba
c
kgr
ound.
Se
ve
ral
stud
ie
s
ha
ve
be
en
done
f
or
a
ddressi
ng
the
routin
g
iss
ues
in
I
oT
bas
e
d
app
li
cat
io
ns
.
T
he
w
ork
done
by
Tse
ng
[11]
has
de
sig
ned
a
m
ulti
path
load
norm
alizi
ng
r
ou
ti
ng
m
echani
s
m
to
address
bott
le
neck
pr
ob
le
m
c
ause
d
by
heavy
data
transm
i
ssion,
in
se
nso
r
net
works.
Howev
e
r,
t
his
w
ork
ha
s
no
t
ta
ke
n
int
o
account
t
he
lo
ad
balanci
ng
f
act
or
f
or
the
bursty
tra
ff
ic
.
Al
-
J
ana
bi
et
al
.
[12]
ha
ve
intr
oduc
e
d
So
ft
war
e
Def
i
ne
Netw
ork
-
(
SDN)
-
sup
porte
d
scal
able
an
d
optim
al
ro
uting
protoc
ol
-
ori
ented
BS
path
su
pe
r
visio
n
m
echan
ism
fo
r
a
la
rg
e
I
oT
eco
syst
e
m
.
In
this,
the
auth
ors
use
d
a
com
bin
e
d
ap
proac
h
of
gen
et
ic
al
gorithm
s
(G
A)
an
d
P
arti
cl
e
Sw
arm
Op
ti
m
iz
at
ion
-
(P
S
O
)
te
chn
i
qu
es
t
o
est
ablish
su
i
ta
ble
paths
f
or
data
forw
a
r
ding
a
nd
node
c
omm
u
nicat
ion
.
I
n
t
he
stud
y
of
Oh
a
nd
Lim
[1
3],
a
cost
-
e
ff
ect
iv
e
routin
g
protoc
ol
was
desig
ne
d
us
i
ng
Bl
oo
m
filt
e
rs
an
d
ra
nk
pr
i
nciples
to
boos
t
the
r
ob
us
tn
ess
a
nd
energy
eff
ic
ie
nc
y
in
the n
et
wor
k.
The
st
ud
y
do
ne
by
Bo
uaziz
et
al
.
[
14]
co
ns
ide
rs
t
he
c
ha
ll
eng
es
pose
d
by
dev
ic
e
m
ob
il
it
y
an
d
energy
-
a
war
e
routin
g
pr
oto
c
ol
is
desi
gn
e
d
to
m
ini
m
iz
e
the
ne
gative
i
m
pact
caused
by
interm
ittent
node
connecti
ons
a
nd
l
ink
inter
r
up
ti
on
facto
r.
This
a
ppr
oac
h
al
s
o
inc
orp
or
at
es
a
m
ob
il
it
y
reco
gnit
ion
a
nd
rep
la
cem
ent
po
li
cy
that
is
awar
e
of
res
our
ce
const
raints
t
o
en
ha
nce
net
work
pe
rfor
m
ance
co
nce
rn
i
ng
energy
eff
ic
ie
ncy
an
d
li
nk
reli
abili
ty
.
S.
Vasil
ie
v
et
al
.
[15]
ha
ve
stu
di
ed
ab
out
the
thr
oughput
cap
abili
ti
es
of
relay
ing
m
et
ho
ds
with
ARQ
syst
em
i
n
Fly
ing
A
d
hoc
Netw
orks
-
(
FANET)
.
The
auth
or
s
her
e
present
Ma
rko
v
m
od
el
s
of
m
ulti
ple
relay
ing
al
go
rith
m
s
and
pe
rform
ed
a
com
par
a
ti
ve
assessm
ent
of
t
he
th
r
oughput
ef
fici
ency
of
su
c
h
r
el
yi
ng
te
ch
ni
qu
e
s.
I
n
the
st
ud
y
of
Xian
g
et
al
.
[1
6],
a
powe
r
-
a
wa
re
r
outi
ng
al
gorith
m
fo
r
S
DN
-
W
SN
is
inv
est
igate
d
by
choosin
g
c
ontr
ol
node
s.
T
hese
c
on
t
ro
l
node
s
dy
nam
icall
y
assign
dif
fer
e
nt
jo
bs
to
oth
e
rs
base
d
on
their
resid
ual
energ
y.
Howev
e
r,
it
is
chal
le
ng
in
g
to
identify
the
pr
eci
se
num
ber
of
nodes
re
qu
i
red
and the
num
ber
of
node
s
unde
r
the
d
ire
ct
ion o
f
a c
ontrol
no
de.
The
work
done
by
Ga
nte
et
al
.
[17]
to
ward
s
netw
ork
m
anag
em
ent,
introdu
ce
d
a
sm
art
m
anag
em
ent
schem
e
by
adopting
the O
pe
nFl
ow
prot
oco
l a
nd
m
od
ifie
d
f
orwardin
g
ru
le
to
pe
rfo
rm
op
tim
al
co
m
m
un
i
cat
io
n
betwee
n
al
l
nodes
t
hroug
hout
the
netw
ork.
Lu
o
et
al
.
[
18
]
desi
gn
e
d
a
n
S
DN
ori
ente
d
WSN
a
rch
it
ect
ur
e
to
address
iss
ues
of
poli
cy
inflexibili
ty
and
i
ts
m
anag
em
ent
by
i
m
pr
ovin
g
Se
nsor
Ope
nF
lo
w.
Jac
o
bs
s
on
a
nd
Orfan
i
dis
[
19]
us
e
d
lo
w
-
c
os
t
hard
war
e
des
ign
a
nd
an
ef
f
ic
ie
nt
placem
e
nt
te
ch
nique
t
o
rec
onfi
gure
WSN
arch
it
ect
ure
an
d
it
s
functi
ona
li
ty
.
The
wor
k
of
Hasee
b
et
al
.
[20]
co
ns
tr
ucted
a
powe
r
-
ef
fici
ent
an
d
rob
us
t
m
ul
ti
-
hop
r
out
ing
m
echan
is
m
based
on
se
cret
-
key
al
loca
ti
on
strat
e
gy
t
o
boos
t
t
he
pe
rfor
m
ance
of
netw
ork
against
m
al
ic
i
ou
s
be
ha
vior.
The
st
ud
y
outc
om
e
de
m
on
st
rates
the
e
ff
ec
ti
ven
ess
of
th
e
pr
e
sente
d
r
outi
ng
m
echan
ism
f
rom
the p
e
rsp
ect
i
ve of
n
et
work li
fe
-
s
pan an
d
t
hro
ughp
ut.
The
w
ork
of
Kh
a
n
e
t
al
.
[
21
]
,
co
ns
ide
rs
issues
relat
e
d
to
e
nergy
eff
ic
ie
ncy
e
nh
ancem
ent
in
unde
rw
at
er
se
nsor
netw
orks.
I
n
orde
r
to
so
l
ve
su
ch
pro
blem
s,
the
author
s
prov
i
de
a
du
al
-
ti
re
cl
us
te
r
ori
ented
efficient
r
ou
ti
ng
protoc
ol
that
is
m
ai
nly
design
e
d
t
o
deal
w
it
h
a
high
er
r
or
rate,
high
c
on
su
m
ption
of
en
erg
y,
and
en
d
-
to
-
e
nd
delay
.
T
he
stud
y
outc
om
e
su
ggest
s
that
the
pr
es
ented
a
ppr
oac
h
ac
hieves
s
up
e
rio
r
perform
ance
com
par
ed
to
ot
her
sim
i
la
r
existi
ng
a
ppr
oa
ches
re
gardin
g
net
work
li
f
e
-
sp
a
n,
reli
abl
e
data
transm
issi
on
.
Si
m
il
arly
,
the
work
of
Nguye
n
et
al
.
[
22
]
st
ud
ie
d
the
e
nergy
an
d
Q
oS
issues
in
heter
ogene
ous
Io
T
netw
orks
and
de
velo
pe
d
an
ene
r
gy
ha
r
vestin
g
ori
ente
d
r
outi
ng
te
c
hniq
ue
to
s
olv
e
the
issues
as
soc
ia
te
d
with
unpredict
able
tra
ff
ic
l
oa
d
c
ha
ng
es
a
nd
th
e
r
em
ai
ni
ng
en
er
gy
c
onditi
on
s
.
T
he
outc
om
e
exh
i
bits
that
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
Ener
gy
-
aware
strategy f
or
da
ta forw
ardin
g
i
n Io
T
ec
os
yst
e
m
(
K. Na
gar
ath
na)
4865
the
intr
oduce
d
te
ch
nique
ca
n
eff
e
ct
ively
pr
ov
i
de
a
pract
ic
al
m
echan
is
m
to
im
pr
ov
e
po
wer
ef
fici
ency
w
hile
m
eet
ing
QoS
r
equ
i
rem
ents.
I
n
the
stu
dy
of
Ku
m
ar
and
V
i
dyarthi
[
23]
,
a g
ree
n
r
outi
ng
m
echan
ism
is
desig
ne
d
base
d
o
n
F
ork
an
d
P
SO
to
e
nh
a
nce
t
he
l
ongev
it
y
of
t
he
s
ens
or
netw
ork
.
This
al
gorith
m
op
tim
iz
es
con
t
ro
l
nodes
a
nd
it
s
cl
us
te
rin
g.
T
he
stud
y
outc
om
e
illustrates
that
the
pr
ese
nted
m
echan
ism
is
bette
r
th
an
othe
r
existi
ng appr
oa
ches i
n
te
rm
s of
prolo
ng
e
d net
work ser
v
ic
e li
fe
-
s
pa
n.
Din
et
al
.
[24]
pr
ese
nted
a
n
e
nh
a
nce
d
m
echan
ism
fo
r
r
ou
t
e
sel
ect
ion
to
cl
us
te
r
hea
d
-
(
CH)
ori
ente
d
on
m
ulti
-
hop
r
ou
ti
ng
in
m
ulti
-
la
ye
r
W
S
N.
T
his
m
echan
is
m
identifie
s
the
r
ou
te
on
the
bas
is
of
m
ini
m
u
m
cos
t
betwee
n
m
ultip
le
co
nn
ect
e
d
routes.
T
he
s
tud
y
outc
om
es
dem
on
strat
e
the
ef
fecti
ve
ne
ss
of
t
he
pr
es
ented
appr
oach
reg
a
rd
i
ng
prolo
ng
netw
ork
ser
vi
ce
durati
on.
Lin
et
al
.
[25
]
pr
ese
nted
a
fau
lt
-
tole
ran
t
r
ou
ti
ng
m
echan
ism
fo
r
I
oT
WSN.
The
a
uthor
ha
s
us
e
d
the
c
oncept
of
virt
ua
l
CH
est
ablishm
ent
and
fl
ow
-
gr
a
ph
arch
it
ect
ure
f
or
bear
in
g
C
H
fail
ur
e
e
ffec
ti
ve
ly
.
All
res
our
ces
f
or
the
no
n
-
fau
lt
y
CH
ar
e
orde
red
as
vi
rtual
CHs
as
a
bac
kup
f
or
al
l
fail
ed
CH
s.
T
he
n,
after
a
c
oncept
of
fl
ow
-
gra
ph
arch
it
ect
ure
is
m
od
el
ed
to
obta
in
fau
lt
tolera
nce
prop
e
rty
wh
i
l
e
red
uci
ng
overall
powe
r
consum
ption
in
al
l
no
n
-
f
aul
ty
CHs.
The
stud
y
ou
tc
om
e
exh
ibit
s
the
po
te
ntial
of
the
pr
ese
nted
fau
l
t
-
tolerant
r
outi
ng
m
echan
ism
reg
ard
i
ng
netw
or
k
li
fe
-
sp
a
n
e
nhan
ce
m
ent.
An
ef
fici
ent
r
outi
ng
pr
oto
c
ol
has
bee
n
intr
oduce
d
i
n
the
st
ud
y
of
Sele
m
et
al
.
[
26
]
for
t
he
wireless
body
area
net
work
(
WBA
N
)
in
IoT
s
upporte
d
healt
h
a
pp
li
cat
io
n.
T
hi
s
ap
proac
h
is
desig
ne
d
to
a
ddress
the
pr
ob
le
m
relat
ed
to
t
he
ne
twork
pe
rfor
m
ance
a
nd
to
co
ntr
ol
the
dam
a
ging
e
ff
ect
s
on
hum
an
sk
in
c
ause
d
du
e
t
o
el
eva
te
d
bo
dy
sen
sor
s
tem
per
at
ur
e
.
The
e
xp
e
rim
ental
ou
tc
om
e
exh
ibit
s
that
the
pr
ese
nted
te
ch
nique
m
ai
ntains
bette
r
netw
ork
perf
or
m
ances
re
ga
rd
i
ng
node
li
fe
and
pac
ket
thr
oughput.
T
he
s
tud
y
of
Na
ggar
at
hn
a
and
Ma
ll
apur
[
27
-
31
]
hav
e
a
ddresse
d
ti
m
e
synch
ronizat
io
n
a
nd
r
ou
ti
ng
pro
blem
and
presente
d
delay
-
awa
re
routin
g
schem
e
to
design
op
t
i
m
al
strat
egy
t
hat
com
pen
sat
es
delay
factor
in
la
rg
e
scal
e
WSN
.
Ba
se
d
on
res
ult
analy
is
the
presented
st
ud
y
is
fo
un
d
to
be
ef
fecti
ve
for
re
du
ci
ng
ov
e
rh
ea
d,
synch
r
on
iz
at
io
n
error
s
,
a
nd pr
ocessin
g t
i
m
e w
hen c
om
par
ed
with
th
e existi
ng ti
m
e
synch
ronizat
io
n
m
et
ho
ds.
Be
gam
and
Prem
a
[32]
desi
gned
e
nergy
-
ha
rv
est
in
g
-
base
d
r
ou
ti
ng
te
ch
niq
ue
.
In
this,
a
co
nce
pt
of
t
h
e
a
r
t
i
f
i
c
i
a
l
n
e
u
r
a
l
n
e
t
w
o
r
k
i
s
a
d
o
p
t
e
d
f
o
r
t
h
e
t
r
a
i
n
i
n
g
.
T
h
e
e
x
p
e
r
i
m
e
n
t
a
l
r
e
s
u
l
t
o
f
t
h
i
s
s
t
u
d
y
d
e
m
o
n
s
t
r
a
t
e
s
t
h
a
t
a
n
i
n
t
r
o
d
u
c
e
d
t
e
c
h
n
i
q
u
e
i
m
p
r
o
v
e
s
n
o
d
e
l
i
f
e
-
s
p
a
n
,
Q
o
S
,
a
n
d
e
n
t
i
r
e
n
e
t
w
o
r
k
s
e
r
v
i
c
e
d
u
r
a
t
i
on
u
n
d
e
r
t
h
e
i
n
f
l
u
e
n
c
e
o
f
d
y
n
a
m
i
c
f
a
c
t
o
r
s
s
u
c
h
a
s
u
n
c
e
r
t
a
i
n
t
r
a
f
f
i
c
l
o
a
d
a
n
d
r
e
s
i
d
u
a
l
e
n
e
r
g
y
c
o
n
d
i
t
i
o
n
s
.
T
i
a
n
e
t
a
l
.
[
3
3
]
intr
oduc
ed
the
ene
rg
y
-
aw
are
strat
egy
for
in
du
st
rial
IoT
ap
plica
ti
on
s,
wh
ic
h
com
bin
es
netw
ork
c
od
i
ng
te
c
hniq
ue
an
d
powe
r
co
ntr
ol
schem
es
to
m
ini
m
iz
e
energy
co
nsum
ption
by
reduci
ng
bur
den
i
n
the
pac
ket
trans
m
issi
on
process
an
d
at
the
sam
e
tim
e
al
lowing
se
nso
r
nodes
to
sel
ect
su
it
able
tra
nsm
it
ener
gy.
T
he
wor
k
ca
rr
ie
d
ou
t
by
S
obral
et
al.
[34]
s
uggeste
d
a
so
luti
on
to
i
m
pr
ov
e
the
pe
rfor
m
ance
of
existi
ng
L
OADng
r
outi
ng
protoc
ol
in
m
ob
il
e
Io
T.
The
stud
y
pr
e
sented
a
m
ech
anism
that
allow
s
sens
or
node
s
to
under
sta
nd
the
av
a
il
abili
ty
of
their
ad
j
ace
nt
nodes
us
in
g
c
on
t
ro
l
m
essages
so
t
hat
these
sens
or
node
s
can
c
hoos
e
a
s
hort
r
ou
te
a
nd
avo
i
d
forw
a
r
ding
data thr
ough i
nter
rupted
p
at
hs
due to
no
de
m
ob
il
it
y.
The
Pro
blem
Descr
i
ption
.
I
oT
ap
plica
ti
ons
hav
e
pre
dicte
d
the
fu
t
ur
e
wh
e
re
en
d
-
us
e
rs,
wireles
s
com
m
un
ic
at
ion
te
ch
no
l
og
ie
s
,
an
d
com
pu
ti
ng
syst
em
s,
will
pr
ovide
a
va
riet
y
of
capa
bi
li
ti
es
to
achieve
high
econom
ic
eff
ic
ie
ncy
an
d
c
onven
ie
nce.
H
oweve
r,
su
c
h
di
ver
se
ap
plica
ti
on
s
face
va
rio
us
diff
ic
ulti
es
du
e
to
const
raint
nat
ure
of
de
v
ic
es
in
I
oT
-
ec
os
yst
e
m
.
The
m
ajo
r
chall
enge
asso
ci
at
ed
with
I
oT
is
the
op
ti
m
a
l
energy
util
iz
at
ion
in
t
he
com
m
un
ic
at
ion
process
t
hat
involves
he
te
rogen
e
ous
dev
ic
es
co
nne
ct
ed
via
the
In
te
r
net.
Also
,
these
de
vices
a
re
ty
pic
al
ly
distribu
te
d
in
a
reas
with
diff
e
r
e
nt
le
vels
of
heter
og
e
nei
ty
.
The
e
ne
rg
y
us
e
d
to
transm
it
dat
a
dep
e
nds
on
sever
al
at
trib
utes,
su
c
h
as
the
distance
f
ro
m
t
he
node
to
t
he
ta
rg
et
point,
th
e
siz
e
of
the
data
pa
cket
to
be
tra
ns
m
itted,
the
energy
am
plific
at
ion
c
os
t
be
fore
tra
ns
m
iss
ion
a
nd
the
e
n
er
gy
consum
ed
in
the
proc
ess
of
even
t
se
ns
in
g,
data
capt
ur
i
ng
an
d
node
c
omm
un
ic
at
ion
s.
H
ow
e
ve
r,
va
rio
us
routin
g
pr
oto
c
ols
ha
ve
bee
n
introd
uced
so
far,
f
or
e
nha
ncin
g
netw
ork
perf
or
m
ance
and
re
du
ci
ng
energy
consum
ption
.
But there
is
no
t
a sin
gle
protoc
ol tha
t i
s acce
pt
ed
gl
ob
al
sta
ndar
d for
IoT.
The
s
olu
ti
ons
pr
ese
nted
i
n
the
li
te
ratur
e
are
com
plex
and
dif
ficult
to
i
m
ple
m
ent
in
real
-
ti
m
e
sit
uations
.
Als
o,
s
om
e
of
t
he
existi
ng
te
c
hn
i
qu
e
s
to
wards
e
nergy
m
ini
m
iz
ation
are
desig
ne
d
c
on
si
der
i
ng
par
ti
cula
r
issue
s
t
hey
do
ha
ve
no
t
co
ns
i
der
e
d
oth
e
r
facto
rs
li
ke
ene
rg
y
hole
issue
in
the
ne
twork
wh
ic
h
is
al
so
a
crit
ic
al
factor
that
can
a
ff
e
ct
ov
e
rall
netw
ork
perform
ance.
The
refo
re,
pr
ese
r
ving
no
de
powe
r
is
a
crit
ic
al
requirem
ent
con
si
der
i
ng
m
ulti
ple
factor
s
f
or
the
lo
ng
er
netw
ork
li
feti
m
e.
The
pro
ble
m
sta
teme
nt
for
this
stud
y
ca
n
be
e
xpresse
d
as
"
de
sign
i
ng
a
ver
y
sim
ple
an
d
op
ti
m
al
te
c
hn
i
qu
e
is
a
c
ha
ll
eng
i
ng
task
th
at
ca
n
enable
ener
gy
-
ef
fi
ci
ent
da
ta
tran
sfe
r
and
rel
iab
le
communicati
on
be
tw
een
hetero
ge
neous
device
s
and
m
ai
nta
in
s lo
ng
n
et
work
servic
e ti
me
".
The
pro
po
se
d
syst
e
m
.
The
ke
y
obj
ect
ive
of
the
pro
po
se
d
stud
y
is
to
pr
esent
a
ne
w
powe
r
sa
vings
m
echan
ism
wh
il
e
ex
hib
it
in
g
r
ou
ti
ng
a
nd
pack
et
tran
sm
i
ssion
ope
rati
ons
i
n
Io
T
a
ppli
cat
ion
s.
T
herefo
re,
the
stu
dy
introdu
ce
s
an
S
D
N
assist
ed
eff
ic
i
ent
r
ou
ti
ng
str
at
egy
that
al
lows
I
oT
nodes
with
dif
fe
ren
t
an
d
lim
it
ed
energy
to
be
i
nterc
onne
ct
ed.
T
he
a
doption
of
S
DN
c
on
ce
pt
offer
s
a
secur
e
an
d
e
ne
rg
y
-
a
wa
re
net
work
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.
10
, No
.
5
,
Oct
ob
e
r 2
020
:
48
63
-
48
71
4866
by
de
nyin
g
ins
ensiti
ve
to
be
pa
rtic
ipati
ng
i
n
the
com
m
un
ic
at
ion
op
e
rati
on
of
the
netw
ork
.
A
schem
at
ic
desig
n
of the
pro
pose
d
syst
em
is sh
own
in Fi
gure
1.
The
pro
posed
stud
y
has
ad
op
te
d
an
anal
yt
ic
al
m
e
tho
dolo
gy
to
i
m
pl
e
m
ent
SD
N
-
ba
sed
co
ntr
ol
syst
e
m
s
that
can
perform
secur
e
an
d
e
ne
rgy
-
eff
ic
ie
nt
r
outi
ng
.
The
de
ve
lop
m
ent
of
the
pro
posed
syst
e
m
is
carried
ou
t
with
so
m
e
con
sid
erati
on
s
t
hat
in
I
oT
ecosyst
e
m
no
des
ar
e
he
te
rogen
e
ous
with
dif
fer
e
nt
energy
values
,
an
d
each
node
is
synch
r
on
iz
e
d
with
the
SDN
co
ntr
ol
syst
e
m
.
The
S
DN
c
on
t
ro
ll
er
syst
em
i
s
al
s
o
respo
n
sible
f
or
execu
ti
ng
othe
r
va
riet
ie
s
an
d
esse
ntial
ser
vices
that
m
ake
netw
ork
perf
or
m
ance
bette
r
and
flexible.
T
he
r
efore,
I
oT
node
s
in
the
netw
ork
directl
y
do
not
perform
any
c
omm
un
ic
a
ti
on
process
,
but
via
the
S
DN
co
nt
ro
ll
er,
the
no
des
ca
n
est
a
blish
a
c
onn
ect
i
on
am
on
g
t
he
m
se
lves
base
d
on
the
f
orwa
rd
i
ng
decisi
ons. Fo
r
t
his,
e
ver
y ac
ti
ve
nod
e
in
t
he n
et
work is assi
gned
w
it
h a
un
i
qu
e
ide
ntit
y.
An
O
pen
Flo
w
protoc
ol
is
ad
op
te
d
that
set
up
t
he
c
omm
u
nicat
ion
betwe
en
an
SDN
c
ontr
oller
an
d
the
no
des
in
the
netw
ork
.
T
he
c
on
tr
oller
ha
s
the
rig
ht
to
perf
or
m
m
ultip
le
adm
inist
rati
ve
jo
bs
li
ke
i
t
can
perform
eli
m
i
nation
a
nd
up
date
of
tra
ff
ic
flo
w
acco
rd
i
ng
to
f
orwardi
ng
r
ules.
A
par
t
from
this,
it
per
f
or
m
s
so
m
e
add
it
iona
l
network
se
rv
ic
es
li
ke
to
po
l
og
y
disco
ve
ry,
r
ou
ti
ng,
t
raffic
co
ntro
l,
po
li
cy
m
ana
gem
ent,
and
acce
s
s
co
ntr
ol
and
e
nergy
m
anag
em
e
nt.
H
ow
e
ve
r,
it
is
po
ssible
that
so
m
e
no
de
s
la
cks
a
su
f
fici
ent
a
m
ou
nt
of
e
ne
rg
y
a
nd
bec
om
e
ver
y
we
ak
or
inse
ns
it
ive.
T
he
SDN
c
on
t
ro
ll
er
can
easi
ly
re
cognize
the
inse
ns
it
ive
nodes
beca
use
it
has
al
l
de
ta
il
s
about
the
netw
ork
a
nd
co
ns
ta
ntly
m
on
it
or
s
the
nodes
.
If
the
node
is
found
to
be
belo
w
a
certai
n
cut
-
off
or
t
hr
es
hold
value
,
the
node
is
then
c
on
si
der
e
d
as
an
inse
ns
it
ive
node
a
nd
is
bl
ackli
ste
d
in
t
he
ta
ble
m
ai
nt
ai
ned
by
the
SDN
co
ntr
oller.
On
ce
t
he
node
i
s
blackli
ste
d,
th
en
it
will
no
t
be
able
to
par
ti
ci
pate
in
t
he
com
m
un
ic
at
ion
process
and
will
no
t
acce
ss
the n
et
wor
k
se
rv
ic
es.
If a
ny nod
e
tries to
acc
ess the
netw
or
k,
t
he
c
on
t
ro
ll
e
r
c
heck
s
it
s Id i
n
the
b
la
c
klist
.
F
or
pac
ket
f
or
wardin
g
ope
rati
on
,
t
he
source
node
first
discov
e
rs
in
form
ation
a
bout
neig
hbour
node
s
.
The
s
ource
no
de
will
br
oad
c
ast
path
reque
st
m
essage
PR
EQ
in
eve
ry
di
recti
on
t
o
det
erm
ine
it
s
adjace
nt
nodes
.
All
ot
he
r
node
s
locat
ed
near
t
he
sou
rc
e
node
will
receive
P
REQ
a
nd
sen
ds
a p
at
h
rep
ly
m
essage
PREP
to
for
ward
the
pack
et
from
s
ource
to
t
he
tr
aget
node
.
H
oweve
r,
it
is
qu
it
e
li
kely
that
the
sou
rce
no
de
m
a
y
receive
PREP
m
essage
fr
om
m
ul
ti
ple
adj
acent
no
des
that
m
ay
or
m
ay
no
t
locat
ed
in
the
directi
on
of
the
destin
at
io
n
node.
This
c
an
le
ad
to
the
gen
erati
on
of
con
tr
ol
m
essage
over
head
pro
blem
.
Therefo
re,
the
stu
dy
a
dopt
s
the
ti
m
eou
t
m
echan
ism
thro
ug
h
S
D
N
c
ontr
ol
to
av
oid
th
e
ov
e
rh
ea
d
issue
a
nd
t
o
ac
hiev
e
a
sin
gle
res
ponse
with
a
ppr
opriat
e
in
form
ation
a
bout
it
s
ad
j
a
cent
nodes
locat
ed
in
t
he
direct
ion
of
the
desti
nation
node
.
A
n
e
ne
rg
y
a
naly
ser
m
od
ule
is
al
so
im
ple
m
ente
d
by
SDN
c
ontr
oller
to
det
erm
ine
the
resid
ual
e
nergy
sta
tus
of
each
a
djace
nt
node
i
f
the
energy
of
th
e
node
is
below
t
he
cut
-
off
-
val
ue,
the
pack
et
is
sent,
an
d
oth
e
r
wise,
an
oth
e
r
neig
hbouri
ng
node
is
sel
ect
ed
[35
-
39]
.
T
ab
le
1
is
m
ai
ntain
ed
by
a co
ntr
oller tha
t con
ta
in
s all
in
form
ation
a
bout
the no
des for
the p
ac
ket tra
nsm
issi
on
.
S
D
N
C
o
n
t
r
o
l
l
e
r
T
a
b
l
e
E
n
e
r
g
y
A
n
a
l
y
s
e
r
I
o
T
-
N
o
d
e
s
N
e
t
w
o
r
k
S
e
r
v
i
c
e
s
N
o
d
e
-
I
D
B
l
a
c
k
L
i
s
t
T
o
p
o
l
o
g
y
E
s
t
a
b
l
i
s
h
m
e
n
t
R
o
u
t
e
A
n
a
l
y
s
i
s
T
r
a
f
f
i
c
M
o
n
i
t
o
r
i
n
g
P
o
l
i
c
y
M
a
n
a
g
e
m
e
n
t
A
d
j
a
c
e
n
t
N
o
d
e
E
s
t
a
b
l
i
s
h
R
o
u
t
e
M
o
n
i
t
o
r
i
n
g
P
e
r
f
o
r
m
d
a
t
a
f
o
r
w
a
r
d
i
n
g
p
r
o
c
e
s
s
Figure
1
.
Pro
pose
d
s
yst
em
a
rc
hitec
ture
Table
1
.
Inf
orm
at
ion
m
ai
ntain
ed
b
y
SDN
c
ontr
oller
Sn
.
No
Details
No
tatio
n
s
1
IoT
-
No
d
es
-
Id
N
-
Id
2
So
u
rce
No
d
e
-
Id
Ni
-
Id
3
Destin
atio
n
Nod
e
-
Id
N
D
-
Id
4
Res
id
u
al energy
R
-
Id
5
Thresh
o
ld
TH
6
Black
List Nod
e
-
Id
BL
-
N
7
Ad
jacent No
d
e
-
Id
Ad
j
-
Id
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
Ener
gy
-
aware
strategy f
or
da
ta forw
ardin
g
i
n Io
T
ec
os
yst
e
m
(
K. Na
gar
ath
na)
4867
2.
ALGO
RITH
M DESC
RIP
TION
This
sect
io
n
pr
esents
a
n
al
gor
it
h
m
descr
i
ptio
n
for
t
he
im
ple
m
entat
ion
of
the
pro
po
se
d
m
et
hodo
l
og
y
for
achievi
ng
energy
-
a
war
e
pack
et
tra
ns
m
i
ssion
op
e
rati
on.
The
si
gn
ifi
cant
ste
ps
in
i
m
ple
m
entat
io
n
are
m
entioned as
f
ollows:
Algorithm:
Energy efficient strategy for data transmission
Input:
(Number of nodes), Dep
A
-
(Deployement area)
Output: Energy aware data forwarding
Start
1:
Init
, Dep
A,
T //
Initialization:
2: Reg: N
S
C
3:
For
each N
4: S
C
Id
5: N
i
requests to Sc
to discover path to N
d
6: S
C
checks
status whether N
d
exists there and allows N
i
to broadcast PREQ
7: Ni finds information of Adj
-
N using PREP
8: N
i
shorts Adj
-
NbyPREP Seq_no
9: Compute: Residual energy of sorted Adj
-
N
10:
if
Adj
-
N residual energy < TH
then
11: Adj
-
N is selected to forward the data to destination
12:
Otherwise
: Compute: Residual energy of Adj
-
N from
Step7
13:
N
i
forwards the packet based on selection of optimal Adj
-
N
14: Update
Table T
15:
Controller will Blacklist the slefishN
based on some threshold value
End
The
ab
ove
-
de
m
on
strat
ed
co
m
pu
ti
ng
ste
ps
are
res
pons
i
ble
for
est
abl
ishin
g
an
e
ne
rg
y
-
e
ff
ic
ie
nt
strat
egy
for
f
orwa
rd
i
ng
data
pack
et
s
from
so
urce
no
de
-
(N
i)
t
o
destin
at
ion
no
de
-
(Nd).
The
first
s
te
p
of
the
al
gorithm
i
s
su
bje
ct
ed
t
o
init
ia
li
zation
of
nodes
-
(
N
)
an
d
de
plo
ym
ent
area
-
(D
e
pA)
(
Step
-
1).
I
n
the
nex
t
ste
p,
al
l
nodes
in
the
de
plo
y
m
ent
area
a
re
reg
ist
ere
d
t
o
S
DN
co
ntr
oller
-
(S
C)
(S
te
p2).
The
SC
the
n
a
ssigns
a
un
iq
ue
id
f
or
each
node
in
the
netw
ork
whic
h
is
m
ai
ntain
ed
by
t
he
co
ntr
oller
in
the
ta
bl
e
T
(S
te
p
-
3
an
d
4)
.
Fo
r
the
data
fo
r
wardin
g
pro
cess,
the
Ni
m
akes
a
req
ue
st
to
SC
fo
r
init
ia
ti
ng
path
disco
ver
y
proc
ess
to
destinat
io
n
no
de
-
(Nd
)
-
(S
te
p
-
5).
The
SC
ch
ecks
the
sta
t
us
of
t
he
net
wor
k
an
d
e
nsures
wh
et
her
destin
at
ion
node
Nd
e
xists
there
a
nd
al
lo
ws
Ni
to
broa
dc
ast
path
re
que
st
m
essage
PREQ
to
fin
d
al
l
po
s
sible
num
ber
of
adj
ace
nt
nodes
-
(
Adj
-
N
)
that c
an parti
ci
pate i
n packet t
ran
s
m
issi
on
ope
rati
on (
Ste
p
-
6).
The
Ni
recei
ve
s
path
re
ply
m
essage
PREP
a
nd
fin
ds
i
nform
at
ion
ab
ou
t
t
heir
a
djacent
node
s
-
(Ad
j
-
N)
(S
te
p
-
7).
Als
o,
it
is
po
ssi
ble
that
the
Ni
m
ay
receive
i
rr
el
e
va
nt
PREP
m
essage
from
the
m
ul
ti
ple
Adj
-
N
that
m
ay
no
t
be
locat
ed
in
the
dire
ct
ion
of
Nd.
T
her
e
fore,
the
ti
m
eou
t
m
echani
s
m
is
i
m
ple
mented
by
SC
to
avo
id
ov
e
r
head
iss
ue
cause
d
by ir
re
le
van
t PREP m
essages
. In
ste
p
8, a sim
ple so
rtin
g
m
echan
ism
is app
li
ed
t
o
s
hort
the
PREP
base
d
on
their
seq
uen
ce
nu
m
ber
to
ob
ta
in
the
m
os
t
su
it
able
nu
m
ber
of
Adj
-
N.
T
his
proce
ss
al
so
pr
ese
r
ves
ene
r
gy
by
avo
i
ding
the
m
ulti
ple
Adj
-
Ns
that
ar
e
unnecessa
ry
par
ti
ci
patin
g
in
the
data
trans
m
issi
on
process
.
Af
te
r
resid
ual
energ
y
of
sel
ect
ed
Adj
-
Ns
betwee
n
Ni
an
d
Nd
is
com
pu
te
d
-
(
Step
-
9)
a
nd
is
ev
al
uated
with a t
hr
es
hold
value
t
o forw
ard data
(S
te
p1
0).
If
the
rem
ai
nin
g
e
nergy
eva
luati
on
co
ndit
ion
is
m
et
,
Ad
j
-
N
is
sel
ect
ed
to
for
ward
the
data
to
the
destinat
io
n
(step
11)
,
ot
herwise
the
syst
e
m
pr
ocee
ds
to
ste
p
7,
an
d
com
pu
te
s
re
sidu
al
ene
r
gy
of
al
l
com
pu
te
d
A
dj
-
Nsa
nd
ba
sed
on
t
heir
r
esi
du
al
e
nergy
le
vel
i
t
will
be
finall
y
sel
ect
ed
to
pa
rtic
ip
at
e
in
the p
ac
ket tran
sm
issi
on
pro
ce
ss f
r
om
N
i t
o
Nd
-
(
Step
-
12 a
nd
13)
.
All t
he
n
odes t
hat are se
le
ct
ed
to p
a
rt
ic
ipate
in
pack
et
tra
nsm
issi
on
proc
ess
and
their
resid
ual
energ
y
value
is
stored
in
the
ta
bl
e
T.
Ap
a
rt
fro
m
thi
s
the
con
t
ro
ll
er
al
so
saves
id
of
sel
fish
no
de
(i.e.,
that
ha
ve
low
ene
r
gy
an
d
are
vulne
ra
ble
to
secur
it
y
at
ta
cks)
into
the
blackl
ist
based
on
s
om
e
cut
-
of
f
va
lue
and
al
so
it
can
no
t
be
ab
le
to
acce
ss
th
e
network
op
e
rati
on
furthe
r.
This
proces
s
helps
in
m
ai
ntaining
sea
m
le
ss
serv
ic
es
acro
ss
the
ne
twork
f
or
pac
ket
transm
issi
on
an
d
node
c
omm
un
ic
at
ion
with
ou
t
any
dis
ruption.
T
he
flo
w
diag
ram
of
th
e
entire
m
et
hodo
l
og
y
for
obta
ining
energy
-
a
war
e
pack
et
t
ran
sm
issi
on strategy i
n Io
T
ope
rati
on is
dem
on
strat
ed
a
s
Fig
ur
e
2.
Energy
is
con
s
um
ed
in
bo
th
the
transm
issi
on
an
d
receptio
n
of
the
data
.
The
f
ollow
i
ng
var
ia
bles
are
us
e
d
to
d
e
rive
t
he
e
nergy e
qu
a
ti
on
for
the
e
ne
rg
y m
od
el
:
Transm
i
tt
ing
en
er
gy
-
(T
E
)
=
∗
+
∗
(
1)
w
he
re,
=
2
ℎ
q
=
4
w
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.
10
, No
.
5
,
Oct
ob
e
r 2
020
:
48
63
-
48
71
4868
Re
cei
vin
g E
ne
rg
y
-
(R
E
)
=
∗
(
2)
Current le
vel of Ee
nergy
-
(E
curnt
)
=
+
(3)
Re
sidu
al
E
ne
rgy
-
(E
res
)
=
−
(4
)
S
t
a
r
t
I
n
i
t
N
,
D
e
p
A
E
a
c
h
N
o
d
e
s
N
r
e
g
i
s
t
e
r
e
d
w
i
t
h
C
o
n
t
r
o
l
l
e
r
C
o
n
t
r
o
l
l
e
r
a
s
s
i
g
n
u
n
i
q
u
e
i
d
t
o
e
a
c
h
n
o
d
e
s
i
n
t
h
e
n
e
t
w
o
r
k
C
o
n
t
r
o
l
l
e
r
s
t
a
r
t
s
m
o
n
i
t
o
r
i
n
g
e
n
t
i
r
e
n
e
t
w
o
r
k
S
o
u
r
c
e
n
o
d
e
r
e
q
u
e
s
t
s
c
o
n
t
r
o
l
l
e
r
t
o
i
n
i
t
i
a
t
e
p
a
t
h
d
i
s
c
o
v
e
r
y
p
r
o
c
e
s
s
C
o
n
t
r
o
l
l
e
r
c
h
e
c
k
s
s
t
a
t
u
s
o
f
n
o
d
e
s
a
n
d
a
l
l
o
w
s
t
o
i
n
i
t
i
a
t
e
p
a
t
h
d
i
s
c
o
v
e
r
y
S
o
u
r
c
e
N
o
d
e
s
r
e
c
e
i
v
e
s
P
R
E
P
a
n
d
f
i
n
d
s
i
n
f
o
r
m
a
t
i
o
n
a
b
o
u
t
i
t
s
a
l
l
a
d
j
a
c
e
n
t
n
o
d
e
s
S
o
r
t
A
d
j
a
c
e
n
t
n
o
d
e
s
o
n
t
h
e
b
a
s
i
s
o
f
P
R
E
P
s
e
q
u
e
n
c
e
s
S
o
u
r
c
e
N
o
d
e
s
s
e
n
d
s
p
a
c
k
e
t
t
o
d
e
s
t
i
n
a
t
i
o
n
n
o
d
e
b
a
s
e
d
o
n
t
h
e
e
n
e
r
g
y
v
a
l
u
e
C
o
m
p
u
t
e
:
R
e
s
i
d
u
a
l
e
n
e
r
g
y
C
h
e
c
k
:
E
n
e
r
g
y
l
e
v
e
l
o
f
A
d
j
-
N
<
T
H
T
r
a
n
s
m
i
t
p
a
c
k
e
t
t
o
d
e
s
t
i
n
a
t
i
o
n
n
o
d
e
N
o
Y
e
s
A
d
d
S
e
l
f
i
s
h
N
o
d
e
t
o
B
l
a
c
k
l
i
s
t
U
p
d
a
t
e
:
T
a
b
l
e
à
T
E
n
d
Figure
2
.
Flo
w
d
ia
gram
o
f
e
ne
rg
y a
war
e
p
ac
ket tra
ns
m
issi
o
n op
e
rati
on
3.
RESU
LT
S
A
ND AN
ALYSIS
This
sect
ion
pr
ese
nts
the
ou
tc
om
e
anal
ysi
s
of
the
pro
po
se
d
m
eth
od
ology
for
il
lustrati
ng
the
ef
fecti
ve
ne
ss
of
t
he
pro
pose
d
syst
em
.
The
im
ple
m
enta
ti
on
of
pr
opose
d
e
nergy
-
e
ff
i
ci
ent
data
f
orwardin
g
m
et
ho
dolo
gy
is
carried
on
th
e
nu
m
erical
com
pu
ti
ng
platf
orm
.
The
per
f
or
m
ance
evaluati
on
of
t
he
pro
pose
d
energy
-
e
ff
ic
ie
nt
m
et
ho
d
is
e
valuated
in
te
rm
s
o
f
pack
et
delive
ry
rate
-
(PDR)
,
T
hro
ughput,
a
nd
Me
an
end
-
to
-
en
d
delay
-
(MEE
D)
.
T
he
supe
rio
rity
of
pro
po
se
d
m
et
ho
ds
is
a
na
ly
sed
base
d
on
t
he
com
par
at
ive
analy
sis
with
existi
ng
A
O
DV
prot
oco
l.
The
sim
ulatio
n
par
am
et
ers
that
are
use
d
f
or
pe
rfo
rm
ing
the expe
rim
e
nt
al
task is
dem
on
strat
ed
in Ta
bl
e 2
.
The
c
om
par
at
ive
a
naly
sis
de
m
on
strat
es
the
eff
ect
i
ven
es
s
of
the
pro
pose
d
syst
em
.
The
perform
ance
of
t
he
pro
pose
d
syst
em
in
te
rm
of
PD
R
is
s
how
n
in
Fi
gur
e
3.
P
DR
is
f
ound
to
be
bette
r
w
hen
com
par
ed
t
o
the
existi
ng
A
ODV
pr
oto
c
ol.
In
init
ia
l
ste
ps,
the
existi
ng
AOD
V
sho
ws
bette
r
pe
rfor
m
ance
but
f
ur
t
he
r
with
an
inc
rease
of
nodes
the
pro
po
s
ed
syst
em
perform
s
bette
r
tha
n
th
e
A
O
DV.
T
he
th
r
oughput
com
par
i
so
n
is
dem
on
strat
ed
i
n
the
F
ig
ur
e
4.
T
hroug
hput
is
al
so
fo
un
d
to
be
i
m
pr
ov
ed
w
hen
c
ompare
d
to
the
e
xisti
ng
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
Ener
gy
-
aware
strategy f
or
da
ta forw
ardin
g
i
n Io
T
ec
os
yst
e
m
(
K. Na
gar
ath
na)
4869
te
chn
iq
ues
.
T
he
en
d
-
to
-
e
nd
de
la
y
per
f
orm
ance
analy
sis
de
m
on
strat
ed
in
F
igure
5.
I
n
fir
st
20s
AOD
V
sh
ows
sli
gh
tl
y
bette
r
perform
ance
t
han
the
pro
pos
ed
syst
e
m
,
bu
t
the
ov
e
rall
de
la
y
is
fo
und
be
decr
ease
d
co
m
par
ed
to the e
xist
in
g t
echn
iq
ues
syst
e
m
.
Table
2
.
Sim
ul
at
ion
p
aram
et
e
rs
Sn
.
No
Para
m
eters
Valu
es
1
Too
l
MatL
ab
2
Sy
ste
m
W
in
d
o
ws 1
0
3
Nu
m
b
e
r
o
f
Nod
es
70
4
Si
m
u
latio
n
r
o
u
n
d
300
5
Dep
lo
y
m
en
t
area
5
0
0
m
x 5
0
0
m
6
Co
m
m
u
n
icatio
n
r
a
n
g
e
5
0
m
7
MAC P
roto
co
l
8
0
2
.11
8
Energy
Mod
el
Rad
io
9
Pack
et size
1
0
0
0
bytes
10
E
in
i
t
1
0
J
11
Ini
T
r
u
s
t
5
F
i
g
u
r
e
4
T
h
r
o
u
g
h
p
u
t
A
n
a
l
y
s
i
s
F
i
g
u
r
e
5
E
n
d
-
t
o
-
E
n
d
D
e
l
a
y
A
n
a
l
y
s
i
s
Figure
3
.
P
ac
ke
t
d
el
ivery
r
at
io
a
naly
sis
Figure
4. Th
r
ough
pu
t a
naly
sis
F
i
g
u
r
e
4
T
h
r
o
u
g
h
p
u
t
A
n
a
l
y
s
i
s
F
i
g
u
r
e
5
E
n
d
-
t
o
-
E
n
d
D
e
l
a
y
A
n
a
l
y
s
i
s
Figure
5. En
d
-
to
-
e
nd
delay
ana
ly
sis
4.
CONCL
US
I
O
N
In
t
his
pa
per,
an
ene
r
gy
-
ef
fici
ent
routin
g
s
trat
egy
is
pro
pose
d
f
or
Io
T
eco
-
syst
em
,
wh
ic
h
a
dopts
SDN
Co
ntr
oller
with
optim
al
route
sel
ect
io
n
m
echan
ism
f
or
t
he
data
tra
ns
m
issi
on
.
Th
e
pro
po
se
d
a
na
ly
ti
cal
al
gorithm
pr
ovides
reli
a
ble
data
transm
iss
ion
ope
rati
ons
and
co
ntr
ols
the
energy
co
ns
um
ption
by
us
ing
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.
10
, No
.
5
,
Oct
ob
e
r 2
020
:
48
63
-
48
71
4870
an
op
ti
m
al
m
e
chan
ism
for
r
outi
ng
sel
ect
ion
an
d
a
naly
sing
the
rem
ai
nin
g
energy
of
t
he
ad
j
acent
node
f
or
the
pac
ket
tra
ns
m
issi
on
.
T
he
res
ults
ex
hib
it
that
the
pro
posed
ene
rgy
-
awar
e
data
forw
a
r
ding
str
at
egy
ou
t
perform
s
the
existi
ng
AODV
r
ou
ti
ng
te
chn
i
qu
e
an
d
im
pr
ov
es
t
he
overall
perform
ance
of
the
net
work
i
n
te
rm
s o
f
pac
ke
t
-
delivery
rate,
e
nd
-
to
-
en
d del
ay
, and
th
r
oughput
.
REFERE
NCE
S
[1]
P.
V.
Dudhe,
e
t
al
.
,
“
Int
ern
et
of
Thi
ngs
(IOT):
A
n
over
vie
w
and
it
s
appl
i
cations
,”
2017
Inte
rnat
io
nal
Confe
ren
ce
on
Ene
rgy
,
Com
municat
ion
,
Dat
a
Analytics and Soft
Computing
(
ICECDS
)
,
pp.
2
650
-
2653,
2017
.
[2]
P.
Sethi
and
S
.
R.
Sara
ngi
,
“
Internet
of
thi
ngs:
ar
chi
t
ec
tur
es,
prot
ocol
s,
and
applic
at
ions
,”
Journal
of
El
e
ct
rica
l
and
Computer
Engi
n
ee
ring
,
vol
.
201
7,
no
.
1
,
pp
.
1
-
2
5,
2017
.
[3]
A.
Bhushan
and
P.
Garg
,
“
Inte
rne
t
of
Thi
ngs:
A
Revi
ew
on
it
s
Future
Scope
&
Chal
le
ng
es
,”
Na
ti
onal
Confe
ren
c
e
on
Rece
nt
Ad
van
ce
ment
in
Engi
n
ee
ring
&
Sci
ence
,
2015
.
[4]
D.
H.
Mun,
et
al
.,
“
An
assessme
nt
of
int
ern
et
of
thi
ngs
protoc
ols
for
resourc
e
-
con
strai
ned
app
li
c
ati
ons
,”
IEEE
40t
h
Annual
Comput
e
r Sof
tware
and
A
ppli
cations Conf
ere
nce (
COMPSAC)
, v
ol. 1
,
pp.
555
-
560,
2016
.
[5]
F.
Jammes,
“
Int
ern
et
of
Thi
ngs
in
Ene
rg
y
Eff
i
cienc
y
:
Th
e
Inte
r
net
of
Thi
ngs
(Ubiquity
s
y
m
po
sium
)
,”
Ubiquity
,
vol.
2016
,
no
.
2
,
Feb
2016.
[6]
I.
Ud
Din,
et
al
.
,
“
The
Inte
rne
t
o
f
Thi
ngs:
A
rev
i
ew
of
ena
bl
ed
tec
hnologies
and
future
ch
al
l
enge
s
,”
I
EEE
Acce
ss
,
vol.
7
,
pp
.
7606
-
7640
,
201
9
.
[7]
J.
Cabra
,
et
al
.
,
“
An
IoT
appr
oac
h
for
wire
le
ss
sensor
net
works
appl
ie
d
to
e
-
h
ealt
h
envi
ronm
ent
a
l
m
onit
oring
,”
20
17
IEE
E
Inte
rna
ti
onal
Confe
ren
c
e
on
Inte
rnet
of
Things
(
iThings
)
and
IEE
E
Gr
een
Computing
and
Comm
unic
ati
ons
(
G
ree
nCom)
an
d
IEE
E
Cyb
er,
Phy
sica
l
and
Soci
al
Computing
(
C
PSCom
)
and
I
EE
E
Smar
t
Dat
a
(
Sma
rtData)
,
pp.
578
-
583,
2017.
[8]
O.
El
ijah,
et
al
.
,
“
An
over
view
of
Inte
rne
t
o
f
Thi
ngs
(IoT
)
and
dat
a
ana
l
y
t
ic
s
in
agr
i
cu
lt
u
re:
Bene
f
it
s
an
d
cha
l
le
nges
,”
I
EEE
Int
erne
t
of
Thi
ngs J
ournal
,
vol.
5
,
no.
5
,
pp.
375
8
-
3773
,
2018
.
[9]
M.
Pati
l
and
S
.
Gundaga
t
ti
,
“
A
Brie
f
Surve
y
on
QoS
base
d
Routi
ng
Protocol
s
for
Rea
l
Ti
m
e
Multi
m
ed
ia
Tra
nsm
ission
in
W
ire
le
ss
Sy
st
ems
,
”
Adv
anc
es
in
Wirel
ess
and
Mobil
e
Comm
unications
,
v
ol
.
11,
no.
1
,
pp.
31
-
41
,
2018
.
[10]
H.
P.
Al
aha
ri
and
S.
B.
Yala
var
thi
,
“
A
surv
e
y
on
n
et
work
rout
ing
protoc
o
ls
in
int
ern
et
of
th
i
ngs
(IOT)
,”
Inte
rnat
i
onal
Journal
of
Computer
Appli
cat
ions
,
vol
.
160
,
no
.
2
,
pp
.
18
-
2
2,
2017
.
[11]
C
.
H
.
Tseng
,
“
Multi
pat
h
loa
d
bal
an
ci
ng
rou
ti
n
g
for
Inte
rn
et
of
Thi
ngs,
”
J
ourn
al
of
Sensors
,
v
ol.
2016
,
pp.
1
-
8
,
2016
.
[12]
T.
A
.
Al
-
Jan
abi
and
H
.
S.
Al
-
R
a
weshid
y
,
“
A
ce
n
tra
lized
rout
ing
protoc
ol
with
a
sche
dule
d
m
obile
sink
-
base
d
AI
for
la
rg
e
sc
ale
I
-
IoT
,”
IE
EE Se
ns
ors
Journal
,
vol
.
18,
no.
24
,
pp.
1
0248
-
10261
,
20
18
.
[13]
H.
Oh
and
S
.
Lim
,
“
Li
ght
-
w
e
ight
Rout
ing
Pr
otoc
ol
in
Io
T
-
b
ase
d
Int
er
-
Devi
ce
Te
l
ec
om
m
unic
a
ti
on
W
ir
el
ess
Envi
ronm
ent
,”
I
nte
rnational
Jou
rnal
of El
e
ct
ri
ca
l
and
Comput
er
Engi
ne
ering
,
vol
.
6
,
no
.
5
,
p
p.
23
52
-
2361,
2016
.
[14]
M
.
Bouaziz
,
et
al
.,
“
EC
-
MRP
L:
An
ene
rg
y
eff
i
c
ie
nt
and
m
obil
i
t
y
support
routi
n
g
protoc
ol
for
I
n
te
rne
t
of
Mobil
e
Thi
ngs,
”
in
The
14th
Annua
l
IE
E
E
Consum
er
Co
mm
unic
ati
ons a
nd
Net
work
ing Confe
renc
e
,
pp.
1
9
-
24,
201
7
.
[15]
D
.
S.
Vasili
ev
a
nd
A
.
Abilov,
“
Rel
a
y
ing
al
gor
ithm
s
with
ARQ
i
n
fl
y
ing
Ad
hoc
net
works
,
”
in
2
015
Inte
rnationa
l
Sibe
rian Con
fe
r
enc
e
on
Con
trol and Communica
ti
ons,
SI
BCON
,
pp.
1
-
5
,
2015
.
[16]
W.
Xiang,
et
a
l
.
,
“
An
ene
rg
y
-
e
fficie
nt
rout
ing
al
gorit
hm
for
software
-
defined
wire
le
ss
sensor
net
works
,”
IE
E
E
Sen
sor
s
J
ournal
,
vol.
16,
no.
20,
pp.
7393
-
7400
,
2016
.
[17]
A.
DeGant
e
,
et
al
.,
“
Sm
art
wire
l
ess
sensor
net
work
m
ana
g
ement
base
d
o
n
software
-
def
i
ned
net
work
ing
,”
i
n
Proc
ee
dings
o
f
th
e
2014
the 27
th
Biennia
l
Symp
osium Comm
unic
ati
ons,
Kingsto
n,
ON,
Canada
,
pp.
71
-
75
,
2014
.
[18]
T.
Luo,
e
t
al
.,
“
Sensor
open
fl
ow:
Ena
bli
ng
software
-
defined
wire
le
ss
sensor
net
works
,”
IEEE
Comm
un
ic
ation
Lett
ers
,
vo
l.
16,
no.
11
,
pp
.
1896
-
1899
,
2012
.
[19]
M.
Jac
obss
on
and
C.
Orfani
dis,
“
Us
ing
software
-
defined
net
w
orking
princ
ipl
e
s
for
wire
le
ss
s
ensor
net
works
,”
i
n
Proc
ee
dings
o
f
th
e
11
th
Swed
ish Nat
ional Com
pute
r Ne
tworki
n
g
Workshop (
SNCNW)
,
Karls
tad,
Swede
n
,
2015
.
[20]
K.
Hasee
b
,
et
al
.,
“
Secr
et
Sharing
-
Based
En
erg
y
-
Aw
are
an
d
Multi
-
Hop
R
out
ing
Proto
col
for
IoT
Base
d
W
SNs
,”
IE
EE
A
cc
ess
,
vol.
7
,
pp.
79980
-
79988
,
2
019
.
[21]
W.
Khan,
e
t
al
.,
“
A
Multi
-
Lay
e
r
Cluste
r
B
ase
d
Ene
rg
y
Eff
i
c
ient
Routi
ng
Sch
e
m
e
for
UW
SNs
,”
IE
EE
Acce
ss
,
vol.
7
,
pp
.
77398
-
77410
,
2019
.
[22]
T.
D.
Ngu
y
en
,
et
al
.,
“
A
distri
bute
d
ene
rg
y
-
ha
rve
sting
-
awa
re
routi
ng
a
lg
orit
hm
for
het
ero
gene
ous
IoT
net
works
,”
IEEE
Tr
ansacti
ons on
Gr
ee
n
Comm
unic
ati
ons
and
Ne
t
working
,
vo
l.
2,
no.
4
,
pp
.
1115
-
1127
,
2018
.
[23]
N.
Kum
ar
and
D
.
P
.
Vid
y
ar
thi
,
“
A
gre
en
routi
ng
al
gorit
hm
for
IoT
-
ena
b
le
d
software
def
ine
d
wire
le
ss
sensor
net
work
,”
IE
EE
Sensors
Journal
,
vol.
18,
no.
22
,
pp.
9449
-
9460
,
2018
.
[24]
W
.
I.
S.
W.
Din
,
e
t
al
.,
“
An
enh
anc
ement
of
pa
t
h
sele
c
ti
on
to
c
l
uster
he
ad
base
d
on
m
ult
i
-
hop
ro
uti
ng
in
two
-
tier
wire
le
ss
sensor
net
work
,”
Int
ernati
onal
Journal
of
El
ec
tri
cal
&
C
omputer
En
gine
ering
(
IJE
C
E)
,
vol.
9
,
no
.
6,
pp.
5360
-
5367
,
2019
.
[25]
J.
Li
n
,
et
al
.,
“
E
ffic
i
ent
Faul
t
-
To
le
ran
t
Routi
ng
i
n
IoT
W
ire
l
ess
Sensor
Networks
Based
on
Bipartit
e
-
Flow
Graph
Modeli
ng
,”
I
EEE
A
ccess
,
vol
.
7
,
pp.
14022
-
1403
4
,
2019
.
[26]
E.
Se
le
m
,
et
al
.,
“
THE
(T
e
m
per
at
ure
H
et
e
roge
neit
y
En
er
g
y
)
Aw
ar
e
Ro
uti
ng
Proto
co
l
for
IoT
Hea
l
th
Applic
a
ti
on
,”
I
E
EE
Ac
c
ess
,
vo
l.
7
,
pp
.
108957
-
1
08968
,
2019
.
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
Ener
gy
-
aware
strategy f
or
da
ta forw
ardin
g
i
n Io
T
ec
os
yst
e
m
(
K. Na
gar
ath
na)
4871
[27]
K.
Naga
rat
hn
a
a
nd
J.
D.
Mall
ap
ur,
“
OTSA
:
Opt
imize
d
Ti
m
e
S
y
nchr
onizati
on
A
pproa
ch
for
Del
a
y
-
b
ase
d
En
erg
y
Eff
icient
Routi
n
g
in
W
SN
,”
In
ter
nati
onal
Journ
al
of
Adv
an
ce
d
Computer
Scien
ce
and
Applicati
ons
,
vol.
8
,
no.
4,
pp.
331
-
341
,
20
17
.
[28]
K.
Naga
ra
thna,
et
al
.,
“
Trust
b
ase
d
sec
ur
ed
ro
uti
ng
in
wi
rel
ess
m
ult
imedia
se
nsor
net
works
,”
i
n
2012
Fourt
h
Inte
rnational
Co
nfe
renc
e
on
Co
mputati
onal
Intelli
gen
ce,
Comm
u
nic
ati
on
Syst
ems and
Ne
tworks
,
p
p.
53
-
5
8
,
2012
.
[29]
K.
Naga
ra
thna
a
nd
J
.
D.
Mallap
ur
,
“
An
inve
stig
at
ion
al
an
aly
sis
of
diffe
ren
t
appr
oac
hes
and
tech
nique
s
for
ti
m
e
s
y
nchr
oni
zation
in
wire
le
ss
sensor
net
work
,”
I
nte
rnational
Jo
urnal
of
Compu
te
r
Appl
i
cat
ions
,
vol.
103,
no
.
5
,
pp.
18
-
28
,
2014
.
[30]
K.
Naga
ra
thna
a
nd
J
.
D.
Ma
ll
ap
ur
,
“
TFTS:
A
Novel
Tr
iple
Fac
t
or
Ti
m
e
S
y
nchr
oniz
a
ti
on
for
Eff
ec
t
ive
Rou
ti
ng
i
n
La
rge
Sca
le
W
SN
,”
Wir
el
ess P
ersonal
Comm
unications
,
vo
l.
87,
n
o.
4
,
pp
.
1157
-
1
173
,
2016
.
[31]
K.
Naga
rat
hn
a
a
nd
J
.
D.
Mall
apu
r
,
“
LNLCS:
Le
v
era
ging
Network
Li
fetim
e
using
cl
ock
s
y
nchr
oni
z
a
ti
on
in
wir
el
ess
sensor
net
work
,”
i
n
2016
Inte
r
nati
onal
Con
fe
r
enc
e
on
Elec
tri
cal
,
Elec
troni
cs,
and
Optimization
Techni
ques
(
ICEE
OT)
,
pp.
2
119
-
2124,
2016
.
[32]
A.
A
.
Bega
m
an
d
A.
Prem
a
,
“
Optimiza
t
ion
of
E
h
Aw
are
Routi
n
g
Protocol
f
or
W
SN
Based
Iot
Networks
,
”
SSR
G
Inte
rnational
Jo
urnal
of El
e
ct
ro
nic
s and
Comm
u
nic
ati
on
Eng
ine
e
ring (
SSRG
–
IJ
EC
E
)
,
pp.
30
-
35,
2019.
[33]
X.
Ti
an,
et
al
.,
“
Rel
ia
ble
and
ene
rg
y
-
eff
icient
dat
a
forwardi
n
g
in
indus
tri
al
wire
le
ss
sensor
net
works
,”
I
EEE
Syste
ms
Journal
,
vol.
11,
no.
3
,
p
p.
1424
-
1434
,
2
01
5
.
[34]
J.
V.
V.
Sobral,
et
al
.,
“
Im
proving
the
Perform
an
ce
of
LOAD
ng
Routi
ng
Pr
otoc
o
l
in
Mobile
Io
T
Scena
rios
,”
I
EEE
Ac
c
ess
,
vol
.
7
,
p
p.
107032
-
1070
46
,
2019
.
[35]
B.
Manic
k
ava
sa
gam,
et
al
.,
“
Opt
imal
pac
k
et
rout
i
ng
for
wire
le
ss
bod
y
ar
ea
n
et
wor
k
using softwa
re
def
ine
d
ne
twork
to
handl
e
m
edi
c
al
emerge
nc
y
,”
I
nte
rnational
Jou
rnal
of
El
ec
tri
c
al
and
Computer
Engi
nee
ring
(
I
JE
CE)
,
vo
l.
10,
no.
1
,
pp
.
427
-
4
37
,
2020
.
[36]
V.
D.
Chakra
v
ar
th
y
and
B.
Am
utha
,
“
Path
base
d
l
oad
balanc
ing
fo
r
dat
a ce
nt
er
netw
orks using
S
D
N
,”
Int
ernati
on
a
l
Journal
of
Elec
t
rical
&
Compute
r E
ngineering
(
IJE
CE)
,
vo
l.
9
,
n
o.
4
,
pp
.
327
9
-
3
285,
2019
.
[37]
H.
T.
Zaw
and
A
.
H
.
Maw
,
“
Tra
ffi
c
m
ana
ge
m
ent
with
el
ep
hant
flow
det
e
c
ti
on
in
s
oftwa
re
def
ine
d
net
wor
ks
(SD
N)
,”
Inte
rna
ti
onal Journal
o
f
Elec
tri
cal
&
Co
mputer
Engi
n
ee
r
ing
(
IJE
CE)
,
vol
.
9
,
no
.
4
,
pp
.
32
03
-
3211,
2019
.
[38]
S.
N.
Hert
ia
na
,
e
t
al
.,
“
Eff
ec
t
ive
Route
r
As
sis
te
d
Congesti
on
Cont
rol
for
SD
N
,”
Inte
rnational
Journal
of
El
e
ct
rica
l
&
C
o
mputer
En
gine
ering
.
(
IJE
C
E)
,
vol.
8
,
no.
6,
pp.
4467
-
4476
,
2018.
[39]
T.
E
.
Ali,
et
al
.,
“
Loa
d
bal
an
ce
in
dat
a
ce
n
te
r
S
DN
net
works
,”
I
nte
rnational
Jou
rnal
of
El
e
ct
rica
l
and
Computer
Engi
ne
ering
(
IJ
ECE
)
,
vol
.
8
,
no
.
5
,
p.
308
4
-
30
9
1
,
2018
.
BIOGR
AP
H
Y
O
F
AU
TH
OR
Dr.
K.
Nagarat
hn
a
,
I
am
cur
ren
tly
working
in
Basave
shw
ar
E
ngine
er
ing
Coll
ege
,
B
aga
lko
t,
Karna
ta
k
a,
Indi
a,
as
As
socia
te
Profess
or.
I
h
ave
completed
m
y
B.
E
from
Vijay
ana
g
ara
Engi
ne
eri
ng
Col
le
ge
,
Bellar
y
Gu
lba
rga
Univ
ersity
.
I
h
ave
complet
ed
m
y
M
.
Tech
from
Po
ojy
a
Doddappa
Col
l
ege
of
Engi
n
eering
Gulbar
g
a,
from
Visvesvara
y
a
Te
c
hnological
Univer
sit
y
,
Bel
gaum.
I
have
complet
ed
Ph.
D.
(El
e
ct
roni
cs
and
Com
m
unic
at
ion
Engi
n
ee
ring
.
)
Basave
shw
ar
Engi
ne
eri
ngCol
l
ege
,
B
agalkot,
Karna
ta
k
a,
In
dia
,
Visvesva
ra
y
a
Technol
ogi
c
al
U
nive
rsi
t
y
,
Bel
gaum, India
.
Evaluation Warning : The document was created with Spire.PDF for Python.