|
Algorithm 1 PA-BAC for optimal user association at slot t. |
-
1:
Input: Given UAV deployment positions ; ship positions ; priority weights .
-
2:
Output: Optimal association .
-
3:
Compute link feasibility and rates for all UAV–ship pairs using the channel model; obtain and .
-
4:
Formulate the BILP (objective (29) with constraints C1–C5).
-
5:
Perform greedy association from higher to lower priority to obtain a feasible initial association , and compute .
-
6:
Initialize the active problem queue Q and push the initial BILP into Q. Set the current best as .
-
7:
while Q is not empty do
-
8:
Pop and remove a subproblem from the front of Q.
-
9:
Solve the LP relaxation of , obtaining the relaxed solution and the objective value .
-
10:
if is infeasible or then
-
11:
Prune and return to Step 7.
-
12:
else if is an integer (integral) solution then
-
13:
Update: , and return to Step 7.
-
14:
else
-
15:
Search for cutting planes violated by and collect them into the cut set L.
-
16:
if L is not empty then
-
17:
Add L into subproblem , and return to Step 9.
-
18:
else
-
19:
Decompose the original problem into restricted feasible subproblems via branching; perform priority-guided branching by preferentially selecting variables corresponding to higher-priority users as branching variables; push the newly generated subproblems into queue Q, and return to Step 7.
-
20:
end if
-
21:
end if
-
22:
end while
-
23:
return
|