# Average Transmission Success Probability Bound for SWIPT Relay Networks

## TL;DR

This paper develops a mathematical framework to bound the average transmission success probability in SWIPT relay networks with energy harvesting, using a Markov decision process and policy iteration.

## Contribution

It introduces an upper bound for success probability in SWIPT relay networks considering finite battery capacity and resource allocation policies.

## Key findings

- Derived an upper bound using a Markov decision process
- Implemented a policy iteration algorithm for calculation
- Provides insights into optimal resource allocation strategies

## Abstract

Wireless energy transferring technology offers a constant and instantaneous power for low-power applications such as Internet of Things (IoT) to become an affordable reality. This paper considers simultaneous wireless information and power transfer (SWIPT) over a dual-hop decode-and-forward (DF) relay network with the power-splitting (PS) energy harvesting protocol at the relay. The relay is equipped with a finite capacity battery. The system performance, which is characterized by the average success probability of source to destination transmission, is a function of the resource allocation policy that selects the PS ratio and the transmit energy of the relay. We develop a mathematical framework to find an upper bound for the maximum the average success probability. The upper bound is formulated by a discrete state space Markov decision problem (MDP) and make use of a policy iteration algorithm to calculate it.