Review Article
Energy-Efficient Task Migration and Path Planning in UAV-Enabled Mobile Edge Computing System
Algorithm 1
The proposed EDTM algorithm.
| Input: | | Output: | | (1) | Initialize the target UAV node Set and initial UAV nodes | | (2) | for e = 1: num do | | (3) | the ant looks for the next hop UAV node according to formula (23) | | (4) | get according to formula (24)–(26) | | (5) | Update the tabu table | | (6) | Update local pheromone | | (7) | Update global pheromone by formula (29) | | (8) | for | | (9) | | | (10) | Update migration node set | | (11) | | | (12) | Compute total migration cost | | (13) | Remove invalid UAV nodes and eliminate nonoptimal paths | | (14) | end for | | (15) | end for |
|
