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

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.