710 research outputs found
Throughput Maximization in Cognitive Radio Under Peak Interference Constraints With Limited Feedback
A spectrum-sharing scenario in a cognitive radio (CR) network where a secondary user (SU) shares a narrowband channel with N primary users (PUs) is considered. We investigate the SU ergodic capacity maximization problem under an average transmit power constraint on the SU and N individual peak interference power constraints at each primary-user receiver (PU-Rx) with various forms of imperfect channel-state information (CSI) available at the secondary-user transmitter (SU-Tx). For easy exposition, we first look at the case when the SU-Tx can obtain perfect knowledge of the CSI from the SU-Tx to the secondary-user receiver link, which is denoted as g 1 , but can only access quantized CSI of the SU-Tx to PU-Rx links, which is denoted as g oi , i = 1,..., N, through a limited-feed back link of B = log 2 L b. For this scenario, a locally optimum quantized power allocation (codebook) is obtained with quantized g 0i , i = 1,..., N information by using the Karush-Kuhn-Tucker (KKT) necessary optimality conditions to numerically solve the nonconvex SU capacity maximization problem. We derive asymptotic approximations for the SU ergodic capacity performance for the case when the number of feedback bits grows large (B β β) and/or there is a large number of PUs (N β β) that operate. For the interference-limited regime, where the average transmit power constraint is inactive, an alternative locally optimum scheme, called the quantized-rate allocation strategy, based on the quantized-ratio g 1 /max i g oi information, is proposed. Subsequently, we relax the strong assumption of full-CSI knowledge of g 1 at the SU-Tx to imperfect g 1 knowledge that is also available at the SU-Tx. Depending on the way the SU-Tx obtains the g 1 information, the following two different suboptimal quantized power codebooks are derived for the SU ergodic capacity maximization problem: 1) the power codebook with noisy g 1 estimates and quantized g oi , i = 1,..., N knowledge and 2) another power codebook with both quantized g 1 and g oi , i = 1,... , N information. We emphasize the fact that, although the proposed algorithms result in locally optimum or strictly suboptimal solutions, numerical results demonstrate that they are extremely efficient. The efficacy of the proposed asymptotic approximations is also illustrated through numerical simulation results
Spectral and Energy Efficiency in Cognitive Radio Systems with Unslotted Primary Users and Sensing Uncertainty
This paper studies energy efficiency (EE) and average throughput maximization
for cognitive radio systems in the presence of unslotted primary users. It is
assumed that primary user activity follows an ON-OFF alternating renewal
process. Secondary users first sense the channel possibly with errors in the
form of miss detections and false alarms, and then start the data transmission
only if no primary user activity is detected. The secondary user transmission
is subject to constraints on collision duration ratio, which is defined as the
ratio of average collision duration to transmission duration. In this setting,
the optimal power control policy which maximizes the EE of the secondary users
or maximizes the average throughput while satisfying a minimum required EE
under average/peak transmit power and average interference power constraints
are derived. Subsequently, low-complexity algorithms for jointly determining
the optimal power level and frame duration are proposed. The impact of
probabilities of detection and false alarm, transmit and interference power
constraints on the EE, average throughput of the secondary users, optimal
transmission power, and the collisions with primary user transmissions are
evaluated. In addition, some important properties of the collision duration
ratio are investigated. The tradeoff between the EE and average throughput
under imperfect sensing decisions and different primary user traffic are
further analyzed.Comment: This paper is accepted for publication in IEEE Transactions on
Communication
Sensing Throughput Optimization in Fading Cognitive Multiple Access Channels With Energy Harvesting Secondary Transmitters
The paper investigates the problem of maximizing expected sum throughput in a
fading multiple access cognitive radio network when secondary user (SU)
transmitters have energy harvesting capability, and perform cooperative
spectrum sensing. We formulate the problem as maximization of sum-capacity of
the cognitive multiple access network over a finite time horizon subject to a
time averaged interference constraint at the primary user (PU) and almost sure
energy causality constraints at the SUs. The problem is a mixed integer
non-linear program with respect to two decision variables namely spectrum
access decision and spectrum sensing decision, and the continuous variables
sensing time and transmission power. In general, this problem is known to be NP
hard. For optimization over these two decision variables, we use an exhaustive
search policy when the length of the time horizon is small, and a heuristic
policy for longer horizons. For given values of the decision variables, the
problem simplifies into a joint optimization on SU \textit{transmission power}
and \textit{sensing time}, which is non-convex in nature. We solve the
resulting optimization problem as an alternating convex optimization problem
for both non-causal and causal channel state information and harvested energy
information patterns at the SU base station (SBS) or fusion center (FC). We
present an analytic solution for the non-causal scenario with infinite battery
capacity for a general finite horizon problem.We formulate the problem with
causal information and finite battery capacity as a stochastic control problem
and solve it using the technique of dynamic programming. Numerical results are
presented to illustrate the performance of the various algorithms
Spectral Efficiency of Multi-User Adaptive Cognitive Radio Networks
In this correspondence, the comprehensive problem of joint power, rate, and
subcarrier allocation have been investigated for enhancing the spectral
efficiency of multi-user orthogonal frequency-division multiple access (OFDMA)
cognitive radio (CR) networks subject to satisfying total average transmission
power and aggregate interference constraints. We propose novel optimal radio
resource allocation (RRA) algorithms under different scenarios with
deterministic and probabilistic interference violation limits based on a
perfect and imperfect availability of cross-link channel state information
(CSI). In particular, we propose a probabilistic approach to mitigate the total
imposed interference on the primary service under imperfect cross-link CSI. A
closed-form mathematical formulation of the cumulative density function (cdf)
for the received signal-to-interference-plus-noise ratio (SINR) is formulated
to evaluate the resultant average spectral efficiency (ASE). Dual decomposition
is utilized to obtain sub-optimal solutions for the non-convex optimization
problems. Through simulation results, we investigate the achievable performance
and the impact of parameters uncertainty on the overall system performance.
Furthermore, we present that the developed RRA algorithms can considerably
improve the cognitive performance whilst abide the imposed power constraints.
In particular, the performance under imperfect cross-link CSI knowledge for the
proposed `probabilistic case' is compared to the conventional scenarios to show
the potential gain in employing this scheme
- β¦