2020
DOI: 10.1109/lcomm.2020.3004418
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Resource Allocation for MC-NOMA in SWIPT-Enabled Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 15 publications
(11 citation statements)
references
References 16 publications
0
11
0
Order By: Relevance
“…For baseline scheme 3, we consider our proposed scheme based on the OMA in which we set L = 1 for the simulation results. For baseline scheme 4, we consider our proposed scheme in which the SIC ordering is done based on the sorting the channel gains as considered commonly in the literature [27], [29], [33]. It can be observed that our proposed method clearly outperforms the other baseline schemes due to the performing joint resource allocation policy.…”
Section: Simulation Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…For baseline scheme 3, we consider our proposed scheme based on the OMA in which we set L = 1 for the simulation results. For baseline scheme 4, we consider our proposed scheme in which the SIC ordering is done based on the sorting the channel gains as considered commonly in the literature [27], [29], [33]. It can be observed that our proposed method clearly outperforms the other baseline schemes due to the performing joint resource allocation policy.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…However, all of the requirements for IoT cannot be satisfied by OFDM any longer [25]. The combination of SWIPT and NOMA has provoked great interest and it is verified that combining SWIPT with NOMA could bring plenty of advantages [26]- [29]. In particular, the authors in [26] aimed to maximize the total energy efficiency of time switching (TS)-SWIPT assisted NOMA system, by considering the joint optimization of TS ratio and power allocation.…”
Section: B Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…In fact, this iterative algorithm can be adopted to tighten the obtained lower bound where the solution of (38) in iteration (t) is exploited as an initial point for the next iteration (t + 1). It should be noted that the sub-optimal iterative algorithm reaches a locally optimal solution of the original problem (5) with a polynomial time complexity [16], [23]- [25], [32]- [34]. The flowchart of this suboptimal solution is depicted in Fig.…”
Section: Startmentioning
confidence: 99%