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

Energy-Efficiency-Based Resource Allocation Framework for Cognitive Radio Networks With FBMC/OFDM

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
25
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 32 publications
(25 citation statements)
references
References 46 publications
0
25
0
Order By: Relevance
“…(1) / * initialization * / (2) Generate topology of primary systems; (3) Generate SIDs appearance probability matrix randomly; (4) Set the values of P r , P t , G t , G r , P sb , P pu , P su , and λ; (5) Determine the PSO parameters: c1, c2, w, npop, iteration number; (6) Set particle(p).best.U(x) � 0 globalbest.U(x) � 0; (7) Generate particle (SIGSs positions and channels) positions and velocities using Equations (13) and (14); (8) Obtain the SIGS position and matched channel; (9) Set iteration � 0; (10) / * calculate every particles utility function * / (11) while (iteration ≤ predetermined maximum iteration number) (12) { (13) for p population size, p � 1 to npop (14) { (15) for m SIGS, m � 1 to N s (16) { (17) Calculate the S_ESINR j k,i and P_WSINR j l based on particle positions; (18) Check the constraint using Equations (11) and (12); (19) if…”
Section: Simulation Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…(1) / * initialization * / (2) Generate topology of primary systems; (3) Generate SIDs appearance probability matrix randomly; (4) Set the values of P r , P t , G t , G r , P sb , P pu , P su , and λ; (5) Determine the PSO parameters: c1, c2, w, npop, iteration number; (6) Set particle(p).best.U(x) � 0 globalbest.U(x) � 0; (7) Generate particle (SIGSs positions and channels) positions and velocities using Equations (13) and (14); (8) Obtain the SIGS position and matched channel; (9) Set iteration � 0; (10) / * calculate every particles utility function * / (11) while (iteration ≤ predetermined maximum iteration number) (12) { (13) for p population size, p � 1 to npop (14) { (15) for m SIGS, m � 1 to N s (16) { (17) Calculate the S_ESINR j k,i and P_WSINR j l based on particle positions; (18) Check the constraint using Equations (11) and (12); (19) if…”
Section: Simulation Resultsmentioning
confidence: 99%
“…Taking into consideration the energy limitations, many papers have studied resource allocation schemes aimed at saving energy. For example, Denis et al [15] investigated the problem of SUs' energy efficiency maximization under secondary total power and primary interference constraints. In CRNs, utilizing resources without subjecting PUs to harmful interference is a crucial problem; this means that any method used to assign the resources must guarantee that PU transmissions are always prioritized.…”
Section: Introductionmentioning
confidence: 99%
“…From (B.3) and (B.4), we can observe that the feasible solutions of (22) are also suitable for (16). According to (19), we also obtain f 2 (P n+1 p,i ,P n+1 s,i ,P n+1 z,i ) ≤ f 2 (P n p,i ,P n s,i ,P n z,i ) Then, following the iterative procedure in (22), we arrive at I i=1 f 1 (P n+1 p,i ,P n+1 s,i ,P n+1 z,i ) − f 2 (P n p,i ,P n s,i ,P n z,i ) − b i (P n+1 p,i −P n p,i ) (b iP n p,i + σ 2 c,i )ln2 From (B.7), we can observe that the proposed iterative procedure is monotonically non-decreasing with the increasing of iterative numbers. In addition, by employing the transmit power constraints of PBS and CBS, i.e., I i=1 P p,i ≤ P total PBS and I i=1 (P s,i + P z,i ) ≤ P total CBS , the upper bound of the objective function can be given by…”
Section: (B4)mentioning
confidence: 86%
“…Based on the given tolerance ε, we can give the iterations as ∆f N0 ln 2 . Given 3I scalar variables in problem (22), so we need at most O((3I) 3.5 log(1/ε)) calculations at each inner iteration [42]. Finally, the overall computational complexity of the proposed scheme can be roughly written as Step 1: Initialize the maximum number of iterations mmax, nmax and the maximum tolerance ε.…”
Section: Two-tier Iterative Algorithm For Icsi-seemmentioning
confidence: 99%
See 1 more Smart Citation