The Impact of Rate Adaptation Algorithms on Wi-Fi-Based Factory Automation Systems

. 2020 Sep 11;20(18):5195. doi: 10.3390/s20185195

Algorithm 4: Selection of the retransmission chain ensuring the lowest transmission error probability for each value of N

1:
repeat
2:
Generate a retransmission chain of size i, $R C_{i}$
3:
calculate $t_{t r a n s} (l, s \in S, N, R C_{i})$
4:
if $t_{t r a n s} (l, s \in S, N, R C_{i}) \leq D$ then
5:
if $P_{r} (l, s \in S, N, R C_{i}) < {\bar{P}}_{r} [i]$ then
6:
${\bar{t}}_{t r a n s} [i] \leftarrow t_{t r a n s} (l, s \in S, N, R_{i})$
7:
${\bar{P}}_{r} [i] \leftarrow P_{r} (l, s \in S, N, R_{i})$
8:
${\bar{R C}}_{l o w} [i] \leftarrow R C_{i}$
9:
else if $P_{r} (l, s \in S, N, R_{i}) = {\bar{P}}_{r} [i]$ then
10:
if $t_{t r a n s} (l, s \in S, N, R C_{i}) < {\bar{t}}_{t r a n s} [i]$ then
11:
${\bar{t}}_{t r a n s} [i] \leftarrow t_{t r a n s} (l, s \in S, N, R C_{i})$
12:
${\bar{P}}_{r} [i] \leftarrow P_{r} (l, s \in S, N, R_{i})$
13:
${\bar{R C}}_{l o w} [i] \leftarrow R C_{i}$
14:
else
15:
Do Nothing
16:
end if
17:
else
18:
Do Nothing
19:
end if
20:
else
21:
Continue
22:
end if
23:
until there are sequences of rates $r_{j}$ , of length $i, \in R$ , meeting condition 2