Ergodic Capacity and Throughput Analysis of Two-Way Wireless Energy Harvesting Network with Decode-and-Forward Relay

Liu, Yingting and Shen, Jianmei and Yang, Hongwu and Yan, Chunman and Cong, Li (2019) Ergodic Capacity and Throughput Analysis of Two-Way Wireless Energy Harvesting Network with Decode-and-Forward Relay. In: Communications and Networking. 13th EAI International Conference, ChinaCom 2018, Chengdu, China, October 23-25, 2018, Proceedings.

[thumbnail of 29032.pdf] PDF
29032.pdf

Download (675kB)

Abstract

In this paper, we consider a wireless energy harvesting network, where two source nodes exchange information via a decode-and-forward (DF) relay node. The network adopts the time switching relaying (TSR) or power splitting relaying (PSR) protocols. In the TSR protocol, transmitting process is split into three time slots. In the first time slot, two source nodes send the signals to the relay node simultaneously and the relay node harvests energy from the radio frequency (RF) signals. In the second time slot, two source nodes send the information signals to the relay node simultaneously. In the third time slot, the relay node decodes the signals and then forwards the regenerated signal to two source nodes using all harvested energy. In the PSR protocol, every transmission frame is divided into two equal time duration slots. The energy constrained relay node splits the received power into two parts for energy harvesting (EH) and information processing in the first time slot, respectively, and forwards the reproduced information signal to the source nodes in the second time slot. We derive the analytical expressions of the ergodic capacity and ergodic throughput of the network both for the TSR and PSR protocols. Numerical results verify the theoretical analysis and exhibit the performance comparisons of two proposed schemes.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Date Deposited: 04 Mar 2026 11:38
Last Modified: 20 Nov 2026 11:28
URI: https://eprints.eai.eu/id/eprint/20059

Actions (login required)

View Item
View Item