Scheduling Algorithms for Dynamic Spectrum Sharing
- Abstract
The secondary service is able to access the spectrum allocated to primary service through spectrum sharing mechanisms. Cognitive radio technology which enables secondary users to share spectrum with primary users in an opportunistic manner can be implemented for this. Scheduling or resource allocation is a major factor for efficient utilization of any shared resource. Opportunistic scheduling policies which utilize time varying multipath fading channel are best to implement in wireless networks. In this paper, performance analyses of resource allocation algorithms for secondary users are presented, specifically, rate-based, delay-based and utility function based scheduling algorithms. Performance analyses of scheduling algorithms are made by theoretical and simulation analysis of fundamental mechanisms in wireless resource management, like throughput fairness, delay fairness. Effect of different channel fading conditions on scheduler performance is presented in detail, in particular, Rayleigh fading and Nakagami fading channels are considered. The simulations are done using the software MATLAB.
- Copyright
- © 2013, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Jose Thomas Vembadanthara PY - 2013/04 DA - 2013/04 TI - Scheduling Algorithms for Dynamic Spectrum Sharing BT - Proceedings of the Conference on Advances in Communication and Control Systems (CAC2S 2013) PB - Atlantis Press SP - 89 EP - 97 SN - 1951-6851 UR - https://www.atlantis-press.com/article/6284 ID - Vembadanthara2013/04 ER -