Stochastic Geometry Analysis for Distributed RISs-Assisted mmWave Communications
Abstract
Millimeter wave (mmWave) has attracted considerable attention due to its wide bandwidth and high frequency. However, it is highly susceptible to blockages, resulting in significant degradation of the coverage and the sum rate. A promising approach is deploying distributed reconfigurable intelligent surfaces (RISs), which can establish extra communication links. In this paper, we investigate the impact of distributed RISs on the coverage probability and the sum rate in mmWave wireless communication systems. Specifically, we first introduce the system model, which includes the blockage, the RIS and the user distribution models, leveraging the Poisson point process. Then, we define the association criterion and derive the conditional coverage probabilities for the two cases of direct association and reflective association through RISs. Finally, we combine the two cases using Campbell’s theorem and the total probability theorem to obtain the closed-form expressions for the ergodic coverage probability and the sum rate. Simulation results validate the effectiveness of the proposed analytical approach, demonstrating that the deployment of distributed RISs significantly improves the ergodic coverage probability by 45.4% and the sum rate by over 1.5 times.
Index Terms:
Stochastic geometry, reconfigurable intelligent surface, distributed deployment, ergodic coverage probability, sum rate.I Introduction
Millimeter wave (mmWave) technology has become the core technology for the next generation of mobile communication networks due to its abundant spectrum resources and low spectrum interference[1, 2, 3]. The high-frequency nature of mmWave massive multiple-input multiple-output technology enables high spatial resolution and directivity, facilitating concentrated power transmission of communication signals. However, it renders the signals highly susceptible to atmospheric absorption and rain attenuation, resulting in significant penetration loss and path loss[4, 5]. To address these challenges, one feasible approach is to deploy distributed reconfigurable intelligent surfaces (RISs), each consisting of numerous low-cost passive reflective elements[6, 7, 8]. Using an intelligent controller, each unit or element can manipulate amplitudes and phase shifts to effectively change incident electromagnetic waves, thereby reconfiguring the wireless propagation environment. Moreover, the distributed RISs provide additional transmission links, effectively guaranteeing the quality of service for users[9]. Therefore, we are interested in the performance gain that distributed RISs can bring to communication systems.
Nevertheless, analyzing the communication performance within a distributed RISs-assisted system remains a challenge. Recently, stochastic geometry has proven to be a successful mathematical framework for simulating the operation of diverse types of wireless networks[10, 11, 12]. In [13], stochastic geometry was utilized to stochastically model the locations of receivers and transmitters using Poisson point processes (PPPs). By considering typical receivers positioned at the origin, the analysis of average network performance was simplified, provided performance metric bounds, and approached realistic scenarios. In [14], the authors leveraged the line-of-sight (LoS) probability function proposed in [13] to model the locations of LoS and non-LoS base stations (BSs) as two independent inhomogeneous PPPs, and further analyzed the dense network case by applying a simplified sphere model. In [15], the authors proposed an analytical framework that incorporates realistic channel models and antenna element radiation patterns. In [16], the authors disregarded the small-scale channel fading model, deployed RISs as coatings on a portion of the blockages, and utilized stochastic geometry to analyze the impact of coating blockages with RISs on the cellular network coverage probability. The authors in [17] used stochastic geometry to analyze the performance of a realistic two-step user association-based mmWave network, consisting of multiple users, transmitters, and one-hop reflection from a large intelligent surface.
Building on the discussion above, this paper investigates the performance analysis in distributed RISs-assisted mmWave communication systems using stochastic geometry, and numerical results validate the gains from the deployment of distributed RISs. In more detail, we start with establishing the scene model and the system model using stochastic geometry. Next, we define the association criterion and decompose the RIS distribution model into several inhomogeneous PPPs using the LoS probability. Afterward, we analyze the two cases of direct association between the users with the serving BS and association through RIS reflection, and derive the association probabilities, the distance distributions, and the conditional coverage probabilities. Using the total probability theorem and Campbell’s theorem, we combine the two cases to derive the ergodic coverage probability. Moreover, we derive closed-form expressions for the sum rate by transformations between the expectation and distribution functions.
Simulation results verify the gains in the ergodic coverage probability and the sum rate brought by the distributed RISs. Specifically, distributed RISs significantly improve the ergodic coverage probability by 45.4% and the sum rate by over 1.5 times when the blockage density is -m2. These results indicate how many distributed RISs should be deployed to reach the performance limit, which provide a valuable guideline for the practical deployment of RISs in cellular networks.
II System Model
We consider a downlink distributed RISs-assisted mmWave communication system as illustrated in Fig. 1, including the single BS serving multiple users. It is assumed that a BS can associate with several users, but only serves one user in a time slot, whether through a direct link or a RIS reflected link, providing the maximum channel gain. Considering the irregular shapes of real cells, we introduce the concept of the cell virtual radius, which is the radius of an equivalent circle of average cell size, denoted as .
Disregarding the height information, the cell is modeled as a planar area with a virtual radius of . The BS is positioned at the center of this area, equipped with antennas. Assuming users remain static within a short time interval, their positions are modeled by a PPP with a density of , denoted as , where is the position coordinate of the -th user, and is the set that comprises all user coordinate points. The parameter denotes the distance between the BS and users, and each user is equipped with antennas. The positions of RISs are denoted as the PPP , with a density of . Here, is the position of the -th RIS, comprises all RIS coordinate points, and each RIS consists of elements. The horizontal and vertical spaces between these elements/antennas are , where represents the signal wavelength. In addition, it is assumed that there is always a LoS link between the BS and the RISs, and that the BS can select different steering vectors as its transmit beams toward the RISs.
Blockages, characterized by their spatial randomness and irregular shapes, especially for buildings in urban areas, are typically modeled as random object processes (ROPs) in the theory of random shapes[18]. However, analyzing ROPs can be complex, especially when considering correlations between objects, as well as their shape, position, and orientation. To make it analyzable, we approximate blockages using the line Boolean model[13], i.e., a line segment models each blockage.
Assumption 1
(Blockage Process) The central coordinates of line segments are modeled by a PPP with a density of , where is the center coordinate of the -th blockage, and comprises all blockage center coordinates. The length of each blockage line segment, denoted as , follows a uniform distribution , where and represent the minimum and maximum lengths of all blockage line segments, respectively. The mean value of the length distribution is denoted as . The orientation of each blockage line segment is defined as the angle between the line segment and the positive direction of the -axis. This orientation angle, denoted as , is uniformly distributed and follows .
Assumption 2
(Large-Scale and Small-Scale Fading Channel Gain) The LoS channel gain for large-scale fading is described by the 3GPP model as . In this model, and are parameters that depend on the specific environment and frequency band, and represents the distance between the transmitter and receiver. For small-scale fading, the channel fading gain is assumed to follow an exponential distribution[15, Remark 5] with a mean value of , which represents the directional gain. To express this directional gain, the practical array pattern is approximated by the segmented antenna model, we define as the main lobe gain, side lobe gain, and main lobe beam width at the transmitter (receiver), respectively. For a beam-aligned link, the directional gain is expressed as . Meanwhile, the angle of arrival (AOA) and the angle of departure (AOD) of a non-beam-aligned link follow a uniform distribution on the interval , and its directional gain is expressed as
(1) |
For an isotropic antenna, the main lobe gain and are equal to the number of antennas , at the transmitter and receiver, and the side lobe gain is , .
As for the signal model, it is assumed that the data transmission links between the BS and the users have already been beam-aligned using existing beamforming techniques like zero forcing[19], minimum mean square error[20], single value decomposition[21], etc. However, interfering signals may arrive through non-beam-aligned links.
Thus, the signal-to-interference-plus-noise ratio (SINR) of the direct links and the RIS reflection links can be defined as follows. For a user located at a distance from the BS, the large-scale fading channel gain of the direct link is denoted as . The received signal at the user is denoted as with power , where is the transmit power of the BS to each user and is the small-scale fading channel gain of the BS-user link. It is assumed that the interference from other users has been eliminated using existing techniques. Therefore, the SINR of the direct link is expressed as
(2) |
where is the noise power.
For the case where the BS reflects the signal to users through the -th RIS , we define the channel as the -th reflected LoS link. The large-scale fading channel gain and received signal power of the -th reflected link are expressed as and , respectively. Here, and are the distance and the small-scale fading channel gain of the BS- link, and are the distance and the small-scale fading channel gain of the -user link, respectively. The SINR of the BS--user link can be expressed as
(3) |
III Performance Analysis
In this section, a theoretical performance analysis is presented leveraging the inherent void probability and contact distribution[22] of the PPP, the location-dependent thinning[23], and the LoS probability.
Proposition 1
(Location-Dependent Thinning[23]) For a homogeneous PPP with density , thinning with probability that depends only on point and not on the rest of the points, results in an inhomogeneous PPP , with density . Simultaneously, the removed points constitute an inhomogeneous PPP with density .
Assumption 3
(LoS Probability) For each link, the LoS probability is only related to the link distance and blockage information, namely, , , but not to the channel state information. Furthermore, the influence of the correlation of the blockages between different links can be ignored. Let denote the number of blockages intersecting the link. According to the line Boolean model of blockages, we have [13]. Consequently, the probability of a LoS link existing at a distance is equivalent to the probability of no blockage intersecting that link, denoted as the void probability when , which is represented as .
In the following, we start with deriving the probability that RISs can assist the communication for any user within the set . It is assumed that RISs can both reflect and transmit to achieve 360-degree coverage. It is further assumed that RISs only assist communication in scenarios where the direct link is non-line-of-sight (NLoS).
Lemma 1
(RISs Assist Probability) In the depicted scenario in Fig. 2, the distances of the BS-user, BS-RIS, and RIS-user links are , , and , respectively. We introduce the angle between the BS-user link and the RIS-user link as , and define . Since we assume that there is always a LoS link between the BS and RISs, the probability that the RIS can provide a reflection link for the BS and the user is . Employing location-dependent thinning, which preserves the RIS PPP with the probability , we obtain an inhomogeneous PPP with a density of . RISs in can assist the communication between the BS and the user.
Next, we define the association criterion.
Definition 1
(Association Criterion) Each user communicates with its serving BS through the link providing the highest signal power, either a direct link or a reflected link,
(4) |
To formulate the feasible analysis equations, we introduce suitable simplifications by substituting the small-scale fading channel gain with its time-averaged value. Therefore, the association criterion can be simplified as
(5) |
Lemma 2
(Reflection Probability) For a user at a distance from the BS, the probability of existing at least one RIS reflective LoS link within the cell is
(6) |
Proof: First, we calculate the number of RISs capable of providing reflective LoS links, which requires a cell-wide integration over the density of LoS RISs . Since depends on the RIS-user distance , which requires transforming the area into an expression on . To facilitate this transformation, we introduce the angle , and the shaded area in Fig. 2 can be approximated as . Utilizing the law of cosines, we can obtain . Further, we derive that . Hence, the number of RISs that can provide reflective LoS links is
(7) |
Thus, the probability is further expressed as
(8) |
Lemma 3
(Distance Distribution of Reflected LoS Links) Given the distance between the BS and a user as , the distance between the BS and the -th RIS as , and the distance between the user and the -th RIS as , we define , its cumulative distribution function is derived in Eq. (9), where .
(9) |
(10) | ||||
Proof: As shown in Fig. 2, the angle between the BS-RIS and BS-user links is defined as , because the location-dependent thinning is only related to the distance but not to the angle, it can be assumed that , then we have . In Eq. (10), the lower bound of equal sign is established because . This implies that for , there is no . Omitting the subscript , is equivalent to . The upper bound is derived from the fact that . Thus, within the region satisfying and in a radius , there exists no RIS capable of assisting communication. Consequently, the number of points in is 0.
Definition 2
Define the coverage probability as
(11) |
where denotes the set threshold, and denotes the SINR of the associated link, which could be either a direct link or a reflected link.
Theorem 1
(Ergodic Coverage Probability) The ergodic coverage probability of the cell is
(12) |
where is the coverage probability of users at distance from the BS, as expressed in Eq. (13), and , .
(13a) | |||
(13b) | |||
(13c) |
Proof: Since the multiplicative path loss of the RIS reflection link is several orders of magnitude larger than that of the direct link, the association criterion degenerates. When a direct LoS link between the user and the serving BS exists, there is a direct association. On the other hand, when the direct link is NLoS and a LoS reflection link exists, the association criterion is an association through RIS reflection.
Lemma 4
Given that the distance between a user and its serving BS is , the direct association probability is
(14) |
Then, the conditional coverage probability of the direct link is derived as
(15a) | |||
(15b) |
Lemma 5
Given that the distance between a user and its serving BS is , the probability that the serving BS and the user are associated through the reflected LoS link is
(16) |
where represents the probability of the direct link between the BS and the user is NLoS. In this scenario, the probability that there exists a reflected LoS link between the user and the NLoS BS is denoted as .
Since the criterion prioritizes the link with the largest received signal power, we obtain the associated RIS as
(17) |
The SINR of the associated link is expressed as . Thus, the conditional coverage probability of the reflected LoS link is
Therefore, the conditional coverage probability of users at a distance from the BS is
Definition 3
The ergodic rate is defined as
(18) |
where is the bandwidth used by each user.
Proposition 2
For a positive random variable ,
(19) |
Theorem 2
The sum rate of the cell is
(20) |
Proof: Obviously, the random variable is positive. According to Proposition 2, the ergodic rate of users at a distance from the BS is
Since the distance between each user and the BS is also a random variable, the sum rate of the cell can be expressed as
IV Simulation Results
In this section, we provide numerical results for the coverage probability and the sum rate in distributed RISs-assisted mmWave wireless communication systems. We assume that the mmWave cellular network operates at a frequency of GHz. The parameters in the large-scale fading channel gain model are set to and . The average length of the blockage line Boolean model is m. The BS antenna array consists of antennas. We set the virtual radius as m and the density of users as -m2. Each user is equipped with antennas and is allocated a bandwidth of MHz.
Fig. 3 plots the ergodic coverage probability for different densities of RISs with a blocking density of -m2. The solid line represents the ergodic coverage probability in Theorem 1, while the corresponding dashed line is obtained by Monte Carlo simulation. The simulation results can overlap the theorem well, which proves the accuracy of our derived formulation. Moreover, we observe that deploying more RISs increases the coverage probability, but the rate of improvement decreases as the density of RISs increases, eventually reaching saturation. Specifically, deploying RISs with a density of -m2 (around the number of ) can improve the coverage probability by 27.3%, while deploying RISs with a density of -m2 (around ) improves the coverage probability by 45.4%.
Fig. 4 plots the effect of the density of deployed RISs on the sum rate of all users in the cell for varying blockage densities. The results of Theorem 2, denoted by the solid line, and the Monte Carlo scenario simulation, denoted by the dashed line, are closely matched. As the blockages become denser, the sum rate decreases, yet the improvement in the sum rate is more significant with the same density of RISs deployed. For example, when RISs with density -m2 (around ) are deployed, the sum rate increases by bps/Hz (1.15 times) when -m2, and by bps/Hz (1.91 times) when the blockage density -m2. However, it is worth noting that the curve tends to flatten out as the density of RISs increases, which means that the sum rate does not increase indefinitely as the density of RISs increases, but rather reaches an upper limit.
V Conclusion
In this paper, we leveraged stochastic geometry to investigate the ergodic coverage probability and the sum rate in distributed RISs-assisted wireless communication systems. Firstly, the system model was established stochastically, including the distribution models of blockages, RISs, and users. Subsequently, the association criterion was defined, and the inhomogeneous PPPs for RISs were derived based on the LoS probability. Then, the association probabilities, the distance distributions, and the conditional coverage probabilities were obtained for the two cases of direct association and reflective association by RISs. Finally, we combined the two cases and obtained the closed-form expressions for the ergodic coverage probability and the sum rate.
The stochastic geometry analysis and simulation results can provide insights into how many RISs should be distributed to achieve a given performance at different blockage densities, which essentially facilitates the optimal design and cost control for practical RIS deployment.
References
- [1] F. Jameel, S. Wyne, S. J. Nawaz, and Z. Chang, “Propagation channels for mmWave vehicular communications: State-of-the-art and future research directions,” IEEE Wireless Commun., vol. 26, no. 1, pp. 144–150, Feb. 2019.
- [2] Z. Lodro, N. Shah, E. Mahar, S. B. Tirmizi, and M. Lodro, “Mmwave novel multiband microstrip patch antenna design for 5G communication,” in Int. Conf. Comput., Math. Eng. Technol. (iCoMET), Jan. 2019.
- [3] X. Yang, M. Matthaiou, J. Yang, C. K. Wen, F. Gao, and S. Jin, “Hardware-constrained millimeter-wave systems for 5G: Challenges, opportunities, and solutions,” IEEE Commun. Mag., vol. 57, no. 1, pp. 44–50, Jan. 2019.
- [4] S. Kutty and D. Sen, “Beamforming for millimeter wave communications: An inclusive survey,” IEEE Commun. Surveys Tuts., vol. 18, no. 2, pp. 949–973, 2nd Quart. 2016.
- [5] Y. Niu, Y. Lia, D. Jin, L. Su, and A. V. Vasilakos, “A survey of millimeter wave (mmWave) communications for 5G: Opportunities and challenges,” Wireles Netw., vol. 21, pp. 2657–2676, Nov. 2015.
- [6] C. Huang, A. Zappone, G. C. Alexandropoulos, M. Debbah, and C. Yuen, “Reconfigurable intelligent surfaces for energy efficiency in wireless communication,” IEEE Trans. Wireless Commun., vol. 18, no. 8, pp. 4157–4170, Aug. 2019.
- [7] L. W. et al., “Joint channel estimation and signal recovery for RIS-empowered multiuser communications,” IEEE Trans. Commun., vol. 70, no. 7, pp. 4640–4655, July 2022.
- [8] X. Gan, C. Zhong, C. Huang, Z. Yang, and Z. Zhang, “Multiple RISs assisted cell-free networks with two-timescale CSI: Performance analysis and system design,” IEEE Trans. Commun., vol. 70, no. 11, pp. 7696–7710, Nov. 2022.
- [9] A. Faisal, I. Al-Nahhal, O. A. Dobre, and T. M. N. Ngatched, “Deep reinforcement learning for RIS-assisted FD systems: Single or distributed RIS?” IEEE Commun. Lett., vol. 26, no. 7, pp. 1563–1567, July 2022.
- [10] M. Z. Win, P. C. Pinto, A. Giorgetti, M. Chiani, and L. A. Shepp, “Error performance of ultrawideband systems in a poisson field of narrowband interferers,” IEEE Int. Symp. Spread Spectrum Tech. Appl., pp. 410–416, Aug. 2006.
- [11] M. Z. Win, P. C. Pinto, and L. A. Shepp, “A mathematical theory of network interference and its applications,” Proc. IEEE, vol. 97, pp. 205–230, Feb. 2009.
- [12] M. Haenggi, J. G. Andrews, F. Baccelli, O. Dousse, and M. Franceschetti, “Stochastic geometry and random graphs for the analysis and design of wireless networks,” IEEE J. Sel. Areas Commun., vol. 27, no. 7, pp. 1029–1046, Sept. 2009.
- [13] T. Bai, R. Vaze, and R. W. Heath, “Analysis of blockage effects on urban cellular networks,” IEEE Wireless Commun., vol. 13, no. 9, pp. 5070–5083, Sept. 2014.
- [14] T. Bai and R. W. Heath, “Coverage and rate analysis for millimeter-wave cellular networks,” IEEE Trans. Wireless Commun., vol. 14, no. 2, pp. 1100–1114, Feb. 2015.
- [15] M. Rebato, J. Park, P. Popovski, E. D. Carvalho, and M. Zorzi, “Stochastic geometric coverage analysis in mmWave cellular networks with realistic channel and antenna radiation models,” IEEE Trans. Commun., vol. 67, no. 5, pp. 3736–3752, May 2019.
- [16] M. A. Kishk and M. S. Alouini, “Exploiting randomly located blockages for large-scale deployment of intelligent surfaces,” IEEE J. Sel. Areas Commun., vol. 39, no. 4, pp. 1043–1056, Apr. 2021.
- [17] Y. Zhu, G. Zheng, and K. K. Wong, “Stochastic geometry analysis of large intelligent surface-assisted millimeter wave networks,” IEEE J. Sel. Areas Commun., vol. 38, no. 8, pp. 1749–1762, Aug. 2020.
- [18] R. Cowan, “Objects arranged randomly in space: An accessible theory,” Adv. Appl. Probab., vol. 21, no. 3, pp. 543–569, Sep. 1989.
- [19] Q. H. Spencer, A. L. Swindlehurst, and M. Haardt, “Zero-forcing methods for downlink spatial multiplexing in multiuser MIMO channels,” IEEE Trans. Signal Process., vol. 52, no. 2, pp. 461–471, Feb. 2004.
- [20] D. H. N. Nguyen, L. B. Le, T. Le-Ngoc, and R. W. Heath, “Hybrid MMSE precoding and combining designs for mmwave multiuser systems,” IEEE Access, vol. 5, pp. 19 167–19 181, Sept. 2017.
- [21] A. Li and C. Masouros, “Hybrid precoding and combining design for millimeter-wave multi-user MIMO based on SVD,” in 2017 IEEE Int. Conf. Commun. (ICC), May 2017.
- [22] D. Moltchanov, “Distance distributions in random networks,” Ad Hoc Networks, vol. 10, no. 6, pp. 1146–1166, 2012.
- [23] Baddeley, A., J. Møller, and R. Waagepetersen., “Non- and semi-parametric estimation of interaction in inhomogeneous point patterns,” Stat. Neerl., vol. 54, no. 3, pp. 329–350, 2000.
- [24] H. P. Keeler, “Campbell’s theorem,” 2015.