TELKOM
NIKA
, Vol.12, No
.4, Dece
mbe
r
2014, pp. 96
3~9
6
8
ISSN: 1693-6
930,
accredited
A
by DIKTI, De
cree No: 58/DIK
T
I/Kep/2013
DOI
:
10.12928/TELKOMNIKA.v12i4.660
963
Re
cei
v
ed Se
ptem
ber 30, 2014; Revi
se
d No
vem
ber
10, 2014; Accepted Novem
ber 25, 20
14
Low Energy Adaptive Clustering Hierarchy Routing
Protocol for Wireless S
e
nsor Network
V. Windha Mah
y
astut
y
*
1
,
A. Ady
a
Pram
udita
2
Dep
a
rtment of Electrical E
ngi
neer
ing, F
a
cult
y of Eng
i
ne
eri
n
g, Atma Ja
y
a
Catho
lic Un
iver
sit
y
Jl. Jend Sud
i
r
m
an Kav. 51, Jakarta, 129
30,
Ph. 021-5
7
0
8
8
2
6
*Corres
p
o
ndi
n
g
author, e-ma
i
l
: veronic
a
.ma
y
@atmaja
y
a
.
ac.
i
d
1
, pramud
ita
@
atmaja
ya
.ac.
id
2
A
b
st
r
a
ct
A W
i
reless Se
nsor Netw
ork (
W
SN) is a net
w
o
rk co
mp
ose
d
of many se
n
s
or
no
des d
i
stribute
d
in
a
regi
on, a
n
d
is
use
d
to
mo
nitor
and
g
a
ther
info
r
m
ati
o
n a
b
o
u
t certa
i
n
phe
no
mena
in
the
phys
i
ca
l
envir
on
me
nt. A sensor n
o
d
e
typical
l
y ha
s limited p
o
w
e
r, w
h
ich mus
t
be taken i
n
to consi
der
atio
n i
n
desi
gni
ng t
he
routin
g pr
otoc
ol of
a W
S
N.
One
of the r
outin
g pr
otoc
o
l
s that ca
n i
n
c
r
ease
the
en
e
r
gy
efficiency
of
W
S
N is
Low
Ener
gy A
d
a
p
tive
Cluster
in
g H
i
erarc
h
y (
L
EACH). In
this r
e
searc
h
, t
h
e
perfor
m
a
n
ce o
f
LEACH, na
mely en
ergy c
o
nsu
m
pti
on
a
n
d
lifeti
m
e is ev
alu
a
ted us
in
g NS-2. Si
mul
a
ti
o
n
results sh
ow
th
at the
nu
mb
er
of no
des
an
d c
l
usters affect t
he
opti
m
u
m
nu
mb
er of c
l
uster
s
an
d the
dev
i
c
e
lifeti
m
e, w
h
ich i
n
turn w
ill affect the energy co
nsu
m
pti
on lev
e
l as w
e
ll as the
energy effici
en
cy.
Ke
y
w
ords
: w
i
reless se
nsor n
e
tw
ork, routing
,
energy,
cluste
ring, the opti
m
um n
u
m
b
e
r of clusters
1. Introduc
tion
Wirel
e
ss Se
nso
r
Net
w
o
r
k (WSN) is widely use
d
to obse
r
ve and control certai
n
environ
ment
s, for variou
s purp
o
ses
such a
s
e
m
e
r
gen
cy servi
c
e
s
, se
cu
rity and weath
e
r
monitori
ng [
1
]. WSN in
clud
es
singl
e or m
u
lt
iple se
nsi
ng e
l
ements, a
data processor,
c
o
mmunic
a
ting compone
nts
and a
power
s
o
urce with lim
ited energy capac
i
ty [2],[3].
The
sen
s
in
g el
em
ent, su
ch
a
s
a
sen
s
o
r
n
o
de, pe
rform
s
mea
s
u
r
eme
n
ts
related
to
its
su
rro
undi
ng
environ
ment.
The
me
asurement
data are
processe
d
in
a proce
ssi
ng unit an
d
sub
s
eq
uen
tly
forwa
r
d
ed ov
er a wi
rele
ss cha
nnel to a
base stat
ion,
whe
r
e they can be a
c
cessed by a use
r
[3].
One
con
s
traint of the u
s
e
of WSN i
s
th
e lim
ited po
wer of e
a
ch se
nso
r
no
de,
so ene
rgy
con
s
um
ption
efficien
cy be
come
s an im
portant i
ssu
e
in WSN. Ro
uting is a fu
nction in
WS
N,
whi
c
h con
s
u
m
es a
su
bsta
ntial amou
nt of ener
gy. Rese
arche
s
o
n
netwo
rk l
a
ye
r WS
N syste
m
s
aim to achi
eve an efficient
route setup i
n
terms
of powe
r
, as
well
as allo
wing
con
s
i
s
tent da
ta
comm
uni
cati
on from sen
s
or nod
es to the ba
se stati
on [1]-[4]. Routing proto
c
ol
s develo
ped
for
data commu
nicatio
n
s
net
work
with th
e aim of
ac
hieving hi
gh
Quality of
Service
(Q
o
S
) is
gene
rally not
appro
p
riate f
o
r WS
N [3] due to the lim
itations of po
wer
sou
r
ce, storage
cap
a
city
and data
pro
c
e
ssi
ng in th
e se
nso
r
n
o
d
e
s. With
out
specifi
c
ro
utin
g proto
c
ol
s,
with low
ene
rgy
con
s
um
ption,
the lifetime and WS
N con
nectivity will be degrade
d.
In LEACH,
several nodes will be
selected as
a
cl
ust
e
r head
(CH). The
num
ber of CH
nodes is
prop
ortio
nal t
o
the
num
ber of cl
uste
rs. T
he n
ode,
whi
c
h i
s
sel
e
cte
d
as a
CH
nod
e, will
co
nsu
m
e
more e
nergy than non
-CH
node
s [5-1
0]. Node
s t
hat run out of ene
rgy will ce
ase
operatin
g and
the numb
e
r o
f
nodes i
n
the
system
will b
e
red
u
ced.
T
he pu
rpo
s
e o
f
this study is to evaluate the
energy con
s
umption
of L
EACH
r
outin
g protocol fo
r
WSN
syst
e
m
s a
nd to
find the
optim
um
numbe
r
of
cl
usters. In
o
r
der to o
b
tain
the mi
nimu
m en
ergy
co
nsum
ption,
a
n
evalu
a
tion
wa
s
perfo
rmed to
identify the influence of the
numbe
r
of n
ode
s on the
optimum n
u
m
ber of
clu
s
ters.
The sim
u
latio
n
is perfo
rme
d
usin
g Net
w
ork Simul
a
tor 2 (NS-2).
2. Rese
arch
Metho
d
The routin
g
p
r
otocol evalu
a
ted
i
s
Low Ener
gy A
dap
tive Clu
s
teri
n
g
Hi
erarchy
(LEACH)
routing proto
c
ol
in Wirele
ss
Se
nsor Networ
k (WS
N).
LEACH algorith
m
is divided
into two
phas
e
s
[2],[9]
:
Evaluation Warning : The document was created with Spire.PDF for Python.
ISSN: 16
93-6
930
TELKOM
NIKA
Vol. 12, No. 4, Dece
mb
er 201
4: 963
– 968
964
a.
Set Up Phase
In the setup
phase, the pro
c
e
ss
of determini
ng th
e clu
s
ter h
e
ad (CH) and
cluste
r
formation, o
r
often called
cluste
ring
al
gorithm, is
carri
ed out. In this pha
se,
LEACH
sele
cts
several sen
s
or n
ode
s in
orde
r to a
c
t
as a
CH. On
ce the
CH is formed, the
CH
nod
e m
u
st
broa
dcast a
n
advertisem
ent (ADV)
Multiple
Access/Colli
sion
Avoidance
(CSMA/CA
). This
messag
e co
ntains the ID Nod
e
and
Heade
r. When the non
-CH nod
es receive the
ADV
messag
e, they will send
a joint reque
st (JOI
N-
RE
Q) me
ssage
that contain
s
ID Node an
d ID
Hea
der to the
CH nod
e that they choose
based o
n
t
he stron
g
e
s
t receive
d
sign
al in orde
r to join
and form
a cluster [5]. When the
CH
node
s receive a JOI
N
-RE
Q
messa
ge, they will make a
TDMA sch
e
d
u
le for ea
ch
membe
r
of their clu
s
te
r. Th
e pro
c
e
s
ses
carrie
d out in the set up ph
ase
are sho
w
n in
Figure 1.
Figure 1. The
Set Up Phases
The
nod
es that a
c
t a
s
a
CH
will
exp
end
more e
n
e
rgy th
an
no
n-CH no
des.
Thi
s
i
s
becau
se the
CH
nod
esre
ceive data fro
m
all othe
r n
ode
s in th
e cl
uster,
co
mpress the
data,
and
sen
d
the d
a
ta to the Ba
se
Station locat
ed fa
rthe
r tha
n
the di
stan
ce between
on
e non
-CH n
o
de
to anoth
e
r [5]. Therefore, i
n
o
r
de
r to
ke
ep the
en
erg
y
con
s
u
m
ed
by ea
ch
nod
e
equita
ble, e
a
c
h
node that act
s
as a CH wil
l
be sub
s
tituted by
other n
on-CH n
ode
at the
next round (r+1
). Every
node
ha
s a
chan
ce to b
e
a CH. Each
node
numb
e
r
i
thatcontends to be a
CH will
choose a
rand
om n
u
m
ber b
e
twe
en
0 and
1. If the ran
dom
nu
mber i
s
le
ss than the th
re
shold (
P
i
) an
d
the
numbe
r of cl
usters that h
a
ve been formed is
smal
l
e
r than the d
e
sired nu
mbe
r
of clu
s
ters, then
the node n
u
m
ber
i
will be el
ected as CH. The threshold
value can be calculated using (1) [5].
/
∶
1
0
∶
0
(1)
whe
r
e
k
i
s
the numbe
r of CH,
N
is the
number of sensor no
de
s in the network and
r
is
the
numbe
r
of ro
und
s that
ha
ve bee
n
com
p
leted.
C
i
i
s
a fun
c
tion th
at indi
cate
s
wheth
e
r
or n
o
t the
node nu
mbe
r
i
is a CH in the most rece
nt round. If node
i
is a CH
in the most rece
nt roun
d the
value of
C
i
is
0 and
C
i
i
s
1if node
i
is elig
ible to becom
e a CH. Th
e thre
shol
d valu
e for the nod
e
that acts a
s
a
CH
will be
set to 0 in the next r
oun
d. A node that a
c
ts as a
CH wi
ll be re
-ele
cte
d
as a CH after
N/k
ro
und
s
becau
se the energy of every node
i
s
expected to b
e
the same a
fter
N/k
ro
und
s. Equation (1
)
i
s
u
s
e
d
if
the
existing no
d
e
s
in
the
network h
a
ve the
same
en
ergy. If
the energy of each nod
e is
different, then
t
he threshold
can be d
e
termined u
s
ing
(2) [5].
(2)
Evaluation Warning : The document was created with Spire.PDF for Python.
TELKOM
NIKA
ISSN:
1693-6
930
Low
Energy Adaptive Clustering
Hierarchy Routing
Protocol
for .... (V. Windha Mahyastut
y
)
965
Whe
r
e
E
i
is th
e current e
n
e
r
gy of n
ode
i
i
n
Joule
s
,
E
total
is the
total e
nergy
of all n
ode
s in
the net
wo
rk i
n
Joule
s
and
k
is the
num
ber of
clu
s
ters. Th
us,
the
node
s th
at h
a
ve mo
re
en
erg
y
will be chosen as a CH more often.
b. Steady
State
Phase
In
the steady
state pha
se,
the CH nod
es re
ce
ive
al
l data from e
a
ch
mem
ber of the
clu
s
ter, co
mp
ress the data
and forward
the data
to the Base Statio
n (BS). The non-CH nod
e
s
will sen
d
the
data to CH node
s a
c
cording to a TDMA sch
edul
e
.
The steady
state pha
se
is
s
h
ow
n
in
F
i
gu
r
e
2
.
Figure 2. The
Steady State
Phase
The po
we
r u
s
ed to tran
smit the messag
e
is affe
cted by the d
i
stan
ce bet
ween the
transmitter a
nd re
ceiver. If the distance
between th
e
transmitter a
nd re
ceiver i
s
smaller tha
n
a
cro
s
sove
r di
stance, th
e fre
e
spa
c
e
prop
agation
mod
e
l
is
used
in th
e si
mulation.
Otherwise, if t
h
e
distan
ce
bet
wee
n
tran
smi
tter an
d
recei
v
er i
s
g
r
eate
r
than
the
cro
s
sover di
stan
ce, the
two ray
grou
nd p
r
op
a
gation mod
e
l is used in the
simulati
on.
Crossove
r di
stance ca
n be
cal
c
ulate
d
usi
ng
(3) [6]:
(3)
whe
r
e
h
r
and
h
t
are
the h
e
ight of the
receiver
and
tran
smitter
antenn
a in
metre
s
,
is
the
wavele
ngth o
f
the carrie
r signal tra
n
smitted fr
om tra
n
s
mitter to receiver in met
r
es a
nd
L
is
th
e
s
y
s
t
em loss
fac
t
or. Power
us
ed to transmit in
formatio
n/messag
e can be calcula
t
ed usin
g (4
) [7]:
_
.
.
,
_
_
.
.
,
(4)
whe
r
e
P
t
is th
e power u
s
e
d
for tran
smi
s
sion in Watts,
d
is the di
sta
n
ce b
e
twe
en
the tran
smitte
r
with the receiver in meters,
_
is the en
ergy amplifier i
n
J/bit/m
2
.
_
_
is two ray
energy ampli
f
ier in J/bit/m
4
, and
BW
is band
width i
n
bps. Th
e total power u
s
ed to tra
n
smit
informatio
n can be calcula
t
ed usin
g (5
) with
radio el
ectro
n
ics en
e
r
gy is in J/bit [7].
.
(5)
Thus, the req
u
ired tran
smit energy can b
e
cal
c
ulate
d
usin
g equ
atio
n (6)
.
(6)
Evaluation Warning : The document was created with Spire.PDF for Python.
ISSN: 16
93-6
930
TELKOM
NIKA
Vol. 12, No. 4, Dece
mb
er 201
4: 963
– 968
966
whe
r
e
is in
Joule
s
, and
l
i
s
the
size of t
he sent me
ssage in
bits. T
he po
we
r u
s
e
d
to re
ceive
a
messag
e ca
n
be determi
ne
d usin
g (7
)
(7)
Whe
r
e
P
r
is
the power th
at is use
d
to receive in
fo
rmation in Watts. The en
ergy re
quired
to
receive su
ch i
n
formatio
n ca
n be cal
c
ul
ated usi
ng (8
):
.
(8)
Whe
r
e
E
r
is e
nergy that is
use
d
to
recei
v
e informatio
n in Joul
es.
The
simul
a
tio
n
is pe
rforme
d u
s
ing
Network Simulato
r 2
(NS
-
2) version
2.34
ba
sed
on
Ubu
n
tu. Based on thi
s
fa
ct, the optim
um num
ber
of clu
s
ters
can be
determined. In o
r
der to
investigate th
e effect of the numb
e
r of
node
s on
th
e
optimum nu
mber of
clu
s
ters, a
simul
a
tion
with a va
ryin
g num
ber of
node
s h
a
s be
en u
s
ed.
The
lifetime of th
e network i
s
also
ob
se
rve
d
in
the si
mulatio
n
.
The
num
b
e
r
of no
de
s v
a
riation
u
s
ed
is 8
0
, 10
0 a
n
d
12
0 a
nd th
e cl
uste
r
num
ber
use
d
is 2, 3, 4, 5, 6, 7 a
nd 8. For th
e si
mulatio
n
, the node
s a
r
e po
sitione
d
rando
mly in the
netwo
rk. The
energy co
nsumption ob
se
rved in this
si
mulation is th
e total energ
y
used by each
node i
n
the
n
e
twork to
se
n
d
and
re
ceive
data. In
the
simulatio
n
, th
e total en
erg
y
used
by ea
ch
sen
s
o
r
nod
e wa
s ob
serve
d
every 10 se
con
d
s. The
si
mulation pa
ra
meters are
sh
own in Ta
ble
1.
Table 1. Simulation Para
meters
Parameter Value
Simulation area
1000 m x
1000m
Simulation time
1000 s
BS position
(80,200
)
Initial Energ
y
of
each node
2 Joule
E
f
r
i
ss-a
m
p
10
pJ/bit/m
2
Ε
two
-ra
y
-a
m
p
0.0013
pJ/bit/m
4
E
elec
50
nJ/bit
3. Results a
nd Analy
s
is
The pa
ramet
e
rs give
n in Section 2 a
r
e u
s
ed to sim
u
la
te the LEACH routing p
r
oto
c
ol in a
Wirel
e
ss
Sen
s
or Network by
using Net
w
ork
Simula
t
o
r 2 (NS-2
)
. In this simul
a
tion, the numb
e
r of
node
s were v
a
ried b
e
twe
e
n
80, 100 an
d 120 no
de
s, and the num
ber of cl
uste
rs used a
r
e 2,
3,
4, 5, 6, 7 and 8. The simul
a
tion result for 100 no
de
s was taken from
[9].
The
simul
a
tio
n
re
sult fo
r
8
0
, 100
and
1
20 n
ode
s g
r
oupe
d into
2
clu
s
ters i
s
g
i
ven in
Figures 3
-
5.
Figure 3. Formation of The
Cluste
r for T
he 80 Node
s
Evaluation Warning : The document was created with Spire.PDF for Python.
TELKOM
NIKA
ISSN:
1693-6
930
Low
Energy Adaptive Clustering
Hierarchy Routing
Protocol
for .... (V. Windha Mahyastut
y
)
967
Figure 4. Formation of The
Cluste
r for T
he
100 Node
s
Figure 5. Formation of The
Cluste
r for T
he 120
Nod
e
s
The CH sub
s
titution wa
s perfo
rmed
in
ea
ch
ro
und
and
th
e num
ber
of CH
n
ode
s
fo
r
each rou
nd was fixed. In the simula
tio
n
, one ro
und la
sted for 20 second
s.
The re
sult fo
r perfo
rma
n
ce simulatio
n
of
LEACH ro
uting proto
c
o
l
in the WSN can b
e
see
n
in Table
2.
Table 2. Energy Con
s
umpti
on for Nu
mbe
r
of Node
s
Number of
Clusters
Energ
y
Consum
ption for Numb
er
of Nodes [Joule]
80 100
120
2 159.815460
8902
8500
199.596713
7201
56
239.695616
1985
5745
3 159.392573
2336
0695
199.775075
4593
10
239.588653
5831
9812
4 158.626837
6886
4082
198.871335
2144
92
239.117122
4355
2884
5 159.153054
2282
7956
197.855650
5843
18
238.904319
7893
9637
6 159.244315
2593
19
198.341705
8281
69
237.522407
3446
9208
7 159.091474
8142
867
198.197959
4346
80
238.548131
9020
6781
8 158.759342
2529
3005
198.196994
7740
45
237.676411
5326
155
Table 2
sho
w
s th
at the o
p
timum num
ber of
clu
s
ters is
5 when t
he num
be
r o
f
sen
s
o
r
node
s u
s
e
d
i
s
10
0.Thi
s
re
sult ag
ree
s
with [6] with the exce
ption t
hat in [6] only
100 n
ode
s
were
use
d
in the simulation, the
r
efore the im
pact of
the n
u
mbe
r
of nod
es on th
e opt
imal numb
e
r
of
clu
s
ters ca
nn
ot be identifie
d.
It is also
sho
w
n that the
e
nergy
con
s
u
m
ption
i
s
directly propo
rtional to the
n
u
mbe
r
of
node
s. Thi
s
i
s
du
e to the f
a
ct that a
s
th
e num
ber
of
node
s in
crea
se
s, the mo
re
data
will be
sent
to the b
a
se
station, req
u
iri
ng a
n
in
crea
sed am
ount
of ene
rgy. F
r
o
m
Tabl
e 2, it
is al
so
ob
se
rved
that the num
ber
of nodes will a
ffect the optimum
number of
cl
usters. The optimum num
ber of
clu
s
ters
whe
n
there a
r
e
8
0
no
de
s in t
he n
e
two
r
k i
s
4,
whil
e for a n
e
two
r
k with 100
and
150
node
s the
o
p
timum nu
m
ber
of clu
s
te
rs i
s
5
an
d
6, re
spe
c
tivel
y
. So the op
timum num
b
e
r of
clu
s
ters is 5 p
e
rcent of the numbe
r of se
nso
r
nod
es u
s
ed in the
si
mulation.
Table 3. Lifetime for Nu
mb
er of Nod
e
s
Number
of
Clusters
Lifetime for Num
ber of No
des [s]
80 100
120
2 344.90
341.40
384.30
3 350.40
343.80
432.20
4 450.80
431.40
509.10
5 308.50
451.70
386.40
6 266.40
376.40
541.40
7 257.70
310.80
412.20
8 222.50
268.80
401.90
Evaluation Warning : The document was created with Spire.PDF for Python.
ISSN: 16
93-6
930
TELKOM
NIKA
Vol. 12, No. 4, Dece
mb
er 201
4: 963
– 968
968
Table
3
sh
ows the
relation
ship
bet
wee
n
the n
u
mb
er
of nod
es u
s
e
d
an
d the
lifetime of
a
WSN. When
the numb
e
rs of node
s are 80, 100 an
d
120, a long lif
etime is obtai
nable
whe
n
the
numbe
rs of
cl
usters
are 4,
5 and
6, resp
ectively.B
ase
d
on th
e resu
lts in T
able
2, it is
see
n
tha
t
4, 5 and 6 is the optimum
numbe
r of clusters for th
e 80, 100 an
d 120 nod
es.
Based on th
e
results sho
w
n in Table
s
2
and 3, it is obse
r
ved t
hat whe
n
the nu
mber of cl
ust
e
r is optim
al, the
netwo
rk
will h
a
ve a long lifetime with lo
w ene
rgy co
n
s
umptio
n, ma
king it ene
rgy
-
efficient.
4. Conclusio
n
Simulation re
sults
sho
w
th
at the adapti
v
e clus
te
rin
g
hiera
r
chy alg
o
rithm that is applied
for routing
protocol
s i
n
WSN
sy
stem
s can
minimi
ze
ene
rgy con
s
umption. Wit
hout clu
s
terin
g
the
data tra
n
smission
process
con
s
um
es a l
o
t of en
ergy
becau
se
each no
de m
u
st
be a
b
le to
re
a
c
h
the Base Station. To a
c
hi
e
v
e the minim
u
m en
ergy
consumption
levels in
the i
m
pleme
n
tatio
n
of
Adaptive Clu
s
terin
g
Hi
era
r
chy
Routin
g
Protocol
it is ne
ce
ssary
to determin
e
the optimu
m
numbe
r of
cl
usters. Th
e
numbe
r of n
ode
s can
aff
e
ct the o
p
timum num
be
r of clu
s
ters
and
lifetime. The
simulatio
n
re
sults
also sho
w
that t
he en
ergy con
s
um
ption
is direct
ly
propo
rtion
a
l
to
the numbe
r o
f
nodes.
Referen
ces
[1]
Ho
w
a
r
d
SL, S
c
hle
gel
C, Inie
w
s
k
i
K. Error
Contro
l Co
di
ng
in L
o
w
-
P
o
w
e
r
Wireless S
e
n
s
or Net
w
o
r
ks
:
W
hen Is ECC
Energ
y
-Efficie
n
t.
EURASIP Journ
a
l o
n
W
i
reless C
o
mmu
n
icati
ons a
nd
Netw
orking
.
200
6; 200
6: 1-14.
[2]
Manik
and
an
K. an
d Pur
u
soth
aman T
.
An Ef
fici
ent R
outi
n
g
Protoco
l
D
e
si
gn for
Distrib
ut
ed W
i
re
less
Sensor N
e
t
w
or
ks.
Internation
a
l Jour
nal of C
o
mputer Ap
plic
ations
. 20
10; 1
0
( 4): 5-10.
[3]
Kandr
is D, T
s
ioumas
P, T
z
es A, Nik
olak
o
pou
las G, V
e
r
gad
os, Dim
itri
os D. P
o
w
e
r
Cons
ervatio
n
throug
h Ener
g
y
Efficie
n
t Rout
ing i
n
W
i
reless
Sensor N
e
t
w
or
ks.
Sensors
. 2009; 9: 73
20-7
342
.
[4]
Majid
I K, Wilf
ried
N, G
anst
e
rer, Haring G
.
Congestion
Avoid
ance
a
n
d
Ener
g
y
Effici
ent R
outin
g
Protocol for W
i
reless Se
nsor
Net
w
orks
w
i
t
h
a Mobi
le Sink.
Journ
a
l of Net
w
orks
. 2007; 2(6): 42-49.
[5]
Heinz
e
lm
an,
W
.
B., Chandr
akasa
n
, A. P. an
d Ba
lakris
hna
n, H. An
Appl
ic
atio
n-Sp
ecific Protoc
o
l
Architecture fo
r W
i
reless Mic
r
osens
or Net
w
orks.
IEEE Tr
ansactions on Wireless Comm
unic
ations
.
200
2; 1(4): 660
-670.
[6]
Patel R., Pari
yani S, Ukan
i V. Energ
y
an
d
T
h
rough
put A
nal
ysis
of Hier
a
rchic
a
l Ro
uti
ng Protoco
l
(LEACH) for W
i
reless S
ens
or
Net
w
ork.
Inter
natio
nal J
our
n
a
l of C
o
mputer
Appl
icatio
ns
. 201
1; 20(4):
32-3
6
.
[7]
Heinz
e
lm
an W
B
. Applic
atio
n-
Specific Pr
ot
ocol Architectur
e
s for Wireles
s
Net
w
orks.
Doctor Tesis
.
Cambri
dg
e: F
a
cult
y
of Elec
tricalEn
gin
eeri
ng
and
C
o
mp
uter Sci
ence
Massach
usetts Institute
o
f
T
e
chnolog
y. 2
000.
[8]
Kotta HZ
, Rantelo
bo K, T
ena S, Klau G. W
i
reless Se
nsor
Net
w
ork for La
ndsli
de Mo
nito
ring i
n
Nus
a
T
enggara T
i
mur.
T
E
LKOMNIKA T
e
leco
mmunic
a
tion C
o
mputin
g Electro
n
i
cs and C
ontro
l.
2011; 9(1):
9-18.
[9]
Mahy
astut
y
V.
W, Pramudita
A.A.
Energy C
onsu
m
ption Ev
alu
a
tion
of
Low
Energy Ad
apti
v
e Cluster
in
g
Hierarc
hy Ro
ut
ing Pr
otocol for
W
i
reless Se
ns
or Netw
ork
. IEEE COMNET
S
A
T. Yogy
akart
a
. 2013: 6-
9.
[10]
W
ang W
,
Pe
ng
Y. LEAC
H A
l
g
o
rithm B
a
sed
o
n
L
o
a
d
Ba
la
nci
ng.
T
E
LKOMNI
KA Indo
nes
ian
Jour
nal
o
f
Electrical E
ngi
neer
ing
. 2
013;
11(9): 53
29-
53
35.
Evaluation Warning : The document was created with Spire.PDF for Python.