By Topic

Service-Outage Capacity Maximization in Cognitive Radio for Parallel Fading Channels

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

3 Author(s)
Limmanee, A. ; Dept. of Electr. & Electron. Eng., Univ. of Melbourne, Melbourne, VIC, Australia ; Dey, S. ; Evans, J.S.

This paper focuses on a cognitive radio network consisting of a secondary user (SU) equipped with orthogonal frequency-division multiplexing (OFDM) technology able to access N randomly fading frequency bands for transmitting delay-insensitive (e.g. data) as well as delay-sensitive (e.g. voice or video) data. Each band is licensed to a distinct delay-sensitive primary user (PU) interested in meeting a minimum rate guarantee for delay-sensitive services with a maximum allowable primary outage probability or a primary outage constraint (POC) . Typically, a PU is oblivious to the SU's existence and has its own power policy based on the channel side information (CSI) of its direct gain between the PU transmitter and the PU receiver only. Under the assumption that the SU knows PUs' power policies and CSI of the entire network, we solve the SU's ergodic capacity maximization problem subject to SU's average transmit power and outage probability constraints (SOC) and all POCs or the so-called service-outage based capacity maximization for SU with POCs. We use a rigorous probabilistic power allocation technique that allows us to derive optimal power policies applicable to both continuous and discrete fading channels. Also, a suboptimal power control policy is proposed in order to avoid the high computational complexity of the optimal policy when N is large. Numerical results are presented to illustrate the performance of the power allocation algorithms.

Published in:

Communications, IEEE Transactions on  (Volume:61 ,  Issue: 2 )