Completion Time Minimization in NOMA Systems: Learning for Combinatorial Optimization

Completion Time Minimization in NOMA Systems : Learning for Combinatorial Optimization

QC 20220520
In this letter, we study a completion-time minimization problem by jointly optimizing time slots (TSs) and power allocation for time-critical non-orthogonal multiple access (NOMA) systems. The original problem is non-linear/non-convex with discrete variables, leading to high computational complexity in conventional iterative methods. Towards an efficient solution, we train deep neural networks to perform fast and high-accuracy predictions to tackle the difficult combinatorial parts, i.e., determining the minimum consumed TSs and user-TS allocation. Based on the learning-based predictions, we develop a low-complexity post-process procedure to provide feasible power allocation. The numerical results demonstrate promising improvements of the proposed scheme compared to other baseline schemes in terms of computational efficiency, approximating optimum, and feasibility guarantee.

Lei, L. (författare)
Lagunas, E. (författare)
Chatzinotas, S. (författare)
Ottersten, Björn,1961-Interdisciplinary Center for Security, Reliability and Trust, University of Luxembourg, Schuttrange, Luxembourg,Signal Processing(Swepub:kth)u120hb53 (författare)
Interdisciplinary Center for Security, Reliability and Trust, University of Luxembourg, Schuttrange, LuxembourgSignal Processing (creator_code:org_t)

Ingår i:IEEE Networking Letters: Institute of Electrical and Electronics Engineers (IEEE)3:1, s. 15-182576-3156

Av författaren/redakt...: Wang, A.; Lei, L.; Lagunas, E.; Chatzinotas, S.; Ottersten, Björn ...

Om ämnet

TEKNIK OCH TEKNOLOGIER: TEKNIK OCH TEKNO ...; och Elektroteknik oc ...; och Signalbehandling

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.