Priority Based Spectrum Allocation
Chamath Divarathne, Tharaka Samarasinghe, Sithamparanathan Kandeepan, Ke Wang · 2023
Dynamic spectrum access is recognized as a potential solution to the problem of spectrum scarcity. Consequently, a significant amount of research has been conducted on spectrum allocation. In this study, we present a multi-traffic class queue-based spectrum allocation solution. The proposed solution is designed for a scenario where communication and other systems do not necessarily require agility in the frequency bands they operate in. The spectrum sensing and forecasting processes are carried out over relatively long time periods compared to the actual transmission rates. The study considers two traffic classes: priority and non-priority. Three packet handling strategies are presented and their average queuing delay performances are compared. While all three strategies yield satisfactory results under low/medium traffic conditions, Strategy 3 exhibits the greatest flexibility in terms of delay performance. Additionally, the study examines the selection of delay thresholds in Strategy 3 using three fairness indices. It is worth noting that although the proposed algorithm focuses on spectrum allocation, it can be easily adapted to address resource allocation problems involving requests with multiple priorities.