Efficient resource allocation scheduling for MIMO-OFDMA-CR downlink systems

In this paper, we consider the resource allocation problem in a Cognitive Radio (CR) downlink system employing both Orthogonal Frequency Division Multiple Access (OFDMA) and Multiple-Input Multiple-Output (MIMO) technologies. We aim at maximizing the total cognitive system throughput subject to the...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International Conference on Wireless Communications and Signal Processing s. 1 - 5
Hlavní autoři: Huijin Cao, Jun Cai, Alfa, Attahiru, Zhen Zhao
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.10.2016
Témata:
Binary Linear Programming
Cognitive Radio
Computational complexity
Downlink
Interference
Loading
MIMO
OFDMA
Resource Allocation
Resource management
Throughput
ISSN:2472-7628
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 paper, we consider the resource allocation problem in a Cognitive Radio (CR) downlink system employing both Orthogonal Frequency Division Multiple Access (OFDMA) and Multiple-Input Multiple-Output (MIMO) technologies. We aim at maximizing the total cognitive system throughput subject to the interference power constraint at the Primary Receiver (PR), the total transmission power constraint at the Secondary Base Station (SBS), and the Quality of Service (QoS) requirement for each SU in terms of the data rate and Bit Error Rate (BER). This joint resource allocation problem integrates subcarrier assignment, power allocation, bit loading, and interference management, and can be formulated as a Binary Linear Programming (BLP) framework. Although the Branch and Bound (BnB) algorithm is a general approach to obtain the optimal solution for a BLP problem, it is impractical in this joint resource allocation problem due to the high computational complexity. In order to provide a good balance between performance and computational complexity, a Novel Two-Step based (NTS) algorithm is proposed in this paper. Numerical results show that the NTS algorithm can reduce the computational complexity significantly with only marginal performance degradation.
ISSN:2472-7628
DOI:10.1109/WCSP.2016.7752583