TELKOM
NIKA Indonesia
n
Journal of
Electrical En
gineering
Vol.12, No.7, July 201
4, pp
. 5591 ~ 55
9
8
DOI: 10.115
9
1
/telkomni
ka.
v
12i7.561
2
5591
Re
cei
v
ed
Jan
uary 9, 2014;
Re
vised Feb
r
uar
y 25, 201
4
;
Accepte
d
March 8, 2014
Construction Protocol of Wireless Sen
s
or Network
Based on Centralized Clustering Routing and Time
Division Multiplexing MAC Protocol
Shitao Yan
1
*
,
Mianrong Yang
2
1
Hena
n Institute of Science and Te
ch
n
o
l
ogy, Hena
n Xinxiang, 453
003, Chi
n
a
2
Xinxiang Uni
v
ersity, Hena
n Xinxiang, 45300
3, Chin
a
*Corres
p
o
ndi
n
g
author, e-ma
i
l
:
yanshitaoh
kd@1
63.com
A
b
st
r
a
ct
LEACH is a ro
uting pr
otoco
l
base
d
on cl
usterin
g
in w
i
rele
ss sensor net
w
o
rks and is b
a
sed o
n
a
low
pow
er
ad
aptive
hi
erarc
h
ical
ro
uting
alg
o
rith
m
des
i
gn
of w
i
reless
sens
or n
e
tw
ork. T
i
me
divi
si
o
n
mu
ltipl
e
xi
ng
mecha
n
is
m is fo
r each w
i
reles
s
sensor
n
e
tw
ork nod
e distri
butio
n in
dep
en
dent ti
me sl
ots for
data transc
e
iv
e
r
, and th
e no
d
e
into s
l
e
ep st
ate in
other
fre
e
time sl
ot. T
h
i
s
pap
er i
n
trodu
ces MAC pr
oto
c
ol
base
d
o
n
ti
me
divisi
on
multip
l
e
xin
g
. T
he p
a
p
e
r pro
poses
co
nstruction
prot
ocol
of w
i
reles
s
sensor
netw
o
rk
base
d
o
n
c
entr
a
li
z
e
d
c
l
usteri
n
g
ro
uting
an
d ti
me
div
i
si
o
n
mu
ltiplex
i
n
g
MAC
protoco
l
. T
he s
i
mulati
on
resu
lts
show
that the LEACHEE proto
c
ol c
an effectiv
ely red
u
ce net
w
o
rk energy
co
nsu
m
pti
on, pro
l
on
g the netw
o
rk
life cycle.
Ke
y
w
ords
:
wireless sensor network, tim
e
division
mu
ltip
lex
i
ng, centra
li
z
e
d
clusterin
g
routi
n
g
Copy
right
©
2014 In
stitu
t
e o
f
Ad
van
ced
En
g
i
n
eerin
g and
Scien
ce. All
rig
h
t
s reser
ve
d
.
1. Introduc
tion
In wirel
e
ss sensor n
e
two
r
ks, me
dium
ac
ce
ss cont
rol
(medi
um acce
ss cont
rol,
MAC)
proto
c
ol
s det
ermin
e
the u
s
ag
e mod
e
o
f
wirele
ss ch
annel, the
un
derlying i
n
fra
s
tru
c
ture to b
u
ild
sen
s
o
r
net
works th
rou
g
h
the allocation of the
li
mited re
so
urce of
wirel
e
ss
com
m
uni
cation
betwe
en the
sen
s
o
r
no
de
s. The bottom
part of t
he MAC protoco
l
in sen
s
or
ne
tw
o
r
k
pr
o
t
oco
l
,
has
a great
effect on the
perfo
rman
ce
of sen
s
o
r
n
e
tworks, is t
he key to en
sure the
efficient
comm
uni
cati
on network protocol
s in wi
reless sen
s
or
netwo
rks.
Wirel
e
ss sen
s
or n
e
two
r
ks (WSN) is d
eployed in the monitori
n
g
area by the larg
e
numbe
r of cheap mi
cro sen
s
o
r
nod
e
s
, a self-o
rg
anized net
work
system t
h
rou
gh wi
rel
e
ss
comm
uni
cati
on to form, its purpo
se i
s
to
coo
p
e
r
ative
sen
s
in
g, coll
e
c
ting a
nd p
r
o
c
e
ssi
ng n
e
twork
informatio
n o
f
object in t
h
e cove
rag
e
a
r
ea, a
nd
sen
d
it to the ob
serve
r
. Be
ca
use th
e no
de
s of
wirel
e
ss
se
n
s
or net
works, ener
gy sto
r
age,
com
p
u
t
ing ca
pa
city
and other con
s
trai
nts,
t
h
e
traditional wireless
routing proto
c
ol
s
are not
suit
abl
e for wi
rele
ss se
nso
r
net
works [1]. Therefo
r
e,
the desi
gn ca
n effectively save energy, prolon
g the
net
work life cycl
e routing p
r
ot
ocol, is of gre
a
t
signifi
can
c
e
to wirele
ss
sen
s
o
r
n
e
twork.
The
cl
uster ba
se
d
routin
g p
r
o
t
ocol
ha
s g
ood
performanc
e
in this
aspec
t.
In wirele
ss
sen
s
o
r
n
e
tworks, e
n
e
r
gy
efficien
cy i
s
a
n
imp
o
rt
ant index
of network
perfo
rman
ce.
It con
s
um
es a very
stri
ct limits on
ene
rgy, shoul
d b
e
as little
as
p
o
ssible
ene
rg
y
con
s
um
ption
to prol
ong
th
e net
work life
cycl
e to.
T
h
e
r
efore, to d
e
sign a
go
od
ro
uting p
r
oto
c
ol
, it
is ne
ce
ssary to redu
ce un
necessa
ry en
ergy co
ns
um
ption. This pa
per mainly di
scusse
s the low
energy ad
apt
ive clu
s
te
ring
protoc
ol (LE
A
CH), poi
nts out the
d
e
fe
cts
of LEA
C
H p
r
oto
c
ol,
a
n
d
gives corre
s
p
ondin
g
soluti
on to be opti
m
ized.
Becau
s
e
of the wi
de u
s
e
of miniaturi
z
e
d
se
nsor n
o
d
e
s, no
de in t
he supply of
energy,
comp
uting po
wer
an
d storage spa
c
e
a
nd
oth
e
r har
dwa
r
e
re
sou
r
ce
s a
r
e ve
ry
limited, the
MAC
proto
c
ol m
u
st
be de
sign
ed
with ene
rgy
saving
as a
pre
r
eq
uisite.
For
WMSN, t
he tran
smi
s
si
on
and
compl
e
x pro
c
e
ssi
ng ta
sk,
while p
r
ov
iding Q
o
S gu
arante
e
mu
st
con
s
id
er h
o
w to efficient u
s
e
of these re
so
urces, QoS
sensitivity is an impor
ta
nt feature of WMS
N
, embodi
ed
in the audio a
nd
video quality, netwo
rk d
e
l
a
y, energy consumpt
ion
and net
wo
rk
media info
rm
ation processing
asp
e
ct
s of.
WMSN comp
ared
with
th
e traditio
nal
WSN, MA
C
proto
c
ol
de
si
gn n
eed to
pay
attention to the quality of service m
o
re.
Evaluation Warning : The document was created with Spire.PDF for Python.
ISSN: 23
02-4
046
TELKOM
NI
KA
Vol. 12, No. 7, July 201
4: 5591 – 55
98
5592
LEACH (Low
Energy A
dapt
ive Clu
s
teri
ng
Hie
r
a
r
chy)
protocol
is a
ro
uting p
r
oto
c
ol
ba
sed
on
clust
e
rin
g
in wi
rele
ss
sen
s
o
r
n
e
tworks, by
peri
odically ele
c
ts
clu
s
ter
he
ads ra
ndoml
y
to
ensure th
at the node
s have equ
al
cha
n
ces to
be the cl
u
s
ter h
ead,
balan
ce
d en
ergy
con
s
um
ption
of nod
es,
so
as to
a
c
hieve
the p
u
rp
ose
of extendi
ng
the
n
e
two
r
k
life cycl
e. Th
e
clu
s
terin
g
id
e
a
ru
ns thro
u
gh a l
o
t of cl
uster
ba
se
d routing p
r
oto
c
ol wa
s
pro
p
o
s
ed. T
he
pap
er
prop
oses co
nstru
c
tion
p
r
otocol
of
wireless
se
nsor network b
a
s
ed
on
centralize
d
clu
s
tering
routing a
nd time division m
u
ltiplexing M
A
C proto
c
ol.
2. Rese
arch
of LEACH
Centrali
zed Cl
usterin
g
Ro
uting Proto
c
ol in WSN
Aiming at the defect
s
of LEA
CH
C protocol in
wireless se
n
s
or networks, this pap
er
pre
s
ent
s
a
cl
usteri
ng
ro
uting p
r
oto
c
ol
b
a
se
d
o
n
e
n
e
r
gy estim
a
tes
based
on
LE
ACH C proto
c
ol.
The ag
reem
e
n
t on the ene
rgy con
s
u
m
pt
ion is e
s
timat
ed, redu
cin
g
the traffic se
n
s
or
node
s an
d
a base statio
n, energy saving of the wh
ole network.
WSN
can b
e
divided into two research
dire
ctio
n
s
of topolo
g
y control: powe
r
con
t
rol an
d
hiera
r
chi
c
al t
opolo
g
y co
nt
rol. Th
e tra
n
s
mit po
we
r
o
f
each n
ode
power
co
ntro
l mechani
sm
to
adju
s
t the network, to gua
rantee n
e
two
r
k conn
ecti
vity, the number of direct ne
ighbo
rs in th
e
equilibrium
(up to a number of nei
ghbors nodes in
si
ngle hop) at t
he same tim
e
, to reduce t
h
e
interferen
ce
b
e
twee
n n
ode
s. Hi
era
r
chi
c
a
l
topolo
g
y co
ntrol i
s
the
u
s
e of
clu
s
terin
g
, so
that p
a
rt
of
the node
s in
the netwo
rk is active, be
come the cl
ust
e
r he
ad no
de
[2]. The cluster hea
d nod
es
con
s
tru
c
t a conne
cted n
e
twork to the transmi
ssi
on a
nd processin
g
of data in the network, an
d
regul
arly or i
rre
gula
r
ly to sele
ct clu
s
ter
head nod
es, to balance
the
energy consumption
of
node
s. In WS
N, the wirele
ss co
mmuni
ca
tion modul
e n
ode in p
o
we
r
transmissio
n state suprem
e,
receiving stat
e and the idle
stat
e power
of the dorma
nt state,
the lowe
st po
wer
con
s
um
ption.
LEACH p
r
oto
c
ol is
ba
sed
on a lo
w po
wer ad
apt
ive hi
era
r
chical ro
u
t
ing algo
rithm
desig
n
of wirele
ss sensor net
work, routing p
r
o
t
ocol is
propo
sed first. Its
basi
c
idea i
s
to the circul
ation
of the rand
o
m
sele
ction o
f
cluste
r hea
d node
s,
oth
e
r no
de
s clu
s
ter g
r
ou
ping
according to
the
sign
al stre
ngt
h received from the clu
s
te
r head,
ma
ki
ng the wh
ole
netwo
rk e
n
e
r
gy load avera
g
e
assign
ed to
e
a
ch
sen
s
o
r
n
ode, the
r
e
b
y
redu
cin
g
the
netwo
rk e
nergy co
nsumpti
on, imp
r
ove t
he
survival time
of the entire
netwo
rk. T
he
LEACH
p
r
oto
c
ol defin
es th
e con
c
e
p
tion
of "round", e
a
c
h
roun
d con
s
i
s
ts
of a clu
s
ter
is esta
blish
e
d
an
d
t
he
ste
ady state
ph
ase. In
a
clu
s
ter, th
e cl
uster
head
sel
e
ctio
n is rand
om.
For a
nod
e n,
whi
c
h
were randomly
sele
cted from a
random
num
b
e
r
betwe
en
0 to
1, if the
nu
mber is
le
ss
than a
thre
sh
old valu
e of
T (n
), n
ode
n
as is the
clu
s
ter
head n
ode to
it.
If the cluste
r stru
cture iso
m
orp
h
ic
clu
s
t
e
ri
ng
metho
d
,
the clu
s
ter
energy is oft
en the
distan
ce f
r
o
m
the b
a
se
station
nea
r
con
s
um
ption
must b
e
rela
tively large, l
eadin
g
to a
new
roun
d of cluster head ele
c
tion, cau
s
ing
the entir
e net
work to su
sp
end wo
rk, even in the earl
y
stage
of
nod
es i
n
to
death
.
To avoi
d thi
s
situati
on,
th
e p
r
elimin
ary
algo
rithm
u
s
ing
clu
s
ter si
ze
hetero
gen
eo
us
clu
s
te
r
structure, n
a
me
ly the di
stan
ce f
r
om
the
base
station
is fa
r tha
n
t
he
dist
an
ce b
e
t
w
ee
n clu
s
t
e
r st
ru
ct
ur
e ba
se station n
e
a
r
larg
e, to
bal
ance the en
e
r
gy co
nsumpt
ion
of data forwa
r
ding.
Duri
ng the
d
eployment of
netwo
rk, the ba
se
stati
on tra
n
smi
s
si
on po
we
r of
a given
netwo
rk
to broad
ca
st
a sig
nal.
Ea
ch se
nso
r
node
re
ceive
s
the
si
gnal, a
c
co
rdi
ng to t
he
stre
ngth
of the received sig
nal to cal
c
ulate it to approxim
at
e the distan
ce from the b
a
se
station. This
distan
ce, n
o
t only co
ntrib
u
te to the sensor n
ode
s tran
smit dat
a to the ba
se station
wh
en
sele
cting the
transmit power availabl
e to redu
ce
the
energy con
s
u
m
ption, and it is still one of the
size of the no
n uniform
clu
s
terin
g
algo
ri
t
h
m to con
s
tru
c
t the informa
t
ion necessa
ry.
This p
ape
r a
s
sume
s that the N
sen
s
o
r
node
s
rand
o
m
ly distrib
u
te
d in the A re
gion an
d
the sen
s
o
r
ne
twork ha
s the
following
cha
r
acte
ri
stics:
(1) T
he network d
eploym
e
nt is com
p
let
ed, all node
s are statio
nary, and the node ca
n
obtain the po
sition informa
t
ion.
(2) The net
work scale
i
s
small;
all node
s can
communi
cate with
the ba
se
station
dire
ctly. The base station
only is fixed position.
(3) T
he o
r
d
i
nary no
de
energy is li
mited, and
has th
e sa
me co
mputa
t
ional,
comm
uni
cati
on ability an
d initial ene
rgy, and ene
rgy and comp
uting ca
pabili
ty of base st
ation
without limit.
WSN n
ode
s energy con
s
u
m
ption mod
e
l
data as follo
ws.
Evaluation Warning : The document was created with Spire.PDF for Python.
TELKOM
NIKA
ISSN:
2302-4
046
Con
s
tru
c
tion
Protocol of Wirele
ss Se
nso
r
Ne
twork Ba
sed o
n
Ce
ntralize
d
… (Shit
ao Yan)
5593
Senso
r
n
ode
s tra
n
smit t
he con
s
ump
t
ion of R b
i
t packet en
ergy, is
sh
o
w
n by
Equation (1).
P
t
(R, d) =r (a
1
+a
2
d
n
)
(1)
Whe
r
e: d i
s
t
he di
stan
ce
betwe
en the
two no
de
s; a
1
is ind
epen
d
ent of the di
stan
ce,
whi
c
h
com
p
ri
se
s tra
n
smitting ci
rcuit en
ergy
con
s
um
ption; a
2
is related to th
e
distan
ce
of
the
weig
ht; n is the path loss e
x
ponent, usu
a
lly from 2 to 4.
The LEA
CH
algorith
m
will
load u
n
iformly di
strib
u
te
d thro
ugh
out
the net
work,
gre
a
tly
save
s the
en
ergy lo
ss in t
he p
r
o
c
e
s
s of
com
m
uni
cati
on. Rotation
algorith
m
cl
u
s
ter
hea
d p
o
sition
to load
rem
o
te com
m
uni
cation in tu
rn
assign
ed to t
he net
wo
rk n
ode, the
wh
o
l
e sy
stem
ca
n
prolo
ng the
survival time of. In addition, the clu
s
ter head n
ode
use
s
a d
a
ta
fusion
and d
a
ta
comp
re
ssion
techn
o
logy in
the pro
c
essi
ng of t
he data
,
the data transmi
ssi
on is
greatly re
du
ced.
In orde
r to p
r
olong th
e net
work life
cycl
e, sho
u
ld try to ch
oo
se the
clu
s
ter n
ode
resid
ual
energy as clu
s
ter he
ad no
de is the high
est, and let
the different no
de rotation was ele
c
ted. This
part a
dopt
s cluster he
ad e
l
ection
metho
d
of re
sid
ual
energy of cl
u
s
ter
hea
d rotation ba
se
d
on
clu
s
ter. Th
e main ide
a
: cl
uster
hea
d in
the clu
s
ter i
s
re
sp
on
sible
for the coll
e
c
tion of no
de
s in
the cluste
r da
ta. In
the cluster head no
d
e
s to tr
an
smit data, the residual ene
rgy of the nodes
in
the data
bits
adde
d value
after a. Th
e
cl
uster he
ad
wi
ll data forwa
r
ding, ea
ch
no
de of the
ene
rgy
of a sim
p
le
sort, be
cau
s
e
no maintai
n
in
g total or
deri
n
g all the e
n
e
r
gy of the nod
e, you only n
eed
to kno
w
a few node re
sid
u
a
l
energy is hi
gh, so the ma
ximum heap
sort meth
od.
LEACH i
s
a
typical ad
ap
tive cluste
rin
g
proto
c
ol, n
ode
s in the
netwo
rk th
ro
ugh th
e
rand
om way self org
ani
ze
into clu
s
ters, the clu
s
ter he
ad se
nd
s dat
a in time slots are assig
ned
to
the clu
s
ter h
ead, the re
ce
ived data fusi
on in ea
ch frame after the
end of dire
ct
commu
nication
with the
base
station [3]. Node
s in
clu
s
ter h
ead,
b
a
la
nce th
e net
work en
ergy
consumption,
but
the clu
s
ter h
ead
s are el
e
c
ted, doe
s n
o
t con
s
ide
r
the node e
n
e
r
gy level, if th
e node en
erg
y
is
very low,
still
want to
a
c
t a
s
clu
s
ter he
a
d
, it will
accel
e
rate
the
dea
th. In additio
n
,
the data
se
nt
dire
ctly to the base statio
n, t
he energy con
s
um
ption
of the node
s
is far f
r
om
base station
s
is
very large, le
ading to lo
cal
node
s die pr
ematurely, the monitori
ng
blind spot.
The radio
e
nergy
co
nsu
m
ption mo
de
l is wi
th
the
sam
e
reference. Wh
en
data i
s
transmitted e
nergy con
s
u
m
ption, as is
sho
w
n by Eq
uation (2
).
(2)
Whe
r
e, k is t
o
transmit da
ta bit; d is as the actu
al comm
uni
cati
on dista
n
ce; d
0
i
s
t
he
distan
ce
thre
shol
d, when
the trans
missi
on di
stan
ce
i
s
le
ss tha
n
d
0
, power ampli
f
ier lo
ss u
s
in
g a
free spa
c
e m
odel, othe
rwi
s
e the p
a
th attenuati
on m
o
del; Eelec
re
pre
s
ent
s en
ergy and re
ceiv
ing
every bit data sendin
g
nod
e circuit;
ε
FX and
ε
amp denote re
sp
ect
i
vely t
he coefficient of energy
con
s
um
ption
amplifier in th
e 2 attenuatio
n mode.
(1) Ea
ch no
d
e
has the
sa
me maximu
m transmit p
o
we
r, its cov
e
rag
e
is the
radiu
s
of
circula
r
re
gio
n
s of the R,
and by adj
usting
the transmit po
we
r in ord
e
r to
adapt to the
comm
uni
cati
on of different
distan
ce no
d
e
s withi
n
its coverag
e
;
(2) F
o
r e
a
ch
node to o
b
tai
n
the re
sid
ual
energy
of the
i
r own, have
certai
n sto
r
a
g
e
sp
ace
to store the in
formation of n
e
ighb
or no
de
s;
(3) Ign
o
re the ob
stacl
e
factors such as
comm
unication qu
ality exist in the real
environ
ment, to ensu
r
e that
all data packets ca
n be rel
i
able tran
smi
ssi
on.
The
clu
s
ter
head
LEACH protocol i
s
random
ly
gen
erated,
the
selectio
n me
chani
sm
without
co
nsi
derin
g the
re
sidu
al e
nergy and
no
de ha
s
d
one
a num
ber
of clu
s
ter head. On
ce
t
h
e
remai
n
ing l
e
ss energy node to
becom
e
a cluster head will
soon
run out
of energy, premat
ure
death. The
cluster m
e
mb
ers
will be n
o
dead h
a
ir
out informati
on and
conti
nue to se
nd
the
requ
est si
gna
l, consu
m
ing l
a
rge am
ount
s of energy
to accele
rate th
e death, redu
ce
s the lifetime
of the whole
netwo
rk.
In the cl
uste
r buildin
g ph
a
s
e, the first
node
as clu
s
ter he
ad
ran
domly dete
r
mined
by
base statio
n.
The n
u
mbe
r
of clu
s
ter
hea
ds i
s
d
e
termi
ned a
c
co
rdin
g to the lo
cati
on, si
ze
and t
he
size of net
wo
rk m
onitori
ng
area. Is
sel
e
cted as th
e cl
u
s
ter h
ead
of ID by the b
a
se station
are i
n
Evaluation Warning : The document was created with Spire.PDF for Python.
ISSN: 23
02-4
046
TELKOM
NI
KA
Vol. 12, No. 7, July 201
4: 5591 – 55
98
5594
the
net
work b
r
oad
ca
st,
net
work nod
es b
y
comp
arin
g
su
ccessive
re
ceived I
D
with their o
w
n, the
same
a
s
th
e
clu
s
ter he
ad.
After the
clu
s
ter h
ead
s
are
ele
c
ted, a
n
d
then
broad
cast to
the
ent
ire
netwo
rk cl
ust
e
r h
ead
ID.
The
clu
s
ter
n
ode in
ea
ch
round
of data
tran
smi
ssi
on
at the e
nd
o
f
a
frame, put to
gether to
sen
d
inform
ation
to their
resi
du
al ene
rgy of cluster hea
d. Re
sidu
al ene
rgy
of the nod
es i
n
the cl
uste
r
head
ele
c
tion
, node
re
si
du
al ene
rgy i
s
the big
g
e
s
t as the next ro
u
nd
of cluste
r hea
ds, thus e
s
ta
blish
ed the first layer clu
s
te
r head.
Then
th
e sta
b
le stage of a
ne
w rou
nd of
is dat
a tra
n
smi
ssi
on. At
this
stag
e, th
e sen
s
or
node
will
mo
nitor the
data
to the
clu
s
te
r he
ad,
clu
s
ter h
ead
data
fusio
n
with
clu
s
ter i
dentif
ier,
then tra
n
smit
the data to th
e ba
se
statio
n, the amo
unt
of data the
b
a
se station st
atistics
for ea
ch
clu
s
ter to
sen
d
over the.
When
a data
transmi
ssion
af
ter the
end
of
the roun
d, a
nd it i
s
the
ba
se
station a
c
cording to the receive
d
every cluste
ring
data e
s
timate the ene
rgy
remaini
ng in
the
curre
n
t clu
s
te
r all node
s.
The se
nsor n
ode re
ceive
s
the R bit packet energy con
s
umptio
n for:
Pr (R
) =
r
β
(
2
)
Type:
β
Lu to receive ene
rg
y coefficient.
P
a
(r
1
+r
2
，
r
)
=
r(r
1
+r
2
-
r)
E
rr
(
k
,
d
)=
k
E
elec
(3)
Where S
e
nsor nodes
w
ill be 2 data flow
R
1
an
d R
2
fu
sion en
ergy di
ssi
pation
a p
a
cket of
R, as is
sh
own by Equat
io
n (3
). Deficie
n
cy of the
LE
ACH
algo
rith
m in wi
rele
ss
sen
s
o
r
n
e
two
r
ks,
lead
s to the
unbal
an
ced l
oad e
n
e
r
gy. This
pap
er
mainly thro
u
gh the im
pro
v
ement of
cl
uster
head
ele
c
tion
algo
rithm i
s
t
o
optimi
z
e th
e LEACH
pro
t
ocol. Th
e m
a
in go
al is to a
v
oid the
node
s
with lo
w
ene
rgy as
cluste
r hea
d,
cluste
r h
ead
num
b
e
r
co
ntrol to
achi
eve o
p
timal
clu
s
ter
h
ead,
redu
ce u
nev
en distri
butio
n in each ro
und of t
he phenom
eno
n. In orde
r to redu
ce the en
ergy
con
s
um
ption
of the system
and it is the final
obje
c
tive to prolon
g the
network life cycle.
The
se
con
d
layer
clu
s
ter
head
and
th
e e
s
tabli
s
hm
ent of
comm
unication m
o
del an
d
LEACH is
greatly different
from the. E
a
ch
rou
nd
of the ele
c
tion
o
f
the first l
a
yer
clu
s
ter
he
ad
become
s
the
com
m
on
no
de
se
cond
la
yer cl
uste
r h
ead, in
LEACH the
s
e n
o
des commu
nicat
e
with the
ba
se
station
direct
ly. By formula (1
)
ca
n be
see
n
, the
am
plifier
e
nergy co
nsumption
is
far greate
r
than the
ci
rcuit
ene
rgy consumption,
energy co
nsumption a
n
d
comm
uni
cat
i
on
distan
ce
an
d
amplifie
r in
D h
a
s a
dire
ct relation
shi
p
, so
in
the
seco
nd l
a
yer
clu
s
ter he
ad,
fully
con
s
id
erin
g the re
sid
ual e
nergy of n
o
d
e
s a
nd
the n
ode a
nd the
base stat
io
n distan
ce and other
factors.
Th
e formation of se
con
d
laye
r
is clu
s
ter
he
ad threshold
cal
c
ulatio
n a
c
cordi
ng to t
h
e
following formula.
T
ch
= E
residual
(i)/ BS
distan
ce
(i)
(4)
Formul
a (4
):
Whe
r
e E
residual
(i) is re
sidual en
ergy
as clu
s
te
r head
s I iden
tification;
BS
distan
ce
(
i
) is identified as
betwe
en clu
s
ter head an
d
bas
e statio
n
I distance. Each roun
d after
the first layer
in the clust
e
r
head
s and
cl
uster h
ead e
n
e
rgy high
er th
an a ce
rtain value Eth (if th
e
node i
s
lo
wer than Eth that node failu
re
), each
clu
s
ter head i
s
Tch, find the Tch
maximum val
ue
is se
co
nd lay
e
r clu
s
te
r hea
d.
Whe
n
the interval numb
e
r of round
s (a
long
time), or the ene
rg
y of senso
r
node
s is
lowe
r than
a
certai
n value,
or a
ne
w m
e
mbe
r
no
de
s are
add
ed, the ba
se
stati
on an
d sen
s
or
node en
ergy requi
rem
ents repo
rt their own inform
at
io
n, and acco
rding to the re
sidu
al ene
rgy
o
f
the re
ceived
informatio
n to each no
de
to estima
te
the co
rrectio
n
, the nume
r
ical the p
r
e
c
i
s
e
division, then
re selectio
n
and cl
uste
r cl
uste
r
hea
d. Comp
ared wi
th LEACH
- C, LEACH
-
EE
proto
c
ol do
e
s
not req
u
ire
sen
s
or n
ode
s to t
he base station in
each rou
nd
after rep
o
rtin
g its
positio
n, energy and other
informatio
n, saving ene
rgy
co
sts. At the same time, th
e interval time
of estimation
accuracy adj
ustment, so the per
fo
rma
n
c
e of LEACH EE protocol i
s
better.
3. Protocol o
f
Time Div
i
sion Multiplexi
ng MAC
With the de
velopment of
wirele
ss co
mmuni
cation,
micro
e
le
ctro
nics manufa
c
turin
g
techn
o
logy a
nd se
nsor te
chn
o
logy, wireless
sen
s
or networks (WSN) have a
r
oused exten
s
ive
Evaluation Warning : The document was created with Spire.PDF for Python.
TELKOM
NIKA
ISSN:
2302-4
046
Con
s
tru
c
tion
Protocol of Wirele
ss Se
nso
r
Ne
twork Ba
sed o
n
Ce
ntralize
d
… (Shit
ao Yan)
5595
attention. WSN is
depl
oyed in the
mo
nitoring
re
gi
o
n
, a lot of int
egratio
n is compo
s
ed
of tiny
sen
s
o
r
nod
es sen
s
ing, dat
a pro
c
e
s
sing
and wi
rele
ss
comm
uni
cati
on and p
o
wer supply mo
du
le.
In intrusion
detection, target tracking,
environm
ental monitoring, battlefield
surveillance,
Bio
Medical, em
e
r
gen
cy
re
scu
e
an
d di
sa
st
er
relief
and
indu
strial pro
c
e
s
s
mo
nitori
ng
a
ppli
c
atio
ns
,
the WSN h
a
s a wide ap
plication pro
s
p
e
ct.
The po
sitioni
ng me
cha
n
ism based on
distan
ce i
s
th
roug
h the a
c
tual dista
n
ce
or ra
nge
measured be
tween a
d
ja
ce
nt node
s to determi
ne th
e unkno
wn n
ode po
sition,
usually ra
ng
ing,
positio
ning
a
nd
corre
c
ting
the ste
p
s to
achiev
e. Du
e to the
dista
n
ce
and
the
angle
mea
s
u
r
ed
betwe
en th
e
nod
es po
si
tioning
me
ch
anism,
u
s
ual
ly based
on
dista
n
ce
hi
gh p
o
sitio
n
in
g
accuracy, but
the req
u
irem
ents of h
a
rd
ware i
s
al
so hi
gher. T
he p
o
s
itionin
g
me
chani
sm di
sta
n
ce
indep
ende
nt betwe
en with
out
a
c
tual m
easure
m
ent node
di
stan
ce o
r
a
ngle
ca
se
ca
n lo
cate
the
unkno
wn no
d
e
; this me
ch
anism
doe
s
not need th
e
actual m
e
a
s
urem
ent, the
node h
a
rdware
requi
rem
ents are
red
u
ce
d, more
suitable fo
r l
a
rge-scale n
e
twork
appli
c
a
t
ions [4]. T
h
e
positio
ning m
e
ch
ani
sm ind
epen
dent of distan
ce
fro
m
vulnerabl
e
to environm
ental impa
ct and
redu
ce the
positio
ning a
c
cura
cy, the erro
r w
ill b
e
increa
sed,
but enough
to satisfy the
locali
zat
i
on f
o
r wir
e
le
ss
sen
s
or n
e
t
w
o
r
ks.
The cl
uste
r h
ead tra
n
smitt
ed co
ntinuo
u
s
ly 5s
synchronization seq
uen
ce, into lo
w po
we
r
mode, 5
s
at the en
d of the
time calle
d the syn
c
h
r
oni
zation time
p
o
int, one of the 10
s poi
nts, all
the se
nsor n
ode
s in the d
a
ta in the re
ceiving
wind
o
w
are at lea
s
t able to re
ceive a compl
e
te
wa
ke-up
com
m
and. T
he first complete
synchroni
zatio
n
comman
d
receive
d
effective comm
an
d,
according to
the se
que
n
c
e n
u
mbe
r
,
node
s
can
d
e
cid
e
the lo
cation
on a
time axis, af
ter
cal
c
ulatio
n, get away fro
m
the synch
r
oni
zati
on ti
me of long t. Can see, th
roug
h co
ntin
uou
s
synchro
nou
s
5s late
r, all the se
nsor n
o
des
c
an
be
synchro
n
ized
to the synchroni
zatio
n
time
point.
The existen
c
e of WMSN a
udio, video in
formati
on, at the sam
e
time
, there may be a text
informatio
n, different p
a
ra
meter
con
c
e
r
n differe
nt
ap
plicatio
ns
of
different Q
o
S
.
Therefore, t
he
MAC protoco
l
sho
u
ld be
d
e
sig
ned a
c
co
rding to th
e
different bu
si
ness to p
r
ovi
de differe
ntia
te
d
servi
c
e
s
, whil
e achi
eving e
fficient us
e of
reso
urce
s in
the netwo
rk
range.
De
sign
of
MAC p
r
oto
c
ols i
s
n
eed
a bal
an
ce
betwe
en v
a
riou
s
pro
p
e
r
ties. T
h
e
perfo
rman
ce
of the bala
n
ce
between
is often
m
o
re imp
o
rtant
than individ
ual pe
rform
a
nce.
Becau
s
e
it is
not a
balan
ce
d ag
ree
m
ent
good
pe
rf
orm
ance even
in
the lab
o
rato
ry, and it is b
u
t
also
may hav
e poo
r
perfo
rmance in
a
real envi
r
onm
en
t. For
exa
m
ple, a
deal
if it too often
turn
off the wi
reless transceiver
savi
ng, not
only make the real-time a
nd reliability i
s
affected, packet
loss retran
sm
issi
on cau
s
ed
will influen
ce
the effect of
energy savin
g
.
MAC control
messa
g
e
s
p
r
otocol
h
ead
er
in
clu
d
e
s
some cont
rol informatio
n, su
ch as
RTS/CTS/ACK, node
s
se
nd the
co
ntrol inform
atio
n nee
d to
consume
som
e
ene
rgy. T
he
wirel
e
ss
com
m
unication m
odule,
sen
s
o
r
node
s i
n
cl
ud
e se
ndin
g
, re
ceiving,
state
monitori
ng
a
nd
dorm
a
n
c
y in four states,
the current MAC prot
o
c
o
l
in redu
cing
powe
r
co
nsumption mai
n
ly
con
c
e
n
trated
in the add no
de sle
ep time
, r
educe the sensi
ng no
de
s on the cha
n
n
e
l.
Even if the synchroni
zatio
n
error
after
10
min to 24
MS, the N no
de layer
and
the N+1
layer nod
e sti
ll has a dete
c
tion wind
ow
50-2
4
=26
MS
overlap pe
ri
od. If the N layer nod
es
with
two command frame
densi
ty to the N+1
layer no
de sends synchronous
i
n
st
ruction, still have t
he
oppo
rtunity to the bottom n
ode captu
r
e
one of
the co
mmand fram
e, beca
u
se th
e 26 ms>2
2
Ms
.
The above a
r
e the critical time stat
e, if the cry
s
tal direction two
no
des of the sa
me, it captures
the uppe
r syn
c
hroni
zation i
n
stru
ction
s
wi
ll incre
a
se the prob
ability of it.
Real time service is ba
sed
on CDMA M
A
C prot
o
c
ol for wi
rele
ss
sensor net
works. They
think th
at u
s
i
ng
CDMA p
r
ogra
m
can
p
r
ovide
mo
re
band
width
re
sou
r
ces am
o
ng
clu
s
ters
of
flexible config
uration, bette
r se
cu
rity and through
put
is gre
a
ter, while allowin
g
for multi domai
n,
airspa
ce joint
commu
nication [5]. The e
quilateral hex
agon
al clu
s
te
r structu
r
e i
s
with differen
t
CDMA
codin
g
sequ
en
ce i
n
stea
d of the multiple freq
uen
cie
s
. To sen
d
informa
t
ion, each no
de
has 1 tran
smitting modu
le and a re
ceiving modul
e
6, while in the listener
/ receiver
with 7
receiving m
o
dule.
Comp
a
r
ed
with T
D
MA and
FDMA mode,
CDMA mo
de
redu
ce
s i
n
ternal
cha
nnel inte
rf
eren
ce, effe
ctively improve
the ut
ilization
of band
width,
but
the disad
v
antage i
s
the
need of spe
c
i
a
l sen
s
o
r
ha
rdwa
re supp
ort, to achieve greate
r
pri
c
e.
FDMA i
s
the
frequ
en
cy b
and i
n
to a
p
l
ura
lity of
ch
annel
s; different no
de
s
can u
s
e
different
cha
nnel
s at the
same
time.
TDMA i
s
a
perio
d of tim
e
the e
n
tire
band to
a n
ode.
Compared wi
th FDMA, T
D
MA communication time
is short, but
the overh
e
a
d
of the net
work
time synchro
n
izatio
n incre
a
se
s [6]. CDMA is
a com
b
ination of fixed and ran
dom di
stributi
o
n
Evaluation Warning : The document was created with Spire.PDF for Python.
ISSN: 23
02-4
046
TELKOM
NI
KA
Vol. 12, No. 7, July 201
4: 5591 – 55
98
5596
mode of di
stribution, with
zero
chan
nel
acce
ss d
e
la
y, bandwidth
utilization rati
o
and statisti
cal
multiplexing
of good, an
d
can
red
u
ce
the influen
ce
of hidden te
rminal p
r
o
b
le
m, but the hi
gh
compl
e
xity of cha
nnel all
o
cation a
nd b
a
se
stati
on
completely ce
ntralized, so
that it does
no
t
apply to the distributio
n in WSN.
The
chan
nel
acce
ss
pro
b
a
b
ility q is defi
ned in
te
rm
s
of the probab
ility of a time slot was
sele
cted
as t
he win
n
e
r
of the nod
e. We as
sum
e
th
at the node
s
are in
dep
end
ent, and the t
w
o
hop n
e
igh
bor node
s n
u
mb
er of
N2 fun
c
tion, and
we
assume
that all
nod
es hav
e
the same
two
hop nei
ghb
or numbe
r. Wh
en nod
e stat
e is in orde
r to anothe
r sta
t
e and it can
con
s
um
e so
me
energy. The followin
g
is th
e energy con
s
umptio
n stat
e conve
r
si
on
formula (5).
P
st,r
x
= P
rx
P
tx
,
r
x
=( P
tx
+ P
rx
)/2
(5)
Whe
r
e P
st,rx
is th
e T
R
A
M
A proto
c
ol,
P
rx
is sched
uling a
c
ce
ss nod
e
cycle
whi
c
h i
s
divided into three
kind
s: transmitting, P
tx
is receivin
g and sle
ep. Send statu
s
ref
e
rs to when a
n
d
only wh
en th
e nod
e ha
s d
a
ta to tran
sm
it state, and
have the hi
gh
est p
r
iority in
the com
petition;
the re
ceiving
state is th
at it is
the
re
cipie
n
t of the spe
c
ified nod
e; other
node
s in
the sle
ep
state.
Adaptive slot selection algorithm for AEA is bas
ed on the current node pr
iority two hop neighbor
node
s
within
one h
op
neig
hbors
and
scheduli
ng info
rmation, de
ci
sion no
de
s in t
he current ti
me
slot state st
ra
tegy: rece
ivin
g, sendi
ng or
slee
p.
This is a hyb
r
id sche
me o
f
a time divi
sion multiplexi
ng TDMA an
d freque
ncy
division
multiplexing
FDMA. In the node mai
n
tains a spe
c
i
a
l
stru
cture frame, table
slot allo
catio
n
is
simila
r to the TDMA node
sch
eduli
ng, accordi
ngly its com
m
uni
ca
tion with the adja
c
ent nod
es.
Multi ch
ann
el
FDMA te
ch
n
o
logy p
r
ovide
s
the
ca
n at t
he
same
time
, the co
mmun
i
cation
betwe
en
multiple no
de
s, effectively avoids the
co
nflict.
Becau
s
e the ch
ann
e
l
and time sl
ot allocatio
n
of
pred
efined li
mits the effective use of i
d
le time
slot, the busin
ess volume is
small lo
w ch
annel
utilization.
Comp
etitive MAC proto
c
o
l
based o
n
the
gene
ral u
s
e of bro
a
d
c
ast ch
ann
el, the node
con
n
e
c
ted to
the chann
el
can be sent
to the broa
dca
s
t ch
ann
e
l
information.
Want to follo
w
certai
n rul
e
s of communi
cation n
ode
cha
nnel
com
petition, the node
s u
s
e ri
ght can
sen
d
informatio
n. Comp
etitive MAC
p
r
oto
c
o
l
incl
udin
g
A
L
OHA
an
d
with the
ca
rrie
r
sen
s
e
multi
p
le
acce
sses
with colli
sion det
ection b
a
sed
on the traditio
nal CSMA etc.
4. Cons
truc
tion Protocol
of WSN
Ba
sed on Cen
t
ralize
d
Clu
s
tering
Rou
t
ing and Time
Div
i
sion Multiplexing MAC
In this pa
pe
r, based o
n
th
e LEACH p
r
otocol
, the
cl
uster he
ad di
rectly to redu
ce the
energy loss of base stati
on and remo
te commu
ni
cation is the prima
r
y goal,
con
s
ide
r
ing
the
resi
dual
en
ergy of no
de
a
nd the
ba
se
station
at
a
distan
ce
of t
w
o l
a
yer whil
e sele
cting t
h
e
clu
s
ter hea
d, and
im
prove
d
the clu
s
ter h
ead node
mu
lti hop p
a
th,
avoid the
use
of lo
w en
ergy.
Thro
ugh th
e
Matlab si
mul
a
tion re
sult
s
sho
w
that, th
e algo
rithm
can furthe
r b
a
l
ance the
clu
s
te
r
head n
ode e
n
e
rgy co
nsum
ption, prolo
n
g
the network l
i
fe cycle.
LEACH
algo
ri
thm, node
s in
the cl
uste
r i
s
not tra
n
smitt
ed in
sin
g
le h
op mo
de d
a
ta to the
clu
s
ter
hea
d;
it is forwa
r
de
d thro
ugh
the
other
no
de
s
in the
clu
s
ter.
Refe
ren
c
e
p
r
opo
se
s
a m
u
lti
hop
clu
s
ter h
ead mo
del, u
s
ing th
e met
hod fro
m
bott
o
m to top, la
yer by layer t
o
gen
erate
e
a
ch
layer cl
uste
r
head, finally
get the net
work
WS
N a
multi-layer structure.
The o
b
jective
fun
c
t
i
o
n
based
on th
e
co
st of the
se
nso
r
n
e
two
r
k
desi
gn i
s
ana
lyzed
with th
e
refe
ren
c
e;
d
e
rive the
sing
le
hop
and
multi
hop
ra
nge, fi
nally propo
se
d a
routin
g
al
gorithm
for
si
ngle
hop
mult
i hop
hybri
d
, to
solve the net
work of "ene
rgy hot" proble
m
.
Mech
ani
sm i
n
the
LEACH ran
domly
sel
e
cts a
clu
s
te
r hea
d, did
no
t cont
rol th
e
numbe
r
of cluste
r hea
d. So it is like
l
y to appear in
a round h
a
s
only one or two cluste
r h
ead, or have
a
lot of clu
s
te
r
head
ca
se. If
the cl
uste
r h
e
ad is too
sma
ll, then the m
e
mbe
r
no
de
s
to the lon
g
p
a
t
h
and th
e
clu
s
ter
head
com
m
unicate the
clu
s
te
r h
ead
will
also receive a l
o
t of
node
informa
t
ion
and forwarde
d to the base
station. So to every node
would bu
rde
n
; if excessiv
e
clu
s
ter he
a
d
, it
will have
a n
ode a
nd a
b
a
se
station
communi
cati
o
n
much, re
d
u
ce
network
energy utiliza
t
ion
rate.
The TRAMA
proto
c
ol throu
gh co
nsultation to en
sure confli
ct free d
i
stribute
d
nod
es sen
d
data, to en
su
re data t
r
an
smissi
on n
e
twork
ha
s a hi
g
her
rate at th
e time of re
ceiving the en
ergy
con
s
um
ption.
Com
pared t
o
the
CSMA
mech
ani
sm
o
f
the se
nsor
netwo
rk MAC proto
c
ol
ba
sed
Evaluation Warning : The document was created with Spire.PDF for Python.
TELKOM
NIKA
ISSN:
2302-4
046
Con
s
tru
c
tion
Protocol of Wirele
ss Se
nso
r
Ne
twork Ba
sed o
n
Ce
ntralize
d
… (Shit
ao Yan)
5597
on T
R
AMA, realizes
data t
r
ansm
i
ssi
on colli
sion probability
higher
percentage
of sleep time and
lowe
r the bitmap. In addition, comp
ared
to other
prot
ocol
s for mult
ica
s
t and bro
adcast mod
e
, the
comm
uni
cati
on overh
ead
of TRAMA protocol i
s
also
less [7]. But there a
r
e so
me pro
b
lem
s
: th
e
proto
c
ol requ
ires
a larg
e storage
spa
c
e
to pres
erve t
he topolo
g
y informatio
n a
nd the neig
h
bor
sched
uling in
formation
within two h
o
p
s
; for any one t
i
me slot is
re
quire
d to cal
c
ulate the pri
o
rity
and running the AEA algori
t
hm all nei
ghbor nodes wit
h
in two hops.
Nod
e
s pe
rio
d
ically
sle
e
p
to redu
ce
i
d
le li
stenin
g
ene
rgy
co
n
s
umptio
n
ca
use
d
by
neigh
bori
ng n
ode
s; virtual clu
s
ter, so sle
ep sc
he
dulin
g time autom
atic syn
c
h
r
oni
zation; meth
o
d
s
using message passi
ng to reduce time
delay [8]. S-MAC
IEEE 802.11 is
still used in
similar way
to avoid
co
n
f
lict, inclu
d
in
g virtual
an
d phy
sical
carri
er
se
nsi
n
g an
d
RTS/CTS ex
cha
n
g
e
.
Compared wi
th IEEE 802.11, S-MAC
has the advant
ages of energy
saving, good ch
aracteri
stic,
and the tra
d
eoff betwee
n
energy and
delay und
er
f
l
ow conditio
n
s
. Ho
weve
r, each nod
e d
u
ty
cycle
is th
e
same, no
no
d
e
to le
ss en
e
r
gy to gi
ve
protection. In
a
dditi
on, ne
ed
further re
se
arch
virtual cl
uste
r techniq
ue;
syn
c
hroni
za
tion
sch
edul
e can
have
a bi
g imp
a
ct o
n
e
nergy
con
s
um
ption.
Wirel
e
ss se
n
s
or
net
work based
o
n
clu
s
terin
g
stru
ct
ure, b
a
sed o
n
the T
D
MA
(Energy-
awa
r
eT
DMA) and energy awa
r
e me
cha
n
ism of clu
s
t
e
r network M
A
C proto
c
ol. Acco
rdi
ng to the
function
al differen
c
e
s
, cl
uster network
consi
s
ts
of three ki
nd
s of n
ode
s: clu
s
ter
membe
r
no
d
e
s
(also called n
ode
s), the
cluster
hea
d n
ode an
d si
nk node [9]. Th
e node
's
stat
e is divide
d into
four kin
d
s: in
ductio
n
(Sen
sing
), forwa
r
ding
(Relayin
g), indu
ction and forwardi
ng (Sen
sing
and
Relayin
g
) a
n
d
ina
c
tive (In
a
ctive)
state. Inductio
n
st
ate nod
e is
resp
on
sible fo
r coll
ectin
g
d
a
ta
and tra
n
smitt
ed to neig
h
b
o
rs. T
he rece
iving node
se
nds th
e othe
r node
s forwa
r
ding
state d
a
ta
and send
s it to the next node. No
de
s in sen
s
in
g an
d forwa
r
di
ng
state nee
d to complete th
e
above two fu
nction
s.
In the T
R
AM
A proto
c
ol, i
n
order to
ada
pt to
chan
ge
s in n
ode
failu
re
or
nod
e in
cre
a
ses
the netwo
rk topology cau
s
ed by divid
i
ng time
into
alternatin
g, rand
om a
c
ce
ss
cycle
a
nd
sched
uling a
c
cess cycl
e. Ran
dom access cycle
an
d sch
edulin
g
acce
ss cy
cle
time slot
num
ber
depe
nding
o
n
the spe
c
ific ap
plication
.
Rand
om
a
c
cess cycle is
mainly used
for network
maintena
nce, such as the
new nod
e is add
ed, the
kno
w
n nod
e
failure topol
ogy cha
nge
s to
compl
e
t
e
in t
he ran
dom a
c
ce
ss
cy
cle.
This p
ape
r u
s
es Matla
b
to simulate th
e LEACH
- EE proto
c
ol, an
d LEACH, LEA
CH a
n
d
C protocols
are
comp
are
d
. Simulation
sce
na
ri
o
s
are as follo
ws:
890m × 8
5
0
m regi
on were
deploye
d
9
0
0
se
nsor no
de
s, ba
se
statio
n is lo
cate
d a
t
coo
r
di
nate
s
(6
5, 98
5), th
e initial
ene
rg
y
of node
s is 8
54, and the p
a
cket si
ze is
453. No
de
fro
m
the total energy dist
ributi
on, clu
s
ter he
ad
of netwo
rk
co
nsum
ption, the
netwo
rk
su
rvival numbe
r compa
r
e
d
L
EACH -
C an
d LEACH
- EE
proto
c
ol,
and
gives th
e e
r
ro
r ma
p diffe
re
nt time e
nerg
y
estimate
s
o
f
LEACH - E
E
proto
c
ol,
a
s
is
sho
w
n by Fig
u
re 1.
Figure 1. Co
mpari
s
o
n
Re
sults of Comp
ared
LEA
CH
- C and LEA
CH - EE Prot
ocol in
WSN
As you
ca
n see, the n
ode
LEACH EE
survival
rate is better than LEACH,
C and LEACH
proto
c
ol. The
50 se
nsor no
des, if you use the
LEACH
proto
c
ol to se
nd data, node
s lastin
g 403
s
netwo
rk all t
he de
ath; the
use of LEA
C
H -
C
prot
o
c
ol, i
s
the ti
me for 448
s after all
net
work
node
s are de
ad; and if the LEACH - EE
proto
c
ol, ti
me
until after 502 s in the net
work no
de
s they
all died.
Evaluation Warning : The document was created with Spire.PDF for Python.
ISSN: 23
02-4
046
TELKOM
NI
KA
Vol. 12, No. 7, July 201
4: 5591 – 55
98
5598
Modelin
g the
protocols a
n
d
other p
r
o
c
e
s
ses in
the p
r
ocess level i
s
usi
ng a finite state
machi
ne. F
o
r
any process
wa
s
simulate
d u
s
ing
t
he
C/C++ la
ngu
ag
e in finite
stat
e ma
chin
e
state
and tran
sitio
n
conditio
n
s.
The use
r
ca
n control t
he level of deta
il can meet simulation. Fin
i
te
state ma
chin
e with
standa
rd C/
C++ a
n
d
OPNET it
sel
f
provide
s
mo
re than
400 li
bra
r
y functio
n
s
con
s
titute the
core M
odel
er prog
rammi
n
g
. OPNET sa
ys this coll
ect
i
on for Proto
C lang
uage.
5. Conclusio
n
The
pap
er prop
oses co
nstru
c
tion protocol
of wi
reless sen
s
or netwo
rk b
a
s
ed o
n
centralized cl
usteri
ng ro
uting and time division
multi
p
lexing MAC
proto
c
ol. In data transmi
ssion
pha
se, the co
mmon no
de
s and the first layer of the cl
uster
hea
d communi
catio
n
mode a
nd the
same
LEACH, but after the
data a
c
qui
sit
i
on, fusio
n
is
compl
e
ted n
o
t
pack data
sent directly to
the ba
se
stati
on, but i
n
a
g
i
ven time
slot
is
se
nt
to the firs
t layer of the respec
tive c
l
us
ter head.
Secon
d
laye
r node
s
acco
rding to
ene
rg
y and di
stan
ce
s to
sele
ct
the next h
o
p
nod
e tran
smit
data, the cluster head until
the seco
nd l
a
yer or co
m
m
unicate wit
h
the base
station dire
ctly, the
se
con
d
layer
clu
s
ter he
ad
node
s after t
w
o times of
d
a
ta fusion, se
nding d
a
ta to the base stati
on.
De
sign
of MA
C p
r
oto
c
ol
s n
eed a
bal
an
ce bet
ween
va
riou
s p
r
op
erti
es, the
prope
rties
of
equilib
rium is often more i
m
porta
nt than individual
p
e
rform
a
n
c
e.
Becau
s
e it is not a balan
ced
agre
e
me
nt g
ood
perfo
rm
ance eve
n
i
n
the l
abo
rat
o
ry an
d it i
s
poo
r p
e
rfo
r
mance in
a
real
environ
ment. For exam
ple,
a deal if it too often tu
rn o
ff the wirele
ss tran
sceiver
saving, not o
n
ly
make th
e rea
l
-time and
rel
i
ability is affected, pa
cket loss retran
sm
issi
on cau
s
e
d
will influen
ce
the effect of
energy savin
g
. Wirele
ss sensor net
works for differe
nt applicatio
n
s
sh
ow different
prop
ertie
s
of
netwo
rks, M
A
C layer p
r
o
t
ocol
s
should
be ada
pted
to variou
s flow patte
rn
s
of
different appli
c
ation
s
.
Referen
ces
[1]
Demirko
l
I, Erso
y
C, Ala
g
o
z
F
.
MAC protocols for
w
i
relesss
ensor
net
w
o
rks: a s
u
rve
y
.
IEEE
Co
mmun
icati
o
ns Maga
z
i
ne
. 2
006; 44(
4): 115
-121.
[2]
W
e
i W
e
i , Pe
i
y
i
Shen,
Lia
ng Z
han
g, Hu
Xu, J
uan S
o
n
g
, W
e
nzhe
ng Z
h
an
g, W
e
i W
ang.
LE
ACH-Bas
e
d
Energ
y
-
C
ons
er
ved Improve
d
Protocol for W
S
Ns.
JDCTA
. 2012; 6(2
3
): 163
-171.
[3]
Z
hanp
ing
Li. W
i
reless
Sens
or
Net
w
orks for E
nerg
y
an
d Dist
ance-B
a
se
d L
EACH Cl
usteri
ng Al
gorit
hm.
IJACT
. 2012; 4(16): 279-
28
6.
[4] Z
heng
T
ao.
PMAC: An ada
ptive en
ergy-e
nicie
n
t MAC protoco
l
for W
i
reless Sens
or Netw
orks
.
Procee
din
g
s of
the 19th IEEE Internatio
na
l Parall
el a
nd Dist
r
ibute
d
Proces
sing S
y
mp
osiu
m. 2005
[5]
W
e
iming
Ya
ng
, Jian
Z
h
a
ng,
Jin
x
ia
ng
Pe
ng.
Mea
n
squ
a
re
Error Distorti
o
n C
o
mputati
o
n
Mod
e
l B
a
se
d
on W
i
r
e
less
S
ensor
Net
w
o
r
k
.
T
E
LKOMNIKA Indo
nes
ian
Journ
a
l
of El
e
c
trical E
ngi
ne
erin
g
. 20
12;
10(7): 17
23-
17
29.
[6]
Li Yua
n
y
u
an.
Energ
y
Efficie
n
t MAC Algori
t
hm base
d
on
Coll
isio
n Avoi
danc
e for W
i
reless Se
ns
o
r
Net
w
orks.
AISS
. 2012; 4(2
1
): 31-39.
[7]
Enji
an B
a
i,
Xueq
in Ji
an
g.
A D
y
nam
ic K
e
y
Man
a
g
e
me
nt Schem
e B
a
sed
on S
e
cr
et Shari
ng f
o
r
Hierarc
hic
a
l Wireless Se
nsor
Net
w
orks.
T
E
L
K
OMNIKA Indones
ian Jo
urn
a
l of Electrica
l
Engi
neer
in
g
.
201
3; 11(3): 15
14-1
523.
[8]
Jong
w
o
n
Ch
oe
, Jun
Xu. En
er
g
y
Bal
anci
ng
L
EACH for W
i
re
less Se
nsor N
e
t
w
o
r
ks.
IJIIP
. 201
2;
3(2)
:
56-6
5
.
[9]
Hao Su
n, Yon
g
rui C
hen, Bi
n
hua W
a
n
g
, W
e
ido
ng Yi. D
y
n
a
m
ic Cou
n
t: An Energ
y
-Effici
en
t Mechanism
for W
S
N MAC
Protocol.
IJACT
. 2013; 5(3): 745-
755.
Evaluation Warning : The document was created with Spire.PDF for Python.