Cross-Layer Optimization for Heterogeneous MU-MIMO/OFDMA Networks

. 2021 Apr 13;21(8):2744. doi: 10.3390/s21082744

Algorithm 1

Q_{l f}

Computation.

1:
$Q_{l f} \leftarrow \emptyset$
2:
$G \leftarrow (N, L)$
3:
for $f \in F$ do
4:
$V \leftarrow f^{dst}, f^{src}$ ▹V keeps track of the visited nodes.
5:
$P \leftarrow \emptyset$ ▹P is the path traced so far.
6:
DFS $(f, G, V, P, Q_{l f})$
7:
end for
8:
return $Q_{l f}$
9:
function DFS( $f, G, V, P, Q_{l f}$ )
10:
$i \leftarrow V (e n d)$ ▹ $V (e n d)$ is the last visited node, while $V (1)$ is the destination of f.
11:
for $l \in L_{i}^{out}$ do
12:
if $l^{dst} = = V (1)$ then
13:
$Q_{l f} \leftarrow 1$
14:
$r e t \leftarrow 1$
15:
else
16:
if $l^{dst} \notin V$ && $| P | < h$ then ▹h is the maximum number of hops.
17:
$V \leftarrow V + l^{dst}$
18:
$P \leftarrow P + l$
19:
$(r e t^{t m p}, Q_{l f}) \leftarrow DFS (f, G, V, P, Q_{l f})$
20:
$Q_{l f} \leftarrow r e t^{t m p}$
21:
$r e t \leftarrow r e t^{t m p} | | r e t$
22:
$V \leftarrow V - l^{dst}$
23:
$P \leftarrow P - l$
24:
end if
25:
end if
26:
end for
27:
return $r e t$ , $Q_{l f}$
28:
end function