Modeling and Performance Analysis of Opportunistic Link Selection for UAV Communication

. 2021 Jan 13;21(2):534. doi: 10.3390/s21020534

Algorithm 1 Pseudo-code of Greedy Based Algorithm for Time Sequence Resource Allocation

1:
Initialization of parameters
2:
while $I (k) \notin \emptyset$ do
3:
Calculate the differential objective function $Δ S$ towards k UAV with the closest link opportunity in the time domain.
4:
Select a flexible threshold value $T_{h} = ϵ \cdot max (Δ S (l, s))$ according to the maximum value of objective functions.
5:
Find link opportunities for each UAV that satisfies $Δ S > = T_{h}$ .
6:
if Only one UAV is allocated to this opportunity then
7:
Save link opportunity $T$ to $k_{t h}$ UAV.
8:
Remove elements in $I (k)$ when $T_{e} (I (k)) < = T (s)$ .
9:
Update parameters.
10:
else
11:
Save link opportunities $T$ with the maximum $Δ S$ value to $k_{t h}$ UAV.
12:
Remove elements in $I (k)$ when $T_{e} (I (k)) < = T (s)$ .
13:
Update parameters.
14:
end if
15:
end while
16:
return $T$