Search arXivSearch

arXiv · 2210.05589

Combining Relaying and Reflective Surfaces: Power Consumption and Energy Efficiency Analysis

Abstract

Hybrid relaying networks (HRNs) combining both a relay and an intelligent reflective surface (IRS) can lead to enhanced rate performance compared to non-hybrid relaying schemes, where only either an IRS or a relay is utilized. However, utilizing both the relay and the IRS simultaneously results in higher power consumption for the HRNs compared to their counterpart. In this work, we study the required transmit power levels and the energy efficiency (EE) of HRNs utilizing both a half-duplex decode-and-forward (HD-DF) relay and an IRS, and compare their performance with non-hybrid relaying schemes. The impact of the required channel estimation overheads is considered when the reflective beamforming design (RBD) at the IRS is carried out under both instantaneous and statistical channel state information models. Also, the investigation is performed for both slow- and fast-changing environments. In terms of the transmit power requirements, our results show that HRNs can lead to higher power savings if the number of reflective elements at the IRS is not very large. However, non-hybrid relaying schemes are shown to be more energy-efficient, unless the targeted rate is high and the IRS is distant from both transmitter and receiver but within a close proximity to the relay.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zaid Abdullah, George C. Alexandropoulos, Steven Kisseleff, Symeon Chatzinotas, Bjorn Ottersten. 2022-10-11. Combining Relaying and Reflective Surfaces: Power Consumption and Energy Efficiency Analysis. https://arxiv.org/abs/2210.05589

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