Open AccessDynamic Spectrum Access Based on Improved SARSA Algorithm
Author(s) -
Xiaofei Liao,
Dequan Wu,
Yang Wang
Publication year - 2020
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/768/7/072015
Subject(s) - cognitive radio , computer science , economic shortage , greedy algorithm , simulated annealing , throughput , algorithm , spectrum (functional analysis) , mathematical optimization , selection algorithm , collision , selection (genetic algorithm) , wireless , artificial intelligence , telecommunications , mathematics , linguistics , philosophy , physics , computer security , quantum mechanics , government (linguistics)
Dynamic spectrum access is the core technology of cognitive radio, accurate spectrum access can effectively alleviate the shortage of spectrum resources and realize the "secondary utilization"of spectrum resources. For this reason, this paper proposes a dynamic spectrum access based on improved Sarsa algorithm. The algorithm uses a simulated annealing strategy instead of the ε-greedy strategy in action selection, which can effectively overcome the problem of the traditional Sarsa algorithm falling into a local optimum. Simulation experiments show that the algorithm proposed in this paper can effectively improve the throughput of cognitive users and reduce the probability of collision with the main user, what’s more, it also has a significant increase in speed.