SearcharxivSearch

arXiv · 2403.08930

How Much Can Reconfigurable Intelligent Surfaces Augment Sky Visibility: A Stochastic Geometry Approach

Abstract

This paper uses the theory of point processes and stochastic geometry to quantify the sky visibility experienced by users located in an urban environment. The general idea is to represent the buildings of this environment as a stationary marked point process, where the points represent the building locations and the marks their heights. The point process framework is first used to characterize the distribution of the blockage angle, which limits the visibility of a typical user into the sky due to the obstruction by buildings. In the context of communications, this distribution is useful when users try to connect to the nodes of an aerial or non-terrestrial network in a Line-of-Sight way. Within this context, the point process framework can also be used to investigate the gain of connectivity obtained thanks to Reconfigurable Intelligent Surfaces. Assuming that such surfaces are installed on the top of buildings to extend the user's sky visibility, this point process approach allows one to quantify the gain in visibility and hence the gain in connectivity obtained by the typical user. The distributional properties of visibility-related metrics are cross-validated by comparison to simulation results.

Explore related subjects

Keep this discovery

BibTeXRIS

Junse Lee, Francois Baccelli. 2024-03-13. How Much Can Reconfigurable Intelligent Surfaces Augment Sky Visibility: A Stochastic Geometry Approach. https://arxiv.org/abs/2403.08930

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR