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.
| Original language | English |
|---|---|
| Article number | 8758187 |
| Pages (from-to) | 1811-1815 |
| Number of pages | 5 |
| Journal | IEEE Communications Letters |
| Volume | 23 |
| Issue number | 10 |
| DOIs | |
| Publication status | Published - Oct 2019 |
| Externally published | Yes |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 7 Affordable and Clean Energy
Keywords
- MEC
- MINLP
- OFDMA
- resource allocation
Fingerprint
Dive into the research topics of 'Joint Uplink/Downlink Sub-Channel, Bit and Time Allocation for Multi-Access Edge Computing'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver