Table - PMC

Skip to main content

View full-text article in PMC

. 2015 Dec 3;15(12):30221–30239. doi: 10.3390/s151229800

Algorithm 1 A M-Level contention window tuning algorithm with a minimum tuning rate of γ.

Initialization

1:
$unsigned$ $s l o t_c n t = 0$ , $i d l e_s l o t_c n t = 0$ , k;
2:
$double$ $c w = C W_M I N$ , $v e c t o r_i n c [M]$ , $v e c t o r_d e c [M]$ ;
3:
for $k = 0; k < M; k + +$ do
4:
$v e c t o r_i n c [k] = P_{I} (32, θ \cdot γ^{k})$ ;
5:
$v e c t o r_d e c [k] = P_{I} (32, θ / γ^{k})$ ;
6:
end for

Algorithm Body

1:
while 1 do
2:
if detecting an idle slot then
3:
$s l o t_c n t + +$ ;
4:
if the slot is over with idle then
5:
$i d l e_s l o t_c n t + +$ ;
6:
end if
7:
end if
8:
end while
9:
while 1 do
10:
if before generating a new backoff period then
11:
if $s l o t_c n t - i d l e_s l o t_c n t \geq 5$ then
12:
for $k = 0; k < M; k + +$ do
13:
if $i d l e_s l o t_c n t / s l o t_c n t < v e c t o r_i n c [k]$ then
14:
$c w = c w * γ$ ;
15:
end if
16:
if $i d l e_s l o t_c n t / s l o t_c n t > v e c t o r_d e c [k]$ then
17:
$c w = c w / γ$ ;
18:
end if
19:
end for
20:
$s l o t_c n t = 0$ , $i d l e_s l o t_c n t = 0$ ;
21:
end if
22:
end if
23:
end while