# End-to-end Throughput Maximization for Underlay Multi-hop Cognitive   Radio Networks with RF Energy Harvesting

**Authors:** Chi Xu, Meng Zheng, Wei Liang, Haibin Yu, and Ying-Chang Liang

arXiv: 1703.02742 · 2017-03-09

## TL;DR

This paper proposes an optimal resource allocation scheme for energy harvesting cognitive radio networks that maximizes end-to-end throughput while ensuring primary user protection, using a convex optimization approach and iterative algorithm.

## Contribution

It introduces a joint optimal time and power allocation (JOTPA) algorithm for EH-CRNs, transforming a nonconvex problem into a convex one for efficient solution.

## Key findings

- JOTPA outperforms other algorithms in throughput maximization.
- The proposed method effectively balances energy harvesting and interference constraints.
- Simulation results confirm the algorithm's convergence and efficiency.

## Abstract

This paper studies a green paradigm for the underlay coexistence of primary users (PUs) and secondary users (SUs) in energy harvesting cognitive radio networks (EH-CRNs), wherein battery-free SUs capture both the spectrum and the energy of PUs to enhance spectrum efficiency and green energy utilization. To lower the transmit powers of SUs, we employ multi-hop transmission with time division multiple access, by which SUs first harvest energy from the RF signals of PUs and then transmit data in the allocated time concurrently with PUs, all in the licensed spectrum. In this way, the available transmit energy of each SU mainly depends on the harvested energy before the turn to transmit, namely energy causality. Meanwhile, the transmit powers of SUs must be strictly controlled to protect PUs from harmful interference. Thus, subject to the energy causality constraint and the interference power constraint, we study the end-to-end throughput maximization problem for optimal time and power allocation. To solve this nonconvex problem, we first equivalently transform it into a convex optimization problem and then propose the joint optimal time and power allocation (JOTPA) algorithm that iteratively solves a series of feasibility problems until convergence. Extensive simulations evaluate the performance of EH-CRNs with JOTPA in three typical deployment scenarios and validate the superiority of JOTPA by making comparisons with two other resource allocation algorithms.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1703.02742/full.md

## Figures

23 figures with captions in the complete paper: https://tomesphere.com/paper/1703.02742/full.md

## References

32 references — full list in the complete paper: https://tomesphere.com/paper/1703.02742/full.md

---
Source: https://tomesphere.com/paper/1703.02742