Skip to content
naulon
Not checkedNot checked for notices yet.

Energy Efficiency Based Joint Computation Offloading and Resource Allocation in Multi-Access MEC Systems

Xiaotong Yang, Xueyong Yu, Hao Huang and 1 more

IEEE Access · 2019

doi:10.1109/access.2019.2936435 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

With the rapid growth of computation demands from mobile applications, mobile-edge computing (MEC) provides a new method to meet requirement of high data rate and high computation capability. By offloading the latency-critical or computation-intensive tasks to the edge server, mobile devices (MDs) could save energy consumption and extend battery life. However, unlike cloud servers, resource bottlenecks in MEC servers limit the scalability of offloading. Hence, computation offloading and resource allocation need to be optimized. Toward this end, we consider a multi-access MEC servers system in which Orthogonal Frequency-Division Multiplexing Access (OFDMA) is used as the transmission mechanism for uplink. In order to minimize energy consumption of MDs, we propose a joint optimization strategy for computation offloading, subcarrier allocation, and computing resource allocation, which is a mixed integer non-linear programming (MINLP) problem. First, we design a bound improving branch-and-bound (BnB) algorithm to find the global optimal solution. Then, we present a combinational algorithm to obtain the suboptimal solution for practical application. Simulation results reveal that the combinational algorithm performs very closely to the BnB algorithm in energy saving, but it has a better performance in average algorithm time. Furthermore, our proposed solutions outperform other benchmark schemes.

Abstract licence: CC BY-NC-ND

References35

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

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    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.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.