Table - PMC

Skip to main content

View full-text article in PMC

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

Algorithm 1 SARF Algorithm

1:
/* Initialization
2:
$c c f \leftarrow 0;$ ▹ Number of consecutive transmission failures
3:
$c c s \leftarrow 0;$ ▹ Number of consecutive transmission successes
4:
$R \leftarrow {r_{1}, r_{2}, . . ., r_{n}};$ ▹ Available rates
5:
$i \leftarrow 1;$ ▹ Select the lowest transmission rate in set R
6:
$t r \leftarrow r_{1};$ ▹ Set transmission rate to the lowest value
7:
/* End Initialization
8:
while true do
9:
if Request of a new transmission then
10:
if Previous attempt was failed then
11:
Perform transmission attempt at the lowest rate
12:
else
13:
Perform transmission attempt at the current rate
14:
if Success then
15:
$c c f \leftarrow 0;$ ▹ Reset # of consecutive failures
16:
$c c s + +;$ ▹ Increase counter of consecutive successes
17:
if $c c s \geq N$ then ▹ If success threshold reached
18:
if $i < n$ then ▹ If highest rate not reached
19:
$i + +$ ;
20:
$t_{r} \leftarrow r_{i};$ ▹ Increase rate
21:
end if
22:
end if
23:
else
24:
/* (If failure)
25:
$c c s \leftarrow 0;$ ▹ Reset # of consecutive successes
26:
$c c f + +;$ ▹ Increase consecutive failures
27:
if $c c f \geq K$ then ▹ If failure threshold reached
28:
if $i > 1$ then ▹ If lowest rate not reached
29:
$i - -;$
30:
$t_{r} \leftarrow r_{i};$ ▹ Decrease rate
31:
end if
32:
end if
33:
end if
34:
end if
35:
end if
36:
end while