Abstract
We consider an orthogonal frequency division multiple access (OFDMA)-based Multi-access Edge Computing (MEC) system, consisting of one serving node and multiple users each with an inelastic computation task of a non-negligible task processing duration and a non-negligible computation result size. A joint uplink/downlink sub-channel, bit and time allocation problem is investigated to minimize the energy consumption, which happens to be a very challenging non-convex mixed integer nonlinear programming (MINLP) problem. We equivalently convert it into a convex MINLP problem by using the McCormick envelope, and develop two low-complexity algorithms to obtain two suboptimal solutions. Specifically, one is based on continuous relaxation with greedy rounding and the other one bases on penalty convex–concave procedure. Simulation results show the advantages of our suboptimal solutions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
