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.
8
, No
.
6
,
Decem
ber
201
8
, p
p.
5162
~
5168
IS
S
N: 20
88
-
8708
,
DOI: 10
.11
591/
ijece
.
v8
i
6
.
pp
5162
-
51
68
5162
Journ
al h
om
e
page
:
http:
//
ia
es
core
.c
om/
journa
ls
/i
ndex.
ph
p/IJECE
Improvi
ng IF Al
gorithm
for Dat
a Aggre
gation T
echn
iqu
es
in
Wireles
s
Sensor
Network
s
Madh
av In
gle
,
P.
V.R.
D.
Pra
sa
d
a Rao
Depa
rtment
o
f
C
SE,
Koneru
La
k
shm
ai
ah
Educat
i
on
Foundati
on
,
I
ndia
Art
ic
le
In
f
o
ABSTR
A
CT
Art
ic
le
history:
Re
cei
ved
Dec
28
, 201
7
Re
vised
Ma
y
31
, 2
01
8
Accepte
d
J
un
1
5
, 201
8
In
W
ire
le
ss
Sensor
Network
(
W
SN
),
fac
t
from
diffe
ren
t
sensor
nodes
is
col
l
ec
t
ed
a
t
assem
bli
ng
node
,
which
is
t
y
p
ica
lly
compl
et
e
vi
a
m
odest
proc
edur
es
such
as
ave
rag
ing
as
i
nade
qua
te
computat
ion
al
power
and
ener
g
y
resourc
es.
Thou
gh
such
col
lections
is
ide
nt
ified
to
be
ext
r
emel
y
sus
ce
pti
bl
e
to
node
comprom
ising
at
ta
cks.
The
se
appr
oa
ch
es
are
ext
remel
y
prone
to
at
t
ac
ks
as
W
S
N
are
t
y
pi
call
y
la
cki
ng
interfe
re
resil
i
ent
har
dware
.
Thus,
purpose
of
ver
a
ci
t
y
o
f
fa
ct
s
an
d
pre
stig
e
of
s
ensor
nodes
is
cri
tica
l
for
wire
l
ess
sensor
net
works
.
Therefore,
imm
inent
gat
h
ere
r
no
des
will
b
e
profic
i
ent
of
ac
complishm
ent
addi
ti
on
al
cu
lt
ivated
da
ta
aggr
egation
al
gorit
hm
s,
so
cre
ating
W
SN
li
ttle
unre
sisting
,
as
the
per
form
anc
e
of
ac
tu
al
low
power
pro
ce
ss
ors
aff
ec
te
d
l
y
in
creases.
It
er
ative
filteri
ng
al
gorit
hm
s
embrac
e
inord
in
at
e
ca
pa
cit
y
for
such
a
resolutio
n.
The
wa
y
of
a
ll
oc
at
ed
the
m
at
chi
ng
m
ass
el
ements
to
informati
on
del
iv
ere
d
b
y
e
ac
h
source
,
suc
h
it
er
at
iv
e
al
gori
t
hm
s
conc
urre
ntly
assem
ble
facts
from
seve
ral
roots
and
del
iv
er
ent
r
ust
v
al
ua
ti
on
of
the
s
e
roots.
Though
suggestive
l
y
ext
r
a
subs
ta
nti
a
l
aga
inst
collusio
n
at
t
ac
ks
b
eside
the
m
odest
averagi
ng
t
ec
hn
iqu
es,
ar
e
qui
et
vulne
rab
le
to
a
diffe
ren
t
cul
t
iva
t
ed
at
t
ac
k
familia
riz
e
.
The
exi
st
in
g
li
te
ra
ture
is
surve
y
ed
in
th
is
pape
r
to
ha
ve
a
stud
y
of
itera
tive
fi
lt
er
ing
t
ec
h
nique
s
and
a
det
a
il
ed
compari
son
is
provide
d.
At
the
end
of
t
his
pape
r
new
t
ec
hniqu
e
of
improved
it
er
at
i
ve
fil
t
eri
ng
is
proposed
with
the
hel
p
of
liter
at
ur
e
surve
y
and
dra
wbac
ks foun
d
in the
literatur
e.
Ke
yw
or
d:
Aggregati
on
Atta
ck
Fil
te
ring
Netw
orks
Robust
Sensor
W
i
reless
Copyright
©
201
8
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
:
Ma
dh
a
v Ingle
,
Dep
a
rtm
ent o
f C
SE,
Kone
ru Lak
shm
ai
ah
Ed
ucati
on F
oundat
ion,
Vaddes
war
am
, Gun
t
ur, An
dhr
a Pr
a
des
h,
I
nd
i
a
.
Em
a
il
:
ing
le
.
m
adh
a
v@gm
ai
l.
com
1.
INTROD
U
CTION
W
i
reless
sens
or
netw
orks
(
W
SN
)
a
re
usual
ly
co
m
pr
ise
s
tho
usa
nds
of
lo
w
cost
,
lo
w
power
se
ns
in
g
dev
ic
es
with
li
m
it
ed
co
m
pu
ta
ti
on
al
,
m
e
m
or
y
and
com
m
un
ic
at
ion
resou
rc
es.
W
S
N
is
cal
le
d
as
a
sp
eci
al
cl
ass
of
a
d
-
hoc
wir
el
ess
netw
ork.
As
W
S
N
c
onta
ins
sever
al
t
hous
a
nds
of
s
ens
or
no
des
di
stribu
te
d
i
n
a
ta
rg
et
detect
ing
e
nv
i
r
on
m
ent
within
it
s
neigh
bo
rho
od
c
ollec
ts
the
data
and
c
ompu
te
s
it
.
Senso
r
nodes
a
re
m
a
de
up
of
sim
ple
pr
oc
essor,
ap
plica
ti
on
s
pecific
se
ns
ors,
wireless
transceive
r
an
d
low
batte
ry.
Data
aggre
gation
is
us
e
d
due
to
li
m
it
ed
a
m
ou
nt
of
power
in
s
ens
or
no
des
a
nd
to
reduce
tran
sm
issi
on
over
hea
d.
A
va
riet
y
of
schem
es
fo
r
da
ta
aggreg
at
i
on
s
are
pr
ov
i
ded.
Data
ag
gr
e
gati
on
is
a
proce
ss
wh
e
rein
data
i
s
bee
n
m
erg
es
fro
m
nu
m
erous
se
nsors
at
inter
m
ediat
e
nodes
an
d
tra
ns
m
itti
ng
a
ggre
gated
data
to
t
he
base
sta
ti
on
.
Data
aggre
gation
e
nt
ang
l
es
colle
ct
ion
of
crit
ic
al
data
pr
esente
d
to
the
base
sta
ti
on
in
e
nergy
adequate
fas
hion
with
no
m
inal l
at
ent tim
e.
Tw
o
ty
pes
of
prot
oco
ls
c
at
eg
ori
zed
i
n
data
a
ggre
gation
ba
s
ed
on
the
to
po
l
og
y.
T
he
fi
rst
i
s
tree
base
d
and
sec
ond
one
is
cl
us
te
r
base
d
data
ag
gr
e
gatio
n
prot
oco
l.
T
he
gro
up
s
of
nodes
form
the
cl
us
te
r.
The
gro
up
i
ng
of
t
he
se
no
des
i
nto
cl
us
te
rs
is
cal
le
d
cl
us
te
rin
g.
I
n
case
of
cl
us
t
er
base
d
data
a
ggre
gation
pr
ot
oco
ls,
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
Impr
ovin
g IF
Algo
rit
hm f
or
Da
t
a
A
ggreg
at
ion
Tech
niques
in
Wi
rel
ess
Se
ns
or N
et
works
(
Madha
v
In
gle
)
5163
cl
us
te
r
head
or
aggre
gato
r
pe
rfor
m
s
data
ag
gr
e
gatio
n
an
d
i
n
case
of
t
ree
base
d
da
ta
a
gg
reg
at
io
n
protoc
ol
the
interm
ediat
e
par
ent
node
nea
r
to
t
he
si
nk
pe
rfor
m
s
data
ag
gr
e
gatio
n.
Sensor
no
des
hav
e
lim
i
te
d
com
puta
ti
on
powe
r,
batte
ry,
le
ss
storag
e
capaci
ty
;
becau
s
e
of
al
l
these
lim
it
a
ti
on
s,
ther
e
is
a
need
of
s
avin
g
su
c
h
res
ources
by
re
du
ci
ng
t
he
am
ou
nt
of
da
ta
transm
issi
on
.
T
his
ca
n
be
done
by
us
i
ng
the
ef
fici
ent
te
chn
i
qu
e
cal
le
d
dat
a
aggre
gation.
F
act
s
fr
om
num
ero
us
se
nsor
s
are
ag
gr
e
gat
ed
to
ward
one
node
cal
le
d
as
aggre
gator,
hen
ce
com
m
un
ic
at
es aggre
gated dat
a w
it
h base
stat
ion
.
Iterati
v
e
filt
ering
(I
F
)
is
us
e
d
fo
r
data
ag
gr
e
gation
a
nd
trust
assess
m
ent.
The
tr
us
tw
or
t
hi
ness
of
eac
h
sens
or
is
est
i
m
at
ed
in
accor
da
nce
with
the
s
pa
n
of
sens
or
re
adin
gs
f
ro
m
the
cor
rect
est
im
at
e
values
got
in
the
antece
de
nt tu
rn of it
erati
on as
in the alac
rity
o
f
aggre
gatio
n of al
l sens
ors s
ta
ti
sti
cs.
Corresp
ondi
ng
data
ag
gr
e
gati
on
is
ha
bituall
y
a
charged
a
ver
a
ge.
Senso
r
sta
ti
sti
cs
are
sign
ific
a
ntly
diff
e
rin
g
from
su
c
h
est
im
at
e.
So
t
he
se
nsors
are
c
on
si
der
e
d
as
le
ss
tr
us
tw
ort
hin
es
s
a
nd
al
so
i
n
the
ag
gre
gatio
n
pro
cess
, th
ei
r
s
ta
ti
sti
cs are b
es
towe
d
a m
ino
r
weig
ht in
c
urre
nt tu
rn of it
erat
ion
.
The
sen
sors
knobs
are
par
ti
ti
on
int
o
seve
r
cl
us
te
rs,
a
nd
e
ver
y
cl
us
te
r
possesses
a
cl
us
te
r
head
th
at
com
po
rts a
n
a
ggre
gato
r.
Spo
r
adical
ly
d
at
a is am
assed
and a
ggre
gated by t
he
a
ggre
gator.
As
pe
r
as
the
m
ai
n
m
otive
of
secu
rity
serv
i
ces
in
W
S
Ns
i
s
to
pr
eca
utio
n
in
the
syst
e
m
and
res
ources
from
at
ta
cks
and
m
isbehavi
or
.
The
sec
uri
ty
in
the
f
orm
of
data
c
onfide
ntial
it
y,
data
i
ntegr
it
y,
data
authe
ntica
ti
on
,
data
fr
esh
ness
,
robu
st
ness
,
da
ta
avail
abili
ty,
acce
ss
con
tr
ol
,
nonr
e
pudiati
on,
for
ward
secrecy
,
backwa
rd secr
ecy
is i
m
po
rta
nt for
WSN.
This
pa
per
s
urveys
the
li
te
ratur
e
to
stu
dy
var
i
ou
s
f
act
ors
of
wireless
se
ns
or
net
work
f
or
it
erati
ve
filt
ering
.
A
r
ound
twe
nty
thr
ee
pa
per
s
are
co
ns
i
de
red
f
or
survey.
Th
e
par
am
et
ers
from
each
pa
per
a
r
e
identifie
d
a
nd
dr
a
w
back
of
e
ach
aut
hor’s
work
is
highli
gh
te
d
in
the
s
urvey.
T
he
det
ai
ls
of
the
s
urvey
ar
e
su
m
m
arized
in
a
ta
ble.
W
it
h
the
help
of
t
he
li
te
ratur
e
a
nd
dr
a
w
back
descr
i
bed
fro
m
each
pap
e
r
a
n
ew
appr
oach f
or tr
us
tw
or
t
hin
ess
of sen
s
ors a
nd
value o
f
the
r
e
pu
ta
ti
on
vecto
r
is prop
os
e
d.
The
rem
ai
nin
g
j
our
nal
is
or
c
he
strat
ed
as
he
r
e.
The
sect
io
n
II
de
scrib
es
th
e
detai
le
d
li
te
ratur
e
sur
vey.
Sect
ion
III
te
nders
ga
p
analy
sis.
Sect
ion
I
V
descr
i
bes
pro
po
s
ed
wor
k.
A
t
la
st,
the
j
ou
r
nal
is
co
nclu
de
d
in
sect
ion
V.
2.
RELATE
D
W
ORK
This
sect
ion
of
the
pap
e
r
gi
ve
s
detai
le
d
li
te
ratur
e
sur
vey.
T
he
rece
nt
pa
pe
rs
inclu
ding
th
e
te
chn
iq
ues
of
data
ag
gr
e
ga
ti
on
a
re
s
urve
ye
d
a
nd
a
deta
il
ed
com
par
iso
n
of
s
urveyed
li
te
ratur
e
is
gi
ven
at
the
e
nd
of
this
sect
ion
.
Lat
hies
Bhas
ke
r
ha
ve
co
ns
i
der
e
d
the
pa
r
a
m
et
ers
including
Fit
ness
f
un
ct
io
n,
Cl
us
t
er
functi
on,
distrib
ution
it
em
(α),
transm
i
ssion
co
st
it
em
(β)
an
d
e
ne
rg
y
it
em
(γ
)
[1]
.
The
te
ch
ni
qu
es
us
e
d
are
Dat
a
Aggregat
or
(
D
AG),
Ge
netic
al
gorithm
.
The
m
ai
n
pr
ob
le
m
with
the
a
uthor
is
i
m
pr
ov
em
ent
required
i
n
Estim
at
ion
o
f
m
et
rics, En
e
rgy
, tran
sm
issi
on and
distrib
utio
n.
Hev
i
n,
Ra
j
es
h
D
hasian
,
Pa
ram
asi
van
Ba
la
su
bram
anian
disc
us
se
d
E
nergy
c
on
s
umpti
on,
C
ost
reducti
on,
Sec
ur
it
y,
Accurac
y
,
Th
rou
ghput
an
d
oth
e
r
pa
ram
et
ers
[2]
.
The
al
gorith
m
s
con
sidere
d
are
si
m
ulate
d
an
ne
al
ing
cal
cul
us
for
data
ag
gr
e
ga
ti
on
,
M
ulti
-
pa
th
data
tra
ns
m
i
ssion.
T
he
pro
blem
with
the
pap
e
r
is n
um
ber
of sl
eep
nodes
are
not co
ns
i
der
e
d
s
o
sc
ope f
or e
ne
rg
y i
m
pr
ovem
e
nt.
Par
li
B.
Har
i,
Dr
.
S
haile
ndra
Nar
ay
an
Sin
gh
discu
ssed
D
at
a
agg
re
gatio
n,
scal
abili
ty
,
powe
r
us
es
,
ov
e
r
head,
an
d
qu
al
it
y
of
ser
vice
[
3]
.
T
he
te
chn
iq
ues
us
e
d
are
secu
re
r
ou
ti
ng
protoc
ol
s,
data
a
ggre
gatio
n
protoc
ols,
i
ntr
us
io
n
detect
io
n,
c
rypto
grap
hy
al
go
rithm
s.
The
pro
blem
is
that
the
al
gorithm
s
to
pro
vid
e
secur
it
y are
no
t descri
bed in
det
ai
l.
M. Rez
van
i,
A
. I
gn
j
at
ovic
, E. Be
rtino
, S. Jha, auth
or
pro
posed
an
e
nh
a
nce
m
ent f
or
it
erati
ve
strai
ni
ng
m
et
ho
ds
by
furn
is
hing
a
n
le
adin
g
est
im
ati
on
f
or
anal
ogou
s
al
gorithm
s
t
hat
de
vel
op
s
them
sel
ves
not
jus
t
collusio
n
pe
rsiste
nt,
bu
t
f
ur
t
her
m
or
e
pr
eci
s
e
an
d
s
wifter
appr
oach
i
ng
[
4]
.
T
he
pro
blem
with
pap
e
r
is
dat
a
aggre
gator no
de
is not c
om
pr
om
ise
d.
S.
Kr
it
hi
ka,
D.
J.
P
res
hiya
disc
us
se
d
on
e
nh
a
nce
d
i
nfo
a
ggre
gation
sty
le
in
WSN
to
wa
r
d
com
pr
om
ise
d
node
[
5]
.
Also
discusse
d
ch
al
le
ng
e
to
data
ag
gr
e
gatio
n
is
yet
to
secur
e
ag
gregati
ve
in
for
m
at
ion
from
con
ci
li
at
i
on
node
at
ta
ck
s
and
re
veali
ng
al
l
ov
er
ag
gregati
ng
te
ch
niq
ue
to
ac
qu
ir
e
pr
eci
se
ag
gr
e
gative
conseq
ue
nces. The
pro
blem
w
it
h
the
p
ap
er is
the clu
ste
r bas
ed netw
ork, ne
twork
li
fesp
a
n i
s less.
A
Secu
re
Data
Aggregati
on
sc
hem
e
reco
m
m
ends
by
H.
S
.Ann
a
pur
na,
M.S
idd
a
pp
a
wh
ic
h
wo
r
ks
with
Fault
Tolera
nc
e
fo
r
W
i
reless
Sens
or
Netw
orks
that
offe
rs
fau
lt
toleranc
e
and
m
utu
al
l
y
end
to
end
pr
i
vacy
thr
oughout
info
ag
gregati
on
[6]
.
I
n
thi
s
pap
e
r,
rese
arch
e
r
sugg
e
s
ts
pr
act
ic
e
for
secur
e
in
form
ation
com
m
un
ic
at
ion
by
pu
blic
cr
yptogra
ph
y
i
n
sens
or
netw
ork
.
T
he
us
e
of
A
ND
&
OR
op
e
rati
on
f
or
sh
ari
ng
secur
e
m
essage & reco
ns
tr
uc
ti
on
s is
pro
ble
m
at
ic
.
V.
Vaide
h
i,
R.
Kayal
vizhi
a
nd
N
.
C.
S
eka
r
pro
po
se
s
a
ne
w
patte
r
n
t
o
s
ecur
e
t
he
proc
ess
of
data
aggre
gation
by
as
lo
ng
as
a
li
gh
t
-
weig
ht
secu
rity
syst
em
ca
ll
ed
Com
bin
at
ori
al
Key
Distrib
utio
n
(
CKD
)
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.
8
, N
o.
6
,
Dece
m
ber
2
01
8
:
5162
-
5168
5164
m
echan
ism
that
eat
s
a
red
uce
d
am
ou
nt
of
powe
r
an
d
it
s
per
f
or
m
ance
is
enh
a
nce
d
us
i
ng
has
hes
of
dat
a
that
is
directed
th
rou
gh
the
netw
or
k
[7]
.
The
pr
opos
e
d
syst
em
re
du
ces
the
powe
r
c
on
s
umpti
on
an
d
m
ax
i
m
iz
e
s
thesecu
ren
e
ss
of d
at
a i
n
the
wireless se
nsor
n
et
w
ork
. T
he
t
echn
i
qu
e
s
us
ed
are
l
ocati
on d
e
pende
nt.
P.
B.
Gaik
wad,
M.
R.
D
hage
done
t
he
s
urvey
on
data
a
ggre
gation
in
sec
ured
way
for
wir
el
ess
sens
or
netw
orks.
Data
aggreg
at
io
n
m
et
hods
can
e
ff
i
ci
ently
su
pport
to
decr
ease
c
onsu
m
ption
of
e
nergy
by
rem
ov
in
g
redu
nd
a
nt
data
travell
ing
bac
k
to
t
he
sin
k
[8]
.
T
her
e
are
nu
m
erous
sec
ur
it
y
co
ncerns
wh
ic
h
c
on
ta
i
n
data
integrity
,
data
confide
ntial
it
y,
avail
abili
ty
,
and
f
reshness
in
data
a
ggreg
at
i
on
that
beco
m
e
serio
us
w
hen
W
S
N
is
instal
le
d
in
an
un
fr
ie
nd
ly
env
i
ronm
ent
wh
e
re
se
nsors
dro
p
pr
on
e
t
o
node
fail
ur
e
s
and
com
pr
om
i
sed
by
rival. Ma
ny al
gorithm
su
se m
e
ssage
a
uth
e
ntic
at
ion
s c
ode &
us
es sym
m
et
ri
c k
ey
e
ncr
y
ption.
H.
Hayo
uni
an
d
M.
Ham
di
present
a
surv
ey
of
H
om
o
m
or
phic
enc
ryptio
n
pro
per
ti
es
w
hi
ch
us
ed
by
so
m
e
secur
e
da
ta
aggreg
at
io
n
ap
proac
hes,
and
t
hen
t
hey
associat
ed
the
m
gr
ounde
d
on
certai
n
pr
i
nc
iples
[9]
.
Last
ly
,
they
pr
esent
a
nd
deliberate
ce
rtai
n
vu
l
ner
a
ble
t
opic
s
that
wan
t
t
o
be
obser
ve
d
in
upcom
ing
stud
ie
s
ind
irect
io
n
to
a
dv
a
nce
the
saf
et
y
of
data
a
gg
reg
at
io
n
i
n
wir
el
ess
sen
sor
ne
tworks
.
T
he
pr
ob
le
m
is
no
ultim
at
e
strat
egy
w
hich
m
ay
enc
ount
er
the
sec
ur
it
y
dem
and
s
to
w
ard
data
ag
gre
gation
an
d
set
tl
e
entire
dilem
m
a
s
evoke
d by the
excep
ti
onal
prop
e
rtie
s of
WSNs.
A
Sec
ur
e
A
ppr
oxim
a
te
Data
A
ggreg
at
io
n
(SAD
A)
sch
e
m
es
intends
by
aut
hros
S
.
Pr
a
kas
h
T,
Venu
gopal,
G
Pr
at
him
a
E,
L
M
Pat
naik,
K
R,
S
S
Iyeng
a
r,
in
that
outl
ine
a
re
m
ade
us
i
ng
pri
m
it
ive
po
ly
nom
ia
l
and
Me
ssage
A
uth
e
ntica
ti
on
Cod
es
(M
ACs
)
are
trans
ferr
ed
al
ongs
i
de
with
the
outl
ine
to
gu
a
ra
ntee
tr
uth
f
uln
es
s
[
10]
.
SADA
delive
r
s
data
fr
e
shne
ss
an
d
trut
hful
ness
at
a
c
omm
un
ic
at
ion
co
st
of
O
(1).
T
he pr
oble
m
wi
th the pa
pe
r
is a
uthor
not
worke
d
f
or a
ggre
gato
r node.
P.
R.
Vam
si
a
nd
K
.
Ka
nt
te
nd
e
r
a
st
ru
ct
ure
for
Wireless
Senso
r
Net
work
s
(
WSNs)
usi
ng
TM
S
a
t
node
point
a
nd
IDS
at
Ba
se
S
ta
ti
on
(BS
)
si
de
f
or
s
ecu
re
da
ta
aggre
gation
[11]
.
Using
tr
ust
cred
i
ts
eac
h
node
in
the
net
wor
k
e
valuates
th
e
be
ha
viour
of
it
s
neig
hbors
an
d
e
nfo
rces
the
netw
ork
op
e
rati
on
to
il
lustrate
cl
us
te
r
hea
d
s
el
ect
ion
,
bri
efi
ng
t
o
the
BS
and
data
ag
gregati
on.
T
he
n,
BS
exam
ines
the
ack
nowl
edg
e
d
inf
or
m
at
ion
usi
ng
I
DS
a
nd
ac
counts
kn
o
wle
dg
e
a
bout
m
isch
ie
f
yo
u
eve
nts
back
to
node
s
in
the
netw
ork.ID
S
of
te
n produce
f
al
se r
ep
ort
of
m
al
ic
iou
s acti
vity
is a p
r
ob
le
m
.
S.
k.
Md.
Ra
hm
an,
M.
A.
H
os
sai
n,
M.
Ma
hm
ud
,
M.
I.
Chau
dr
y,
A.
Alm
og
ren,
M.
Alnuem
,
A.
Alam
ri
designed
reso
l
ution
gro
unde
d
on
a
c
rypto
gr
a
phic
m
od
e
[12]
.
Aggr
e
gato
r
ca
n
s
coop
obli
vious
data
a
t
the
a
ggreg
at
i
on
le
vel
m
akes
key
s
ecu
rity
chall
en
ge
f
or
data
a
ggre
ga
ti
on
i
n
WSN.
Th
us
,
this
le
vel
of
aggre
gation
is
su
sce
ptible
to
at
ta
cks
by
intru
de
rs.
S
o,
the
pr
ese
nt
pro
pos
al
s
do
not
ou
tf
it
the
secur
it
y
gr
a
nts
wh
ic
h
em
erg
e
into
dynam
ic
no
de
WSN.
He
nce
in
this
pa
pe
r
a
uthors
pro
pose
d
a
syst
em
to
ta
ckle
t
he
se
cur
it
y
issues in
d
y
na
m
ic
n
od
e
of
W
SN
call
ed
it
li
gh
twei
ght sec
ure data a
ggre
gation
te
c
hn
i
qu
e
. Sec
uri
ty
an
al
ysi
s and
Energy c
onsum
pt
ion
is
not p
rovide
d
is t
he pr
oble
m
w
it
h
the
pap
e
r.
S.
S.
Ra
njani
,
Dr.
S.
Ra
dha
kr
is
hn
a
n
a
nd
Dr
.
C.T
hanga
r
aj
a
uthors
m
od
ify
their
Ene
rg
y
ef
fici
ent
Cl
us
te
r
Ba
se
d
Data
A
ggre
gat
ion
(ECBD
A
)
syst
e
m
to
deliver
sec
ur
e
dat
a
tran
sm
issi
on
[
13
]
.
S
ub
se
qu
ently
,
sens
or
s
nodes
ar
e
low
powered
i
m
m
at
ur
e;
i
t
is
no
t
feasible
to
pu
t
on
ty
pical
cryptograph
y
te
chn
iqu
e
s.
Cl
us
te
r
head
ac
hiev
es
data
ag
gr
e
gation
a
nd
Ba
ye
sia
n
f
us
io
n
al
go
r
it
h
m
to
al
low
s
ecur
it
y.
Tr
us
t
is
gu
i
ding
ass
oc
ia
ti
on
a
m
on
gst
two
sens
or
no
de
s.
T
hroug
h
i
ns
pe
ct
ion
t
here
li
abili
ty
of
a
node
,
the
y
can
al
lo
w
secu
re
com
m
un
ic
at
ion
.
Ba
ye
sia
n
f
us
io
n
al
gorith
m
analy
zes
t
he
tr
us
t
possibil
it
y
of
a
s
ens
or
base
d
on
th
e
perform
ance
of
the
node.
B
F
A
disc
us
se
d
in
the
pa
per
is
I
nf
le
xib
le
to
se
ns
or
c
hanges
and
t
he
work
l
oad
i
s
con
ce
ntrate
d
at
a sin
gle
po
i
nt. It i
s not s
uitabl
e f
or
la
rg
e
-
ra
nge
netw
ork.
The
tr
us
t of
t
he
n
odes is pre
m
edita
te
d
by N
. S
. Re
nubala
an
d K.S.D
ha
na
la
ks
hm
i, they
aim
ed
schem
e
util
iz
es
the
Bi
o
-
ins
pire
d
Ene
r
gy
Eff
ic
ie
nt
-
Cl
us
te
r
(B
EE
-
C
)
protoc
ol
an
d
f
uzzy
log
ic
[14]
.
The
bla
ck
ho
l
e
a
nd
flo
od
i
ng
at
ta
ck
disc
ov
e
re
d
by
sugg
est
e
d
pr
act
ic
e
an
d
it
al
so
ban
is
hes
this
assault
.
The
cre
dit
rates
are
associat
ed
al
ong
with
the
li
m
it
.
The
cred
it
rate
beyon
d
the
lim
it
is
deliberated
as
tr
us
te
d
no
des
a
nd
data
pack
et
s
are
pe
rishe
d
ov
e
r
th
e
no
de
.
T
he
c
red
it
rate
i
nf
e
r
ior
th
an
t
he
li
m
it
value
is
la
beled
a
s
accr
edite
d
un
t
ru
ste
d
node
w
hich
is
t
he
n
el
im
inate
d.
The
pro
j
ect
ed
m
ann
er
deliv
ers
re
duced
de
la
y
pau
se
,
ex
pensi
ve
ov
e
r
head,
an
d
pack
et
waste
with
im
pr
ov
e
d
pac
ket
trans
fe
r
rati
o
t
han
th
e
pr
e
sent
gam
e
theo
ry,
F
uzz
y
with
trust
(
LEAC
H
).
Disad
va
ntag
e
of
pract
ic
in
g
f
uzzy
lo
gic
is
ra
pid
ly
bu
dd
i
ng
exte
nt
of
t
he
ru
le
-
ba
se
an
d
m
ixtur
e.
K.
Sh
im
,
C.
Par
k,
aut
hor
s
pro
pose
a
real
-
w
orl
d
SDA,
Sen
-
S
DA,
f
ounded
on
preser
vative
Ho
m
om
or
ph
ic
en
cry
ption
sc
hem
e,
an
i
d
entit
y
-
base
d
si
gn
at
ur
e
sch
em
e,
and
a
batc
h
c
onfi
rm
ation
m
et
hod
with
an
al
gorithm
fo
r
filt
ering
i
nject
ed
false
data
[15
]
.
Pac
ket
dro
p
at
ta
cks
ar
e
no
t
ha
nd
le
d
in
this
pap
e
r
a
nd
it
is
extra
over
hea
d.
M.
Thanga
raj,
P.
P.
Ponm
al
ar
pr
op
os
e
d
Sec
ur
e
d
Hyb
rid
(
GA
-
AB
C
)
Dat
a
Aggr
e
gatio
n
Tree
(SHD
T)
is
bein
g
raisi
ng
the
vital
it
y
pro
fici
ency
of
a
syst
e
m
.
The
e
xp
l
oitat
ion
of
form
er
intel
le
c
tual
strat
egies
as
a
n
al
te
rn
at
ive
of
ABC i
s tr
ouble
[
16
]
.
D
Ma
njaia
h,
M.
Bharat
hi
an
d
B.P.
Vij
ay
a
Ku
m
ar
pr
ece
de
s
a
li
ne
towa
r
d
delibe
r
at
es
the
ha
ndli
ng
of
m
ul
ti
-
di
m
ensio
nal
key
distrib
ution
(M
DKD)
pro
posal
f
or
s
afeguar
ding
t
he
co
nn
ect
io
n
s
urrou
nd
e
d
by
nodes
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
Impr
ovin
g IF
Algo
rit
hm f
or
Da
t
a
A
ggreg
at
ion
Tech
niques
in
Wi
rel
ess
Se
ns
or N
et
works
(
Madha
v
In
gle
)
5165
appr
oach
a
ble
i
n
the
WSN
sys
tem
[17]
.
The
orga
nizat
ion
is
co
ncen
t
rated
extra
sa
fe
t
hro
ugh
play
ing
no
de
-
to
-
node veri
ficat
ion sy
ste
m
b
y
a
lt
ering
ell
ipti
cal
cu
r
ve
c
rypto
grap
hy as
well
as Elgam
al
sign
at
ur
e
desig
n. L
ast
ly
,
the
adv
ise
d
de
s
ign
is
assesse
d
fou
nd
e
d
on
m
a
nipulat
ion
p
eri
od
in
sec
ondha
nd
p
acket data
delivera
nce
rat
io
to
cat
ch
the aim
e
d
protect
io
n
sy
stem
is extre
m
el
y l
ucr
at
ive in
n
a
tu
re.
T
he
pr
ob
le
m
is that E
CC
algo
rithm
i
so
m
er
com
plex
as
we
ll
as m
or
e d
if
ficult
for
im
plem
ent Elgam
al
Sign
at
ur
e
alg
ori
th
m
is rar
el
y u
sed
i
n pr
act
ic
e.
R.
K.
K
od
al
i
pro
po
ses
a
ke
y
m
anag
e
m
ent
te
chn
iq
ue,
a
m
on
g
it
s
red
uc
ed
res
ource
c
os
ts,
w
hich
is
extrem
el
y su
it
a
ble to
be used
in hierarc
hical
WSN a
pp
li
cat
ion
s
[
18]
. Toget
her
I
den
ti
ty
b
a
sed key
m
anag
e
m
ent
(I
BK
)
a
nd
pro
bab
il
ist
ic
key
pr
e
-
distri
bu
ti
on
syst
em
s
are
form
ed
e
m
plo
y
toward
al
te
r
ed
hie
rar
c
hical
la
ye
rs.
Desig
ne
d
key
m
anag
em
ent
a
ppr
oach
is
ap
pl
ie
d
adoptin
g
I
RIS
W
S
N
no
de
s.
The
m
ai
n
pr
oble
m
is
insecur
it
y
against
Q
uan
t
um
Co
m
pu
te
r
at
ta
ck.
Karu
na
Ba
bbe
r
an
d
Ra
j
ne
es
h
Ra
nd
hv
a
pr
opos
e
cl
us
te
ri
ng
al
gorithm
with
e
nergy
e
ff
ic
ie
ncy
a
nd
QOS
in
form
of
sec
ur
it
y
an
d
reli
abili
ty
[19]
.
Un
i
form
clu
ste
r
an
d
cent
r
al
ly
locat
ed
no
de
as
a
cl
us
te
r
head
consi
der
e
d. T
he
au
th
or
has not
co
nsi
der
e
d
cl
us
te
r hea
d fail
ur
e
.
Bharath
K.
Sa
m
anthu
la
co
nsi
der
e
d
secu
re
data
aggre
gation
m
od
e
for
MIN
an
d
MA
X
encr
y
ptio
n
appr
oach
es
of
secur
it
y as
pects
[
20
]
. I
n
this
paper
, r
e
duci
ng
siz
e o
f
en
c
odin
g
m
at
r
ix can
be
i
m
pr
ove
d.
Aj
ay
.
K.
Tal
el
e
author
sur
ve
ye
d
in
this
pa
per
a
bout
r
ou
ti
ng
protoc
ol
an
d
desi
gn
iss
ue
s
in
wireless
sens
or
netw
ork
[
21
]
.
Also
over
viewe
d
of
sh
ort
est
path
t
ree
data
ag
gre
gation
al
gorith
m
,
DA
G
base
d
in
ss
Netw
orkA
l
gori
thm
and
A
N
T
Colon
y
Algorithm
.
DRIN
A
al
go
rithm
propose
d
wit
h
delay
an
d
la
te
ncy
com
par
e
to
ab
ov
e
i
n
va
rio
us
aspects.
Ma
in
fo
c
us
to
i
ncrea
se
Netw
ork
Lifet
i
m
e
bu
t
due
to
delay
m
ay
in
increase at
the
transm
issi
on
ti
m
e.
PV
RD
Pr
a
sad
Ra
o,
K.
Ra
ghava
Ra
o
aut
hor
pro
pose
s
i
m
pen
din
g
sen
so
r
m
echan
ism
pleas
are
exp
l
or
e
d
[22]
.
Dev
el
op
e
d
RL
S
Al
gorithm
for
local
iz
at
ion
f
or
WSN
i
n
cl
a
ss
of
sec
ur
it
y.
Ma
in
pro
blem
is
that
m
or
e
fo
c
us
on
local
iz
at
ion
de
pende
ncy.
Sy
nchr
on
iz
at
io
n
and
sti
ll
chance
of
rec
ur
si
ve
est
i
m
at
ion
can
be
i
m
pr
ove
d.
Deep
a
k
C.
M
ehetre,
S.
Em
al
da
Rosli
n
a
nd
Sanjee
v
J.
W
ag
h
a
uthor
proposes
node
sche
du
li
ng
con
t
ro
l
Algo
rithm
in
distrib
ut
ed
m
ann
er;
no
des
functi
one
d
re
gionall
y
ov
er
at
te
ntive
di
f
fer
e
nt
s
urrou
ndin
gs
[23]
.
It
co
nsu
m
es
le
ss
ene
rgy
consum
ption
an
d
c
onsist
en
cy
in
CA
ba
se
d
node
sche
du
li
ng
.
A
uthors
f
ocused
on inc
reasin
g Netw
ork
Li
feti
m
e, en
er
gy c
onsu
m
ption
bu
t i
n
this
case
dela
y gets inc
rease
d.
In
this
sect
io
n
a
detai
le
d
su
r
vey
is
giv
e
n
by
the
authors.
The
va
rio
us
par
am
et
ers
including
c
os
t
reducti
on,
po
wer
us
es,
o
ve
rh
ea
d,
f
ault
to
le
ran
ce,
data
confide
ntial
it
y,
hierar
c
hical
m
od
el
,
at
ta
ck
m
od
el
,
netw
ork
m
od
el
,
dynam
ic
no
de
to
po
l
og
y,
key
m
anag
e
m
ent,
tru
st
pro
ba
bili
ty
,
end
to
end
delay
,
ba
tt
ery
resid
ual cap
aci
ty
, r
outi
ng tree
co
st et
c.T
he
s
umm
ary of
t
he survey
ed
p
a
pe
r
s
is gi
ven in t
he
Tab
le
1.
Table
1.
Su
m
m
ary o
f
the
s
urv
ey
ed
pa
pe
rs
Sr.
No.
Au
th
o
r
n
a
m
e
Para
m
eters
Techn
iq
u
es/Alg
o
rith
m
s
Disad
v
an
tag
es
1
Lathies
Bh
ask
er[1
]
Fitn
ess
f
u
n
ctio
n
,
C
lu
ster
f
u
n
ctio
n
,
d
istrib
u
ti
o
n
ite
m
(α)
,
trans
m
iss
io
n
cos
t i
te
m
(β),
en
ergy
ite
m
(γ)
Data Agg
regato
r
(
DAG)
Genetic
alg
o
rith
m
Esti
m
atio
n
of
m
et
r
ics
Energy,
tr
an
s
m
iss
io
n
an
d
dis
tribu
tio
n
ca
n
be
i
m
p
rov
ed
2
Para
m
asiv
an
Balas
u
b
ra
m
an
ian
,
He
v
in
Rajesh
Dh
asian,
[
2
]
Energy
co
n
su
m
p
ti
o
n
,
Secu
rity, Ac
cu
rac
y
,
Co
st
redu
ctio
n
,
Thro
u
g
h
p
u
t and
o
th
er
p
ara
m
e
ter
Alg
o
rith
m
of
Si
m
u
lated
an
n
ealin
g
f
o
r
d
ata agg
regatio
n
in
W
SN
Multi
-
p
ath
data tr
a
n
s
m
iss
io
n
Nu
m
b
e
r
o
f
sleep
n
o
d
e
n
o
t con
sid
ere
d
so
s
co
p
e
f
o
r
en
ergy
i
m
p
rov
e
m
en
t
3
Dr.
Shail
en
d
ra
Nara
y
an
Sing
h
and
Parli
B.
Ha
ri,
[
3
]
Data a
g
g
regatio
n
,
scalab
ility,
p
o
wer
u
ses
,
o
v
erhead
,
q
u
ality
o
f
service
Secu
re
p
roto
co
ls o
f
r
o
u
tin
g
d
iv
isio
n
,
d
ata agg
regatio
n
p
roto
co
ls, cr
y
p
to
g
r
ap
h
y
alg
o
rith
m
s
and
intr
u
sio
n
d
etectio
n
The alg
o
rith
m
s to
p
rov
id
e security
a
r
e no
t
d
escribed
in d
etails
4
Ign
jato
v
ic
,M
.Rezv
an
i,
A.,
E.
Bertin
o
and
S.
Jh
a
[
4
]
Netwo
rk Mod
el,
I
t
erat
iv
e
Filtering
in Rep
u
tatio
n
Sy
ste
m
s, Adv
ersa
r
y
Mod
el,
Co
llu
sio
n
Attack Scenario
IF
alg
o
rith
m
f
o
r
D
ata
Ag
g
regatio
n
.
Ass
u
m
ed
data
ag
g
regato
r
n
o
d
e is no
t
co
m
p
ro
m
ised
.
5
S.
Kr
ith
ik
a,
D.J
.
Presh
iy
a [
5
]
Hy
b
rid ,
Tr
e
e ,
Ch
ai
n
,
Grid an
d
Clu
ster Based
Iter
ativ
e f
ilte
ring
algo
rith
m
ap
p
roach
.
In clu
ster bas
ed
n
etwo
rk, netwo
rk
lif
esp
an
is less.
6
H.S.
An
n
ap
u
rna,
M.
Sid
d
ap
p
a [
6
]
Fau
lt toleran
ce,
Da
ta
co
n
f
id
e
n
tiality
Secret
sh
a
ring
algo
rith
m
and
m
a
sk
des
ig
n
in
g
techn
iq
u
e
Used
AND
& OR
o
p
eration
f
o
r
sh
ar
in
g
secu
re
m
ess
ag
e
&
recon
stru
ctio
n
s
7
V.
Vaid
eh
i,
R.
Kay
alv
izh
i and
N
.
C.Sek
ar
[
7
]
Exclu
sio
n
Basis
Sy
ste
m
(E
BS)
The h
ash
in
g
m
eth
o
d
Locatio
n
-
awar
e
C
o
m
b
in
ato
rial
Key
Distrib
u
tio
n
(
CKD
)”
alg
o
rith
m
Locatio
n
dep
en
d
en
t
8
P.
B.
Gaik
wad
,
M.
R.Dh
ag
e[
8
]
Sin
g
le Agg
regato
r
Sch
e
m
e
Multip
le Agg
regat
o
r
Sch
e
m
e
SIA,
SDA
,
T
AG,
W
DA
Many
alg
o
rith
m
s u
se
m
e
ss
ag
e auth
en
tic
atio
n
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.
8
, N
o.
6
,
Dece
m
ber
2
01
8
:
5162
-
5168
5166
Table
1.
Su
m
m
ary o
f
the
s
urv
ey
ed
pa
pe
rs
Sr.
No.
Au
th
o
r
n
a
m
e
Para
m
eters
Techn
iq
u
es/Alg
o
rith
m
s
Disad
v
an
tag
es
co
d
e &
us
es s
y
m
m
etric
k
ey
encr
y
p
tio
n
.
9
H.
Ha
y
o
u
n
i and
M
.
Ha
m
d
i [
9
]
IHCA,
E
IR
DA,
RCDA, S
A
-
SPKC, F
ESA
,
SD
A
-
HP,
SAHE,
SKBH
Ho
m
o
m
o
rph
ic enc
ry
p
tio
n
p
roto
co
ls
n
o
exe
m
p
la
ry p
lo
t
wh
ich
can su
itab
le
secu
rity
warnin
g
s
as
d
ata agg
regatio
n
and
p
erseveran
ce e
n
tir
e
d
ile
m
m
as
gen
erate
d
th
o
u
g
h
the cer
tain
p
ecul
iarities of
WSNs
10
Ven
u
g
o
p
al K
R an
d
S.
Pr
ak
ash
T
,
[
1
0
]
Netwo
rk Mod
el
Atta
ck
M
o
d
el
Secu
re
Ap
p
rox
i
m
a
te Data
Ag
g
regatio
n
Algo
rith
m
,
PCS
A
su
p
p
o
rted alg
o
rith
m
f
o
r
p
rocreating
su
m
m
ary
No
t work
ed
f
o
r
ag
g
regato
r
n
o
d
e.
11
P.
R.V
a
m
si
and
K.
Kan
t [
1
1
]
Hierarch
ical
Mod
el,
Co
n
f
i
d
en
tiality
,
Int
eg
rity
,
Au
th
en
ticatio
n
Secu
re
D
A,
u
sin
g
TM
S
an
d
I
DS
IDS
o
f
ten
pro
d
u
ce fals
e
repo
rt
o
f
m
alicio
u
s
activ
ity
12
S.
k
.
Md. Rah
m
an
,
M.
A
.
Ho
ss
ain
,
M.
Mah
m
u
d
[
1
2
]
Dy
n
a
m
i
c no
d
e top
o
lo
g
y
,
Key
m
a
n
ag
e
m
en
t
Secu
re
D
A bas
ed
o
n
I
BE Pai
ring
b
ased
cr
y
p
to
g
raph
y
,
Ch
in
ese
Re
m
ain
d
er
th
eo
re
m
Secu
rity an
aly
sis
a
n
d
Energy
co
n
su
m
p
ti
o
n
is
n
o
t pro
v
id
ed
13
S.
S.Ran
jan
i,
Dr
.
S
.
Rad
h
ak
rish
n
an
an
d
Dr.
C
.T
h
an
g
araj
[
1
3
]
Tr
u
st Prob
ab
ility
,
Energy
Diss
ip
atio
n
,
Co
m
m
u
n
icat
io
n
Ov
erhead
Energy
ef
f
icien
t,
Clu
ster Based
DA (
ECBDA
),
Ba
y
esian
f
u
sio
n
alg
o
rith
m
BFA is Inf
lex
ib
le t
o
sen
so
r
ch
an
g
es an
d
the
wo
rklo
ad
is
co
n
cent
rated at a
s
in
g
le
p
o
in
t.
It
is n
o
t su
itab
le
f
o
r
large
-
rang
e net
wo
rks
14
Co
n
sis
ten
cy
,
Lasti
n
g
Energy,
Bu
f
f
er
h
ab
itatio
n
,
Pack
et
p
rod
u
ctio
n
Rate,
swif
tn
ess
Co
n
sis
ten
cy
,
Lasti
n
g
E
n
ergy,
Bu
ff
er
h
ab
itatio
n
,
Pack
et
p
rod
u
ctio
n
Rate,
swif
tn
ess
A f
u
zzy
log
ic legg
ed
cr
ed
it
esti
m
atio
n
plan
Bi
o
-
d
iv
in
e
Energy
co
m
p
eten
t
-
Clu
ster
(BEE
-
C) pro
to
co
l
Sh
o
rtco
m
in
g
of
p
racticing
f
u
zzy
lo
g
ic
is
th
e r
ap
id
ly
f
lo
u
rish
in
g
v
o
lu
m
e of
r
u
le
-
b
as
is
an
d
co
m
b
in
atio
n
15
K.Shi
m
an
d
,
C
.
Pa
r
k
[
1
5
]
Heterog
en
eo
u
s clu
sterin
g
,
Co
n
f
i
d
en
tiality
,
Au
th
en
ticatio
n
A r
ealisti
c pro
tecte
d
DA
id
ea.
Sen
-
SDA
Ad
d
itiv
e
Ho
m
o
m
o
rph
ic
Encry
p
tio
n
des
ig
n
,
An
iden
tity
-
b
ased
sig
n
atu
re
id
ea A
b
atch
co
n
f
ir
m
atio
n
Pack
et dro
p
attack
s are
n
o
t han
d
led
.Generate
ex
tra
o
v
erhead
16
M.
Than
g
araj
,
P.
P.
Po
n
m
al
ar
[
1
6
]
Energy Co
n
su
m
p
ti
o
n
,
End
to
End
Delay, Pa
ck
et
Deliv
ery
Rate
Battery
r
esid
u
al c
a
p
acity
Gen
eticalg
o
rith
m
i
c pro
g
ra
m
(GA)
Secu
red H
y
b
rid (G
A
-
ABC
)
Data
Ag
g
regatio
n
T
ree (
SHDT
)
Exercisin
g
oth
er
in
tellig
en
t algo
rithm
s
in
stead
of
ABC
17
M.
A
.
Bh
ar
ath
i,
B.
P.
Vijay
a
Ku
m
a
r
an
d
D
H M
an
jaiah
[
1
7
]
Co
n
f
i
d
en
tiality
,
Pa
ck
et
d
eliv
ery
ratio, P
rocess
in
g
Ti
m
e
Multi
-
d
i
m
en
sio
n
alk
ey
d
istrib
u
tio
n
(
MDK
D)
id
ea
Elliptical cu
rve
cry
p
to
g
raph
y
,
Elg
a
m
al
sig
n
atu
re
id
ea
ECC alg
o
rith
m
is
m
o
re
co
m
p
lex
an
d
m
o
re
d
if
f
ic
u
lt to i
m
p
le
m
en
t
Elga
m
al
Sign
atu
re
alg
o
rith
m
is r
arel
y
u
sed
in
practice
18
R. K.
Ko
d
ali [
1
8
]
Energy Co
n
su
m
p
ti
o
n
,
scalab
ility,
Integ
rity
Iden
tity
bas
ed
k
ey
m
a
n
ag
e
m
en
t
(I
BK)
Hash
in
g
Al
g
o
rith
m
Idea of
Pr
o
b
ab
ilistic k
ey
pr
e
-
d
istrib
u
tio
n
Ins
ecure again
st
Qu
an
tu
m
Co
m
p
u
ter
attack
19
Karun
aBab
b
er
an
d
Rajn
eesh
Ran
d
h
v
a
[
1
9
]
Initial en
ergy
of
no
d
e,
Energy
Sp
en
t on
Data
Ag
g
regatio
n
,
Electr
o
n
ics Ene
rgy
,
Pack
et
Size,
Nu
m
b
er
Of
Nod
es
Energy
Ef
f
icien
t Unif
o
r
m
Clu
sterin
g
Algo
rith
m
Sen
so
r
No
d
e M
a
y
resid
e
an
y
locatio
n
,
du
e t
o
u
n
ifor
m
clu
sterin
g
tech
n
iq
u
e,
f
ew no
d
e
m
a
y
be d
iscarded
o
r
clu
ster head
m
a
y
f
ail
20
Bh
arath K.
Sa
m
an
th
u
la[
2
0
]
Encry
p
tio
n
T
i
m
e,
Energy
Co
n
su
m
p
tio
n
Encry
p
tio
n
sch
e
m
e,
Dat
a
Ag
g
regatio
n
Algo
rith
m
with
MI
N
and
M
A
X
Still Ch
an
ce of
Red
u
ctio
n
in Size
en
co
d
in
g
m
atrix u
s
in
g
ap
p
rop
riate
s
ize
redu
ctio
n
techn
iq
u
e and
Heu
ristics
21
Ajay
.
K.
T
al
ele[
2
1
]
Pack
et Delive
ry Rate, Pa
ck
et
Deliv
ery Rate,
E
f
f
icien
cy
,
Ro
u
tin
g
tr
ee c
o
st,
Los
s o
f
ag
g
regated
datad
elay
,
latency
.
Sh
o
rtest path
tr
ee
alg
o
rith
m
,
Cen
tre
at
Near
est
So
u
rce
Alg
o
rith
m
,
G
reed
y
I
n
cre
m
en
tal
Tr
ee
Algo
rith
m
,
D
AG bas
ed
I
n
Netwo
rkAg
g
regati
o
n
,
OPAG,
An
t Co
lo
n
y
Algo
rith
m
More Focu
s to
incr
ease
Netwo
rk ex
isten
ce
bu
t
y
et aff
ect
m
o
re
trans
m
iss
io
n
delay
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
Impr
ovin
g IF
Algo
rit
hm f
or
Da
t
a
A
ggreg
at
ion
Tech
niques
in
Wi
rel
ess
Se
ns
or N
et
works
(
Madha
v
In
gle
)
5167
Table
1.
Su
m
m
ary o
f
the
s
urv
ey
ed
pa
pe
rs
Sr.
No.
Au
th
o
r
n
a
m
e
Para
m
eters
Techn
iq
u
es/Alg
o
rith
m
s
Disad
v
an
tag
es
22
PVRD P
ras
ad
Rae,
K.Rag
h
av
a Rao
[
2
2
]
W
L
LS
(weigh
ted
Linear
Least Squ
ares
)
,
Localizatio
n
,
M
SPE
and
L
LS
(
le
ast
m
ean
sq
u
are)
,
De
lay
Alg
o
rith
m
f
o
r
lo
ca
lizatio
n
in
wireless is R
LS
,R
ecursiv
e L
east
Sq
u
ares (
RLS
)
Alg
o
rith
m
s
Secu
rity f
o
r
lo
caliz
atio
n
d
ep
en
d
en
t
23
Deep
ak
C.
Mehetr
e,
S.
E
m
ald
aRo
slin
a
n
d
San
jeev
J.Wag
h
[
2
3
]
Netwo
rk Size
,
Nu
m
b
er
o
f
No
d
es ,Data Trans
f
er
Rate ,
Energy
co
n
su
m
p
ti
o
n
and
Battery
Lif
eti
m
e
n
o
d
e sch
ed
u
li
n
g
co
n
trolalg
o
rith
m
,C
A bas
ed
no
d
e
sch
ed
u
lin
g
,
Fo
cu
s o
n
increase
Netwo
rk
Lif
eti
m
e,
en
ergy
co
n
su
m
p
tio
n
bu
t in th
is
case delay
m
ay
in
crea
ses
y
n
ch
ron
iz
atio
n
an
d
still chan
ce of
recursiv
e esti
m
atio
n
can
b
e i
m
p
rov
ed
3.
GAP
ANA
L
Y
SIS
Af
te
r
rev
ie
wing
ab
ove
pa
pers
the
auth
ors
of
this
pap
e
r
c
om
ing
to
the
c
oncl
us
i
on
t
hat,
the
sur
veyed
pap
e
rs
c
on
si
de
rs
the
pa
ra
m
et
ers
li
ke
cost
re
du
ct
io
n,
power
us
es
,
ov
e
rh
ea
d,
f
ault
tolerance
,
data
confide
ntial
it
y,
hiera
rc
hical
m
od
el
,
at
ta
ck
m
od
el
,
ne
tw
ork
m
od
el
,
dynam
i
c
node
to
polo
gy
,
Key
m
anag
e
m
ent,
trust
pro
bab
il
it
y,
en
d
to
en
d
delay
,
batte
ry
resid
ual
cap
aci
ty
,
routin
g
tree
costet
chi
ng
li
te
ratur
e
no
ne
of
th
e
pap
e
r
c
onside
r
s tru
st
worthi
ne
ss of se
nsors
a
nd v
al
ue of
the
r
e
pu
ta
ti
on
vec
tor.
4.
PROP
OSE
D SYSTE
M
In
propose
d
w
ork,
a
n
i
m
pr
ov
e
m
ent
ov
er
e
xi
sti
ng
it
erati
ve
f
il
te
ring
al
gorithm
this
can
be
achieve
d
by
furn
is
hing
prel
i
m
inary
est
i
m
a
te
of
the
cre
dib
il
it
y
to
senso
r
nodes.
T
his
buil
ds
the
I
F
al
gorithm
m
or
e
rob
us
t
and
acc
ur
at
e.
Also
co
ns
i
der
e
d
t
he
fact
that
the
a
dv
e
rsar
y
cou
l
d
at
ta
ck
on
the
aggre
gator
no
de.
The
a
ppr
oach
of it
erati
ve
filt
erin
g
f
or sec
ured
data ag
greg
at
ion
ov
e
r
c
ompr
om
ise
d
aggr
egato
r node.
5.
CONCL
US
I
O
N
In
t
his
survey
m
anu
scri
pt
w
e
rendere
d
t
horou
gh
sca
n
of
data
ag
gr
e
gat
ion
al
go
rithm
s
in
wireles
s
sen
sin
g
syst
em
s.
All
of
t
hem
e
m
ph
asi
s
on im
pr
ov
in
g
si
gn
i
ficant recit
al
sc
al
es in p
a
rtic
ul
ar e
nergy ex
ha
us
ti
on,
netw
ork
existe
nce,
data
s
us
pe
ns
io
n
la
te
ncy
and
data
ver
ac
it
y.
Pr
incipal
com
po
ne
nts,
th
e
gains
an
d
los
ses
of
ind
ivi
du
al
data
ag
gr
e
gatio
n
a
lgorit
hm
ic
ru
le
are
de
picte
d.
In
obli
gated
a
ct
trust
worthin
ess
of
sens
ors
an
d
value o
f
the
r
e
pu
ta
ti
on
vecto
r
is co
ns
ide
re
d
f
or an
im
pr
ov
e
m
ent.
REFERE
NCE
S
[1]
L.
Bh
aske
r,
“
Gene
ticall
y
der
ived
sec
ure
c
luste
r
-
base
d
da
ta
agg
reg
ation
in
wire
le
ss
sensor
net
w
orks”,
IET
I
nf
.
Sec
ur.
,
2014
,
Vo
l.
8
,
Iss
.
1,
pp.
1
–
7doi:
10
.
1049/iet
-
ifs.
2013
.
0133.
[2]
H.
R.
Dhasian,
P.
Bal
asubra
m
a
nia
n,
“
Surve
y
o
f
dat
a
aggr
eg
at
i
on
te
chni
qu
es
using
soft
compu
ti
ng
in
wire
le
ss
sensor ne
tworks”,
I
ET
Inf
.
S
ec
ur
.
,
2013,
Vol.
7,
I
ss
.
4,
pp
.
336
–
34
2doi:
10
.
1049/ie
t
-
ifs.
2012.
0292
.
[3]
P.
B.
Hari
,
Dr.
S.
N.Singh,
“
Secur
ity
Iss
ues
in
W
ire
le
ss
Sensor
Networks:
Curre
nt
Resea
r
ch
an
d
Chal
le
ng
es”
,
978
-
1
-
5090
-
0673
-
1/16/
$31.
00
©
2016
IEEE.
[4]
M.
Rez
vani,
A.
Ignja
tovic,
E
.
Bert
ino
,
and
S.
Jha
“
Secur
e
Data
Aggrega
ti
on
Te
chn
i
que
for
W
ire
le
ss
Sensor
Networks
in
th
e
Presenc
e
of
Coll
usion
Attacks
”
IEE
E
Tr
ansacti
o
ns
on
Depe
ndabl
e
and
S
ec
ure
Co
mputing
,
VO
L
.
12,
NO
.
1
,
JA
NU
ARY
/FEBRU
ARY
2015.
[5]
S
Krithi
ka,
D.J.
Preshi
y
a
,
“
Enhance
d
Dat
a
Aggrega
t
ion
Techni
q
ues
for
Com
pro
m
ised
Node
Atta
ck
s
in
W
ire
l
ess
Sensor Net
works
”,
978
-
1
-
4673
-
9338
-
6/16/
$31.
0
0c
2016
I
EEE.
[6]
H.S.Annapurna
,
M.Sidda
ppa,
“
Secur
e
D
at
a
Agg
reg
ation
with
F
aul
t
Tol
er
ance
f
or
W
ire
le
ss
Sen
sor
Networks”,
Inte
rnational
Co
nfe
renc
e
on
Eme
rging
Re
search
i
n
El
e
ct
ronics
,
C
omputer
Sci
en
ce
an
d
Technol
og
y
–
2015,
978
-
1
-
4673
-
9563
-
2/1
5/$31.
00
©2015
IEE
E
.
[7]
V.
Vaide
hi
,
R.
Ka
y
al
vi
zhi
and
N.
Chandra
Sekar
,
“
Secur
e
Data
Aggrega
ti
on
in
W
ire
le
ss
Sensor
Networks”,
978
-
9
-
3805
-
4416
-
8/1
5/$31.
00c
2015
I
EE
E
.
[8]
P.
B.
Gaikwa
d
,
M.
R.
Dhage
,
“
Surve
y
on
Sec
ure
Dat
a
Agg
r
ega
t
ion
in
W
ir
el
ess
Sensor
Networks”,
201
5
Inte
rnational
Co
nfe
renc
e
on
com
puti
ng
communi
cat
ion
Control
a
nd
Aut
omation
,
9
78
-
1
-
4799
-
6892
-
3/15
$31.
00
©
2015
IEEEDO
I 10.1109/ICCUBEA.
2015.
52
.
[9]
H.
Ha
y
ouni
an
d
M.
Ham
di,
“
Secur
e
Da
ta
A
ggre
gation
with
Hom
om
orphic
Pr
imiti
ves
in
W
ire
le
ss
Sensor
Networks:
A
Crit
ical
Surv
e
y
a
nd
Open
Research
Iss
ues”
,
Proce
ed
ings
of
2
016
IEE
E
13th
Inte
rnation
a
l
Confe
renc
e
on
N
et
working
,
S
ensing,
and
Control Mex
i
co
Ci
ty
,
Me
xic
o,
April
28
-
3
0,
2016
.
[10]
G
Prathi
m
a
E,
S.
Praka
sh
T,
K
R
Venugopa
l,
S
SIy
enga
r
,
L
M
Patna
ik,
“
SA
DA
:
Secur
e
Approxim
at
e
Dat
a
Aggrega
ti
on
in
W
ire
le
ss
Sensor
Networks”,
978
-
1
-
5090
-
1281
-
7/1
6/$31.
00
2016
I
EE
E
.
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.
8
, N
o.
6
,
Dece
m
ber
2
01
8
:
5162
-
5168
5168
[11]
P.
R.
Vam
si
and
K.
Kant
,
”
Se
cur
e
Dat
a
Aggrega
t
ion
and
In
trusio
n
Detect
ion
in
W
ire
le
ss
Sensor
Networks”,
978
-
1
-
4799
-
6761
-
2/1
5/$31.
00
©2015
IEE
E
.
[12]
SkM
dM.
Rahm
an,
M.
A.
Hos
sain,
M.
Mahm
ud,
M.
I
.
Chaud
r
y
,
A.
Alm
ogre
n,
M.
Alnu
em,
A.
Alamri,
“
A
li
ghtwei
gh
t
Se
c
ure
Dat
a
Aggr
ega
t
ion
T
ec
hn
iq
ue
for
W
ire
le
ss
Sensor
Netwo
rk”
,
2014
IE
E
E
Int
ernati
onal
Symposium on Multi
media
978
-
0
-
7695
-
543
7
-
2/1
4
$31.
00
©
2014
IEEEDO
I
10.
11
09/ISM.2014.
84.
[13]
S.
S.
Ranjani
,
Dr.
S.
Radh
akr
ish
nan
and
Dr
.
C.
T
hanga
ra
j,
“
Secur
e
Cluste
r
base
d
Data
Aggreg
at
io
n
in
W
ire
l
ess
Sensor
Networks”,
Int
ernati
ona
l
Confe
ren
ce
o
n
Sci
en
ce,
Eng
i
nee
ring
and
M
anageme
nt
R
ese
arch
(
ICSEMR
2014)
978
-
1
-
4799
-
7613
-
3/14/
$31
.
00
©2014
IEEE
.
[14]
S.Re
nubala
and
K.S.Dhana
l
akshm
i,
“
Trust
base
d
Secur
e
Rou
ti
ng
Protocol
using
Fuzz
y
Logic
in
W
ire
le
ss
Sensor
Networks”,
2014
IEE
E
Inte
rnat
i
onal
Confe
renc
e
on
Computati
onal
Inte
lligen
ce
a
nd
Computing
Re
search
,
978
-
1
-
4799
-
3975
-
6/14/$31.00
©2014
I
EE
E
[15]
K.
Shim
and
C.
Park,
“
A
Secur
e
Data
Aggrega
t
ion
Scheme
bas
ed
on
Appropria
te
Cr
y
ptogr
aphic
Prim
it
ive
s
in
Hete
roge
n
eous
W
ire
le
ss
Sensor
Networks”,
104
5
-
9219
(c)
2013
IEE
E
.
[16]
M.T
hanga
r
aj,
P
.
P.
Ponm
al
ar
,
“
Sw
ar
m
Inte
lli
genc
e
base
d
Secur
ed
Dat
a
A
ggre
gation
in
W
ire
le
ss
Sensor
Networks”,
2014
IEE
E
Inte
rnat
i
onal
Confe
renc
e
on
Computati
onal
Inte
lligen
ce
a
nd
Computing
Re
search
,
978
-
1
-
4799
-
3975
-
6/14/$31.00
©2014
I
EE
E
.
[17]
M.
A
Bhara
thi,
B.
P.
Vijay
a
Kum
ar,
D
H
Manja
ia
h,
“
Robust
and
Cost
-
Eff
ective
Secur
ity
Algori
t
hm
for
PreStage
and
Pos
t
-
Stage o
f
Data Aggre
ga
tion”,
4
th
ICCCN
T
–
2013,
Jul
y
4
-
6,
2013
,
T
iruc
h
e
ngode,
Ind
ia.
[18]
R.
K.
Kodali
,
“
Ke
y
Mana
g
ement
Te
chn
ique
fo
r
W
S
Ns
”
2014
IEE
E
R
egi
on
10
Symposium
,
978
-
1
-
4799
-
2027
-
3/14/
$31.
00
©20
14
IEEE.
[19]
Karuna
Babbe
r
,
Raj
ne
esh
Randhva
,
“
Ene
rg
y
Eff
i
ci
en
t
Cluste
ring
with
Secur
ed
Da
ta
Tra
nsm
ission
Te
chn
ique
for
W
ire
le
ss
Sensor
Networks”,
201
6
Inte
rnationa
l
Confe
renc
e
on
Computing
for
S
ustainabl
e
Glob
al
Dev
e
lopment
(
INDIACom
)
.
[20]
Bhara
th
K.
Sam
ant
hula
,
W
ei
Jiang
a
nd
Sanjay
Madria
,
“
A
Probabil
isti
c
E
ncr
y
p
ti
on
b
ase
d
MIN
/MAX
Co
mput
at
ion
in
W
ire
l
ess
Sensor
Networks
”,
2013
I
EE
E
14th
Int
ernati
onal
Confe
r
enc
e
on
Mobile
Data
Manage
me
nt
.
[
2
1
]
Aja
y
.
K.
T
al
e
le,
Suraj
G.
Pa
ti
l
an
d
Nilka
nth
B.
C
hopade
,
“
A
Surve
y
on
Da
ta
Rou
t
ing
a
nd
Aggr
egationT
e
chni
qu
es
for
W
ire
l
ess
SensorN
et
works
”,
2
015
Inte
rnat
iona
l
Conf
ere
nce on
Pe
rvasiv
e
Comp
uti
ng
(
ICPC)
.
[22]
PV
RD
Prasad
Rao,
K.R
agha
v
a
Rao,
“
Deve
lop
m
ent
of
RLS
Algorit
hm
for
l
oca
l
iz
a
ti
on
in
wire
le
ss
sensor
net
works
”,
Inte
r
nati
onal
Con
fe
re
nce
on
Comm
uni
cat
ion
,
Manag
e
ment
and
In
formation
Te
chnol
og
y
,
June
2015
.
[23]
Dee
pak
C.
Meh
et
re
,
S.
Emalda
Roslin,
Sanje
e
v
J.W
agh,
“
Ta
rge
t
Covera
g
e
a
nd
Data
Coll
ect
ion
for
li
fe
ti
m
e
m
axi
m
iz
at
ion
in
W
ire
le
ss
Sensor
Network”
,
IJCT
A
,
10(8)
,
20
17,
p
p.
201
-
21
.
Evaluation Warning : The document was created with Spire.PDF for Python.