Search arXivSearch

arXiv · 1411.2890

Performance Analysis for Energy Harvesting Communication Protocols with Fixed Rate Transmission

Abstract

Energy Harvesting (EH) has emerged as a promising technique for Green Communications and it is a novel technique to prolong the lifetime of the wireless networks with replenishable nodes. In this paper, we consider the energy shortage analysis of fixed rate transmission in communication systems with energy harvesting nodes. First, we study the finite-horizon transmission and provide the general formula for the energy shortage probability. We also give some examples as benchmarks. Then, we continue to derive a closed-form expression for infinite-horizon transmission, which is a lower bound for the energy shortage probability of any finite-horizon transmission. These results are proposed for both Additive White Gaussian Noise (AWGN) and fading channels. Moreover, we show that even under \emph{random energy arrival}, one can transmit at a fixed rate equal to capacity in the AWGN channels with negligible aggregate shortage time. We achieve this result using our practical transmission schemes, proposed for finite-horizon. Also, comprehensive numerical simulations are performed in AWGN and fading channels with no Channel State Information (CSI) available at the transmitter, which corroborate our theoretical findings. Furthermore, we improve the performance of our transmission schemes in the fading channel with no CSI at the transmitter by optimizing the transmission initiation threshold.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mahmood Mohassel Feghhi, Aliazam Abbasfar, Mahtab Mirmohseni. 2014-11-11. Performance Analysis for Energy Harvesting Communication Protocols with Fixed Rate Transmission. https://doi.org/10.1049/iet-com.2014.0281

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