Paper Info
Title
Joint QoS-aware admission control, channel assignment, and power allocation for cognitive radio cellular networks
Abstract
In cognitive radio cellular networks (CogCells), primary users (PUs) rarely utilize all the assigned frequency bands at a certain time and a location. The spectral inefficiency caused by the spectrum holes motivated cognitive radio technology (CR) that presents unlicensed secondary users (SUs) an opportunity for using spectrum holes. CR makes the SUs to find and use the spectrum holes without interrupting the operation of PUs. The SUs are allowed to access the channel licensed to the PUs which consist of primary transmitters (PTs) and primary receivers (PRs) when the interference to the PRs is less than acceptable value (i.e., predefined system threshold), and the quality of service (QoS) required by PTs are also guaranteed. According to different levels of QoS required by SUs, the network operator can achieve different secondary revenues by providing different QoS levels to SUs. Due to the high density, the mobility of SUs, the interference limitation at PRs and the QoS requirements from PTs, not all SUs can be supported. The problem we investigated in this paper is to select the maximum subset of SUs to maximize the total secondary revenue of the CogCell, meanwhile the QoS requirements from both PTs and admitted SUs must be guaranteed. Moreover, the interference caused by the admitted SUs and the PTs at the PRs (due to access the same channel) has to be less than the predefined system threshold. In this paper, we formulate such a joint QoS-aware admission control, channel assignment, and power allocation scheme as a non-linear NP-hard optimization problem. This is a very challenging problem and the NP-hardness has been shown in the literature even for the single-channel scenario. In this paper, we propose a new polynomial-time joint QoS-aware admission control, channel assignment and power allocation scheme which has a O(1/log n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p</sub> <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r</sup> + log n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">w</sub> ) approximation guarantee, e.g., the total secondary revenue achieved by our algorithm is at least OmegaO(1/log n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p</sub> <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r</sup> + log n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">w</sub> )of the optimum, where n <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r</sup> <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p</sub> is the number of PRs and n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">w</sub> is the number of available channels in the CogCell. Note that Our algorithm also significantly improves the current best known solution with a O(1/n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p</sub> <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r</sup> ) approximation guarantee for the single-channel scenario [11]. In this paper, we also propose a greedy heuristic approximation algorithm and an exact solution. The simulation results show that the approximation algorithms we proposed can achieve significantly higher secondary revenue than the currently best known approximation approach for this problem, an extension of the minimal SINR removal algorithm in [15]. Indeed, quite surprisingly, the simulation results also demonstrate that the secondary revenue achieved by our approximation approaches is very close to the optimum in practice, specially for the approximation O(1/log n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p</sub> <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r</sup> + log n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">w</sub> ) algorithm.
Year
DOI
Venue
2009
10.1109/MOBHOC.2009.5336984
2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems
Keywords
Field
DocType
quality of service,channel assignment,power allocation,cognitive radio cellular network,wireless channel,radiofrequency interference,nonlinear NP-hard optimization problem,polynomial-time joint QoS-aware admission control,greedy heuristic approximation algorithm,frequency band assignment
Approximation algorithm,Mathematical optimization,Admission control,Computer science,Computer network,Greedy algorithm,Cellular network,Frequency allocation,Channel allocation schemes,Optimization problem,Cognitive radio
Conference
ISSN
ISBN
Citations 
2155-6806
978-1-4244-5113-5
13
PageRank 
References 
Authors
0.66
10
2
Name
Order
Citations
PageRank
Qin Xin1233.54
Jie Xiang217011.18