In this paper, we study a mobile edge computing (MEC) system in which the mobile device is assisted by a base station (BS) and a relay node. The mobile device has sequential tasks to complete, whereas the relay assists the mobile device on both task offloading and task computation. In specific, two cases are investigated, which are 1) the relay has no tasks to complete itself, and 2) the relay has tasks to complete itself. Our target is to minimize the total energy consumption of the mobile device and the relay through optimizing the transmit duration in task offloading, CPU frequency in task computing along with the task index to offload in the sequential tasks. In the first case, we decompose the mixed-integer non-convex problem into two levels. In the lower level problem, thanks to the convexity, Karush-Kuhn-Tucker (KKT) conditions are utilized to simplify the problem, which is then solved with bisection search. In the upper level problem, to find solution of the task index to offload, rather than utilizing traversal method, we develop a monotonic condition to simplify the searching process. In the second case, in order to guarantee the successful computation of the mobile device and relay, the uploading transmission is classified into three schemes. Within each scheme, the non-convex problem is decomposed. In the lower level problem, semi-closed solution is found by KKT conditions. In the upper level problem, traversal method is applied to find the optimal offloading index.
翻译:在本文中,我们研究移动边缘计算系统(MEC),移动设备在其中由一个基站和中继节点辅助移动设备。移动设备有相继任务要完成,而中继则在任务卸载和任务计算中协助移动设备。具体地说,调查了两个案例,即:(1) 中继没有完成任务,(2) 中继有完成的任务。我们的目标是通过优化任务卸载的传输时间,最大限度地减少移动设备的总能量消耗和中继器的传输时间,在任务中,CPU频率与任务指数一起计算,以卸载相继任务。在第一个案例中,我们将混合内行的非convex问题拆分解为两个级别。在较低一级,由于连接,卡鲁什-库恩-陶克(KKTT)的条件被用来简化问题,然后通过双层搜索解决。在较高一级,在任务指数中,而不是使用跨级方法,我们开发一个单调状态,以简化移动式传输机制的升级程序。在每一级中,通过分解的顺序,将每组中,将一个单调式的递递递进的递进系统,在三个递进的递进系统中,是分解的递进系统。