Data Collection Based on Opportunistic Node Connections in Wireless Sensor Networks

. 2018 Oct 30;18(11):3697. doi: 10.3390/s18113697

Algorithm 3. The routing protocol

1.
Assuming that the sensing data from node $v_{s}$ is forwarded along its optimal path on the spanning tree to the mobile sink;
2.
When an intermediate node $v_{m}$ receives the sensing data:
3.
if (its father node $v_{n}$ is in working status)
4.
Forward the sensing data to $v_{n}$ ;
5.
$v_{n}$ employs this routing protocol to forward the data;
6.
else // $v_{n}$ is in sleeping status
7.
if ( $v_{m}$ has neighbors on the spanning tree)
8.
for each neighbor $v_{i}$ do
9.
Calculate $P_{v_{m} v_{i}}$ according to Equation (14);
10.
Calculate the PC of the path $v_{m}$ - $v_{i}$ - $v_{\sin k}$ ;
11.
end for
12.
Select the neighbor that on a path with a max value of PC as the forwarder;
13.
Forward the sensing data to this forwarder;
14.
The forwarder employs this routing protocol to forward the data;
15.
else
16.
Stop forwarding this data;
17.
end if
18.
end if