Computation Scheduling of Multi-Access Edge Networks Based on the Artificial Fish Swarm Algorithm

With the increasing requirements for computing in modern society, Multi-access Edge Computing (MEC) has received widespread attention for meeting low-latency. In MEC network, mobile devices can offload computing-intensive tasks to edge servers for computing. Wireless Power Transmission (WPT) provides initial energy for mobile devices, and the tasks of mobile devices consume energy when they are locally calculated or completely offloaded. The combination of the two technologies forms the Wireless Powered Mobile Edge Computing (WP-MEC) network. In this article, considering the impact of WPT transmission time τ0, we study the offloading and scheduling of tasks for multiple mobile devices in the WP-MEC network, which is an NP-hard problem. We formulate this scheduling problem to minimize the time delay under the constraint of WPT transmission energy. We regard our problem studied in this paper as a multidimensional knapsack problem (MKP). The difference is that the knapsack capacity in MKP is limited, while in our problem, the knapsack that one item can choose is limited. Therefore, we improve the Artificial Fish Swarm Algorithm (AFSA) and propose Computation Scheduling Based on the Artificial Fish Swarm Algorithm (CS-AFSA) to find the optimal scheduling. We encode a scheduling scheme as an artificial fish and regard the delay corresponding to the scheduling as the optimization object. The optimal artificial fish can be gradually approached and determined through the swarm, follow and prey behavior of artificial fish. The optimal artificial fish is the optimal scheduling scheme. More importantly, based on the original behavior of AFSA, we also improve the scheme that does not meet the WPT energy constraint, including the modification of infeasible artificial fish and insufficient artificial fish. Besides, we also consider how to find the best WPT transmission time τ0. Finally, we perform data simulation on the proposed algorithm.

Abstract licence: CC BY-NC-ND

28 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.