Single hop selection based forwarding in WDFAD-DBR for underwater wireless sensor networks By

Abstract

Due to the detrimental nature of aquatic environment, the design of routing protocols for Underwater Wireless Sensor Networks (UWSNs) faces numerous challenges, such as optimal route selection, energy efficiency, propagation delay, etc. Energy efficiency is considered to be one of the key parameters while designing any of the routing strategy. The uneven dissipation of energy causes void hole creation. Due to the hole creation, a node can not forwards its data towards the destination because of the unavailability of relay node(s). In order to avoid the creation of void hole, we pro- pose a routing mechanism which detects void hole prior to its occurrence and takes an alternative route for successful data delivery. We compute an optimal number of forwarders at each hop for reducing the probability of void hole occurrence. In addition, forwarding communication range is logically divided in to subareas in order to minimize the number of redundant transmissions. To optimize the network lifes- pan via reducing the energy consumption, linear based optimization is presented to compute the feasible region for energy tax. Also we perform simulations for showing that our claims are well grounded. The results depict that the proposed work has outperformed baseline schemes in terms of Packet Delivery Ratio (PDR), energy tax and Accumulative Propagation Distance (APD).

Full text

𝒟

S
A
D
B
C
E
F
?
?
?
h
h1
S1
S2
S3

Depth Depth
Sink
Anchored Node
Relay Node
Acoustic Link
Radio Link
T_Range
Satellite
Control Station

10 log 𝐴(𝑑.𝑓 ) = 𝑘.10 log 𝑑+𝑑.10 log 𝛼(𝑓)
10 log 𝑑10 log 𝛼(𝑓)
𝑁(𝑓) = 𝑁𝑤(𝑓) + 𝑁𝑠(𝑓) + 𝑁𝑡(𝑓) + 𝑁𝑡ℎ(𝑓)
𝑤 𝑠 𝑡 𝑡ℎ
𝑆𝑁 𝑅(𝑓, 𝑑) = 𝑃(𝑓)−𝐴(𝑑, 𝑓)−𝑁(𝑓) + 𝑑𝑖
𝑃(𝑓)𝑖
𝑆𝑁 𝑅(𝑓, 𝑑)

𝑋=𝐻𝐴
|𝑋𝐴|+ 1,𝐻𝐵
|𝑋𝐵|+ 1
𝐴 𝐵 𝐴
𝐵
𝑌=𝑅𝐴, 𝑅𝐵.
𝐴 𝐵
𝛼𝐴=
𝐻𝐴
(|𝑋𝐴|+1)
𝐻𝐴
(|𝑋𝐴|+1) +𝐻𝐵
(|𝑋𝐵|+1)
𝛼𝐵=
𝐻𝐵
(|𝑋𝐵|+1)
𝐻𝐴
(|𝑋𝐴|+1) +𝐻𝐵
(|𝑋𝐵|+1)
.
𝐴 𝐴 𝐵 𝐵
𝛼𝐶=𝑅𝐴
𝑅𝐴+𝑅𝐵

𝛼𝐷=𝑅𝐵
𝑅𝐴+𝑅𝐵
.
𝛼𝐴,𝐶= 0.5×𝛼𝐴+ 0.5×𝛼𝐶
𝛼𝐵,𝐷= 0.5×𝛼𝐵+ 0.5×𝛼𝐷.
𝑁𝐴∝1
𝛼𝐴,𝐶
𝑁𝐵∝1
𝛼𝐵,𝐷
.
𝐴 𝐵 𝐴 𝐵
S
AB
E
F
G
H
S1
S2
S3
I
?
HA
HB
XAXB
XY

S
A
B
D
E
F
G
S1
S2
S3
?
𝑡ℎ 𝑒
𝑡ℎ
𝑒
𝑛𝑜𝑤

𝑒
𝑒 𝑛𝑜𝑤
ℎ𝑜𝑙𝑑𝑖𝑛𝑔
𝑒 𝑛𝑜𝑤
𝑒 𝑛𝑜𝑤

′
𝑛𝑜𝑤
′
𝑒𝑟′
𝑛𝑜𝑤
𝑟′=√𝑂𝐴′2+ℎ2
𝑂𝐴′=√𝑟2−ℎ2+ 2𝑠𝑛×(𝑡𝑛𝑜𝑤 −𝑡).
𝑛
′
AA
B
S
C
D
rrh
O

