2021
DOI: 10.3390/s21051833
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Allocation for Downlink Multi-Channel NOMA Systems Considering Complex Constraints

Abstract: To enable an efficient dynamic power and channel allocation (DPCA) for users in the downlink multi-channel non-orthogonal multiple access (MC-NOMA) systems, this paper regards the optimization as the combinatorial problem, and proposes three heuristic solutions, i.e., stochastic algorithm, two-stage greedy randomized adaptive search (GRASP), and two-stage stochastic sample greedy (SSD). Additionally, multiple complicated constraints are taken into consideration according to practical scenarios, for instance, t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 36 publications
(42 reference statements)
0
5
0
Order By: Relevance
“…If the input scale is large, (2) a random algorithm can accurately solve the problem with a high probability in polynomial time or (3) an approximate solution for the problem can be obtained in polynomial time. In [27], other approximate schemes are also mentioned. The central concept is to adopt the random sampling of sub-channels with probability ρ to avoid the traversal search.…”
Section: Fully Polynomial Time Approximation Program Based On Dynamic Programming (Dp-fpta)mentioning
confidence: 99%
See 1 more Smart Citation
“…If the input scale is large, (2) a random algorithm can accurately solve the problem with a high probability in polynomial time or (3) an approximate solution for the problem can be obtained in polynomial time. In [27], other approximate schemes are also mentioned. The central concept is to adopt the random sampling of sub-channels with probability ρ to avoid the traversal search.…”
Section: Fully Polynomial Time Approximation Program Based On Dynamic Programming (Dp-fpta)mentioning
confidence: 99%
“…Due to the high complexity of this program, it can only be regarded as an optimization reference index. However, the solutions provided in [27] reduce the complexity by discretizing the power value to achieve the approximate optimal performance.…”
Section: Introductionmentioning
confidence: 99%
“…The performance of multihop, FD, and NOMA systems was studied widely in [ 21 , 22 , 23 , 24 , 25 , 26 , 27 ]. Xu and others proposed three solutions, namely, stochastic algorithm, two-stage greedy randomized adaptive search, and two-stage stochastic sample to maximize sum-rate by jointly optimizing the channel and power allocation [ 21 ]. The outage probability (OP) and ergodic capacity of the NOMA systems combined with full-duplex relaying were derived in [ 22 ].…”
Section: Introductionmentioning
confidence: 99%
“…Similarly, other users decode their signals. The furthest weak user does not receive the high power signals of other users; therefore, it considers the power of others users with the better channel conditions as noise to decode its own signal [ 26 ].…”
Section: Introductionmentioning
confidence: 99%
“…To permit an effective Dynamic Power and Channel Allocation (DPCA) in the DL multi-channel NOMA (MC-NOMA) systems [ 26 ], the optimization as the combinative problem, and offers three investigative solutions, i.e., two-stage Greedy Randomized Adaptive Search (GRASP), stochastic algorithm, and two-stage Stochastic Sample greeDy (SSD). For shortage of frequency band resources, a Terrestrial-Satellite Integrated Network (TSIN) for ground users in [ 35 ] is evaluated with NOMA.…”
Section: Introductionmentioning
confidence: 99%