A Computational Offloading Research Model based on Particle Swarm Optimization Algorithm in Heterogeneous Networks
Abstract
processing, to reduce latency and enhance user experience. This paper proposes a computational offl oading scheme based on a particle optimization algorithm to effectively reduce the economic cost of user computational offl oading in an ultra-dense heterogeneous network with
multiple users and single tasks. The particle swarm optimization algorithm refers to fi nding the optimal solution by simulating the behavior of
a fl ock of birds, each particle searches for the optimal solution separately in the search space, and the particles share information with other
particles in the swarm to fi nd the optimal individual extreme value as the global optimal solution of the entire particle swarm.
Keywords
Full Text:
PDFReferences
[1] Guo F, Zhang H, Ji H, et al. An efficient computation offloading management scheme in the densely deployed small cell networks with
mobile edge computing[J]. IEEE/ACM Transaction on Networking, 2018, Vol.26(6): 2651-2664.
[2] Zhou T, Fu Y, Qin D, et al. Secure and multi-step computation offloading and resource allocation in ultra dense multi task NOMA enabled IoT networks[J]. IEEE Internet of Things Journal, 2024, Vol.11 (3): 5347-5361.
[3] Zhou T, Qin D, Nie X, et al. Energy-efficient computation offloading and resource management in ultradense heterogeneous networks[J].
IEEE Transactions on Vehicular Technology, 2021, Vol.70 (12): 13101-13114.
DOI: http://dx.doi.org/10.70711/aitr.v2i7.5980
Refbacks
- There are currently no refbacks.