Reduction of Computational Time for Cooperative Sensing Using Reinforcement Learning Algorithm
| dc.contributor.author | Olatunji, Samuel | |
| dc.contributor.author | Fajemilehin, Temitope | |
| dc.contributor.author | Opadiji, Jayeola | |
| dc.date.accessioned | 2019-06-03T08:34:05Z | |
| dc.date.available | 2019-06-03T08:34:05Z | |
| dc.date.issued | 2019 | |
| dc.description.abstract | Cooperative spectrum sensing in cognitive radio systems is characterized by high computational time for decision making due to the fusing of individual decisions of cognitive radios involved in the cooperative scheme. This increases the communication overhead of the network. In this paper, an adaptive cooperative spectrum sensing algorithm is developed with improved detection algorithm. Reinforcement learning is thenincorporated to improve the decision making efficiency of the cooperative spectrum sensing such that less time is required to make a decision at the fusion centre. Three temporal difference learning techniques were compared in order to select the most efficient to reduce sensing and decision delays. Appropriate learning rate was utilized in the sensing and decision making algorithm to enhance the performance ofthe adaptive cooperative spectrum sensing. Results reveal significant reduction in the computation time required in cooperative spectrum sensing and decisions. This permits greater efficiency in dynamic spectrum management as the limited electromagnetic spectrum is being utilized for telecommunication services. | en_US |
| dc.identifier.uri | http://hdl.handle.net/123456789/2052 | |
| dc.language.iso | en | en_US |
| dc.publisher | Published by IEEE Nigeria, Computer Science Section | en_US |
| dc.subject | Cognitive Radio | en_US |
| dc.subject | Cooperative Spectrum Sensing | en_US |
| dc.subject | Computational Time | en_US |
| dc.subject | Reinforcement Learning | en_US |
| dc.title | Reduction of Computational Time for Cooperative Sensing Using Reinforcement Learning Algorithm | en_US |
| dc.type | Article | en_US |