By Topic

An Auction Theory Based Algorithm for Throughput Maximizing Scheduling in Centralized Cognitive Radio Networks

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)
Eraslan, B. ; Dept. of Comput. Eng., Bogazici Univ., Istanbul, Turkey ; Gozupek, Didem ; Alagoz, F.

In this letter we propose an auction theory based algorithm for throughput maximizing scheduling in centralized cognitive radio networks (CRN). In the considered CRN scheme, a centralized base station coordinates the assignment of frequencies and time slots to cognitive users with multiple antennas. Our proposed algorithm uses first-price sealed bid auction mechanism in which frequency and time slot pairs are considered as the auctioned resources and cognitive users are the bidders. The experimental results show that our computationally efficient algorithm yields very close throughput performance to the optimization software CPLEX values.

Published in:

Communications Letters, IEEE  (Volume:15 ,  Issue: 7 )