An Optimal Policy for Hybrid Channel Access in Cognitive Radio Networks With Energy Harvesting

In this aticle, an optimal policy is presented to maximize the secondary user's (SU's) throughput in an energy harvesting cognitive radio network with multiple SUs and single primary user (PU). The SU can access the PU's channel in a hybrid interweave/underlay channel access mode usin...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on vehicular technology 2020-10, Vol.69 (10), p.11253-11265
Main Authors: Tayel, Ahmed F., Rabia, Sherif I., El-Malek, Ahmed H. Abd, Abdelrazek, Amr M.
Format: Article
Language:English
Subjects:
Algorithms
Cognitive radio
Complexity
Energy harvesting
hybrid channel access
Iterative methods
Markov decision process
Markov processes
Numerical models
Portable equipment
Radio frequency
Sensors
Throughput
Time Division Multiple Access
Wireless sensor networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this aticle, an optimal policy is presented to maximize the secondary user's (SU's) throughput in an energy harvesting cognitive radio network with multiple SUs and single primary user (PU). The SU can access the PU's channel in a hybrid interweave/underlay channel access mode using time division multiple access (TDMA) technique. This hybrid access mode combines the benefits of interweave channel access mode of accessing the PU's channel opportunistically with high transmission power to gain high throughput and that of the underlay channel access mode of transmission at any time regardless of the PU's activity with controlled power. Moreover, energy harvesting from ambient sources promotes the SU's device to be portable and self sustainable. To deal with the random environment, the system is modeled as a mixed (full/partial) observable Markov decision process (MOMDP). Moreover, to reduce the solution complexity, the point-based value iteration (PBVI) algorithm is used to solve the proposed model. The simulation results show the superiority of the proposed model compared to other related models in terms of throughput. Based on an insight on the optimal policy of the proposed model and the time complexity comparison with the related models, a couple of suboptimal policies are proposed, namely, a myopic policy, an interweave only policy, and a combined-policy approach.
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2020.3008671