2018
DOI: 10.1109/tvt.2018.2864545
|View full text |Cite
|
Sign up to set email alerts
|

Energy-Efficient Full-Duplex Cooperative Nonorthogonal Multiple Access

Abstract: Full-duplex (FD) cooperative non-orthogonal multiple access (NOMA) achieves superior throughput over conventional half-duplex (HD) cooperative NOMA, where the strong users (SUs) with good channel conditions can act as an FD relay node for the weak users (WUs) with poor channel conditions. However, the energy efficiency (EE) of cooperative NOMA may be degraded due to additional power consumption incurred at the SUs. We are therefore motivated to investigate the EE maximization problem of an FD cooperative NOMA … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
8
2

Relationship

3
7

Authors

Journals

citations
Cited by 37 publications
(28 citation statements)
references
References 17 publications
0
28
0
Order By: Relevance
“…Note that an EE maximization problem that involves both SE and power consumption can be handled by quasi-concave optimization. That is, one can transform the fractional structure into a more tractable difference structure, which can be solved by standard convex optimization approaches [47] [48]. As seen, the proposed A-FR obtains the highest EE while the TS-FR is the least efficient solution among the algorithms.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…Note that an EE maximization problem that involves both SE and power consumption can be handled by quasi-concave optimization. That is, one can transform the fractional structure into a more tractable difference structure, which can be solved by standard convex optimization approaches [47] [48]. As seen, the proposed A-FR obtains the highest EE while the TS-FR is the least efficient solution among the algorithms.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…In the relay phase, User 1 transmits the block of decoded signal to User 2 while BS keeps silent. We assume that the channel is static within each block [25] and all the channel information is perfectly known at BS, Users 1 and 2 [12,20]. The channel coefficient between BS and User i is denoted as h i (i = 1, 2) and the channel coefficient between Users 1 and 2 is denoted as h 12 .…”
Section: System Modelmentioning
confidence: 99%
“…Now P2 is a standard semi-definite programming problem, which can be solved by CVX [20]. To tighten the approximation, the value of t n iteratively, ∀n ∈ N , until convergence.…”
Section: Solution To the Problemmentioning
confidence: 99%