On the limits of interweaved cognitive radios

Authors:
G. Chung;S. Vishwanath;C. S. Hwang
Affiliations:
Wireless Networking and Communication Group, University of Texas at Austin, Austin, TX;Wireless Networking and Communication Group, University of Texas at Austin, Austin, TX;Communication Lab., SAIT, Samsung Electronics Co. Ltd., Yongin, Korea
Venue:
RWS'10 Proceedings of the 2010 IEEE conference on Radio and wireless symposium
Year:
2010

Citing 5
Cited 1

Adaptive Spectrum Selection for Cognitive Radio Networks

CSSE '08 Proceedings of the 2008 International Conference on Computer Science and Software Engineering - Volume 05
On the limits of interweaved cognitive radios

RWS'10 Proceedings of the 2010 IEEE conference on Radio and wireless symposium
Capacity of fading channels with channel side information

IEEE Transactions on Information Theory
Achievable rates in cognitive radio channels

IEEE Transactions on Information Theory
Capacity of a Class of Cognitive Radio Channels: Interference Channels With Degraded Message Sets

IEEE Transactions on Information Theory

On the limits of interweaved cognitive radios

RWS'10 Proceedings of the 2010 IEEE conference on Radio and wireless symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the problem of channel sensing in cognitive radios. The system model considered is a set of N parallel (dis-similar) channels, where each channel at any given time is either available or occupied by a legitimate user. The cognitive radio is permitted to sense channels to determine each of their states as available or occupied. The end goal of this paper is to select the best L channels to sense at any given time. Using a convex relaxation approach, this paper formulates and approximately solves this optimal selection problem. Finally, the solution obtained to the relaxed optimization problem is translated into a low complexity algorithm.