Table - PMC

Skip to main content

View full-text article in PMC

. 2015 Dec 11;15(12):31224–31243. doi: 10.3390/s151229860

Algorithm 1 Transmitting time slot-determining algorithm.

Input: A schedule node

u_{s}

, the set of its reaching nodes

R (u_{s})

;
Output: The set of splitting schedule nodes

u_{s j}

and its transmitting time slot

u_{s j} . t

;

1:
Sorting the nodes in $R (u_{s})$ according to their last active time slot;
2:
$j \leftarrow L + 1$ ;
3:
while $R (u_{s})$ is not empty do
4:
$v_{1} \leftarrow$ the first node in $R (u_{s})$ ;
5:
Create a new schedule node $u_{s j}$ identical to $u_{s}$ ;
6:
$u_{s j} . t \leftarrow e n d (v_{1})$ ;
7:
Add edge $(u_{g}, u_{s j})$ and $(u_{s j}, v_{1})$ in $G^{'}$ ;
8:
for $i = 2$ to $| R (u_{s}) |$ do
9:
$v_{i} \leftarrow$ the i-th node in $R (u_{s})$
10:
if $s t a r t (v_{i}) \leq u_{s j} . t$ then
11:
add edge $(u_{s j}, v_{i})$ ;
12:
else
13:
break;
14:
end if
15:
end for
16:
$j \leftarrow j + 1$ ;
17:
Remove $v_{1}$ from $R (u_{s})$ ;
18:
end while
19:
Delete $u_{s}$ from $G^{'}$ ;
20:
return the set of splitting schedule nodes of $u_{s}$ ;