NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cooperative relay to improve diversity in cognitive radio networks
IEEE Communications Magazine
Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey
IEEE Communications Surveys & Tutorials
IEEE Journal on Selected Areas in Communications
Integrated Radio Resource Allocation for Multihop Cellular Networks With Fixed Relay Stations
IEEE Journal on Selected Areas in Communications
Spectrum Sharing for Multi-Hop Networking with Cognitive Radios
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Cognitive Radio Network (CRN) has been proposed in recent years to solve the spectrum scarcity problem by exploiting the existence of spectrum holes. One of the important issues in the cellular CRNs is how to efficiently allocate primary user (PU) spectrum inside a CRN cell without causing harmful interference to PUs. In this paper, we present a cross-layer framework which jointly considers spectrum allocation and relay selection with the objective of maximizing the minimum traffic demand of secondary users (SUs) in a CRN cell. Specifically, we consider (1) CRN tries to utilize PU spectrum even when the CRN cell is not completely outside the protection region of the PU cell, and (2) cooperative relay is used in cellular CRNs to improve the utilization of PU spectrum. We formulate this cross-layer design problem as a Mixed Integer Linear Programming (MILP) and propose a low complexity heuristic algorithm to solve it. Compared to a simple channel allocation scheme, the numerical results show a significant improvement by using our proposed method and the performance is close to the optimal solution. We further consider the spectrum allocation among several CRN cells with the objective of maximizing the overall minimum throughput of all cells while ensuring each individual cell's minimum throughput requirement. A low complexity algorithm is proposed to achieve the objective with satisfactory performance.