Minimizing the computation latency of FDMA‐based wireless powered edge computing network

Abstract

Abstract The 0–1 mixed integer programming problem of binary offloading on wireless powered mobile edge computing (WP‐MEC) networks requires joint optimization of binary and continuous variables, which is computationally expensive for traditional techniques and difficult to solve within the channel coherence time under time‐varying condition. Using machine learning models to output variable values is also challenging. Hence, designing efficient and low‐complexity algorithms is crucial for optimal network performance. This paper focuses on the computation latency of the FDMA‐based WP‐MEC network and proposes a task‐offloading algorithm to minimize the total completion delay (TCD). The TCD minimization is modelled as a 0–1 MIP problem and is decomposed into a master problem of optimizing the offloading decision and the sub‐problem of optimizing other parameters under a given offloading decision. The sub‐problem is solved using optimization method, while the master problem is solved using a deep reinforcement learning algorithm. Simulation results show that the proposed algorithm can achieve almost minimal TCD with low complexity.

Keywords

• convex programming
• delay estimation
• frequency division multiple access
• integer programming
• internet of things