Research Article
Resource Management Framework Based on the Stackelberg Game in Vehicular Edge Computing
Algorithm 1
DSA service area partitioning algorithm.
| Input: The number of DSA | | The service radius for each DSA | | The Car density kn | | According to the above input, bring the program to determine | | the radius, get the Rref | | | | | | | | | | | | | | counter +1 | | | | | | else | | join the DSA queue list | | | | | | | | move tasks from the adjacent DSA queue list to local completion | | | | | | |
|