A Data-Gathering, Dynamic Duty-Cycling MAC Protocol for Large-Scale Wireless Sensor Networks

View full-text article in PMC

. 2020 Jul 22;20(15):4071. doi: 10.3390/s20154071

Algorithm 1 GSE: processing a received DIVISION message

1:
$t \leftarrow M S t a t e D u r + T_{M} - ⌊ \frac{M S t a t e D u r + T_{M}}{T_{c y c l e}} ⌋ \cdot T_{c y c l e}$ ;
2:
if $grade < 0$ or $grade > MGrade + 1$ then
3:
$grade \leftarrow MGrade + 1$ ;
4:
if $MState = = R$ then
5:
if $t < T_{s l o t}$ then
6:
$state \leftarrow T; stateDur \leftarrow t$ ;
7:
else if $t < (ξ + 1) \cdot T_{s l o t}$ then
8:
$state \leftarrow S; stateDur \leftarrow t - T_{s l o t}$ ;
9:
else
10:
$state \leftarrow R; stateDur \leftarrow t - (ξ + 1) \cdot T_{s l o t}$ ;
11:
end if
12:
end if
13:
if $MState = = T$ then
14:
if $t < ξ \cdot T_{s l o t}$ then
15:
$state \leftarrow S; stateDur \leftarrow t$ ;
16:
else if $t < (ξ + 1) \cdot T_{s l o t}$ then
17:
$state \leftarrow R; stateDur \leftarrow t - ξ \cdot T_{s l o t}$ ;
18:
else
19:
$state \leftarrow T; stateDur \leftarrow t - (ξ + 1) \cdot T_{s l o t}$ ;
20:
end if
21:
end if
22:
if $MState = = S$ then
23:
if $t < (ξ - 1) \cdot T_{s l o t}$ then
24:
$state \leftarrow S; stateDur \leftarrow t + T_{s l o t}$ ;
25:
else if $t < ξ \cdot T_{s l o t}$ then
26:
$state \leftarrow R; stateDur \leftarrow t - (ξ - 1) \cdot T_{s l o t}$ ;
27:
else if $t < (ξ + 1) \cdot T_{s l o t}$ then
28:
$state \leftarrow T; stateDur \leftarrow t - ξ \cdot T_{s l o t}$ ;
29:
else
30:
$state \leftarrow S; stateDur \leftarrow t - (ξ + 1) \cdot T_{s l o t}$ ;
31:
end if
32:
end if
33:
$MGrade \leftarrow grade; MState \leftarrow state; MStateDur \leftarrow stateDur$ ;
34:
rebroadcast the DIVISION message;
35:
else
36:
discard the DIVISION message;
37:
end if