Search arXivSearch

arXiv · 1702.07881

On the Performance of Wireless Powered Communication With Non-linear Energy Harvesting

Abstract

In this paper, we analyze the performance of a time-slotted multi-antenna wireless powered communication (WPC) system, where a wireless device first harvests radio frequency (RF) energy from a power station (PS) in the downlink to facilitate information transfer to an information receiving station (IRS) in the uplink. The main goal of this paper is to provide insights and guidelines for the design of practical WPC systems. To this end, we adopt a recently proposed parametric non-linear RF energy harvesting (EH) model, which has been shown to accurately model the end-to-end non-linearity of practical RF EH circuits. In order to enhance the RF power transfer efficiency, maximum ratio transmission is adopted at the PS to focus the energy signals on the wireless device. Furthermore, at the IRS, maximum ratio combining is used. We analyze the outage probability and the average throughput of information transfer, assuming Nakagami-$m$ fading uplink and downlink channels. Moreover, we study the system performance as a function of the number of PS transmit antennas, the number of IRS receive antennas, the transmit power of the PS, the fading severity, the transmission rate of the wireless device, and the EH time duration. In addition, we obtain a fixed point equation for the optimal transmission rate and the optimal EH time duration that maximize the asymptotic throughput for high PS transmit powers. All analytical results are corroborated by simulations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rania Morsi, Elena Boshkovska, Esmat Ramadan, Derrick Wing Kwan Ng, Robert Schober. 2017-05-18. On the Performance of Wireless Powered Communication With Non-linear Energy Harvesting. https://arxiv.org/abs/1702.07881

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT