Average Throughput of Myopic Policy for Opportunistic Access Over Block Fading Channels

Date

2019-03-01

Author

Gül, Ömer Melih

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

12
views

0
downloads

This letter considers a multi-channel access problem in a cognitive radio network with M primary users and a multi-channel secondary user (SU). SU selects K channels for transmission without knowing the channel states or statistics of channel evolution processes. If SU senses that a selected channel is available, it sends data over that channel at that time. Otherwise, SU does not use it in that slot. Under average throughput criteria, myopic policy is proposed and upper bounds of its throughput performance are derived for this problem. It is shown that it achieves optimality over block fading channels for certain channel evolution processes although it is generally suboptimal.

Subject Keywords

Cognitive radio, Wireless network, Opportunistic spectrum access, Resource allocation, Scheduling algorithms

URI

https://hdl.handle.net/11511/57914

Collections

Department of Electrical and Electronics Engineering, Article