Table - PMC

Skip to main content

View full-text article in PMC

. 2021 Nov 19;21(22):7706. doi: 10.3390/s21227706

Algorithm 3 TMR Routing Protocol

1:
at RSU:
2:
While (RREP = true) !RREPs received from Algorithm 2
3:
procedure 1: Calculating average $R T T_{i j}$
4:
!RTT_ij received from Algorithm 2
5:
$R T T_{i a} = \frac{\sum_{j = 1}^{n} R T T_{i j}}{n}$
6:
end procedure
7:
procedure 2 Path Selection
8:
if ( $R T T_{i j} > R T T_{i a}$ ) then
9:
drop $R T T_{i j}$ route
10:
else
11:
add $R T T_{i j}$ into an array $A []$
12:
sort array $A []$ in an ascending order
13:
update the routing table
14:
end if
15:
Send a message using a route with the minimum RTT in $A []$
16:
if ( $t i m e o u t$ ) then
17:
send a message using a route with the next minimum RTT in $A []$
18:
end if
19:
end procedure