Search arXivSearch

arXiv · 2203.09090

Energy-Efficient Power Control and Beamforming for Reconfigurable Intelligent Surface-Aided Uplink IoT Networks

Abstract

Recently, reconfigurable intelligent surface (RIS), a planar metasurface consisting of a large number of low-cost reflecting elements, has received much attention due to its ability to improve both the spectrum and energy efficiencies by reconfiguring the wireless propagation environment. In this paper, we propose a RIS phase shift and BS beamforming optimization technique that minimizes the uplink transmit power of a RIS-aided IoT network. Key idea of the proposed scheme, referred to as Riemannian conjugate gradient-based joint optimization (RCG-JO), is to jointly optimize the RIS phase shifts and the BS beamforming vectors using the Riemannian conjugate gradient technique. By exploiting the product Riemannian manifold structure of the sets of unit-modulus phase shifts and unit-norm beamforming vectors, we convert the nonconvex uplink power minimization problem into the unconstrained problem and then find out the optimal solution on the product Riemannian manifold. From the performance analysis and numerical evaluations, we demonstrate that the proposed RCG-JO technique achieves $94\%$ reduction of the uplink transmit power over the conventional scheme without RIS.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiao Wu, Seungnyun Kim, Byonghyo Shim. 2022-03-17. Energy-Efficient Power Control and Beamforming for Reconfigurable Intelligent Surface-Aided Uplink IoT Networks. https://arxiv.org/abs/2203.09090

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