Skip to content
naulon
Not checkedNot checked for notices yet.

Energy efficiency optimization-based resource allocation for underlay RF-CRN with residual energy and QoS guarantee

Jie Tian, He Xiao, Yimao Sun and 2 more

EURASIP Journal on Wireless Communications and Networking · 2020

doi:10.1186/s13638-020-01824-z (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

How to achieve energy-efficient transmission in radio frequency energy harvesting cognitive radio network (RF-CRN) is of great importance when nodes in CRN are self-maintained. This paper presents a radio frequency (RF) energy harvesting hardware-based underlay cognitive radio network (RH-CRN) structure, where a secondary transmitter (ST) first harvests energy from RF signals source originating from the primary network, and then communicates with a secondary receiver (SR) in underlay mode by using the harvested energy. The total consumed energy by the secondary user (SU) must be equal to or less than the total harvested energy referred to as energy causality constraint, In addition, the ST possesses some initial energy which may be the residual energy from the former transmission blocks, and we consider the energy loss of energy harvesting circuit as a systematic factor as well. Our goal is to achieve the maximum energy efficiency (EE) of the secondary network by jointly optimizing transmitting time and power. To guarantee the quality of service (QoS) of secondary transceiver, a minimum requirement of throughput constraint is imposed on the ST in the process of EE maximization. As the EE maximization is a nonlinear fractional programming problem, a quick iterative algorithm based on Dinkelbach’s method is proposed to achieve the optimal resource allocation. Simulation results show that the proposed strategy has fast convergence and can improve the system EE greatly while ensuring the QoS.

Abstract licence: CC BY-NC-ND

References37

    37 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.