Table - PMC

Skip to main content

View full-text article in PMC

. 2017 Feb 10;17(2):338. doi: 10.3390/s17020338

Algorithm 1 The CTMAC Algorithm

1:
if the number of vehicles n is lager than $n^{*}$ then
2:
if the last transmission was successful then
3:
$s l o t = n$
4:
else
5:
$s l o t = r a n d (0, n)$
6:
end if
7:
else
8:
if the last transmission was successful then
9:
$C W = C W_{m i n}$
10:
else
11:
$C W = m i n (2 \times C W + 1, C W_{m a x})$
12:
end if
13:
$s l o t = r a n d (0, C W)$
14:
end if