Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2010.01113

Secrecy Rate Maximization in Multi-IRS Millimeter Wave Networks

Anahid Rafieifar·S. Mohammad Razavizadeh
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper investigates the problem of increasing the security at the physical layer of a Millimeter Wave (mmWave) network equipped with several Intelligent Reflecting Surfaces (IRSs). In this network, multiple IRSs help the Base Station (BS) to reach the signal to the desired user and at the same time maintain the security of the network i.e. securing the signal from receiving by the unallowable eavesdropper. The target of the proposed scheme is to maximize the secrecy rate by jointly optimizing the active beamforming at the BS and passive beamforming at the IRSs. This leads to a non-convex optimization problem which we solve by decomposing into two sub-problems. The sub-problems alternatively solve the active and passive beamforming design problems using the Semi-Definite Relaxation (SDR) technique. Finally, simulations are done to assess the performance of the proposed algorithm. These results show the superiority of using multiple IRSs in the enhancement of the secrecy rate in the wireless networks that operate in the mmWave frequency bands.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anahid Rafieifar, S. Mohammad Razavizadeh. 2021-05-21. Secrecy Rate Maximization in Multi-IRS Millimeter Wave Networks. https://doi.org/10.1016/j.phycom.2021.101436

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↗