An Opportunistic Cooperative Packet Transmission Scheme in Wireless Multi-Hop Networks

. 2019 Nov 5;19(21):4821. doi: 10.3390/s19214821

Algorithm 1 Proposed opportunistic cooperative routing scheme

1:
Initiate $S_{0} = \{V_{s}\}, V_{1} = V_{s}, T = S_{0}$ , get $R$ by (9).
2:
$n \leftarrow 0$ . The source $V_{s}$ broadcasts the packet X.
3:
while $V_{d}$ fails in receiving X do
4:
$n \leftarrow n + 1$ ;
5:
Update $S_{n}$ as the set of nodes that have received X;
6:
Update $V_{n}, T_{n}$ and $R_{n}$ by (7),(8) and (9);
7:
$V_{n}$ organizes the nodes in $T_{n}$ to transmit X to $R_{n}$ with cooperative beamforming.
8:
end while