Channel-Aware Random Access in the Presence of Channel Estimation Errors

In this work, we consider the random access of nodes adapting their transmission probability based on the local channel state information (CSI) in a decentralized manner, which is called CARA. The CSI is not directly available to each node but estimated with some errors in our scenario. Thus, the impact of imperfect CSI on the performance of CARA is our main concern. Specifically, an exact stability analysis is carried out when a pair of bursty sources are competing for a common receiver and, thereby, have interdependent services. The analysis also takes into account the compound effects of the multipacket reception (MPR) capability at the receiver. The contributions in this paper are twofold: first, we obtain the exact stability region of CARA in the presence of channel estimation errors; such an assessment is necessary as the errors in channel estimation are inevitable in the practical situation. Secondly, we compare the performance of CARA to that achieved by the class of stationary scheduling policies that make decisions in a centralized manner based on the CSI feedback. It is shown that the stability region of CARA is not necessarily a subset of that of centralized schedulers as the MPR capability improves.Comment: The material in this paper was presented in part at the IEEE International Symposium on Information Theory, Cambridge, MA, USA, July 201

A Sensing Error Aware MAC Protocol for Cognitive Radio Networks

Cognitive radios (CR) are intelligent radio devices that can sense the radio environment and adapt to changes in the radio environment. Spectrum sensing and spectrum access are the two key CR functions. In this paper, we present a spectrum sensing error aware MAC protocol for a CR network collocated with multiple primary networks. We explicitly consider both types of sensing errors in the CR MAC design, since such errors are inevitable for practical spectrum sensors and more important, such errors could have significant impact on the performance of the CR MAC protocol. Two spectrum sensing polices are presented, with which secondary users collaboratively sense the licensed channels. The sensing policies are then incorporated into p-Persistent CSMA to coordinate opportunistic spectrum access for CR network users. We present an analysis of the interference and throughput performance of the proposed CR MAC, and find the analysis highly accurate in our simulation studies. The proposed sensing error aware CR MAC protocol outperforms two existing approaches with considerable margins in our simulations, which justify the importance of considering spectrum sensing errors in CR MAC design.Comment: 21 page, technical repor

Performance Analysis of Cognitive Radio Systems under QoS Constraints and Channel Uncertainty

In this paper, performance of cognitive transmission over time-selective flat fading channels is studied under quality of service (QoS) constraints and channel uncertainty. Cognitive secondary users (SUs) are assumed to initially perform channel sensing to detect the activities of the primary users, and then attempt to estimate the channel fading coefficients through training. Energy detection is employed for channel sensing, and different minimum mean-square-error (MMSE) estimation methods are considered for channel estimation. In both channel sensing and estimation, erroneous decisions can be made, and hence, channel uncertainty is not completely eliminated. In this setting, performance is studied and interactions between channel sensing and estimation are investigated. Following the channel sensing and estimation tasks, SUs engage in data transmission. Transmitter, being unaware of the channel fading coefficients, is assumed to send the data at fixed power and rate levels that depend on the channel sensing results. Under these assumptions, a state-transition model is constructed by considering the reliability of the transmissions, channel sensing decisions and their correctness, and the evolution of primary user activity which is modeled as a two-state Markov process. In the data transmission phase, an average power constraint on the secondary users is considered to limit the interference to the primary users, and statistical limitations on the buffer lengths are imposed to take into account the QoS constraints of the secondary traffic. The maximum throughput under these statistical QoS constraints is identified by finding the effective capacity of the cognitive radio channel. Numerical results are provided for the power and rate policies

Robust Beamforming for Security in MIMO Wiretap Channels with Imperfect CSI

In this paper, we investigate methods for reducing the likelihood that a message transmitted between two multiantenna nodes is intercepted by an undetected eavesdropper. In particular, we focus on the judicious transmission of artificial interference to mask the desired signal at the time it is broadcast. Unlike previous work that assumes some prior knowledge of the eavesdropper's channel and focuses on maximizing secrecy capacity, we consider the case where no information regarding the eavesdropper is available, and we use signal-to-interference-plus-noise-ratio (SINR) as our performance metric. Specifically, we focus on the problem of maximizing the amount of power available to broadcast a jamming signal intended to hide the desired signal from a potential eavesdropper, while maintaining a prespecified SINR at the desired receiver. The jamming signal is designed to be orthogonal to the information signal when it reaches the desired receiver, assuming both the receiver and the eavesdropper employ optimal beamformers and possess exact channel state information (CSI). In practice, the assumption of perfect CSI at the transmitter is often difficult to justify. Therefore, we also study the resulting performance degradation due to the presence of imperfect CSI, and we present robust beamforming schemes that recover a large fraction of the performance in the perfect CSI case. Numerical simulations verify our analytical performance predictions, and illustrate the benefit of the robust beamforming schemes.Comment: 10 pages, 5 figures; to appear, IEEE Transactions on Signal Processing, 201

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

Optimal Spectrum Access for Cognitive Radios

In this paper, we investigate a time-slotted cognitive setting with buffered primary and secondary users. In order to alleviate the negative effects of misdetection and false alarm probabilities, a novel design of spectrum access mechanism is proposed. We propose two schemes. First, the SU senses primary channel to exploit the periods of silence, if the PU is declared to be idle, the SU randomly accesses the channel with some access probability $a_s$. Second, in addition to accessing the channel if the PU is idle, the SU possibly accesses the channel if it is declared to be busy with some access probability $b_s$. The access probabilities as function of the misdetection, false alarm and average primary arrival rate are obtained via solving an optimization problem designed to maximize the secondary service rate given a constraint on primary queue stability. In addition, we propose a variable sensing duration schemes where the SU optimizes over the optimal sensing time to achieve the maximum stable throughput of the network. The results reveal the performance gains of the proposed schemes over the conventional sensing scheme. We propose a method to estimate the mean arrival rate and the outage probability of the PU based on the primary feedback channel, i.e., acknowledgments (ACKs) and negative-acknowledgments (NACKs) messages.Comment: arXiv admin note: substantial text overlap with arXiv:1206.615