Resource allocation algorithm for downlink MIMO-OFDMA based cognitive radio networks in spectrum underlay scenario

In this study, the sum throughput maximisation problem for cognitive radio networks (CRNs) based on the multiple-input multiple-output orthogonal frequency division multiple access (MIMO-OFDMA) structure has been investigated. Hence, the intention is to maximise the downlink sum throughput of the CR...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IET communications Ročník 14; číslo 11; s. 1811 - 1820
Hlavní autoři: Mohammadi, Mahla, Hosseini Andargoli, Seyed Mehdi
Médium: Journal Article
Jazyk:angličtina
Vydáno: The Institution of Engineering and Technology 14.07.2020
Témata:
CBS
cognitive base station
cognitive radio
cognitive radio networks
combinatorial constraints
complex problem
convex optimisation framework
convex programming
CRN
downlink MIMO‐OFDMA structure
frequency division multiple access
induced interference threshold level
iterative algorithm
iterative methods
Lagrangian coefficients
low complicated algorithms
maximisation problem
MIMO communication
multiple‐input multiple‐output orthogonal frequency division multiple access structure
OFDM modulation
optimal algorithm intricacy
radio networks
radio spectrum management
radiofrequency interference
Research Article
resource allocation
resource allocation algorithm
resource assignment algorithm
spectrum underlay scenario
sum throughput maximisation problem
radio networks
iterative methods
optimal algorithm intricacy
induced interference threshold level
multiple-input multiple-output orthogonal frequency division multiple access structure
sum throughput maximisation problem
downlink MIMO-OFDMA structure
cognitive radio networks
cognitive base station
radiofrequency interference
spectrum underlay scenario
cognitive radio
resource allocation
CBS
convex optimisation framework
low complicated algorithms
OFDM modulation
combinatorial constraints
MIMO communication
resource allocation algorithm
radio spectrum management
frequency division multiple access
maximisation problem
Lagrangian coefficients
convex programming
complex problem
resource assignment algorithm
iterative algorithm
CRN
ISSN:1751-8628, 1751-8636
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this study, the sum throughput maximisation problem for cognitive radio networks (CRNs) based on the multiple-input multiple-output orthogonal frequency division multiple access (MIMO-OFDMA) structure has been investigated. Hence, the intention is to maximise the downlink sum throughput of the CRN in a way that the sum power of the cognitive base station (CBS) remains below the given power limit and the induced interference on each subcarrier guarantees the interference threshold level predefined by primary users. Here, due to combinatorial constraints, the complex problem should be resolved. Hence, the core purpose of this study is to prepare a novel resource assignment algorithm that tries to fulfil these combinatorial constraints simultaneously. Therefore, this study makes progress towards solving the problem theoretically based on convex optimisation framework. An optimal solution has been implemented by proposing the iterative algorithm in which an optimal level of Lagrangian coefficients is obtained. Then, because of the optimal algorithm intricacy, the two low complicated algorithms are further suggested based on the solutions of two simplified versions of the original problem. Numerical results demonstrate that the suggested algorithms improve sum throughput considerably in comparison with classical algorithm. The proposed simplified algorithms converge to the optimal solutions’ performance while their complexities are desirable for practical implementation.
ISSN:1751-8628
1751-8636
DOI:10.1049/iet-com.2019.0512