𝑅=ℎ+𝑑=ℎ
2+𝑧2
8ℎ
𝑆=𝛼
180Π𝑅=𝜃𝑅
𝑧= 2𝑅sin 𝜃
2=𝑅√2−2 cos 𝜃.
cos 𝜃= 2𝑙1−(𝑑
𝑅)
2
ℎ=𝑅(1 −cos 𝜃
2) = 𝑅−𝑅2−𝜃
4
𝜃= 2 tan−1𝑧
2𝑑.
𝐴=𝑅2
2(𝜃−sin 𝜃)
𝑛
𝑁𝑃= (𝑅2
2(𝛼𝜋
180 −sin 𝛼)×𝑝𝑛),
𝑛
𝑁𝐴=𝜋𝑟2
2−(𝑅2
2(𝜃−sin 𝜃)×𝑝𝑛).

S1
S2
D
A
B
C
E F
S3
O
X Y
S
h
d
Z
R
θ
S1
S2
D
A
B
C
E F
S3
O
X Y
S
h
d
Z
R
θ

𝐸𝑡𝑎𝑥 =
𝑛

𝑖=1
(𝐸𝑡
𝑛×𝑝)
𝐸𝑡=𝐸𝑡𝑥 +𝐸𝑟𝑥
𝐸𝑡𝑥 =1
𝑅
𝑛

𝑖=1
(𝑃𝑠×𝑇𝑝×𝐷𝑗
𝑖)
𝐸𝑟𝑥 =1
𝑅
𝑛

𝑖=1
(𝑃𝑠×𝑁𝑛×𝐸𝑟).
𝐶1:𝐸𝑖≤𝐸𝑜∀𝑖∈𝑁
𝐶2:𝐸𝑖≥𝐸𝑚𝑖𝑛
𝑖∀𝑖∈𝑁
𝐶3:𝐴𝑓𝑟≤𝑃 𝐹 𝑁 𝑠 ≤𝑡𝑟
𝐶4:𝑑𝑖< 𝑑𝑚𝑖𝑛
𝑗∀𝑖, 𝑗 ∈𝑁.
𝑡
𝑡
𝑡𝑥 𝑟𝑥 𝑠

𝑝
𝑗
𝑖
𝑛
𝑟 𝑠
𝑚𝑖𝑛
𝑖
0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 2
Etx (J)
0
0.2
0.4
0.6
0.8
1
1.2
1.4
1.6
1.8
2
Ercv (J)
Etx+Ercv= 1.84
P2(1.05, 0.60)
P1(1.05, 0.30)
P3(1.24, 0.60)
P4(1.24, 0.30)

𝑀𝑖𝑛
𝑗

𝑖=1
𝐷𝑗
𝑖(𝑟)∀𝑟∈𝑅
𝐶1:𝑀𝑖𝑛
𝑗

𝑖=1
ℎ(𝑟)∀𝑟∈𝑅
𝐶2:𝑀𝑎𝑥
𝑛

𝑖=1
𝑅(𝑟)∀𝑟∈𝑅.

𝐸2𝐸𝐷 =𝑇𝐷+𝑃𝐷
𝑇𝐷=𝐻𝑇+𝐷𝐿
𝐷𝑅
𝑃𝐷=𝐷𝑁
𝑉𝑆
.
𝐷 𝐷
𝐿 𝑅
𝑇 𝑁
𝑆
2.20 ≤𝑇𝐷≤3.40
5.02 ≤𝑃𝐷≤3.50
7.04 ≤𝑇𝐷+𝑃𝐷≤6.9

0123456789
Delayprop(sec)
0
1
2
3
4
5
6
7
8
9
Delaytrans(sec)
Delaytrans+Delayprop= 6.90
P1(2.20,3.50)
P2(2.20, 5.02)
P4(3.40, 3.50)
P3(3.40,5.02)

10𝑘𝑚 ×10𝑘𝑚×10𝑘𝑚

100 150 200 250 300 350 400 450 500
Number of Nodes
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
PDR
Intar
WDFAD-DBR
SHSF-WDFAD-DBR

100 150 200 250 300 350 400 450 500
Number of Nodes
0
1
2
3
4
5
6
7
8
9
10
End-to-end delay (Sec)
Intar
WDFAD-DBR
SHSF-WDFAD-DBR

100 150 200 250 300 350 400 450 500
Number of Nodes
0
0.02
0.04
0.06
0.08
0.1
0.12
0.14
0.16
0.18
0.2
Energy tax (J)
Intar
WDFAD-DBR
SHSF-WDFAD-DBR

100 150 200 250 300 350 400 450 500
Number of Nodes
1
2
3
4
5
6
7
8
9
10
APD (km)
Intar
WDFAD-DBR
SHSF-WDFAD-DBR