Resource Allocation in Dynamic DF Relay for SWIPT Network with Circuit Power Consumption

TL;DR

This paper investigates resource allocation in a SWIPT relay network considering circuit power consumption, proposing an efficient optimization algorithm for throughput maximization with practical circuit power models.

Contribution

It introduces a novel resource allocation framework for SWIPT relay networks that accounts for circuit power consumption and develops an efficient optimization algorithm.

Findings

The proposed algorithm reduces computational complexity compared to interior point methods.

Numerical results provide insights into optimal system parameters under circuit power constraints.

The model enhances understanding of energy harvesting and circuit power trade-offs in relay networks.

Abstract

This paper considers simultaneous wireless information and power transfer (SWIPT) over a dual-hop dynamic decode-and-forward (DF) relay network with the power-splitting (PS) energy harvesting protocol at the relay. The circuit power consumption (CPC), which includes power requirements for both decoding and encoding circuits, is considered at the relay. For a rate-dependent linear CPC model, we formulate an optimization problem to decide the optimal throughput, PS ratio, relay transmit power and time ratio for the source to relay transmission. Although the resultant optimization problem is non-convex, we derive an efficient optimization algorithm, requiring significantly less floating point operations than an interior point method. Finally, we present numerical results which lead to some interesting insights for system design.