By Topic

Robust Utility Maximization and Admission Control for a MIMO Cognitive Radio Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Huiqin Du ; Sch. of Eng., Univ. of Edinburgh, Edinburgh, UK ; Ratnarajah, T.

This paper considers a multiple-input-multiple-output (MIMO) cognitive radio network, in which a single primary user (PU) coexists with multiple secondary users (SUs). Standard cognitive radio techniques require perfect channel state information (CSI) and are sensitive to the errors in channel estimation. In practice, such errors are inevitable due to finite feedback resources, quantization errors, and other physical constraints. As a result, robustness has become a crucial issue. Under the assumption of norm-bounded channel imperfections, we develop a robust energy-aware design that strives to admit the maximum number of served SUs and enhance the transmit rate of the secondary links while using the least transmit power while imposing the upper limit of the interference temperature to the PU. A utility function is introduced to achieve the multi-objective function by dealing with the tradeoff between maximizing the transmit rate and minimizing the transmit power. Instead of using the deterministic target, the signal-to-interference-and-noise ratio (SINR) target becomes one of the ongoing optimization variables, which is dynamically adapted with the channel condition under the pre-specified bit-error-rate (BER) requirement, and acts as admission control implicitly, i.e., the cognitive link is not allowed to transmit as long as its SINR falls to zero. Due to its nonconvexity and NP-hardness, the underlying problem is reformulated in a semidefinite programming (SDP) form and solved via an iterative bisection search approach. Simulation results are provided to validate the robustness and efficiency of the proposed scheme.

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:62 ,  Issue: 4 )