TELKOM
NIKA Indonesia
n
Journal of
Electrical En
gineering
Vol. 12, No. 10, Octobe
r 20
14, pp. 7495
~ 750
0
DOI: 10.115
9
1
/telkomni
ka.
v
12i8.560
8
7495
Re
cei
v
ed
Jan
uary 8, 2014;
Re
vised July
27, 2014; Accepted Augu
st
20, 2014
One Kind of Routing Algorithm Modified in Wireless
Sensor Network
Nini Wei*, Yi
Song
Dep
a
rtment of computer sci
en
ce& Informatio
n
Engi
ne
erin
g, W
uhan Bi
oe
ngi
neer
ing Institut
e,
W
uhan 4
3
0
415
, China
*Corres
p
o
ndi
n
g
author, e-ma
i
l
:
w
n
n1
98
210
2
4
@1
63.com
A
b
st
r
a
ct
T
he w
i
reless sensor n
e
tw
orks are the emer
gin
g
next gen
eratio
n se
nsor netw
o
rks, Routi
n
g
techno
lo
gy is the w
i
rel
e
ss se
nsor n
e
tw
ork communic
a
tio
n
layer
of the co
re techn
o
lo
gy.
T
o
bui
ld re
lia
bl
e
paths i
n
w
i
rel
e
ss sens
or n
e
t
w
o
rks, w
e
can cons
id
er
tw
o w
a
ys: provi
d
in
g
mult
i
p
l
e
paths utili
z
i
ng
th
e
redu
nda
ncy to
assure the co
mmu
n
icati
on r
e
lia
bi
lity or
co
nstructing tran
smiss
i
on r
e
li
ab
ility mech
anis
m
t
o
assure th
e reli
abil
i
ty of ever
y hop. Brai
d
mu
ltip
ath
al
gor
ithm and ReIn
forM
routing a
l
gorit
hm are
t
h
e
reali
z
a
t
io
ns of
these tw
o
mec
han
is
ms. After the
an
al
ysis
o
f
these tw
o
alg
o
rith
ms, this
p
aper
pro
pos
es
a
ReInforM routi
ng al
gorith
m
b
a
sed br
aid
mu
l
t
ipath routi
ng a
l
gorit
hm.
Ke
y
w
ords
:
w
i
reless se
nsor n
e
tw
ork
,
routing protoco
l
, braid
mu
lt
ip
ath, ReIn
forM routing
Co
p
y
rig
h
t
©
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
Wirel
e
ss
se
n
s
or net
works are th
e em
e
r
ging
next ge
neratio
n n
e
tworks,
whi
c
h d
e
velop
on the ba
si
s of the new netwo
rk in
the digita
l c
i
r
c
uit
r
y, w
i
r
e
less
communic
a
tions
,
micr
o-
electrome
c
h
a
n
ical
system
s and oth
e
r te
chn
o
logie
s
h
a
s b
e
come a
hot re
sea
r
ch
field.Hun
d
re
ds
of low co
st, low po
we
r,
small size, multi-functio
nal
sensor
no
d
e
s in se
nsor networks, in the
military
and
national defe
n
se, enviro
n
m
ental
mo
nitoring, biome
d
ical, sma
r
t home
s
,
re
mo
te
monitori
ng a
nd othe
r d
a
ngerou
s a
r
e
a
s of th
e region
ha
s p
o
tentialu
se v
a
lue a
nd b
r
oad
appli
c
ation p
r
osp
e
ct
s [1].
For
m
any sensor netwo
rk appli
c
atio
ns with
hi
g
h
reli
ability
of data tran
smissio
n
requi
rem
ents,
its impl
emen
tation dep
en
ds m
a
inly
o
n
the
route ch
ose
n
an
d reli
able, so relia
ble
routing
proto
c
ol i
s
p
a
rticul
arly
impo
rtant
.Wirele
s
s
sen
s
or net
work
routing te
chn
o
l
ogy is th
e co
re
techn
o
logy o
f
communi
ca
tions layer [
2
-3]. Re
spo
n
s
ible for rou
t
ing proto
c
ol
data packe
ts
transmitted from the
source no
de to
de
stination n
ode
throug
h the
n
e
twork to a
c
h
i
eve in th
e
si
nk
node a
nd sen
s
or n
ode
s tra
n
smit data rel
i
ably.
2. Sensor Ne
t
w
o
r
k Arc
h
itectur
e
Wirel
e
ss sen
s
or n
e
two
r
k i
s
deploye
d
in
the monitorin
g
area by the
large num
be
r of low
-
co
st micro se
nso
r
nod
es,
whi
c
h is the formatio
n of a multi-ho
p ad hoc n
e
two
r
ks through
wirel
e
ss
comm
uni
cati
on.Sensor
n
e
tworks is t
he integ
r
atio
n of monito
ring, control
and
wirel
e
ss
comm
uni
cat
i
on n
e
t
w
o
r
k
s
y
s
t
e
m,
it
s
st
r
u
ct
ur
e i
s
s
h
o
w
n i
n
Fi
gure
1, se
nsor net
work con
s
ist
s
of
sen
s
o
r
node
s, ag
gregatio
n no
de
s, task m
ana
geme
n
t nod
es an
d othe
r
com
pone
nts.Sen
s
o
r
node
s
depl
oyed in
the
de
si
gnated
mo
nitoring
a
r
ea,
th
e sen
s
o
r
n
o
d
e
s to
mo
nitor the
data
alo
ng
to other se
n
s
or n
ode
s h
op by hop transmi
ssion,
tran
smi
ssi
on of monitoring
data in multiple
node
s ca
n b
e
handle
d
through the mul
t
i-hop ro
uting
to the sink node after, an
d finally through
the Interneta
nd satellite to rea
c
h m
a
n
ageme
n
t nod
e, the use
r
t
h
rou
gh the
manag
eme
n
t node
sen
s
o
r
netwo
rk configu
r
ati
on and man
a
gement, rele
ase
s
monito
ri
ng mission a
nd the colle
ct
ion
of monitorin
g
data.
Wirel
e
ss
se
n
s
or net
work
h
a
s th
e follo
wi
ng
ch
a
r
a
c
teri
stics: de
nse, and the
large
numb
e
r
of nod
es; the
location of
sensor
nod
es i
s
b
a
si
ca
lly fixed; du
e to th
eir o
w
n
environmental
imp
a
ct
of ene
rgy de
pletion a
nd p
r
one
to failure nod
e;
envi
r
onm
ental int
e
rferen
ce a
n
d
nod
e failu
res
likely to
cau
s
e chan
ge
s in
network top
o
logy;
sen
s
or nod
e en
ergy, pro
c
e
ssi
ng
power,
stora
g
e
Evaluation Warning : The document was created with Spire.PDF for Python.
ISSN: 23
02-4
046
TELKOM
NI
KA
Vol. 12, No. 10, Octobe
r 2014: 749
5
– 7500
7496
cap
a
city a
n
d
co
mmuni
cati
on b
and
widt
h a
r
e ve
ry li
mited.Wirele
ss
sen
s
o
r
net
works fo
r th
ese
cha
r
a
c
teri
stics, the net
work prot
ocol mu
st be a
b
le to
efficiently
use
energy and t
he lo
cal net
work
informatio
n to be able to choo
se the rig
h
t based o
n
the path.Thi
s
article d
o
e
s
not interse
c
t the
path ba
sed o
n
multi-path routing me
cha
n
ism
de
scri
b
ed, and put fo
rwa
r
d thei
r views.
Figure 1. The
Netwo
r
k Stru
cture
3. Multi-path
Based o
n
th
e ReInforM
Winding Ro
ute
3.1. Multi-path Routin
g Mechanism fo
r Winding
In sensor networks, the int
r
oduction
of
multi-
path
routing is to incr
ease the reli
ability of
data tra
n
smission
and
impl
ementation
of
netwo
rk
loa
d
balan
cin
g
.In
the multi-p
a
th
routin
g, how
to create
a d
a
ta source
no
de to
sin
k
n
o
de of the
mu
l
t
iple path
s
i
s
a pri
o
rity.In di
recte
d
diffu
si
on,
data q
uery
when
ne
ce
ssary, the sin
k
no
de to fo
rm
th
e first tran
smi
ssi
on
of info
rmation th
rou
gh
the floodin
g
g
r
adie
n
t of inte
rest, a
nd the
n
create
a
data
sou
r
ce n
ode
to sin
k
n
ode
multiple pat
h
s
,
and finally th
rough th
e pat
h of strength
ening th
e info
rmation to
select a
prim
ary
path to tran
smit
data.Wh
en th
e prima
r
y pat
h fails, the di
recte
d
di
ffusi
on ro
uting ne
ed to use the
perio
dic, lo
w-
rate floodin
g
pro
c
e
ss to re
stabli
s
h the p
r
imary path.
Propo
se
d a
multi-path
ro
uting me
cha
n
i
sm that
pre-establi
s
hm
en
t and mainte
n
ance of a
path, do
not
need
pe
riodi
c floodin
g
to
b
e
abl
e to
re
cover th
e d
a
ta
so
urce
nod
e
to si
nk no
de
of
the tran
smi
s
sion path [3].
The ba
si
c ide
a
is :First, bui
ld from the
d
a
ta so
urce to
the sin
k
n
o
d
e
of
the main path
,
and then create a numb
e
r of alter
nat
e paths; data
transmissio
n throug
h the main
path, while lo
w-spe
ed data
transmi
ssion
using alte
rna
t
e path to maintain the effectivene
ss of th
e
path; Whe
n
the prim
ary p
a
th fails .Wh
en the pat
h f
r
om the alte
rnate path
sel
e
cted a
s
the
new
sub
-
optim
al p
a
th.
For the
est
a
blishm
ent of
multiple p
a
ths m
e
thod [
3
] pro
p
o
s
ed
a multi-p
a
th
disjoi
nt
(disj
o
int multi
path) a
nd wo
und multi-pat
h (braid mu
lti
path) two alg
o
rithm
s
is di
sjoint from th
e
sou
r
ce n
ode
to de
stinatio
n no
de
of an
y two p
a
thsn
ode
s d
o
n
o
t
intersect.Buil
d
process: first
throug
h the main path of conve
r
ge
nce node en
han
c
ed informatio
n to establish
the primary
path;
and then
sen
d
the se
cond
best path to enha
nce t
he informatio
n to sub-optimal
node A, node
A
and then
ch
o
o
se th
eir o
w
n optimal no
de B, the se
con
d
-b
est p
a
t
h to enhan
ce the inform
a
t
ion
passed on.If the prim
ary path B,
B sends back information to
enhance the negativ
e A, A node to
the seco
nd
-b
est
se
cond
-b
est p
a
th to e
nhan
ce i
n
formation tra
n
sf
er; if B is no
t the main
p
a
th,
then the
B
sub
-
optim
al
path to
pa
ss on i
n
crea
se
d information
,
until the
constructio
n
o
f
a
se
con
doptim
al path, a
c
cording to the
sa
me metho
d
s,
It may contin
ue to
con
s
tru
c
t a
sub
-
opti
m
al
path to the ne
xt.
In disjoint mu
ltipath, the alternate p
a
th
may be much
longer than t
he main path
,
for the
introduction of spiral m
u
lti-path (braid
multipat
h) co
nce
p
t.Multi-p
ath wi
nding
path to
overcome
the main pro
b
lem of singl
e node failure.The win
d
in
g path is the ideal multi-wi
nding path by
the
formation of
a gro
up.A wi
nding p
a
th that corre
s
po
n
d
s to a no
de
on the main
path, not incl
uding
the nod
es in
the net
wo
rk, the form
ation of th
e
so
urce n
ode
to
de
stination
node f
r
om t
he
optimize
d
ba
ckup path.
Wi
nding p
a
th as the prima
r
y path of a backup p
a
th.The
main path, e
a
ch
node
ha
s
a
correspon
ding
win
d
ing
path
,
whi
c
h
co
nsti
tutes a
wi
ndi
ng p
a
th from
the sou
r
ce n
o
de
to de
stinatio
n no
de
more than
the
windi
ng
path
.
Obviously, su
ch an alternate
path
by
intersec
ting with the main path.
Evaluation Warning : The document was created with Spire.PDF for Python.
TELKOM
NIKA
ISSN:
2302-4
046
One Kind of
Routin
g Algorithm
Modified in Wirele
ss Sensor Netwo
r
k (Nini Wei
)
7497
In ideal
wi
nd
ing p
a
th, the
nod
es ne
ed
to
kno
w
th
e
glob
al n
e
twork top
o
logy.
A lo
cal
multi-path
ge
neratio
n al
go
rithm
windi
ng
as follo
ws:
the e
s
tabli
s
h
m
ent of th
e
main p
a
th, t
he
prima
r
y path for each nod
e (exce
p
t the source n
ode
and the nod
es ne
ar the source
) sh
ould
be
enha
nced alternate p
a
th to sen
d
information
to their su
b-optim
al node (den
oted as A), the
se
con
d
best
again to find
the optimal node no
de
(denote
d
as
B) increa
sed
disseminatio
n of
information on the alternat
e path.If the node B i
s
not
the main path,It will continue to spread
its
optimal nod
e, until the interse
c
tion with t
he main path
to a new ba
ckup p
a
th.
In the two m
u
lti-path
gen
eration
alg
o
ri
thm, t
he alte
rnate p
a
ths h
a
ve differe
nt
prio
rities.
Whe
n
the p
r
i
m
ary path fail
s, the second
best p
a
th wil
l
be a
c
tivated
to become t
he ne
w p
r
ima
r
y
path.
3.2. ReInFor
M the Ro
utin
g Mechanis
m
In the
sen
s
o
r
network,
sen
s
or no
de
s i
s
t
he d
a
ta
sou
r
ce, the m
onito
ring
data
se
nt to the
sin
k
n
ode.
Re
InForM
(Relia
ble Informatio
n Fo
rwardi
ng
Using
Multipl
e
Path
s)
ro
ute sta
r
ting
fro
m
the data so
urce no
de, co
n
s
ide
r
the reli
a
b
ility,
quality
of commu
nication and
sen
s
or
node to
si
nk
node ho
p co
unt to determine the nu
mber of re
qu
ired tra
n
smi
s
sion p
a
th, and the numbe
r of
node
s a
nd the corre
s
pon
ding n
e
xt hop nod
eto achi
eve data transmi
ssion t
o
meet relia
bility
requi
rem
ents.
ReInFo
rM b
a
si
c pro
c
e
ss route [4-5]
is: First, the data so
u
r
ce n
ode b
a
se
d on
transmissio
n reliability re
q
u
irem
ents n
e
eded to ca
lculate the nu
mber of tra
n
s
missio
n pat
hs;
Then, sel
e
ct
the numbe
r of node ne
ighbo
rs a
s
the next hop
node, and
to each n
o
d
e
in
accordan
ce
with the app
ortionm
ent of the number
of paths, and
finally,
the data path sou
r
ce
node n
u
mb
er will be a
ssi
g
ned a
s
a fiel
d in a hea
der sent to neig
hbor
nod
es.
N
eighb
or no
de
to
the data sou
r
ce nod
e re
cei
v
es data, the data t
hemsel
v
es as the so
urce nod
e, re
peat the above
data so
urce n
ode ro
uting p
r
oces
s.ReInF
o
rM protocol descri
bed
in
detail belo
w
to achi
eve.
In ReInForM
routing, defines a reliab
ility param
eters, with
a positive number
s
r
indicate
s
less than
on
e. The a
r
gu
ment that the
system
req
u
i
reme
nts for t
he data
so
urce to
sen
d
d
a
ta
packet
s
to th
e sin
k
no
de
prob
ability of su
cc
ess.Each node
kn
ows its nei
ghb
o
r
nod
es to th
e
cha
nnel quali
t
y,
using
the cha
nnel error
rate
s
e
that is l
e
ss than
on
e
positive. Su
ppo
se e
a
ch
node to all ne
ighbo
rs of qu
ality is the sa
me.
Senso
r
no
de
s thro
ugh the
following m
e
cha
n
ism
s
to the sin
k
n
ode
kno
w
s the nu
mber of
hop
s h
s
: the
sin
k
n
ode
pe
riodically broa
dca
s
t
r
outing
update
s
, whi
c
h
in
clud
es
a numbe
r of
ho
ps
to
the sin
k
no
de
d
o
main,
n
ode ro
uting u
pdate
i
n
fo
rm
a
t
ion, the i
n
formation i
n
the
numbe
r
of h
o
p
s
to the sink n
o
de.
Acco
rdi
ng to the data so
urce no
de
s
r
、
s
e
an
d
s
h
three parameters
，
we ne
ed to decid
e
how m
any paths to forward data
packets to ensure reliability.As
s
e
to a link
error rate, for the
data so
urce
node, After
s
h
the jump node packet arri
va
l probability of convergence
(1-
)
s
h
s
e
,After p after the packet path can not re
ach the probability of convergence node
[ 1
-
(1
-
)
]
s
h
p
s
e
,
so the
su
cce
ss
of the sou
r
ce
nod
e ne
e
d
sn
umbe
r
of transmissio
n path
p can b
e
cal
c
ul
ated b
y
the followin
g
formul
a:
lg
(
1
)
p(
)
=
lg
(
1
1
-
(
1
-
)
)
s
s
ss
s
h
s
r
r,
e,
h
e
(
1
)
Note: Th
e foll
owin
g form
ul
a, P rep
r
e
s
e
n
ts the
sou
r
ce of all n
ode
s requi
red th
e num
ber
of su
ccessful
tran
smissio
n
path;
s
r
re
pre
s
e
n
ts the
syste
m
req
u
ireme
n
ts for the d
a
ta so
urce t
o
send data packets to the
si
nk node
probabilit
y of
success;
s
e
rep
r
e
s
ents th
e
cha
n
nel e
r
ror
rate;
s
h
rep
r
e
s
ent
s the said h
e
hop
s to the sin
k
node of the
s
h
.
If p is greate
r
than the nu
mber of success
ful data transmi
ssion p
a
th to the neighbo
r
data so
urce
node n
u
mbe
r
, you need to
send m
u
ltipl
e
copi
es of
some neig
hbo
rs to copy dat
a to
meet the relia
bility require
ments.
Evaluation Warning : The document was created with Spire.PDF for Python.
ISSN: 23
02-4
046
TELKOM
NI
KA
Vol. 12, No. 10, Octobe
r 2014: 749
5
– 7500
7498
Data
sou
r
ce
node
nee
ds t
o
cal
c
ul
ate th
e num
ber of forwarding
pat
h after
sele
cti
ng the
next hop
nei
ghbo
r n
ode
s,
and
a
ssi
gn
the ap
pro
p
ri
a
t
e path fo
rwa
r
d.Acco
rding
to a
sin
k
n
o
d
e
hop
s, the
so
urce n
ode to
neigh
bor
nod
es into
thre
e
categ
o
rie
s
[6]
:
with their h
ops to
the
sa
me
clu
s
ter
nod
e, the n
ode, th
an thei
r le
ss
numbe
r
of
ho
ps to
the
sin
k
n
ode
on
e,
node,
and
to
the
sin
k
no
de tha
n
theirm
ore
than o
ne n
o
d
e
.These thre
e nod
es
we
re
use
d
. First, sele
ct the
so
urce
node
of a ne
xt hop nod
e
as the
defaul
t, the defaul
t next hop to
forwa
r
d
data
prob
ability da
ta
node i
s
one.
Since the
so
urce no
de to the defaul
t n
e
xt hop node
send
s a
su
cce
ss
rate of the
data, this pat
h is equivalent to the success of
Article forwarding path.If
greater than
or equal
to
the Equ
a
tion
(1) calculated
the
numb
e
r
of path
s
, indi
cating
that th
e sou
r
ce n
o
d
e
only
nee
d t
o
default the n
e
xt hop nod
e
can forwa
r
d
data to mee
t
the reliabilit
y requireme
n
t
s. Otherwise
,
i
t
requi
re
s ad
ditional forwa
r
di
ng nod
es req
u
ired n
u
mb
er of additional
paths:
lg
(
1
)
p(
)
=
(
1
)
lg
(
1
1
-
(
1
-
)
)
h
s
s
s
ss
s
s
r
r,
e
,
h
e
e
(
2
)
First
sele
ct
addition
al no
des from the
path of the
H
－
, Only wh
en
the value of
p is
cal
c
ulate
d
greater th
an th
e numb
e
r
of node
s
H
－
in time acco
rdan
ce
with the fo
rm
ula (2
), ne
ed
to
sele
ct
no
de
s
f
r
om
0
H
; If the p value is grea
ter than th
e sum of the n
u
m
ber
of nod
e
s
H
－
an
d
0
H
,At this point
need
to
sele
ct node
s from
H
＋
. Each
no
de i
n
the
coll
ecti
on h
a
ve b
e
e
n
sele
cted
as
the source
n
ode to
create
a
ce
rtain n
u
m
ber of p
a
th
s, To
en
su
re
that the
pat
h of all
sele
cted
node
s to prov
ide the sum o
f
p.
Use
H
p
,
0
H
p
,
H
p
set
t
hat
colle
ct
ion
H
－
，
0
H
，
H
＋
,
was s
e
l
e
ct
ed a
s
the next ho
p
node
nee
d to
create
a
n
u
m
ber of path
s
the
source
node,
Set
H
－
,
0
H
,
H
＋
, in the
orde
r of sel
e
cted node
s
H
N
,
H
N
,
0
H
N
,
There have the formul
a (3
).
H
N
.
H
p
+
0
H
N
.
0
H
p
+
H
N
.
H
p
=
p
(
3
)
Acco
rdi
ng to the followi
ng
Propo
rtion wit
h
H
p
,
0
H
p
,
H
p
:
0
2
1-
(
1
-
)
HH
H
ss
pp
p
ee
(
4
)
Selec
t
0
H
or
H
＋
nod
e as th
e next
hop n
ode;
ra
ther tha
n
re
p
eat the sele
ction
H
－
node
s in o
r
de
r
to maintain the balanc
e
network
load.
For
example,
in the
H
－
have si
x
node
s,
0
H
have the
num
ber of no
de
s i
s
t
here,
source
node
ne
ed
s
an a
ddition
al
num
ber of
p
a
ths
p=6
。
Su
ppo
se th
e
ch
annel
erro
r
rate
s
e
=
1
/2, S
o
a
node
in
H
－
as th
e defa
u
lt n
e
xt hop
n
ode, th
e remaini
ng fi
ve nod
es in
H
0
and a
n
ode
in t
he p
a
th
of the next hop a
s
an a
dditional n
o
d
e
, in accord
ance with th
e formula
(3) and form
ula
(4)
cal
c
ulate
d
:
H
p
=1
2/11
，
0
H
p
=6/11.
The numb
e
r
of paths as th
e head of a param
eter dat
a packet se
nt to the next hop node.
If the next h
op nod
e re
ceives the p
a
th to great
e
r
than one, th
e alway
s
forward data; If you
receive a n
u
m
ber
of path
s
is l
e
ss tha
n
one, a
nd t
he num
be
r of
paths i
n
a
c
corda
n
ce with
the
same
proba
bi
lity of forwa
r
d
i
ng data. So
u
r
ce
no
de
s to
sen
d
the d
a
ta
packet
s
in th
e hea
d with
H
p
，
s
e
，
the
s
e th
re
e pa
ramete
rs. Neigh
b
o
r
no
de I receive
d
packet, in
accordan
ce
wit
h
the p
a
th to
deci
de whether the probability of
the same numbe
r of forward packets.If
it is determined to
forwa
r
d the
p
a
cket, the no
de i itself a
s
the so
urce
n
o
de, and in a
c
cordan
ce
wit
h
the formul
a
(1).
Use thei
r o
w
n
i
r
，
i
e
and
i
h
re
cal
c
ul
ate the
numb
e
r of t
r
an
smi
s
sion
path
s
re
quire
d.He
re
i
r
n
ode
i is de
signate
d
to ensure t
he reli
ability of node
s re
calcul
ate the reliability value, in accorda
n
ce
with the follo
wing formula:
1
11
-
(
1
-
)
s
H
h
s
P
e
=
1-
(
）
i
r
(
5
)
Evaluation Warning : The document was created with Spire.PDF for Python.
TELKOM
NIKA
ISSN:
2302-4
046
One Kind of
Routin
g Algorithm
Modified in Wirele
ss Sensor Netwo
r
k (Nini Wei
)
7499
The
1
(1-
)
s
h
s
e
mean
s
succe
ssful
tra
n
smi
ssi
on f
r
o
m
nod
e i
sai
d
data
pa
cke
t
to the
sin
k
node
p
r
oba
bil
i
ty,
s
1
1 1
-
(
1
-
)
H
h
s
P
e
－
（）
. That
pat
h p
from
all
o
f
the
su
ccessful tran
smi
ssi
on of
data
can not be g
r
oup
ed into the pro
bability
of conv
erg
e
n
ce no
de. Node i with the sou
r
ce nod
es
usin
g the sa
me method t
o
cho
o
se the
i
r next hop
n
ode. Thi
s
pro
c
e
ss
contin
u
e
s until the
sink
node h
a
s be
en rea
c
h
ed.B
e
ca
use every
step of t
he sou
r
ce nod
e are gu
arante
ed tran
smi
ssi
on
reliability requirem
ents, the ent
ire transfer proc
ess to ensure reliability of data transmission
requi
rem
ents.
3.3. Multi-path Algorithm
to Improv
e t
h
e Winding
3.1 an
d 3.2 f
r
om the
detail
ed d
e
scri
ptio
n can
b
e
see
n
:
many wind
ing
p
a
ths and
disj
oint
multipath co
mpared to th
e advantag
e
of redu
cin
g
the length
of the alternate
paths to imp
r
ove
the efficiency
of data transmissi
on, but t
he
reliab
ility i
s
decreased.For
more
winding
path, if t
he
prima
r
y path
and alte
rnat
e path exi
s
ts for a cert
ai
n peri
od of i
n
tersectin
g
p
a
ths, when t
he
intersectin
g
p
a
ths fail
s, after thei
r main
path and
alte
rnate p
a
th wi
ll fail, if all paths have b
e
e
n
intersectin
g
with a path,
andthi
s sid
e
of the pat
h fa
ils, the tran
smissi
on
will b
e
termin
ated,
onl
y
to re
-e
stabli
s
h a
go
od
net
work until th
e ne
w pr
im
ary path
and
al
ternate
path
can
continu
e
to
transmit data.
Ho
weve
r, disjoint multipat
h algo
rithm, d
a
ta tran
smi
ssion failu
re o
c
curs
only in t
he
main p
a
th an
d a n
u
mbe
r
o
f
alternate
pa
ths at the
sa
me time fail
s. ReInF
o
rM
ro
uting me
ch
an
ism
has th
e a
d
va
ntage of th
e
quality of co
mmuni
cation
cha
nnel th
ro
u
gh the t
r
an
smissi
on
path
and
the path
cal
c
ulation of the
numbe
r di
stribution,
imp
r
o
v
e the relia
bil
i
ty of data transmi
ssi
on a
n
d
netwo
rk loa
d
bala
n
ci
ng, t
he e
nergy
li
mited by
sh
ortco
m
ing
s
i
n
the fa
ce
o
f
su
ch
a
rou
t
ing
mechani
sm f
o
r
sensor networks to
P path whil
e transmissi
on, energy
will be costly. Therefore, it
can i
m
prove
the way
we propo
se a
route
and wou
nd ReIn
ForM and combine multi
-
path
algorith
m
: multi-path ba
sed
on the ReInf
o
rM wi
ndin
g
route, spe
c
ifically describ
ed
as follows:
(1)
The first to use multi
-
pa
ss al
gorith
m
windi
ng agg
regation no
de
and betwe
e
n
the
sou
r
ce nod
e n be a main p
a
th and altern
ate paths.
(2)
Set up
s
r
＝
1
，
s
e
＝
0
，
Pr
imar
y pa
th
u
s
ed
fo
r data trans
m
ission.
(3) Whe
n
the pri
m
ary path fails, data tran
smissi
on u
s
ing
ReInFo
rM ro
uting,set up
s
r
The
reliability of the system parameter values them
selves,
s
e
The ch
ann
el error rate,
At the same t
i
me, by p
r
iorit
y
level of the
n ba
r,
choo
se an
alternat
e path
a
s
a
n
e
w
path
con
n
e
c
ting t
he main
pat
h, if there is no such
pat
h, you nee
d
to use
(1
) to
re-esta
b
lish
th
e
prima
r
y path and alternate
path, and ru
n
(2) ste
p
.
4. Conclusio
n
In this pape
r, two multi-pa
th routing al
g
o
rithm and
ReInforM de
scribed a
nd an
alyzed,
and o
n
this
basi
s
, con
s
id
ering th
e a
d
vantage
s
a
nd
disa
dvantag
e
s
of ea
ch
propo
sed
a mu
lti-
windi
ng path
ReInforM ba
sed ro
uting me
cha
n
ism, th
i
s
improve
d
use
of woun
d mu
lti-path ro
utin
g
mech
ani
sm a
l
gorithm
for e
s
tabli
s
hin
g
a
prima
r
y
path
and a
n
u
mbe
r
of altern
ate paths, wh
en
t
h
e
main path in
a norm
a
l stat
e, only one main path u
s
ed
for data tran
smissio
n
, mo
re than ReInforM
multi-path
rou
t
ing algorith
m
to transfe
r d
a
ta at
the sa
me time save
a lot of energy, which e
n
e
rgy
Shou
se
nsor network i
s
very limit
ed
sense. Fail
ure
at the
mai
n
path
ro
uting
to tra
n
sfe
r
d
a
ta
using ReInforM ensure the
reliabilit
y of wireless
sensor networks.
Ackn
o
w
l
e
dg
ements
This p
ape
r i
s
supp
orted
by National
Natural Sci
ence Fou
n
d
a
tion of Chi
na (No.
6067
2137
) a
nd New
Ce
ntury Excelle
nt Talent
s
F
ound
ation (NCET-0
8
-080
6
)
and
Wu
h
a
n
Educatio
n Project
s
Foun
d
a
tion (No.200
9K100
)
Referen
ces
[1]
Cui L
i
, Ju Hai
l
i
ng. Progress
in
w
i
r
e
l
e
ss sens
or net
w
o
rks.
C
o
mputer R
e
se
arch an
d Dev
e
l
o
p
m
e
n
t
. 2005
;
(1): 163-1
74.
Evaluation Warning : The document was created with Spire.PDF for Python.
ISSN: 23
02-4
046
TELKOM
NI
KA
Vol. 12, No. 10, Octobe
r 2014: 749
5
– 7500
7500
[2]
Yapi
ng LI.Ana
l
y
ze
and Imp
l
e
m
entatio
n of
a
Ne
w
R
oute Pr
otocol Bas
ed
o
n
MSAODV.
Microcom
puter
Information
. 2
0
07; (8-2): 225-
22
[3]
Qiang
li Z
h
a
o
, Ming
Xu. A
nal
ysis and
Comp
a
r
ison of R
outi
n
g Protoco
l
s for
W
i
reless Se
ns
or.
Networks
Co
mp
uter Scie
nce.
200
9; 2(3
6
): 35-41.
[4]
DY Z
hang, GQ Ji. Researc
h
on DSR-B
a
sed Ener
g
y
R
outin
g Protoco
l
s for Ad Hoc
Net
w
o
r
ks.
Co
mp
uter T
e
chno
logy
and D
e
vel
o
p
m
e
n
t
. 2009; 19(
8): 15-
19.
[5]
CX W
u
, LZ
S
ong, JB W
a
n
g
. DSR Proto
c
olBas
ed o
n
Con
gestio
n
C
ontrol a
nd E
n
erg
y
Bal
anc
e
Strateg
y
. C
ontr
o
l Eng
i
ne
eri
ng
of
Chin
a. 201
0; 17(2): 260-
26
3.
[6]
Ahmad S, A
w
an I, Waqqas A, et al.
Per
f
orma
nce
an
al
ysis of
DSR&
exten
d
e
d
DS
R pr
otocol
s
.
Proc.Kual
a Lu
mpur: the Seco
nd Asia Inter
n
a
t
iona
lCo
nfere
n
c
e on Mod
e
li
ng
& Simulati
on. 2
008.
Evaluation Warning : The document was created with Spire.PDF for Python.