Search arXivSearch

arXiv · 1606.04639

Wireless Information and Power Transfer Design for Energy Cooperation Distributed Antenna Systems

Abstract

Distributed antenna systems (DAS) have been widely implemented in state-of-the-art cellular communication systems to cover dead spots. Recent studies have also indicated that DAS have advantages in wireless energy transfer (WET). In this paper, we study simultaneous wireless information and power transfer (SWIPT) for a multiple-input single-output (MISO) DAS in the downlink which consists of arbitrarily distributed remote antenna units (RAUs). In order to save the energy cost, we adopt energy cooperation of energy harvesting (EH) and two-way energy flows to let the RAUs trade their harvested energy through the smart grid network. Under individual EH constraints, per-RAU power constraints and various smart grid considerations, we investigate a power management strategy that determines how to utilize the stochastically spatially distributed harvested energy at the RAUs and how to trade the energy with the smart grid simultaneously to supply maximum wireless information transfer (WIT) with a minimum WET constraint for a receiver adopting power splitting (PS). Our analysis shows that the optimal design can be achieved in two steps. The first step is to maximize a new objective that can simultaneously maximize both WET and WIT, considering both the smart grid profitable and smart grid neutral cases. For the grid-profitable case, we derive the optimal full power strategy and provide a closed-form result to see under what condition this strategy is used. On the other hand, for the grid-neutral case, we illustrate that the optimal power policy has a double-threshold structure and present an optimal allocation strategy. The second step is then to solve the whole problem by obtaining the splitting power ratio based on the minimum WET constraint. Simulation results are provided to evaluate the performance under various settings and characterize the double-threshold structure.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fangchao Yuan, Shi Jin, Kai-Kit Wong, Hongbo Zhu. 2016-06-15. Wireless Information and Power Transfer Design for Energy Cooperation Distributed Antenna Systems. https://arxiv.org/abs/1606.04639

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