Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1405.5764

Optimal Cooperative Power Allocation for Energy Harvesting Enabled Relay Networks

Xueqing Huang·Nirwan Ansari
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we present a new power allocation scheme for a decode-and-forward (DF) relaying-enhanced cooperative wireless system. While both source and relay nodes may have limited traditional brown power supply or fixed green energy storage, the hybrid source node can also draw power from the surrounding radio frequency (RF) signals. In particular, we assume a deterministic RF energy harvesting (EH) model under which the signals transmitted by the relay serve as the renewable energy source for the source node. The amount of harvested energy is known for a given transmission power of the forwarding signal and channel condition between the source and relay nodes. To maximize the overall throughput while meeting the constraints imposed by the non-sustainable energy sources and the renewable energy source, an optimization problem is formulated and solved. Based on different harvesting efficiency and channel condition, closed form solutions are derived to obtain the optimal source and relay power allocation jointly. It is shown that instead of demanding high on-grid power supply or high green energy availability, the system can achieve compatible or higher throughput by utilizing the harvested energy.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xueqing Huang, Nirwan Ansari. 2014-07-07. Optimal Cooperative Power Allocation for Energy Harvesting Enabled Relay Networks. https://arxiv.org/abs/1405.5764

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