Search arXivSearch

arXiv · 2104.07971

Coverage Probability and Energy Efficiency of Reconfigurable Intelligent Surface-Assisted mmWave Networks

Abstract

Reconfigurable intelligent surface (RIS) emerges as a promising technology for the next generation networks. In this paper, we utilize the tools from stochastic geometry to study the performance of a RIS-assisted millimeter wave (mmWave) cellular network. Specifically, the locations of the base stations (BSs) and the midpoints of the blockages are modeled as two independent Poisson point processes (PPP) where the blockages are modeled by line boolean model and a fraction of the blockages are coated with RISs. The distinguish characteristics of mmWave communications, i.e., the directional beamforming and different path loss laws for line-of-sight (LOS) and non-line-of-sight (NLOS), are incorporated into the analysis. We derive the expressions of the coverage probability and the area spectral efficiency. The coverage probability under the special case where the blockage parameter is sufficiently small is also derived. Numerical results demonstrate that better coverage performance and higher energy efficiency can be achieved by the large-scale deployment of RISs. In addition, the tradeoff between the BS and RIS densities is investigated and the results show that the RISs are excellent supplementary for the traditional networks to improve the coverage probability with limited power consumption.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Le Yang, Fu-Chun Zheng, Shi Jin. 2021-04-16. Coverage Probability and Energy Efficiency of Reconfigurable Intelligent Surface-Assisted mmWave Networks. https://arxiv.org/abs/2104.07971

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