Opportunistic channel access and RF energy harvesting in cognitive radio networks

Research output: Contribution to journalArticlepeer-review

Abstract

Radio frequency (RF) energy harvesting is a promising technique to sustain operations of wireless networks. In a cognitive radio network, a secondary user can be equipped with RF energy harvesting capability. In this paper, we consider such a network where the secondary user can perform channel access to transmit a packet or to harvest RF energy when the selected channel is idle or occupied by the primary user, respectively. We present an optimization formulation to obtain the channel access policy for the secondary user to maximize its throughput. Both the case that the secondary user knows the current state of the channels and the case that the secondary knows the idle channel probabilities of channels in advance are considered. However, the optimization requires model parameters (e.g., the probability of successful packet transmission, the probability of successful RF energy harvesting, and the probability of channel to be idle) to obtain the policy. To obviate such a requirement, we apply an online learning algorithm that can observe the environment and adapt the channel access action accordingly without any a prior knowledge about the model parameters. We evaluate both the efficiency and convergence of the learning algorithm. The numerical results show that the policy obtained from the learning algorithm can achieve the performance in terms of throughput close to that obtained from the optimization.

Original languageEnglish
Article number6985740
Pages (from-to)2039-2052
Number of pages14
JournalIEEE Journal on Selected Areas in Communications
Volume32
Issue number11
DOIs
StatePublished - 1 Nov 2014

Keywords

  • cognitive radio
  • Markov decision process
  • RF energy harvesting

Fingerprint

Dive into the research topics of 'Opportunistic channel access and RF energy harvesting in cognitive radio networks'. Together they form a unique fingerprint.

Cite this