z-logo
open-access-imgOpen Access
Computation offloading in cognitive radio NOMA‐enabled multi‐access edge computing systems
Author(s) -
Nguyen Chuyen T.,
Pham QuocViet,
Pham HuongGiang T.,
Dao NhuNgoc,
Hwang WonJoo
Publication year - 2020
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2020.0344
Subject(s) - computer science , computation offloading , cognitive radio , mobile edge computing , edge computing , subcarrier , small cell , noma , computer network , enhanced data rates for gsm evolution , computation , distributed computing , cellular network , server , wireless , telecommunications link , orthogonal frequency division multiplexing , algorithm , telecommunications , channel (broadcasting)
The explosive growth of end devices and mobile applications calls for novel schemes that can enable computation‐hungry applications at small end‐devices and meet the massive connectivity requirement. Cognitive radio (CR), non‐orthogonal multiple access (NOMA) and multi‐access edge computing (MEC) are envisioned as the key technologies in fifth‐generation and beyond. In this work, the authors introduce the concept of CR‐NOMA in MEC offloading, where a secondary user (SU) can utilise the spectrum allocated to a primary user (PU) to offload its computation task to the MEC server for remote execution. For the spectrum utilisation, an equation to specify the minimum transmit power that must be allocated to the PU is derived. The authors also develop an algorithm to determine the offloading decision (i.e. offloading or not) and the paired PU (i.e. subcarrier used for computation offloading) for SUs, using one‐to‐one matching game. Moreover, through numerical simulations, the authors demonstrate the superior performance of the proposed algorithm compared with several baseline schemes.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here