kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Joint Computation Offloading and Resource Allocation for MIMO-NOMA Assisted Multi-User MEC Systems
Harbin Inst Technol, Sch Elect & Informat Engn, Harbin 150001, Peoples R China..
Harbin Inst Technol, Sch Elect & Informat Engn, Harbin 150001, Peoples R China.;Peng Cheng Lab, Shenzhen 518055, Peoples R China..
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.ORCID iD: 0000-0001-9621-561X
Harbin Inst Technol, Sch Elect & Informat Engn, Harbin 150001, Peoples R China..
Show others and affiliations
2023 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 71, no 7, p. 4360-4376Article in journal (Refereed) Published
Abstract [en]

This paper investigates the resource allocation and computation offloading problem for multi-access edge computing (MEC) systems, where multiple mobile users (MUs) equipped with multiple antennas access the base station in a non-orthogonal multiple access manner. We jointly optimize the offloading ratio, computational frequency and transmit precoding matrix of each MU to minimize the total energy consumption of all MUs while satisfying the latency constraints. The problem is formulated as a non-convex optimization problem and a two-layer iterative method is proposed to solve the problem efficiently with low complexity. Specifically, we first decompose the original problem into several subproblems, and then sequentially solve these subproblems in an alternative fashion. Furthermore, we also discuss the optimal decoding order of MUs under two different scenarios. Firstly, when the MUs' channel conditions are similar, by deriving closed-form expressions for energy consumptions of all MUs, we prove that the optimal decoding order is only determined by the latency requirements. On the other hand, when the MUs' channel conditions are different, we show that the optimal decoding order is determined by both the channel conditions and the latency requirements. As such, we propose a metric aiming to balance the effects of channel conditions and latency requirements on the MUs' decoding order. Simulation results validate the convergence of the proposed method and demonstrate its superiority over benchmark algorithms.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE) , 2023. Vol. 71, no 7, p. 4360-4376
Keywords [en]
Multi-access edge computing, computation offloading, resource allocation, MIMO-NOMA, decoding order
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-334713DOI: 10.1109/TCOMM.2023.3277531ISI: 001035493400040Scopus ID: 2-s2.0-85160276718OAI: oai:DiVA.org:kth-334713DiVA, id: diva2:1791108
Note

QC 20230824

Available from: 2023-08-24 Created: 2023-08-24 Last updated: 2023-08-24Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Zhang, Deyou

Search in DiVA

By author/editor
Zhang, Deyou
By organisation
Information Science and Engineering
In the same journal
IEEE Transactions on Communications
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 48 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf