Search arXivSearch

arXiv · 1903.08860

Cognitive Wireless Power Transfer in the Presence of Reactive Primary Communication User

Abstract

This paper studies a cognitive or secondary multi-antenna wireless power transfer (WPT) system over a multi-carrier channel, which shares the same spectrum with a primary wireless information transfer (WIT) system that employs adaptive water-filling power allocation. By controlling the transmit energy beamforming over sub-carriers (SCs), the secondary energy transmitter (S-ET) can directly charge the secondary energy receiver (S-ER), even purposely interfere with the primary WIT system, such that the primary information transmitter (P-IT) can reactively adjust its power allocation (based on water-filling) to facilitate the S-ER's energy harvesting. We investigate how the secondary WPT system can exploit the primary WIT system's reactive power allocation, for improving the wireless energy harvesting performance. In particular, our objective is to maximize the total energy received at the S-ER from both the S-ET and the P-IT, by optimizing the S-ET's energy beamforming over SCs, subject to its maximum transmit power constraint, and the maximum interference power constraint imposed at the primary information receiver (P-IR) to protect the primary WIT. Although the formulated problem is non-convex and difficult to be optimally solved in general, we propose an efficient algorithm to obtain a high-quality solution by employing the Lagrange dual method together with a one-dimensional search. We also present two benchmark energy beamforming designs based on the zero-forcing (ZF) and maximum-ratio-transmission (MRT) principles, respectively, as well as the conventional design without considering the primary WIT system's reaction. Numerical results show that our proposed design leads to significantly improved energy harvesting performance at the S-ER, as compared to these benchmark schemes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tianxin Feng, Ganggang Ma, Jie Xu. 2019-03-21. Cognitive Wireless Power Transfer in the Presence of Reactive Primary Communication User. https://arxiv.org/abs/1903.08860

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