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
,
D
ece
m
ber
201
8
, pp.
4366
~
43
73
IS
S
N:
20
88
-
8708
,
DOI:
10
.11
591/
ijece
.
v
8
i
6
.
pp
4366
-
43
73
4366
Journ
al h
om
e
page
:
http:
//
ia
es
core
.c
om/
journa
ls
/i
ndex.
ph
p/IJECE
RMEER:
Reliabl
e
Multi
-
path Energ
y Efficient
Ro
utin
g
Protoc
ol fo
r Und
erwate
r
Wireles
s
Sensor
Network
Mukhti
ar Ah
med
1
,
M
az
le
ena Salle
h
2
,
M
Ibra
him
Cha
n
na
3
, M
oh
d
F
oad
R
ohani
4
1,2
,4
Facul
t
y
of
C
om
puti
ng,
Dep
ar
tment
of
Com
pu
te
r
Sc
ie
nc
e, Uni
ver
sit
y
Te
chn
olo
g
y
Malay
si
a
,
Ma
lay
s
ia
3
Facul
t
y
of
Sci
e
nce
,
Depa
r
tment
of
Inform
ation
Te
chno
log
y
,
Quaid
-
e
-
Aw
am Uni
ver
sit
y
Nawabsh
ah
Sindh,
Pakist
an
Art
ic
le
In
f
o
ABSTR
A
CT
Art
ic
le
history:
Re
cei
ved
Oct
5
, 2
01
7
Re
vised
Jan
17
, 201
8
Accepte
d
Ja
n 3
1
, 2
01
8
Underwat
er
W
i
rel
ess
Sensor
Networks
(UWSN
s)
is
int
ere
sting
area
for
rese
arc
h
ers
.
To
ext
ra
ct
the
infor
m
at
ion
from
sea
bed
to
wa
te
r
sur
fac
e
the
the
m
aj
ority
num
be
rs
of
routi
ng
protoc
ols
has
be
e
n
int
roduc
ed
.
T
he
design
of
routi
ng
protoc
o
l
s
fac
es
m
an
y
c
hal
l
enge
s
li
ke
d
epl
o
y
m
ent
of
se
nsor
nodes,
cont
rolling
of
node
m
obil
ity
,
deve
lopment
of
eff
icient
ro
ute
for
data
forwardi
ng,
prol
ong
the
batter
y
power
o
f
the
se
nsor
nodes,
and
removal
of
void
nodes
from
active
da
ta
for
wardi
ng
pa
ths.
Thi
s
rese
arc
h
ar
ti
cle
fo
cuse
s
the
design
of
t
he
Rel
i
able
Multi
pa
th
Ene
r
g
y
Eff
icient
Rou
ti
n
g
(RMEER)
which
dev
el
ops
the
e
fficie
nt
rou
te
be
twee
n
sensor
nodes,
and
p
rolongs
the
b
at
t
er
y
l
ife
of
t
he
nodes.
RME
ER
is
a
sca
la
b
le
and
robust
prot
ocol
whi
ch
uti
lizes
the
pow
erf
ul
fixe
d
cour
ie
r
nodes
in
ord
er
to
enha
n
ce
t
he
net
work
throughput
,
d
ata
del
iv
er
y
ra
ti
o
,
net
work
li
f
et
ime
and
red
u
ce
s
th
e
end
-
to
-
end
del
a
y
.
RMEER
is
al
so
an
en
erg
y
ef
fi
ci
en
t
rou
ting
protoc
o
l
for
saving
th
e
ene
rg
y
le
ve
l
of
t
he
nodes
.
W
e
ha
ve
used
th
e
NS
2.
30
sim
ula
tor
wit
h
AquaSim
pac
kag
e
for
p
erf
orm
anc
e
anal
y
sis
of
RME
ER.
W
e
observe
d
tha
t
th
e
sim
ula
ti
on
p
erf
o
rm
anc
e
of
RME
ER
is b
et
t
er
tha
n
D
-
DBR
protoc
o
l
.
Ke
yw
or
d:
Energy
e
ff
ic
ie
nt
Locali
zat
ion
Mult
i
-
path
Rou
ti
ng
Unde
rw
at
er
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
:
Mukhti
ar
Ah
m
ed
,
Dep
a
rt
m
ent o
f C
om
pu
te
r
Scie
nce,
Faculty
of Com
uting
,
UTM,
Sku
dai,
Jo
ha
r
Be
hru,
Ma
la
ysi
a.
Em
a
il
:
m
uk
htiar.a@
gm
ai
l.com
1.
INTROD
U
CTION
Unde
rw
at
er
W
irel
ess
Sensor
Netw
ork
(
U
WSN
)
el
a
borates
the
wides
pr
ea
d
ap
plica
ti
on
s
li
ke
assist
ed
nav
i
gation,
oil
and
gas
,
m
inerals,
sei
sm
ic
mo
nito
rin
g,
disa
ste
r
preve
ntio
n
et
c
[
1
]
,
[
2
]
.
F
r
om
the
bo
tt
om
of
the
sea
the
inform
at
ion
retrieval
so
urce
is
sens
or
node,
the
de
pl
oy
m
ent
of
sen
so
r
nodes
with
ro
utin
g
pr
oto
c
ol
is
on
e
of
th
e
c
ompli
cat
ed
ta
sk
s
du
e
to
t
he
e
nv
i
ronm
ental
conditi
on
s
of
unde
r
wate
r.
In
un
de
rw
at
er
en
vir
onm
ent
the
rad
i
o
sig
na
li
ng
can
not
work
well
du
e
to
l
ong
dista
nces
on
ly
at
low
f
re
qu
e
ncies
(
30
-
300Hz
)
w
hich
r
equ
i
re
la
rg
e
ante
nna
and
high
tra
nsm
issi
on
powe
r
[
3
]
,
[
4
]
.
O
ptica
l
sign
al
s
are
good
en
ough
for
cl
ean
wate
r
with
po
i
nt
to
point
com
m
un
ic
at
ion
;h
ow
e
ve
r
opti
cal
sign
al
s
ca
nnot
w
ork
well
in
un
derwate
r
sea
en
vir
on
m
ent
due
to
it
s
short
ra
nge
(less
t
ha
n
5m
),
fo
r
op
ti
cal
sign
al
in
g
t
h
e
pr
eci
se
posit
ion
in
g
is
re
quire
d
with
na
rro
w
beam
op
ti
cal
tra
ns
m
i
tt
er
[
5
]
,
[
3
]
.
Acousti
c
si
gn
a
ls
are
s
uitable
f
or
un
derwate
r
e
nv
i
ronm
ent
howe
ver
the
em
plo
ym
ent
of
aco
us
ti
c
channel
al
s
o
f
aces
so
m
e
cha
ll
eng
es
i
n
unde
rw
at
er
e
nv
ir
onm
ent
li
ke:
la
rg
e
pro
pag
at
io
n
delay
,
a
nd
hig
h
bit
error
rate
[
6
]
-
[
8
]
.
Th
ree
dim
e
ns
io
nal
de
plo
y
m
ent
of
se
nsor
nodes
is
not
an
easy
ta
sk
du
e
to
the
unde
r
water
pr
ess
ure
a
nd
env
i
ronm
ental
co
nd
it
io
ns
[
9
]
-
[
11
]
.
Howe
ve
r
the
be
ha
vio
r
of
se
nsor
node
i
n
unde
r
water
env
i
ronm
ent
is
al
so
un
c
ontro
ll
able
du
e
t
o
water
pr
es
sure
an
d
wate
r
cu
rr
e
nt
[
12
]
,
[
13
]
.
Anothe
r
iss
ue
f
or
dep
l
oym
ent
of
sens
or
node
i
s
local
iz
at
ion
.
The
e
xisti
ng
a
lgorit
hm
s
of
loca
li
zat
ion
s
a
r
e
no
t
a
ppr
opri
at
e
for
unde
r
water
en
vir
on
m
ent
[
14
]
,
[
15
]
.
In
underwate
r
en
vir
onm
ent
the
local
i
zat
ion
fr
ee
rou
ti
ng
prot
oco
ls
sh
ow
s
the
good
perf
or
m
ance
as
c
om
par
e
to
lo
cat
ion
ba
sed
routin
g
prot
oc
ols;
beca
us
e
t
he
en
vir
onm
e
nt
of
Evaluation Warning : The document was created with Spire.PDF for Python.
In
t J
Elec
& C
om
p
Eng
IS
S
N:
20
88
-
8708
RMEER:
Rel
ia
ble
M
ulti
-
path
Ener
gy
Eff
ic
ie
nt R
ou
ti
ng
…
(
Muk
htiar A
hm
ed
)
4367
unde
rw
at
er
is
local
iz
at
ion
f
re
e
[
16
]
.
T
o
m
ai
t
ia
n
the
e
nergy powe
r
of o
r
dina
ryn
od
e
i
n
unde
rw
at
er
en
vir
onm
ent
is
al
so
a
m
ajo
r
issue
be
ca
us
e
in
unde
rw
at
e
r
en
vir
on
m
ent
the
se
nsor
no
de
can
not
be
re
charge
d
easi
ly
[
17
]
.
Rou
ti
ng
protoc
ol d
e
sig
ning f
a
ces m
any chall
eng
e
s li
ke:
a.
In un
derwate
r e
nv
i
ronm
ent the acousti
c cha
nnel
b
a
ndwi
dth
is l
i
m
i
te
d.
b.
Du
e
to
t
he
m
ulti
path
an
d fa
din
g t
he
ac
ousti
c c
ha
nn
el
will
bec
om
e i
m
paire
d.
c.
In un
derwate
r e
nv
i
ronm
ent the ch
a
nn
el
pro
pa
gation delay
will
cause fo
r
l
ow d
at
a
delive
ry.
d.
Du
e
to
t
he
s
ha
dow
z
ones
or void
re
gions the
loss of c
onnec
ti
vity
w
il
l occur.
e.
In un
derwate
r e
nv
i
ronm
ent the b
at
te
ries
of s
ens
or
node
s ca
n
not
be recha
r
ged easi
ly
.
f.
Du
e
to
t
he fo
ul
ing
a
nd c
orrosi
on the
unde
r
w
at
er s
en
sor
node
m
a
y be f
ai
lu
r
e.
g.
3D d
e
plo
ym
ent in under
water
envir
on
m
ent is not a
n
easy
ta
sk
.
On
basis
of
a
bove
chall
e
ng
es
the
e
ff
ic
ie
nt
a
nd
scal
able
de
sign
of
routin
g
prot
oco
l
is
ne
eded.
In
this
researc
h
arti
cl
e
we
propose
the
Re
li
able
Mult
i
-
path
Energy
Eff
ic
ie
nt
Rou
ti
ng
(R
MEE
R)
proto
col
f
or
unde
rw
at
er
se
a
env
ir
onm
ent
.
RM
EER
is
an
ene
rg
y
ef
fici
ent,
scal
able,
and
reli
able
routin
g
proto
c
ol.T
he
desig
n
of
RM
EER
is
ba
sed
on
co
uri
er
node
s,
sin
k
node
s,
source
no
des,
an
d
se
nsor
no
des.
The
fi
xed
sin
k
nodes
a
re
posi
ti
on
ed
on
wat
er
surface
a
nd
sta
ti
c
po
werf
ul
co
ur
ie
r
node
s
are
de
plo
ye
d
on
fi
ve
num
ber
s
of
la
ye
rs
from
to
p
to
bo
tt
om
of
the
sea
water
.
The
se
ns
or
node
s
are
dep
l
oy
ed
at
the
5
th
(bottom
)
la
ye
r
of
the
water.
F
ro
m
bo
tt
om
layer
of
sea
water
the
m
ul
ti
path
data
forw
a
r
ding
te
chn
i
qu
e
is
use
d.
Fixed
c
ourier
node
is
the
po
werfu
l
node
w
hich
de
ve
lop
s
t
he
m
ultip
at
h
betwee
n
s
ource
node
a
nd
se
nsor
nodes
.
The
sen
sor
node
s
retrieve
the
in
f
or
m
at
ion
from
so
urce
no
des
in
m
ult
ipath
fas
hion
an
d
will
fo
r
ward
to
the
c
ourier
no
de.
C
ourier
nodes
are
res
pons
i
ble
to
f
orward
t
he
data
pack
et
s
to
t
he
surface
sin
k
nodes
.
We
c
om
par
e
the
sim
ulati
on
respo
ns
e
of R
MEE
R wit
h Di
recti
on
al
De
pth
-
Ba
se
d
R
ou
ti
ng (D
-
DBR).
The
a
dvanta
ge
s
of RM
EER a
re list
ed belo
w
:
a.
RM
EER ca
n
e
asi
ly
h
an
dle th
e nod
e
m
ov
em
ent w
it
h wate
r c
urren
t.
b.
RM
EER reduc
es the c
om
plex
r
ou
ti
ng ta
bles.
c.
RM
EER i
s loc
al
iz
at
ion
free
prot
oco
l.
d.
RM
EER uti
li
zes the m
ulti
-
sink
s
w
it
h
m
ultip
at
h dis
j
oi
nt m
echan
ism
to
en
han
ce
p
ac
kets
deli
ver
y
rati
o.
e.
RM
EER
us
es
the
powe
rful
c
ourier
no
des
t
o
e
nhance
the
batte
ry
li
fe
of
ordina
ry
se
nso
r
nodes
an
d
al
so
enh
a
nces
the
ne
twork
li
fetim
e
.
2.
RE
LATE
D
W
ORK
In
this
sect
ion
we
pr
e
sent
the
local
iz
at
ion
free
ro
utin
g
prot
oco
ls
with
thei
r
lim
it
at
ion
s.
In
[9
]
De
pth
Ba
sed
Rou
ti
ng
(D
BR
)
prot
oc
ol
is
pr
opose
d.
The
routin
g
m
et
ric
of
DBR
is
dep
th
in
form
at
ion
of
se
nsor
node.
The
de
pth
of
s
ens
or
no
de
inf
or
m
at
ion
is
pack
ed
with
the
data
pack
et
an
d
w
hen
se
nd
e
r
node
f
orward
the
dat
a
pack
et
to
the
r
ecei
vin
g
node;
receivin
g
node
will
co
m
par
e
their
dep
t
h
with
the
de
pth
of
sen
der
node
;
the
sens
or
node
w
hich
kee
ps
the
lowe
r
dep
t
h
will
forw
a
rd
the
data
pac
ket
s.
Eac
h
f
orwa
r
der
node
w
il
l
keep
the
data
pac
ket
for
certai
n
tim
e
per
io
d.
T
he
hol
ding
tim
e
is
based
on
the
dif
fer
e
nce
bet
wee
n
cu
rr
e
nt
f
orw
ard
e
r
node
an
d
the
s
end
e
r
no
de.
I
n
DBR
there
are
so
m
e
l
i
m
it
ation
s.
DBR
on
ly
works
in
greed
y
m
od
e;
so
it
c
annot
perform
well
in
s
parse
are
a
be
c
ause
it
is
t
he
possibil
it
y
tha
t
in
s
par
se
area
that
no
no
de
c
an
forw
a
r
d
the
data
pack
et
s
du
e
t
o
the
gr
eat
e
r
de
pt
h
as
com
par
ed
to
sen
ding
node
,
an
d
cu
rr
e
nt
node
will
con
ti
nu
e
t
o
m
ake
m
or
e
and
m
or
e
at
te
m
pts.
In
D
BR
the n
odes w
il
l
cal
culat
e
their de
pth
i
n
e
ve
ry
ti
m
e
and
i
n
r
esu
lt
ant
the
ene
r
gy
le
vel
of th
os
e
nodes
will
b
e
reduce
d
a
nd d
ie
ea
rlie
r.
In
[
8]
t
he
Di
re
ct
ion
al
De
pth
Based
Ro
utin
g
(D
-
DBR
)
is
pr
opos
e
d.
D
-
DB
R
forw
a
r
ds
the
data
pac
kets
thr
ough
opti
m
al
path
to
t
he
s
ink
n
ode. D
-
D
BR
is
based
o
n
sing
le
sin
k
a
nd
re
duces
the propa
gation
del
ay
with
le
ss
num
ber
of
hops.
Si
nk
node
with
high
ba
tt
ery
power
is
de
plo
ye
d
on
t
he
s
urface
of
water
a
nd
se
nsor
no
des
are
de
plo
ye
d
a
t
dep
th
of
wat
er.
D
-
DBR
use
s
the
holdi
ng
tim
e
and
ang
l
e
ho
l
ding
tim
e
functi
ons
f
or
route
direct
ives.
D
-
DBR
al
so
use
s
the
Tim
e
of
Arrival
(T
oA)
rangin
g
te
c
hn
i
qu
e
in
data
f
orwa
rd
i
ng
m
ec
han
ism
.
Like D
BR
the D
-
DBR al
so
cannot achie
ve
th
e h
igh
delivery
d
at
a rati
o
in sp
arse a
rea.
N
o pro
per
m
et
ho
dolo
gy
is
def
ine
d
by
D
-
DBR
f
or
t
he
energy
savi
ng
of
ordi
nar
y
sens
or
nodes
.
Rem
ov
al
of
vo
i
ds
in
unde
r
water
env
i
ronm
ent
is
the
m
ajo
r
iss
ue
an
d
D
-
DBR
is
inef
fici
ent
to
rem
ov
e
this
prob
le
m
;
du
e
to
the
vo
i
d
prob
le
m
the
ov
e
rall
n
et
wor
k
th
r
oughput
m
ay
b
e d
e
gr
a
de
d.
3.
R
MEE
R
P
ROT
OCO
L
RM
EER
proto
col
arc
hitec
tur
e
is
base
d
on
si
nk
node
s,
c
ourier
no
des,
s
ource
nodes
,
a
nd
ordi
nar
y
nodes
.
Sin
k
no
des
a
re
de
pl
oyed
on
sea
w
at
er
s
urface,
c
ouri
er
no
des
a
re d
e
plo
ye
d
on 5
n
um
ber
of
w
at
er lay
ers
with
fixe
d
sta
t
ic
m
ann
er
an
d
so
urce
no
des
are
de
plo
ye
d
at
the
bo
tt
om
of
the
sea
as
de
scried
in
F
i
gure
1.
The
sin
k
node
s
are
connecte
d
with
ons
hor
e
data
centre
thr
ough
RF
sign
al
li
ng.
Sin
k
nodes
al
so
di
rectl
y
connecte
d
with
co
ur
ie
r
nodes
from
top
to
bo
t
tom
of
sea
wit
h
dif
fer
e
nt
la
yer
s
thr
ough
acou
sti
c
sig
nalli
ng
.
Sea
Evaluation Warning : The document was created with Spire.PDF for Python.
IS
S
N
:
20
88
-
8708
In
t J
Elec
&
C
om
p
En
g,
V
ol.
8
, N
o.
6
,
Dece
m
ber
201
8
:
4366
-
4373
4368
bo
tt
om
la
ye
r
ordina
ry
no
de
s
are
c
o
nn
ect
ed
with
c
ourier
no
des
t
hro
ugh
ac
ousti
c
sign
al
li
ng.
W
e
ha
ve
dev
el
op
e
d
t
he c
onnecti
vity
b
e
tween
source
nod
e
s to
the c
ou
rier
nodes
w
it
h m
ult
ipath
disjoint m
et
ho
d.
The
ordina
ry
sens
or
nodes
are
res
pons
i
ble
to
de
velo
p
t
he
pat
h
bet
we
en
s
ource
no
de
s
to
co
ur
ie
r
nodes
t
hro
ugh
m
ult
ipath
dis
joint
m
et
ho
d.
RM
EER
proto
col
com
plete
s
the
ta
sk
f
or
pa
ckets
de
li
very
from
so
urce n
odes to sin
k nodes wi
thin two
num
ber
s o
f ph
ase
s.
On
e is route d
e
velo
pm
ent p
hase an
d
seco
nd is d
at
a
forw
a
r
ding
ph
a
se. T
he descri
pt
ion
of tw
o ph
a
ses is de
scri
be
d
in
b
el
ow s
ub
sect
ion
s.
Figure
1. RM
EER
arc
hitec
tur
e
f
or
U
WSN
3.1
.
R
ou
te
D
e
velopm
ent
Ph
as
e
As
al
rea
dy
we
hav
e
disc
us
se
d
that
the
sourc
e
nodes
a
re
de
plo
ye
d
at
bo
tt
om
of
the
sea
w
at
er
an
d
the
la
ye
r
-
5
co
ur
ie
r
node
s
a
re
res
pons
i
ble
to
de
velo
p
t
he
rout
e
towa
r
ds
s
ou
rce
nodes
th
rough
ordi
nar
y
nodes
.
Fr
om
courier
t
o
sou
rce
no
des
the
route
de
ve
lop
m
ent
m
echan
ism
is
based
on
m
ulti
path
node
disjoint
m
e
tho
d
as d
esc
ribe
d
i
n Fi
gure
2.
Figure
2. Mult
ipath
betwee
n
c
ourier t
o
s
ourc
e nod
e
The
n
ode
dis
j
oi
nt
m
echan
ism
util
iz
es
the
m
a
xim
u
m
reso
ur
c
es
of
the
e
ntire
netw
ork.
I
n
node
disjoint
m
echan
ism
if
a
ny
node
bec
ome
s
fail
ur
e
the nod
e d
isj
oin
t
m
et
hod
will
sel
ect
the
al
te
rn
at
e
route
to
f
orwa
rd
th
e
data
pac
kets.
The
r
oute
devel
op
m
ent
betw
een
co
ur
ie
r
no
des
to
s
ource
nodes
is
base
d
on
Hell
o
m
es
sage.
Courie
r
no
de
is
respon
si
ble
to
forw
a
r
d
the
Hell
o
m
essage
towards
the
neig
hbor
node
s.
Wh
en
t
he
Hell
o
Evaluation Warning : The document was created with Spire.PDF for Python.
In
t J
Elec
& C
om
p
Eng
IS
S
N:
20
88
-
8708
RMEER:
Rel
ia
ble
M
ulti
-
path
Ener
gy
Eff
ic
ie
nt R
ou
ti
ng
…
(
Muk
htiar A
hm
ed
)
4369
m
essage
is
re
c
ei
ved
by
t
he
ne
ighbor
nodes;
ever
y
neig
hbor
node
will
upda
te
it
s
Neig
hbor
Ta
ble
(
NT
)
w
it
h
it
s
new
e
ntry
an
d
will
beco
m
e
t
he
pa
rt
of
the
m
ul
ti
path
route
dev
el
opm
ent.
NT
will
al
so
keep
the
in
f
orm
at
ion
about the
li
st o
f
it
s n
ei
ghbor
nod
e
s. Hel
lo m
essage
f
or
m
at
is
shown i
n
Fi
gu
re
3.
Figure
3. Hell
o
f
or
m
at
In H
el
lo
m
essa
ge fo
rm
at
the descripti
on
of e
ver
y
fiel
d
is
gi
ven b
el
ow
:
Me
ssage
seq
ue
nce:
Con
sist
s
of
tw
o
byte
wh
ic
h
create
s
the
m
essage
nu
m
ber
thr
ou
gh
m
essage
or
i
gin
at
or.
Me
ssage
Ty
pe: Co
ns
ist
s of
on
e b
yt
e an
d rese
rv
e
d for m
essage ty
pe.
Sender
ID: C
onsist
s of t
wo by
te
s an
d i
s r
ese
rv
e
d for t
he
node_I
D.
Node T
ype:
C
on
sist
s
of
on
e
byte
and is
res
erv
e
d for
node
ty
pe.
Hop
C
ount :
Con
sist
s
of
on
e
byte
and
reserv
ed fo
r hop c
ou
nt.
Fo
r
wa
rd No
de ID: C
on
sist
s
of
two byte
a
nd re
serv
e
s fo
r
f
or
warder
no
de_I
D.
Re
sidu
al
Ene
r
gy
Level:
Consi
sts
of
fou
r
by
te
s
and
reserved
to
s
how
the
resid
ual
en
erg
y
le
vel
of
forw
a
r
der
node
.
Link
Q
ualit
y:
co
ns
ist
s
of
t
wo
byte
s
a
nd
reserve
d
to
s
how
the
li
nk
qual
it
y
with
ac
ou
sti
c
c
ha
nn
el
betwee
n
c
ourie
rs
to
sou
rce
nodes.
Wh
e
n
the
Hell
o
m
essage
received
by
the
ne
ighbor
node
s;
e
ver
y
node
al
so
m
a
intai
ns
its
NT
as
al
ready
we
discusse
d
an
d
relat
ed
C
ourier
N
od
e
Ta
ble
(
CNT)
.
Wh
e
n
ever
y
node
ha
s
up
dated
NT
and
CNT;
the
LI
N
K
m
essage
will
be
ge
ne
rated
by
courier
no
de
to
de
velo
p
th
e
m
ulti
path
li
nk
bet
ween
c
ou
rier
no
des
to
s
ource
nodes
.
3.2
.
D
ata
F
or
w
arding Ph
ase
Af
te
r
the
r
ou
te
de
velo
pm
ent
ph
a
se
the
sour
ce
node
will
broa
dcast
the
R
ou
te
Re
quest
(
RR
EQ)
on
m
ul
ti
ple
li
nk
s
to
f
orwa
rd
the
pac
kets
t
o
th
e
co
ur
ie
r
node
thr
ough
nei
ghbor
nodes
.
Af
t
er
the
ar
rival
of
t
he
RR
EQ; the n
ei
ghbor
no
des
w
il
l
up
date it
s R
ou
ti
ng Tab
le
(R
T)
with n
e
w
entry. Th
e sele
ct
ion
o
f
r
oute
is b
ased
on
lo
wer
li
nk
cost
crit
eria.O
n
rece
ption
of
RR
EQ;
ever
y
node
will
upda
te
the
NT,
CN
T,
an
d
RT
with
ne
w
entries.
When
courier
node
will
receive
t
he
RR
EQ;
the
c
ourier
node
wi
ll
cre
at
e
the
ne
w
e
ntry
f
or
un
known
so
urce
no
de.
T
he
tim
er
is
set
for
the
RR
EQ,
if
RR
EQ
arr
iv
es
after
the
tim
e
exp
ires
tha
n
it
will
autom
atical
ly
be
dro
pped
.
It
is
al
so
the
resp
onsi
bili
ty
of
the
courier
node
to
de
velo
p
the
loa
d
bal
ance
bet
ween
al
l
the
m
ul
ti
path
li
nk
s
.
Wh
en
t
he
bal
anced
m
ulti
path
r
ou
te
will
be
dev
el
op
e
d
between
t
he
s
ourc
e
and
c
ourier
node;
the s
ource
node
w
il
l f
orward
the d
at
a
pac
ket
s w
it
h D
AT
A m
essage.
The
li
nk
c
os
t and
rest o
f
the
update
d
val
ues
of
NT, CNT
, an
d
RT t
hro
ugh courie
r
node
s w
il
l
m
on
it
or
the
co
ndit
ion
s
of
m
ulti
path
bein
g
us
ed
.
T
he
c
ourier
node
has
t
o
re
-
distribu
te
t
he
dat
a
rates
ov
e
r
pa
ths
t
o
op
ti
m
iz
e
the
us
age
of
net
work
res
ources
i
nfreque
ntly
.
Courie
r
node
is
res
pons
ible
t
o
c
heck
out
t
he
pat
h
fail
ur
e
th
rou
gh
inter
arr
ival
de
la
y
of
p
ackets
on
eve
ry
li
nk
.
If
delay
occur
s
fo
r
pr
e
-
deter
m
ined
thres
ho
l
d,
the
courier
node
a
ssu
m
es
the
path
is
bro
ke
n.
T
he
co
uri
er
no
de
will
send
the
RESET
sig
nal
to
the
sou
rce
node
to
re
-
dev
el
op
the
route.
When
al
l
the
bott
om
la
ye
r
co
ur
ie
r
node
s
recei
ves
t
he
da
ta
pac
ket
s,
the
c
ourier
nodes
furthe
r
directl
y
fo
r
wa
rd
data
pack
et
s
to
the
diff
e
re
nt
la
ye
red
sta
ti
c
cou
ri
er
nodes
from
bo
tt
om
la
ye
r
to
top
la
ye
r
with
po
wer
le
vels
p1,
p2,
….
,
pn
-
1.
Wh
e
n
t
op
la
ye
r
fixe
d
c
ourier
nodes
will
rec
ei
ve
the
data
pa
ckets
than
data
pac
ke
ts
directl
y
f
orwa
rd
e
d
t
o
the
surface
sin
k
nodes
.
S
urface
sin
k
no
des
w
il
l
fo
r
ward
t
he
data
pack
et
s
to
t
he on
s
hore
d
at
a c
enter t
hroug
h R
F signal
ing.
4.
PERFO
R
MANC
E
A
NA
L
Y
SIS
To
m
easur
e
t
he
pe
rfor
m
ance
of
RM
EER
w
e
ha
ve
us
e
d
N
S2
.
30
sim
ulator
with
AquaSi
m
p
ackag
e.
We
ha
ve
c
onsidere
d
the
3D
dep
l
oym
ent
area
with
5
num
ber
s
of
la
ye
rs.
W
e
ha
ve
te
st
ed
the
resu
lt
s
on
300
Evaluation Warning : The document was created with Spire.PDF for Python.
IS
S
N
:
20
88
-
8708
In
t J
Elec
&
C
om
p
En
g,
V
ol.
8
, N
o.
6
,
Dece
m
ber
201
8
:
4366
-
4373
4370
nu
m
ber
s
of
no
des.
The
netw
ork
siz
e
is
set
on
10
00
m
x1000m
x1000m
fo
r
sim
ulatio
n
resu
lt
s.
The
802.1
1
-
DYN
AC
is
use
d
as
a
MAC
protoc
ol
[
18
]
.
We
te
ste
d
the
pe
rfor
m
ance
of
RM
EER
on
50
,
10
0,
150,
20
0,
25
0,
and
300
nu
m
ber
s
of
no
des.
T
he
distanc
e
of
each
la
ye
r
is
set
on
20
0
m
et
e
rs.
We
ha
ve
use
d
the
en
er
gy
m
od
el
sam
e as d
escribed i
n
[
19
]
. Re
st of the
sim
ula
ti
on
par
am
et
ers
are
desc
ribe
d i
n
Ta
ble
1.
Table
1.
NS2.
30 Sim
ulati
on
P
aram
et
ers
Para
m
eters
Ratin
g
s
Netwo
rk size
1
0
0
0
m
x
1
0
0
0
m
x
1
0
0
0
m
No
.
o
f
no
d
es
300
Lay
e
r
d
istan
ce
2
0
0
m
Data pack
ets size
6
4
bytes
Initial Energ
y
Energy Co
n
su
m
p
ti
o
n
:
Tr
an
s
m
ittin
g
,
R
ece
iv
in
g
,
id
le
5
0
J
2
w,
0
.75
w,
8
m
w
MAC P
roto
co
l
8
0
2
.11
-
DYNAV
W
ate
r
salin
it
y
38
W
ate
r
te
m
p
eratur
e
2
0
C to
30
0
C
Av
erage wat
er
p
r
e
ss
u
re
o
n
ev
ery
dep
th
la
y
er
1
5
0
db
r
W
ate
r
d
en
sity
2
4
.32
Kg/
m
3
4.1.
Perf
orm
ance
A
na
l
ys
is
Measuri
n
g
P
ar
amet
er
s
The det
ai
le
d d
escripti
on
of pe
rfor
m
ance p
a
r
a
m
et
ers
are
de
scribe
d
in
Ta
ble 2
[
6
]
.
Table
2.
Per
for
m
ance
A
naly
sis M
easu
rin
g
P
aram
et
ers
[
6
]
Perf
o
r
m
an
ce
Met
ri
cs
Descripti
o
n
Netwo
rk Thro
u
g
h
p
u
t
Thro
u
g
h
p
u
t
refers
to
ag
g
regated
d
ata
rate
achi
ev
ed
in
Kb
/s
at
th
e
d
esti
n
atio
n
n
o
d
es
f
o
r
t
h
e
en
tire
n
etwo
rk.
I
n
o
th
er
wo
rds
,
a
g
g
regate
th
rou
g
h
p
u
t
f
o
r
all
th
e
f
lo
ws
in
th
e
n
etwo
r
k
.
Thro
u
g
h
p
u
t r
ef
lects th
e eff
icien
cy
of
netwo
rk in
collecti
n
g
and
deliv
ering
d
a
ta.
t
r
f
r
t
h
r
o
T
P
N
wh
ere
s
d
t
r
f
T
T
T
End
-
to
-
End
Dela
y
It
refers
to
th
e
av
e
rage
d
elay
f
o
r
all
t
h
e
d
ata
p
ackets
arriv
in
g
at
th
e
d
estination
f
ro
m
d
if
f
erent
so
u
rces.
Lower
the
end
-
to
-
en
d
delay
s
ig
n
if
ies b
etter
n
etwo
rk p
erfo
r
m
an
ce.
n
s
d
e
t
e
P
T
T
D
Ro
u
tin
g
Overheads
Measu
re
th
e
ratio
o
f
co
n
trol
p
ackets
/
m
e
ss
ag
e
g
en
erate
d
to
su
ccessf
u
lly
rece
iv
ed
d
ata
p
ackets
d
u
ring
r
o
u
tin
g
si
m
u
latio
n
.
m
m
o
D
C
R
Av
erage E
n
e
rgy
C
o
n
su
m
p
tio
n
an
d
Network lif
etim
e
It
m
e
asu
res
th
e
av
erage
d
if
f
erence
b
etween
th
e
in
itial
lev
el
o
f
en
ergy
an
d
th
e
f
in
al
lev
el
o
f
en
ergy
th
at
is
lef
t
i
n
each
n
o
d
e.
Let
Ei=
th
e
in
itial
en
erg
y
lev
el
o
f
a
n
o
d
e,
Ef
=
th
e
f
i
n
al
en
erg
y
lev
el of
a
n
o
d
e and
n
= nu
m
b
e
r
o
f
no
d
es in
the si
m
u
latio
n
.
Then
:
=
∑
(
−
)
=
1
Netwo
rk
lif
eti
m
e
i
s
in
v
ersely
p
rop
o
rtion
al
to
en
ergy
co
n
su
m
p
tio
n
an
d
referred
to
ti
m
e
elap
s
ed
sin
ce the no
d
es d
ep
lo
y
m
en
t till
th
e f
irst no
d
e dies
du
e to en
ergy
d
ep
letio
n
.
Pack
ets Deliv
er
y
Ratio
Pack
ets d
eliv
ery ra
tio
can
b
e def
in
ed
; the n
u
m
b
er
of
deliv
ered pack
ets at th
e sin
k
no
d
e
Evaluation Warning : The document was created with Spire.PDF for Python.
In
t J
Elec
& C
om
p
Eng
IS
S
N:
20
88
-
8708
RMEER:
Rel
ia
ble
M
ulti
-
path
Ener
gy
Eff
ic
ie
nt R
ou
ti
ng
…
(
Muk
htiar A
hm
ed
)
4371
4.2.
Ne
twork
Throu
gh
p
ut
In
Fi
gure
4
the
networ
k
thr
ou
ghput
of
RM
E
ER
is
hig
he
r
than
D
-
DBR
be
cause
the
us
e
of
powerf
ul
fixe
d
c
ourier
node
s
has
e
nh
a
nc
ed
the
n
et
wor
k
th
r
oughput
of RM
EER.
Figure
4. N
o. of No
des v/s
Ne
twork
Thr
ough
pu
t
4.3.
Ne
twork
Li
fet
im
e
Figure
5
sho
w
s
the
com
par
is
on
of
net
work
li
fetim
e
of
RM
EER
against
D
-
DBR.
In
RM
EER
the
use
of
powe
rful
fi
xed
c
ourie
r
no
des
hav
e
s
how
n
the
i
ncr
e
dib
l
e
adv
a
nta
ge
over
D
-
DBR.
T
he
po
werfu
l
c
ourie
r
nodes
ha
ve
plentiful
ene
r
gy
than
ordi
nary
senso
r
node
s;
so
wh
e
n
c
ourier
no
des
are
involve
d
in
data
forw
a
r
ding
m
e
chan
ism
;
the
l
onge
r
netw
ork
li
fetim
e
is
exp
ect
ed.
In
c
ontrast
,
D
-
DBR
e
xp
e
rience
s
e
xc
essive
energy c
on
s
umpti
on, a
ff
ect
in
g t
he netw
ork
li
f
et
i
m
e b
ecause
it
is o
bs
e
rv
e
d
t
hat m
os
t of
t
he
tim
e in D
-
DB
R t
he
sm
a
ll
er d
ept
h nodes
conti
nuously
forwar
ds t
he data
p
a
ckets
and
will
d
ie
ea
rlie
r
tha
n hig
he
r dept
h nodes.
Figure
5. N/
w Li
fetim
e ag
ai
nst
D
-
DBR
4.4.
A
verage
End
-
to
-
End
D
el
ay
Figure
6
s
how
s
the
a
ver
a
ge
end
-
to
-
en
d
del
ay
of
RM
EER
against
D
-
DB
R.
The
a
ve
rage
en
d
-
to
-
e
nd
delay
of
RM
EER
is
red
uce
d
than
D
-
DBR;
because
in
RM
EER
we
hav
e
reduce
d
the
num
ber
of
hops
a
nd
we
hav
e
al
so
us
e
d
high
tra
n
sm
issi
on
powe
r
betwee
n
c
ouri
er
no
des
for
data
f
orwardi
ng
wh
ic
h
re
duc
es
the
aver
a
ge
e
nd
-
to
-
en
d
delay
.
D
-
DBR
m
et
ho
dolog
y
is
ba
sed
on
m
axim
u
m
nu
m
ber
of
hops
w
hich
reduc
es
the
perform
ance
of
D
-
DBR
.
D
-
DBR
is
unc
ontrolla
ble
in
e
nd
-
to
-
e
nd
delay
by
inc
reasin
g
of
n
et
work
de
ns
it
y
howe
ver
RM
EER rem
ai
ns
stable i
f netw
ork den
sit
y i
ncr
eas
e.
0
50
100
150
200
250
300
350
50
100
150
200
250
300
Netw
ork
Thr
oughput
(Kbi
ts
/s
ec
)
No.
of Nodes
RME
E
R
D-D
BR
0
500
1000
1500
2000
2500
3000
3500
50
100
150
200
250
300
Netw
ork
Li
feti
me (Sec
)
No.
of Nodes
RME
E
R
D-D
BR
Evaluation Warning : The document was created with Spire.PDF for Python.
IS
S
N
:
20
88
-
8708
In
t J
Elec
&
C
om
p
En
g,
V
ol.
8
, N
o.
6
,
Dece
m
ber
201
8
:
4366
-
4373
4372
4.5.
T
otal Ene
rgy Cons
ump
t
ion
Figure 7
s
hows
the
ave
ra
ge
e
ne
rg
y
c
onsu
m
ption
o
f
RM
EER
against D
-
DB
R.
RM
EER
use
s
the
fi
xe
d
powe
rful co
ur
i
er no
des o
n
di
f
fer
e
nt num
ber
of
lay
ers
w
it
h s
m
al
l nu
m
ber
of or
din
ary
node
s in data
forw
ard
i
ng
m
echan
ism
;
t
his
m
echan
ism
increases
the
li
fe
of
th
e
ordin
a
ry
sensor
no
des;
s
o
am
ou
nt
of
energy
consum
ption
is
obviously
re
duced
as
com
par
e
to
D
-
DBR.
Howe
ver,
in
D
-
DBR,
t
he
de
pt
h
of
se
ns
or
nodes
is
the
on
ly
par
am
et
er
f
or
f
orwa
r
ding.
The
se
nsor
no
des
ha
ving
sam
e
de
pth
s
al
so
hav
e
sam
e
holdi
ng
tim
e
f
or
a
data
pack
et
.
These
no
des
for
ward
the
sam
e
data
pack
et
con
c
urre
ntly
.
Ther
e
fore,
the
r
edun
dan
cy
of
pack
e
t
transm
issi
on
s i
s una
vo
i
dab
le
,
wh
ic
h resu
lt
s i
n
e
xcessive
ene
rg
y c
onsu
m
ption
.
Figure
6. A
verage E
2E dela
y
against
D
-
DB
R
Figure
7. Ene
r
gy cons
um
pti
on
a
gainst
D
-
D
BR
4.6.
Pac
kets
Del
ivery Ra
tio
Figure
8
s
how
s
the
pac
kets
delivery
rati
o
of
RM
E
ER
an
d
D
-
DBR.
T
he
pac
kets
delivery
rati
o
of
RM
EER
is
inc
reased
agai
ns
t
D
-
DBR.
In
RM
EER
the
us
e
of
powerf
ul
fi
xed
co
uri
er
nodes
ha
ve
e
nh
a
nced
th
e
pack
et
s
delive
ry
rati
o.
I
n
c
ontrast
the
packet
s
delivery
ra
ti
o
of
D
-
DBR
is
reduced
du
e
to
the
com
plica
te
d
m
echan
ism
f
or d
at
a
forw
a
r
ding.
Figure
8. N
o. of No
des ve
rsu
s
Pack
et
s
D
el
iv
ery Ra
ti
o
(%
)
0
0.5
1
1.5
2
2.5
3
50
100
150
200
250
300
Av
erage
End
-
to
-
End
Del
ay
(Sec
)
No.
of Nodes
RME
E
R
D-D
BR
0
500
1000
1500
2000
2500
50
100
150
200
250
300
Av
erage
Energy
Cons
umpti
on
(Joul
es
)
No.
of Nodes
RME
…
D-D
BR
0
20
40
60
80
100
50
100
150
200
250
300
Pac
k
ets
Del
i
v
ery
Rati
o
(%)
No.
of Nodes
RME
E
R
D-D
BR
Evaluation Warning : The document was created with Spire.PDF for Python.
In
t J
Elec
& C
om
p
Eng
IS
S
N:
20
88
-
8708
RMEER:
Rel
ia
ble
M
ulti
-
path
Ener
gy
Eff
ic
ie
nt R
ou
ti
ng
…
(
Muk
htiar A
hm
ed
)
4373
5.
CONCL
US
I
O
N
The
pro
posed
RM
EER
r
ou
ti
ng
protoc
ol
for
unde
rw
at
e
r
wireless
se
nsor
net
wor
k
i
s
base
d
on
m
ul
ti
path
dis
j
oi
nt
te
chn
i
qu
e
f
or
data
forw
a
r
ding.
T
he
t
hr
e
e
num
ber
s
of
r
ou
ti
ng
ta
bles
a
s
NT
,
CN
T,
a
nd
RT
are
us
e
d
in
pro
po
s
ed
routin
g
protoc
ol.
RM
E
ER
us
es
the
fi
xed
powe
rful
c
ourier
nodes
on
di
ff
e
ren
t
la
ye
rs
of
sea
water.
T
he
sink
node
s
ar
e
dep
loye
d
on
the
water
surfa
ce
and
the
or
di
nar
y
sens
or
node
s
are
de
ploy
ed
at
the
bott
om
of
the
wate
r.
S
our
ce
nodes
a
re
de
plo
ye
d
at
water
bott
om
wh
ic
h
f
orwards
t
he
data
pac
kets
th
rou
gh
m
ul
ti
path
disjoint
m
et
ho
d
to
powerfu
l
c
ourier
no
des
an
d
powerfu
l
c
ourier
no
des
f
ur
t
her
f
orwa
rd
t
he
data
pack
et
s
by
util
iz
ing
the
m
axim
u
m
po
we
r
le
vels
to
the
s
urf
ace
sink
nodes
.
W
e
have
com
par
e
d
the
sim
ulati
on
respo
ns
e
of
th
e
RM
EER
wit
h
the
fam
ou
s
routin
g
pr
ot
oc
ol
D
-
DBR
an
d
we
ob
se
r
ve
d
that
the
sim
ulati
on
perform
ance o
f
RM
EER i
s b
et
te
r
tha
n D
-
DB
R.
REFERE
NCE
S
[1]
N.
Li
,
J.
F
.
Mart
íne
z
,
J.M.
Mene
ses
Chaus,
and
M.
Ec
ker
t,
“
A
Surve
y
on
Unde
rwate
r
Acousti
c
Sensor
Network
Routi
ng
Proto
co
ls”
,
S
ensors
,
vol
.
16,
no.
3,
pp.
41
4,
2016
.
[2]
A.
W
ahi
d,
and
D.
Kim
,
“
An
En
erg
y
Eff
ic
i
ent
L
oca
l
iz
a
ti
on
-
Fre
e
Routi
ng
Protoco
l
for
Underw
at
er
W
ire
le
ss
Senso
r
Networks”
,
In
te
r
nati
onal Journal
of
Distribu
te
d
S
ensor Ne
tworks
,
2012.
[3]
A.
W
ahi
d,
S.
Le
e
,
D.
Kim
,
a
nd
K.S.
Li
m
,
“
MRP
:
A
Loc
al
i
za
t
ion
-
Free
Mul
ti
-
L
a
y
ere
d
Rou
t
ing
Protocol
fo
r
Underwat
er
W
ir
el
ess
Sensor
Networks”
,
Wirel
es
s
Pe
rs
onal
Com
municat
ions,
vol
.
77,
no.
4,
pp.
2997
-
3012,
Aug,
2014.
[4]
A.
W
ahi
d,
S.
L
ee
,
and
D.
Kim
,
“
A
rel
ia
ble
and
ene
rg
y
-
ef
ficien
t
routi
ng
proto
co
l
for
u
nder
wat
er
wire
le
ss
sensor
net
works
”
,
Inte
r
nati
onal Journal
of
Comm
unic
a
tion Sy
stems,
vol.
27,
no
.
10
,
pp
.
2
048
-
2062,
Oc
t, 2
014.
[5]
M.
Ay
az,
I.
Ba
ig,
A.
Abdulla
h
,
and
I.
Fa
y
e,
“
A
survey
on
ro
uti
ng
technique
s
in
under
wate
r
wire
le
ss
sensor
net
works
”
,
Jour
nal
of
Net
work
a
nd
Computer
Ap
pli
cations,
vo
l. 3
4,
no
.
6
,
pp
.
190
8
-
1927,
Nov,
20
11.
[6]
A.
Ahm
ed,
K.
A.
Baka
r,
M.
I.
Channa
,
and
A.
W
.
Khan,
“
A
S
ec
ure
Routi
ng
Protocol
with
T
rust
and
Ene
rg
y
Aw
are
ness for W
ire
le
ss
Sensor
Network”
,
Mobi
le
N
et
works and
Appl
ic
a
ti
ons
,
pp.
1
-
14,
2016.
[7]
M.
Sharif
-
Yaz
d,
M.R.
Khos
rav
i,
and
M.K.
Moghim
i,
“
A
Surv
e
y
on
Underwa
te
r
Acoustic
Se
nsor
Networks:
Perspec
ti
v
es
on
Protocol
Design
for
Signaling,
MA
C
and
Rout
ing
”
,
arX
iv preprint
arXiv
:1703
.
083
53
,
2017
.
[8]
M.
Ahm
ed,
M.
Sall
eh
,
and
M.I.
Channa
,
“
Cr
it
i
cal
Anal
y
sis
of
Da
ta
Forw
ard
ing
R
outi
ng
Protoco
ls
Based
on
Singl
e
pat
h
for
UW
SN”
,
Int
ernati
onal
Journal
of
El
e
ctr
ic
al
and
Computer
Engi
ne
erin
g,
vol.
6,
no
.
4,
pp.
1695
-
1701,
2016.
[9]
P.V.
Am
oli
,
“
An
Overvi
ew
on
Curre
nt
R
ese
ar
c
hes
on
Underwa
te
r
Sensor
N
et
w
o
rks:
Applicati
o
ns,
Challenge
s
a
nd
Future
Tr
ends”
,
Inte
rnational
Jo
urnal
of El
e
ct
ri
c
al
and
Comput
er
Engi
n
ee
ring
,
vo
l.
6
,
no
.
3
,
pp
.
95
5,
2016
.
[10]
M.
Ahm
ed,
and
M.
Sall
eh,
“
Local
i
za
t
ion
sche
m
e
s
in
Underwat
er
Se
nsor
Network
(UW
S
N):
A
Surve
y
”
,
Indon
esia
n
Journal
of
Elec
t
rical
Engi
ne
erin
g
and
Computer
Sci
en
ce.,
vol. 1,
no.
1
,
pp
.
119
-
1
25,
2015
.
[11]
M.
Ahm
ed,
M.
Sall
eh,
M.
Ch
anna
,
and
M.F.
Rohani
,
“
Review
on
Loc
al
i
zation
base
d
Rout
ing
Protocol
s
for
Underwat
er
W
ir
el
ess
Sensor
Network”
,
Inte
rnat
i
onal
Journal
of
El
e
ct
rica
l
and
Computer
Engi
ne
ering,
vol
.
7,
no.
1,
pp
.
536
,
2017
.
[12]
P.R.
Jadha
o
,
and
M.M.
Ghonge,
“
Ene
rg
y
Eff
i
cien
t
Routi
ng
Protoc
ols
For
Underwat
er
Sensor
Ne
tworks
-
A
Surve
y
”
,
Ene
rgy,
vol
.
1
,
n
o.
1
,
2015
.
[13]
M.
Ahm
ed,
M.
Sall
eh,
M.I.
C
hanna
,
and
M.F
.
Rohani
,
“
Ene
r
g
y
Eff
i
cient
Routi
ng
Protocol
s
for
U
W
SN
:
A
Revi
ew”
,
Te
lk
o
mnika,
vo
l. 15, n
o.
1
,
2017
.
[14]
G.
Han,
N.
Bao
,
L.
L
iu,
D.
Zh
ang,
and
L
.
Shu,
“
Routi
ng
protoc
ols
in
under
wate
r
a
coustic
sensor
net
works
:
a
quant
itati
v
e comparison”
,
Int
ernati
onal Journal of
Distribut
ed
Se
nsor
Net
works,
v
ol.
2015
,
pp
.
10
,
2015.
[15]
A.
W
ahi
d,
S.
Le
e
,
H.
J.
Jeong
,
and
D.
Kim
,
“
EE
DBR:
Energ
y
-
E
fficie
nt
D
ept
h
-
Based
Rou
ti
ng
Protocol
f
or
Unde
rwate
r
W
ir
el
ess
Sensor
Net
works
”
,
Adv
an
c
ed
Computer
Sc
ie
nc
e
and
Infor
mation
Technology,
vol
.
195
,
p
p.
223
-
234,
2011
.
[16]
B.
Diao
,
Y.
Xu,
Z.
An
,
F.
W
ang
,
and
C
.
Li
,
“
Im
proving
Both
Energ
y
and
Ti
m
e
Ef
fic
i
ency
of
Dept
h
-
Based
Rout
ing
for
Underwat
er
Sensor
Networks”
,
Inte
rnat
ional
Journal
of
Dist
ribute
d
Sensor
Net
works,
vol
.
1
1,
no.
10
,
pp.
1
-
9,
2015.
[17]
M.R.
Khos
rav
i,
R.
Sala
ri
,
a
nd
H.
Rostami,
“
A
So
lut
ion
for
Sca
la
b
le
Routi
ng
in
De
pth
Divisions
-
Based
DU
SN
s
via
Adding
a
Scal
a
ble
Para
m
eter
t
o
Control
Dept
h
Cluste
rs:
Cre
at
ing
an
Ene
rg
y
Eff
ic
i
ent
and
Low
Delay
N
I
-
Ind
epe
nden
t
Co
m
m
unic
at
ion
Pr
otoc
ol
”
,
Journal of
Computer
and
Comm
unic
ati
on
s,
vol. 4, no. 07,
pp.
55
,
2016
.
[18]
S.
Zha
ng
,
D.
L
i,
and
J.
Ch
en,
“
A
li
nk
-
state
base
d
ad
apt
iv
e
fee
dba
ck
rout
in
g
for
under
wa
ter
ac
oust
ic
senso
r
net
works
”
,
Sens
ors
Journal,
I
EEE,
vo
l. 13, no. 1
1,
pp
.
4402
-
441
2,
2013
.
[19]
N.
Nicol
aou
,
A.
See,
P.
Xie
,
J.
H.
Cui,
and
D.
Ma
ggiori
ni
,
“
Im
pro
ving
the
robustn
ess
of
loc
at
ion
-
b
ase
d
routi
ng
for
under
wate
r
sens
or
net
works
”
,
O
ce
ans 2007
-
Eu
rope,
Vo
ls 1
-
3
,
p
p.
1485
-
1490
,
2
007.
Evaluation Warning : The document was created with Spire.PDF for Python.