Opportunistic Multipath Routing in Long-Hop Wireless Sensor Networks

. 2019 Sep 20;19(19):4072. doi: 10.3390/s19194072

Algorithm 1 Pseudocode for the bifurcation decision process at an intermediate node i

1:
Input: $P_{r e q}$ ← required packet delivery ratio, $k_{i}$ ← the number of neighbors
2:
Output: n ← the number of paths(default = 1)
3:
4:
$P_{(k_{i}, 1)} = 1 - (1 - P_{1}) (1 - P_{2}) \dots (1 - P_{k_{i}})$ ▹ link reliability by opportunistic routing
5:
$N_{h o p}$ = $⎡ \frac{D i s t (i, d e s t i n a t i o n)}{r} ⎤$ ▹ expected hop-count from itself to the destination
6:
$P_{e x p}$ = ${(P_{(k, 1)})}^{N_{h o p}}$ ▹ expected packet delivery ratio
7:
8:
if $P_{e x p} > P_{r e q}$ then ▹ bifurcation do not require
9:
return n
10:
end if
11:
12:
while $P_{e x p} < P_{r e q}$ do ▹ bifurcation required
13:
n = n+1
14:
$P_{e x p}$ = ${(P_{(k_{i}, n)})}^{N_{h o p}}$ ▹ $P_{e x p}$ when n of $k_{i}$ nodes is selected by opportunistic routing
15:
end while
16:
17:
return n