Cart (Loading....) | Create Account
Close category search window
 

An Optimal Probabilistic Multiple-Access Scheme for Cognitive Radios

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)
Hamza, D. ; Phys. Sci. & Eng. Div., King Abdullah Univ. of Sci. & Technol., Thuwal, Saudi Arabia ; Aissa, S.

We study a time-slotted multiple-access system with a primary user (PU) and a secondary user (SU) sharing the same channel resource. The SU senses the channel at the beginning of the slot. If found free, it transmits with probability 1. If busy, it transmits with a certain access probability that is a function of its queue length and whether it has a new packet arrival. Both users, i.e., the PU and the SU, transmit with a fixed transmission rate by employing a truncated channel inversion power control scheme. We consider the case of erroneous sensing. The goal of the SU is to optimize its transmission scheduling policy to minimize its queueing delay under constraints on its average transmit power and the maximum tolerable primary outage probability caused by the miss detection of the PU. We consider two schemes regarding the secondary's reaction to transmission errors. Under the so-called delay-sensitive (DS) scheme, the packet received in error is removed from the queue to minimize delay, whereas under the delay-tolerant (DT) scheme, the said packet is kept in the buffer and is retransmitted until correct reception. Using the latter scheme, there is a probability of buffer loss that is also constrained to be lower than a certain specified value. We also consider the case when the PU maintains an infinite buffer to store its packets. In the latter case, we modify the SU access scheme to guarantee the stability of the PU queue. We show that the performance significantly changes if the realistic situation of a primary queue is considered. In all cases, although the delay minimization problem is nonconvex, we show that the access policies can be efficiently obtained using linear programming and grid search over one or two parameters.

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:61 ,  Issue: 7 )

Date of Publication:

Sept. 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.