Abstract
We consider a cognitive radio network consisting of M primary users, M primary receivers, a secondary user with K channels and K secondary receivers. A channel is assigned to each primary user for transmitting data to a primary receiver. Secondary user is assumed as data backlogged. The secondary user has no direct information on states (good or bad) of M channels, or statistic of channel evolution process. Secondary user chooses K channels for transmission in each time slot. If secondary user senses good state for a chosen channel, it can transmit data to a secondary receiver in that time slot. Otherwise, secondary user does not use that channel and choose another channel for data transmission next time. This scheduling problem is tackled under average reward criterion. Uniforming Random Ordered Policy (UROP) is proposed, and shown to achieve nearly throughput-optimality. It performs much better than myopic policy.
Original language | English |
---|---|
Title of host publication | Proceedings of the IEEE 46th Conference on Local Computer Networks, LCN 2021 |
Editors | Lyes Khoukhi, Sharief Oteafy, Eyuphan Bulut |
Publisher | IEEE Computer Society |
Pages | 403-406 |
Number of pages | 4 |
ISBN (Electronic) | 9780738124766 |
DOIs | |
Publication status | Published - 4 Oct 2021 |
Externally published | Yes |
Event | 46th IEEE Conference on Local Computer Networks, LCN 2021 - Edmonton, Canada Duration: 4 Oct 2021 → 7 Oct 2021 |
Publication series
Name | Proceedings - Conference on Local Computer Networks, LCN |
---|---|
Volume | 2021-October |
Conference
Conference | 46th IEEE Conference on Local Computer Networks, LCN 2021 |
---|---|
Country/Territory | Canada |
City | Edmonton |
Period | 4/10/21 → 7/10/21 |
Bibliographical note
Publisher Copyright:© 2021 IEEE.
Keywords
- Cognitive radio
- Cross-layer design
- Fading
- Internet of Things (IoT)
- Opportunistic spectrum access
- Scheduling