An auction theory based algorithm for throughput maximizing scheduling in centralized cognitive radio networks
IEEE Communications Letters, cilt.15, sa.7, ss.734-736, 2011 (SCI-Expanded, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 15 Sayı: 7
- Basım Tarihi: 2011
- Doi Numarası: 10.1109/lcomm.2011.060111.102428
- Dergi Adı: IEEE Communications Letters
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
- Sayfa Sayıları: ss.734-736
- Anahtar Kelimeler: Auction algorithm, cognitive radio networks, dynamic spectrum access, first price sealed bid auction, resource allocation, scheduling
- Boğaziçi Üniversitesi Adresli: Evet
Özet
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. © 2011 IEEE.