|
Algorithm 1 Foraging-based group selection |
-
1:
Input: User positions , user requests , group locations , and charging power
-
2:
Init: UAV position, group selection
-
3:
Optimize the power allocation and bandwidth allocation coefficient for each group and each user
-
4:
Calculate the profitability for each group
-
5:
Rank the profitability from large to small
-
6:
repeat
-
7:
Select the next potential served group from the remaining set with the largest profitability
-
8:
-
9:
Delete group from the group set
-
10:
until Satisfy (28)
-
11:
-
12:
Output: Optimal group selection with maximal deployment profitability
|