Next Article in Journal
A Dual-Band Polarization-Insensitive Frequency Selective Surface for Electromagnetic Shielding Applications
Previous Article in Journal
Silver Nanowire-Based Flexible Strain Sensor for Human Motion Detection
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Secrecy Analysis of a Mu-MIMO LIS-Aided Communication Systems under Nakagami-m Fading Channels

by
Ricardo Coelho Ferreira
1,*,
Gustavo Fraidenraich
1,
Felipe A. P. de Figueiredo
1,2 and
Eduardo Rodrigues de Lima
3
1
Department of Communications, Faculty of Electrical and Computer Engineering, State University of Campinas (UNICAMP), Campinas 13083-970, SP, Brazil
2
Instituto Nacional de Telecomunicações—INATEL, Santa Rita do Sapucaí 37540-000, MG, Brazil
3
Department of Hardware Design, Instituto de Pesquisas Eldorado, Alan Turing-275, Campinas 13083-898, SP, Brazil
*
Author to whom correspondence should be addressed.
Sensors 2024, 24(11), 3332; https://doi.org/10.3390/s24113332
Submission received: 4 April 2024 / Revised: 26 April 2024 / Accepted: 6 May 2024 / Published: 23 May 2024
(This article belongs to the Section Communications)

Abstract

:
This study evaluates the performance of large intelligent surface (LIS) technology in the context of a multi-user MIMO mobile communication system (Mu-MIMO) proposed for the sixth generation (6G). LIS employs digitally controlled reflectors to enhance Signal-to-Interference plus Noise Ratio (SINR) and establish line of sight (LoS) connectivity in non-LoS environments, improving transmission security. Analytical expressions are derived to assess LIS performance metrics, including distribution parameters, bit error probability, and secrecy outage probability, considering the presence of eavesdroppers and environmental fading. The study highlights the potential of LIS technology to enhance the confidentiality and reliability of digital communication systems in next-generation networks.

1. Introduction

Mobile communications face several challenges in delivering signals with a good signal-to-noise ratio (SNR) and high transmission rates to users. One is multipath propagation, which is present mainly in large urban centers, with increasingly larger buildings and many users sharing the spectrum. This study proposes the implementation of strategically positioned reflecting surfaces to enhance the channel SNR and deliver a clearer, less interfered signal.
Large, intelligent surfaces have been one of the biggest innovations in digital communications in recent years. The term has variants such as large reflecting surfaces or intelligent reflecting surfaces. They consist of a grid of reflecting units composed of a metamaterial with a controllable reflection coefficient that can be digitally controlled using an optimization algorithm to strengthen the channel’s LoS.
Zhang et al. [1] presented a cost-effective and energy-efficient solution to enhance signal coverage and improve system capacity in mobile communications. However, large intelligent surfaces face challenges such as multiplicative fading effects arising from composite channels between the LIS and base stations and between the LIS and users. Additionally, the LIS encounters difficulties in enhancing communication systems when a strong direct link is present. Almekhlafi et al. [2] investigated a scenario where a base station transmits signals to multiple users using a single antenna. They developed an algorithm to jointly optimize power allocation to users and phase shifts induced by the LIS. In contrast to other studies that perform optimization processes in a decoupled manner, the authors propose two solutions: one utilizing linear transformation to reduce the number of variables for optimization and another employing an element-wise Karush–Kuhn–Tucker approach to derive closed-form expressions for phase shifts in a multi-user scenario.
Researchers are actively involved in discussions about the sixth generation and beyond the fifth generation (B5G) of mobile communications in several countries [3,4,5,6]. To meet this advancement, the community faces a series of challenges, encompassing algorithmic and mathematical complexities, as well as issues related to hardware and materials [7,8,9,10].
Tataria et al. [11] contributed significantly to addressing the challenges associated with the real-time implementation of LISs. In the same vein, Wang et al. [12] presented a remarkable system proposal employing a reconfigurable smart reflective surface in a MIMO cognitive radio environment. Their approaches strive to optimize the system secrecy rate by jointly optimizing base station transmit beamforming, and RIS-reflected beamforming, considering the complexities of dynamic environments.
Despite being a relatively new topic, there are older references in the LIS literature [13]. The term LIS has gained evidence and prominence and become a relevant bet for the technological industry and also academic research as a promising alternative to improve spectral efficiency (since it can act passively, without energy expenditure), decrease the bit error probability, and allow the erasure of channels for eavesdroppers using beamforming techniques, allowing a more elaborate approach of physical layer security.
The ability of the LIS to adapt to the channel and generate a resulting channel with different statistics allows us to, in a way, think of a controllable and adjusted channel. The channel between the transmitter and the LIS, as well as the channel between the end-user and the LIS, can be generically modeled using the Nakagami-m distribution, with the m parameter allowing a generic analysis of the environment’s behavior [14] before considering the presence of the LIS. In addition, it is prudent to consider a possible direct channel between the user and the transmitter and channels between the transmitter and an eavesdropper; without losing the generality, we can consider all these channels as Nakagami-m. However, each one has its parameter m; for users close to the base station, the parameter m in the Nakagami distribution for the direct channel will be large between the user and the transmitter and may not even need the LIS, whereas a user outside the LoS may have m = 1 and fall into the Rayleigh fading scenario (without LoS), where the LIS will create a channel resulting from the composition of all the links that result in a channel with LoS and a lower bit error rate [15].
The literature on mobile communication network optimization has been limited to two-point operations, with some strategies only for the transmitter (a base station) and the receiver. However, LISs changed this reality and created new possibilities to achieve even lower bit error rates, better spectral efficiency, decreased transmission power, and increased SNR. According to Gong et al. [16] the LIS allows modifying the channel characteristics and canceling its phase; in addition to projecting the beam towards the user, the adjustable reflector panels of the LIS can match the signals that reach them, thus enabling a smart radio environment that learns to beat the channel, even when its characteristics change.
Wu et al. [17] developed a framework in the form of a tutorial for implementing the LIS; the authors present the channel model, including the reflectors, discuss hardware aspects and practical issues related to the system deployment, and point out future possibilities for this technology.
Sánchez et al. [18] presented a performance analysis regarding physical layer security (PLS) in an environment assisted by a LIS, considering the possibility of phase errors. The authors assume that it is possible to model an equivalent scalar fading channel including the LIS, as shown by recent work [19] and show that the eavesdropper’s channel is Rayleigh distributed. The fading coefficient is statistically independent of the channel between the transmitter and the legitimate user; they also present the scaling laws for the SNR of the legitimate channel and the eavesdropper concerning the number of LIS reflectors.
Most preliminary articles on LISs present strategies for estimating the channel assisted by the LIS via least squares and other related methods, considering perfect knowledge of the CSI. However, this scenario is not close to reality since they are passive reflectors that intelligently reflect the inside electromagnetic waves to improve system performance. Nadeem et al. [20] present one of the first and most relevant contributions in studying a multi-user system assisted by the LIS assuming an imperfect CSI. The authors use the a priori knowledge of the fading statistics to feed a Bayesian minimum mean squared error (MMSE) estimator for the resulting fading, thus proposing a joint design of the precoder and the power allocation for transmission considering the application of beamforming in the LIS and show the impact of the channel estimation error on the efficiency of the designed system.
Basar et al. [21] present a script for the analytical calculation of the symbol error probability (SEP) in the transmission through the LIS in a generic scenario, in addition to presenting alternative modeling that considers the LIS as an access point (AP), which can or cannot know the phases of the channel.
The statistical analysis of cascaded MIMO channels poses a considerable challenge, complicating the modeling of resulting fading due to including both linear and non-linear transformations of random variables in its definition. However, by using the central limit theorem (CLT), it is possible to obtain, with great accuracy, the fading statistical model, taking into account the continuous phase errors committed by the LIS after the phase adjustment. The composite channel is the product of two channels with a Nakagami-m [14] distribution with different coefficients, modeling what goes to the LIS and what goes to the user, and a complex phase error modeled as a Von Mises distribution. Ferreira et al. [15] obtained the distribution of the resulting channel considering only one antenna in the receiver; in this work, we approach a more complex and more comprehensive system model, which includes all the analyses made by the authors, for a special case in which the number of antennas of the user is unitary.
This study investigates the fading distribution of a LIS-aided channel with multiple transmitters and users enabling the increase of SINR, allowing the strengthening of a LoS or improving spectrum sharing. It examines the impact of channel parameters (the number of LIS reflectors, users, the Von Mises error concentration parameter, and the number of transmitter antennas) on the bit error probability and the secrecy outage probability. The aim is to assess the impact of LIS design on performance and help design the system based on quality and information security metrics, evaluating performance that can be calculated directly through simple algebraic expressions involving the parameters of the statistical modeling of the system.
Recent papers on LISs present various mobile system modeling schemas. Lin et al. [22] focused on joint beamforming design for LIS-aided hybrid satellite–terrestrial relay networks, employing a refracting LIS approach to enhance satellite signals for obstructed users. Lin et al. [23] investigated destructive beamforming by a malicious LIS in IoT networks to minimize received SNR at IoT devices. Ma et al.’s [24] study converted mmWave communications with finite blocklength, optimizing antenna gain for covert transmission against spatially random wardens. Niu et al. [25] analyzed robust beamforming design in a secrecy MISO network with LIS, addressing imperfections in CSI and potential eavesdroppers. These articles considered different beamforming strategies, addressing challenges such as power optimization, security, and robustness to channel variations. In contrast, our paper focuses on the phase error distribution without being restricted to a specific optimization technique and can be applied, regardless of how the LIS is designed, provided that the phase error concentration parameter is known. With this level of abstraction, we analyzed the system performance in terms of physical layer security and bit error probability across various fading scenarios involving multiple users.

2. System Model

This work considers a base station composed of M uncorrelated antennas and K uncorrelated users, as shown in Figure 1. The base station sends the same message to all users; however, it applies a normalized precoding vector for each one of the fading channels.
The signal received by the uncorrelated antenna array at the user side is
y = G H Φ H H H + H d H Ψ + η ,
where H C M × N is the channel between each one of the uncorrelated antennas at the base station and each one of the LIS reflectors, G C N × K is the channel between the LIS reflectors and the users, Φ C N × N is the phase matrix with the phase shifts applied by the LIS in the incoming signals, and H d C M × K is the direct link between the base station and each user. The eavesdropper link is w C M × 1 and is only considered for the secrecy outage probability analysis. Therefore, it was neglected in the first analysis.
One possible strategy to cancel the channel phase is to apply a precoding matrix at the base station; in this case, the sub-optimal solution is the normalized hermitian of the overall channel.
Let
Υ = H Φ G + H d ,
whose dimensions are Υ C M × K , and the elements of the matrix Υ are the υ k vectors.
The scalar elements of H have a Nakagami distribution with parameters m H and Ω H , the elements of G have a Nakagami distribution with parameters m G and Ω G , and the elements of H d follow the complex normal distribution with mean zero.
The mean of a variable T with Nakagami-m distribution with parameters m and Ω can be calculated by
E [ T ] = Γ m + 1 2 Γ ( m ) Ω m 1 2 ,
and the second-order moment E T 2 = Ω .
The transmitted symbols after the application of the precoder are
Ψ = P A s ,
where P is the power gain and A is the precoding matrix, and, for analysis purposes, the s symbols are generated as complex normal distributed s C N 0 , I K .
The sub-optimal precoding matrix, considering complete knowledge of the Channel State Information (CSI), is given by
A = P Υ Υ F ,
where . F is the Frobenius norm. The precoding vector for each user is given by
a k = P K υ k υ k ,
and each one of the υ k has dimensions υ k C M × 1 .
The scalar definition of each element of the υ k vectors is
υ l k = p = 1 N q = 1 N h l p ϕ p q g q k + h ( d ) , k l ,
after the application of the LIS, these coefficients can be rewritten as
υ l k = p = 1 N q = 1 N h l p g q k e j δ ( h ) , l p + δ ( g ) , q k φ p q + h ( d ) , k l ,
where δ ( h ) , l p = a r g ( h ) , φ p q = a r g ( ϕ p q ) , and δ ( g ) , q k = a r g ( g q k ) are the phases of each channel.
To nullify the overall channel phase, the phase shift applied by the LIS panel must be equal to
φ p q = δ ( h ) , l p + δ ( g ) , q k δ p q
where δ p q is the residual error of the LIS phase correction.
The elements of the overall channel matrix for each user are
υ k = p = 1 N q = 1 N h p g q k e j δ p q + h ( d ) , k ,
where
h p = h 1 p , h 2 p h M p
and h ( d ) , k = h ( d ) , k 1 , h ( d ) , k 2 , h ( d ) , k M are the lines of the matrix H d .
The norm of the overall channel for each user can be written as
υ k 2 = l = 1 M p = 1 N q = 1 N h l p g q k e j δ p q + h ( d ) , k l 2 ,
and the SINR at the user antenna k is
γ k = | υ k H a k | 2 i = 0 , i k K | υ i H a i | 2 + σ η 2 ,
where the terms
υ k H a k 2 = P K υ k 2 .
Therefore,
γ k = P K υ k 2 P K i = 0 , i k K υ i 2 + σ η 2 .
The SINR can be rewritten as
γ k = Z k σ η 2 + i = 0 , i k K Z i ,
where Z i = υ i 2 .
Since the summation terms of Equation (10) are complex variables, then
Z k = P K l = 1 M r l k 2 ,
where
r l k = p = 1 N q = 1 N h l p g q k e j δ p q + h ( d ) , k l .
Considering that the complex number r l k = c l k + j s l k , thus
Z k = P K l = 1 M c l k + j s l k 2 ,
in which
c l k = p = 1 N q = 1 N h l p g q k cos δ p q + { h ( d ) , k l } ,
and
s l k = p = 1 N q = 1 N h l p g q k sin δ p q + { h ( d ) , k l } .
By substituting the imaginary and real parts of the complex scalar r l k , it follows that
υ k 2 = l = 1 M c l k 2 + l = 1 M s l k 2 ,
since the real and imaginary parts of the direct path h ( d ) , k l are Gaussian and uncorrelated.
Let be C k = l = 1 M c l k 2 and S k = l = 1 M s l k 2 ; therefore, we can rewrite υ k 2 as
R k = υ k 2 = C k + S k ,
then
Z k = P K R k ,
we consider that
F k = σ η 2 + i = 0 , i k K Z i .
Therefore, the SINR can be written in terms of these two coefficients as
γ k = Z k F k .
Since Z k is the sum of squared Gaussian random variables, it is reasonable to assume that Z k is Gamma distributed with parameters α Z and β Z . The term F k is the sum of Gamma random variables, and it is supposed to be also Gamma distributed with parameters α F and β F .
The SINR γ k is the ratio between the variables Z k and F k and also is supposed to be Gamma distributed. This study proposes an approximation for the SINR distribution to obtain the error and secrecy outage probability. Although not an exact solution, the approximation is very accurate, even for small values of M, N, and K.
The parameters of the SINR distribution can be obtained by calculating the moments of γ k . Since γ k is the ratio of Z k and F k , therefore, the statistics of the numerator Z k and the denominator F k must be evaluated.
The variables Z k and F k are correlated, and because of this, the covariance between them must be taken into account.
According to Kendall et al. [26], the mean of the ratio between the Gamma random variables is
μ γ = E γ k = μ Z μ F ,
where μ Z = E Z k and μ F = E F k .
The variance can be approximated by
v a r γ k = μ Z μ F 2 σ Z 2 μ Z 2 2 c o v ( Z k , F k ) μ Z μ F + σ F 2 μ F 2 ,
where σ F 2 = v a r ( F k ) and σ Z 2 = v a r ( Z k ) .
The term c o v ( Z k , F k ) = E Z k F k E Z k E F k can be computed as c o v ( Z k , F k ) = E Z k i k K Z i E Z k E i k K Z i = i k K E Z k Z i E Z k E Z i ; by considering the definition of the covariance and considering that all the coefficients Z k are equally distributed, then
c o v ( Z k , F k ) = ( K 1 ) c o v ( Z i , Z k ) , i k .
Given the covariance c o v ( Z k , F k ) , the variance of γ k can be derived as
σ γ 2 = μ Z μ F 2 σ Z 2 μ Z 2 2 ( K 1 ) c o v ( Z i , Z k ) μ Z μ F + σ F 2 μ F 2 ,
where σ γ 2 is an approximation for v a r γ k .
Since μ F = ( K 1 ) μ Z , thus
σ γ 2 = 1 ( K 1 ) 2 μ Z 2 σ Z 2 2 c o v ( Z i , Z k ) + σ F 2 ( K 1 ) 2 ,
with the overall channel moments, the fading parameters α γ and β γ can be computed as follows:
α γ = μ γ 2 σ γ 2 , β γ = μ γ σ γ 2 ,
where α γ and β γ are the shape and rate parameters of the SINR γ k .
The mean and variance of Z k , F k and γ k are presented in Appendix A, Appendix B and Appendix C respectively.

2.1. Error Probability

The error probability of a LIS-aided communication system was derived by Ferreira et al. [19], considering that the transmitted symbols are M-QAM signals transmitted through a Gamma fading channel; in this scenario, the probability will be
P ¯ e Q A M ( γ ) 4 log 2 M Q 3 γ l o g 2 M M 1 .
Since the mu-MIMO LIS channel is considered as Gamma distributed, therefore, this expression for P ¯ e Q A M ( γ ) will be used. The parameters γ k are identically distributed and, therefore, P ¯ e Q A M ( γ k ) = P ¯ e Q A M ( γ l ) = P ¯ e Q A M ( γ ) .

2.2. Secrecy Outage Probability

Secrecy outage probability is a metric used in communication systems to quantify the likelihood of unauthorized information disclosure. It represents the probability that the confidential information transmitted between parties becomes susceptible to interception or eavesdropping. A lower secrecy outage probability indicates a higher level of security, where the confidential information is less likely to be compromised during transmission.
The SOP is the probability that the instantaneous secrecy capacity, C, is less or equal to a given capacity threshold, ln 1 + γ t h , which is expressed as
S O P = P r ln ( 1 + γ D ) ( 1 + γ E ) ln 1 + γ t h = 0 0 1 + γ E 1 + γ D 1 f γ E ( w ) f γ D ( u ) d u d w ,
the instantaneous secrecy capacity can be written as
C = ln 1 + γ D ln 1 + γ E γ D > γ E 0 γ D γ E ,
where γ E is the SINR of the channel between the source and the eavesdropper and γ D is the SINR of the channel between the source and the correct destination (the user).
Ferreira et al. [15] derived the exact formula of the SOP for a Nakagami-m distributed eavesdropper channel as (34).
S O P = k = 0 ( 1 ) k β α + k γ t h α + k Γ ( α ) Γ ( k + 1 ) × ( π m m 2 α k v 2 m Ω m Γ ( m + 1 2 ) csc ( π ( α + k + 2 m ) ) 2 F ˜ 2 ( m , m + 1 2 ; 1 2 ( k + 2 m + α + 1 ) , 1 2 ( k + 2 m + α + 2 ) ; m v 2 Ω ) Γ ( k α + 1 ) + π 3 / 2 Ω α + k 2 m 1 2 ( α k ) v α + k 2 Γ ( m ) ( 2 csc ( 1 2 π ( α + k + 2 m ) ) 2 F ˜ 2 ( 1 2 ( k α ) , 1 2 ( k α + 1 ) ; 1 2 , 1 2 ( k 2 m α + 2 ) ; m v 2 Ω ) α + k m sec ( 1 2 π ( α + k + 2 m ) ) 2 F ˜ 2 ( 1 2 ( k α + 1 ) , 1 2 ( k α + 2 ) ; 3 2 , 1 2 ( k 2 m α + 3 ) ; m v 2 Ω ) v Ω ) ) ,
where v = 1 + γ t h γ t h .

3. Numerical Results

This section demonstrates the performance of the LIS for a multi-user system through simulations using the Monte Carlo method and analyzing the validity of the proposed approximations for various analysis scenarios in terms of the number of antennas at the LIS panel, the number of users in the system, the number of antennas at the base station, and the Von Mises parameter for the phase error distribution.
In this study, the SINR was simulated for each user using the parameters of each channel involved in the total link, being the Nakagami-m channels from the base station to the LIS, from the LIS to the user, and the complex normal direct channel from the base station to the user, which may be strong for near-field communications and weak for far-field communications. The SINR histograms were generated by the Monte Carlo method, simulating the resulting channel several times, and the contours of the histograms are shown close to the PDF of the Gamma distribution.

3.1. Probability Distribution

For 10 5 iterations of the Monte Carlo method, it is shown in Figure 2 that the probability density function of the SINR is close to the Gamma distribution.
Figure 2 shows a comparison between the exact Gamma distribution and the simulated PDF of the SINR via the Monte Carlo method for m = 2 , Ω = 1 , K = 16 users, and M = 2 for different values of the number of reflectors N.
It is possible to note that the SINR follows a gamma distribution for a wide variety of parameters in such a way that the analytical calculations of the moments and the statistical parameters of the SINR are valid for the formulas proposed for the probability of bit error and the secrecy outage probability.

3.2. Bit Error Probability

One possible way to demonstrate that the LIS can improve the SINR is by showing how the bit error probability varies, increasing the number of antennas at the base station, the number of reflecting elements, and the concentration parameter of the phase error distribution.
Figure 3 illustrates how the bit error probability decreases when the number of reflectors increases. This scenario has four users, eight transmitting antennas, the Nakagami parameter m = 2 , and the Von Mises κ = 2 . Notably, although the bit error probability is low, the values do not change significantly from N = 32 to N = 64 as much as from N = 16 to N = 32 reflectors. This may be because the channel already has LoS. Additionally, and beyond a certain number of reflectors, the SINR becomes optimal with the assistance of the LIS, which is something this type of analysis can help discover.
Figure 4 demonstrates that increasing the number of system users raises the bit error probability when keeping the number of LIS reflectors, base station antennas, and the Von Mises parameter constant. In this scenario, the transmission of 16-QAM signals was considered. One strategy to mitigate the increase of the error probability is to use many reflectors to enhance the LIS’s capacity to serve more users with higher SINR and, consequently, reduce the bit error probability.
For the scenario depicted in Figure 5, in which signals from the 4-QAM constellation are transmitted, the approximation of SINR by the gamma distribution continues to hold, and the bit error probability remains higher when the system accommodates more users.
When there is no line of sight as in Figure 6, where the scenario with SINR channels following a Rayleigh distribution (Nakagami with m = 1 ) is analyzed, it is noticeable that the exact bit error probability continues to approximate the simulated bit error rate closely. In this case, a higher SINR was required compared to Figure 7 to reduce the bit error rate promoted by the LIS. In this simulation, the number of reflectors was kept constant. However, it is worth noting that one case deals with the 4- Q A M constellation and the other with the 16- Q A M constellation.
Regarding the Von Mises parameter, it is notable that the bit error probability decreases faster for larger values of κ , as observed in Figure 5. The worst-case scenario is when κ = 0 and the error distribution is uniform. In this case, large and small phase errors have the same probability density and occur when the phase error has been poorly corrected.
If the phase error is concentrated around the mean (in this study, the mean phase error is zero), the PDF of the phase error approaches a delta function at the origin. In this case, the SINR will be higher because the sum of phasors will be greater if their phase is zero, and the complex exponential vanishes, leaving only the magnitudes.

3.3. Secrecy Outage Probability

To simulate the secrecy outage probability (SOP), the SINR corrected by the LIS was generated, and an additional eavesdropper channel with a Nakagami distribution with LoS access to the LIS signal was considered. This additional channel has a line of sight. The summation was truncated at index 100 to calculate the SOP, and the approximation closely matched the simulated SOP values via Monte Carlo. It was assumed that the Von Mises concentration parameter was κ = 2 , and the direct link had unity variance.
It can be observed in Figure 8, where an eavesdropper channel with m = 2 and Ω = 1 is considered, that the higher the number of reflectors, the lower the SOP will be. This demonstrates that the LIS contributes to the confidentiality of information.

4. Conclusions

This study shows that Mu-MIMO channels formed by links with Nakagami-m fading, when assisted by large intelligent surfaces, have an SINR with Gamma distribution and can considerably reduce their bit error probability by increasing the number of reflectors or the efficiency of the phase optimization algorithm (related to the κ parameter of the phase error distribution).
The worst case, considering the Nakagami-m fading channel, is the Rayleigh fading (for m = 1 ); this study shows that Rayleigh channels can be converted to Gamma fading channels by applying the phase shift matrix of the LIS. It was also shown that creating a line of sight in scenarios where a LoS did not exist was possible. This study presented the probability distributions of SINR compared to the PDF of the Gamma distribution. It showed that the exact formula for the probability density is very close to the one generated by the histogram obtained from the channel simulation.
It was possible to show that the LIS can enable a low secrecy outage probability, even for a few reflecting units and low bit error probability values, when increasing the number of LIS elements or improving the quality of phase correction. Our study assumes complete knowledge of the channel state information. It considers phase errors due to the behavior of the reflecting panel when attempting to correct the phase of many signals simultaneously (and not being able to optimize this for all) or due to the influence of the superposition of electromagnetic signals.

Author Contributions

Conceptualization, R.C.F., G.F., F.A.P.d.F. and E.R.d.L.; Formal analysis, R.C.F., G.F., F.A.P.d.F. and E.R.d.L.; Writing—original draft, R.C.F., G.F., F.A.P.d.F. and E.R.d.L. All authors have read and agreed to the published version of the manuscript.

Funding

This work was partially funded by CNPq (Grant Nos. 302077/2022-7, 403612/2020-9, 311470/2021-1, and 403827/2021-3), by the São Paulo Research Foundation (FAPESP) (Grant No. 2021/06946-0), by the Minas Gerais Research Foundation (FAPEMIG) (Grant No. APQ-00810-21) and by the project “Resource-aware Machine Learning Model Optimization for Edge Computing”, supported by xGMobile—EMBRAPII-Inatel Competence Center on 5G and 6G Networks, with financial resources from the PPI IoT/Manufatura 4.0 from MCTI grant number 052/2023, signed with EMBRAPII.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A. Statistical Parameters of Zk

Appendix A.1. Expected Value of Zk

The expected value of Z k will be
E Z k = P K E l = 1 M r l k 2 ,
since the expected value is a linear operator, then
E Z k = P K l = 1 M E r l k 2 = P M K E r l k 2 ,
where the term E r l k 2 must be calculated, but, first of all, the terms E c l k and E s l k are needed.
The expected value E c l k of the real part of r l k can be defined as
E c l k = E p = 1 N q = 1 N h l p g q k cos δ p q + { h ( d ) , k l } ,
since E { h ( d ) , k l } = 0 and the summation terms are independent and equally likely. Therefore,
E c l k = N 2 E h l p E g q k E cos δ p q = N 2 μ h μ g α 1 .
The moments of the fading channels are μ h = E h l p , ξ h = E h l p 2 , μ q = E g q k , ξ g = E g q k 2 , χ h = E [ h l p 3 ] , χ g = E [ g q k 3 ] , ϵ h = E [ h l p 4 ] , ϵ g = E [ g q k 4 ] , μ { h ( d ) } = E { h ( d ) , k l } = 0 , ξ { h ( d ) } = E { h ( d ) , k l } 2 , μ { h ( d ) } = E { h ( d ) , k l } = 0 , and ξ { h ( d ) } = E { h ( d ) , k l } 2 and most of then will appear in the following equations.
The expected value E s l k of the imaginary part of r l k can be computed as
E s l k = E p = 1 N q = 1 N h l p g q k sin δ p q + { h ( d ) , k l } ,
since E { h ( d ) , k l } = 0 and the summation terms are independent and equally likely, then
E s l k = N 2 E h l p E g q k E sin δ p q = N 2 μ h μ g β 1 ,
but the Von Mises variable δ has a PDF that is symmetric about zero, and the phase errors are zero mean, so p . β p = E sin p δ = 0 , therefore
E s l k = N 2 μ h μ g β 1 = 0 .
The expected value E r l k 2 of the magnitude of r l k can be obtained as
E r l k 2 = E c l k 2 + E s l k 2 ,
where
E c l k 2 = E p = 1 N q = 1 N h l p g q k cos δ p q + { h ( d ) , k l } 2 ,
and
E s l k 2 = E p = 1 N q = 1 N h l p g q k sin δ p q + { h ( d ) , k l } 2 ,
by expanding the terms (A9), it follows that
E c l k 2 = E p = 1 N q = 1 N h l p g q k cos δ p q + { h ( d ) , k l } ×                   b = 1 N e = 1 N h l b g e k cos δ b e + { h ( d ) , k l } ,
that can be rewritten as
E c l k 2 = E p = 1 N q = 1 N p = 1 N q = 1 N h l p g q k cos δ p q h l p g q k cos δ p q + E { h ( d ) , k l } 2 +               E { h ( d ) , k l } p = 1 N q = 1 N h l p g q k cos δ p q + E { h ( d ) , k l } b = 1 N e = 1 N h l b g e k cos δ b e ,
and since
E { h ( d ) , k l } p = 1 N q = 1 N h l p g q k cos δ p q = E { h ( d ) , k l } b = 1 N e = 1 N h l b g e k cos δ b e ,
and the expected value is a linear operator, so
E c l k 2 = p = 1 N q = 1 N b = 1 N e = 1 N E h l p g q k h l b g e k cos δ p q cos δ b e + E { h ( d ) , k l } 2 +                            2 E { h ( d ) , k l } b = 1 N e = 1 N E h l b g e k cos δ b e ,
by separating the independent coefficients, it follows that
E c l k 2 = p = 1 N q = 1 N b = 1 N e = 1 N E h l p h l b E g q k g e k E cos δ p q cos δ b e + E { h ( d ) , k l } 2 +                          2 E { h ( d ) , k l } b = 1 N e = 1 N E h l b E g e k E cos δ b e .
To compute E c l k 2 , four situations must be considered: N 2 times the event p = b and q = e will occur in the summation, N 2 ( N 1 ) times the event p = b and q e will occur, N 2 ( N 1 ) 2 times p b and q e , and N 2 ( N 1 ) times p b and q = e , then
E p = 1 N q = 1 N h l p g q k cos δ p q + { h ( d ) , k l } 2 = N 2 ( N 1 ) 2 E g q k 2 E cos δ p q 2      + N 2 E h l p 2 E g q k 2 E cos 2 δ p q + N 2 ( N 1 ) E h l p 2 E g q k 2 E cos δ p q 2        + N 2 ( N 1 ) E h l p 2 E h l p 2 E g q k 2 E cos δ p q 2 +                      E { h ( d ) , k l } 2 + 2 E { h ( d ) , k l } b = 1 N e = 1 N E h l b E g e k E cos δ b e .
Therefore,
E c l k 2 = N 2 2 ξ h ξ g ( 1 + α 2 ) + N 2 ( N 1 ) ξ h μ q 2 α 1 2 + N 2 ( N 1 ) μ h 2 ξ g α 1 2 +                  N 2 ( N 1 ) 2 μ h 2 μ q 2 α 1 2 + 2 N 2 μ { h ( d ) } μ h μ q α 1 + ξ { h ( d ) } .
The expected value E s l k 2 of the squared magnitude of s l k can be calculated as
E s l k 2 = E p = 1 N q = 1 N h l p g q k sin δ p q + { h ( d ) , k l } 2 ,
that can be rewritten as
E s l k 2 = E p = 1 N q = 1 N b = 1 N e = 1 N h l p g q k sin δ p q h l b g e k sin δ b e + E { h ( d ) , k l } 2 +                  E { h ( d ) , k l } p = 1 N q = 1 N h l p g q k sin δ p q + E { h ( d ) , k l } b = 1 N e = 1 N h l b g e k sin δ b e .
After expanding and simplifying the terms, it follows that
E s l k 2 = p = 1 N q = 1 N b = 1 N e = 1 N E h l p h l b E g q k g e k E sin δ p q sin δ b e + E { h ( d ) , k l } 2 +                           2 E { h ( d ) , k l } b = 1 N e = 1 N E h l b E g e k E sin δ b e ,
that can be simplified to
E s l k 2 = N 2 2 ξ h ξ g ( 1 α 2 ) + N 2 ( N 1 ) ξ h μ q 2 β 1 2 + N 2 ( N 1 ) μ h 2 ξ g β 1 2 +               N 2 ( N 1 ) 2 μ h 2 μ q 2 β 1 2 + 2 N 2 μ { h ( d ) } μ h μ q β 1 + ξ { h ( d ) } ,
and, since β 1 = 0 , therefore,
E s l k 2 = N 2 2 ξ h ξ g ( 1 α 2 ) + ξ { h ( d ) } .
To compute the expected value E Z k substituting (A8) in (A2), then
E Z k = P M K E c l k 2 + E s l k 2 .
After substituting (A17) and (A22) in (A23), it follows that
μ Z k = E Z k = P M K N 2 2 ξ h ξ g ( 1 + α 2 ) + N 2 ( N 1 ) ξ h μ q 2 α 1 2 + N 2 ( N 1 ) μ h 2 ξ g α 1 2 +             N 2 ( N 1 ) 2 μ h 2 μ q 2 α 1 2 + 2 N 2 μ { h ( d ) } μ h μ q α 1 + ξ { h ( d ) } + N 2 2 ξ h ξ g ( 1 α 2 ) + ξ { h ( d ) } .

Appendix A.2. Variance of Zk

To compute the variance of Z k , we consider that
σ Z k 2 = v a r Z k = v a r P K l = 1 M r l k 2 ,
in terms of the real and imaginary parts, the equation can be rewritten as
σ Z k 2 = P K 2 v a r l = 1 M c l k 2 + l = 1 M s l k 2 ,
since the variance of the sum of random variables can be computed in terms their covariances, then
σ Z k 2 = P K 2 v a r C k + v a r S k + 2 c o v C k , S k ,
where
v a r C k = v a r l = 1 M c l k 2 = M ( M 1 ) c o v c l k , c i k + M v a r c l k ,
v a r S k = v a r l = 1 M s l k 2 = M ( M 1 ) c o v s l k , s i k + M v a r s l k ,
and
c o v C k , S k = E C k S k E C k E S k .
To compute the previous variances, the covariances c o v c l k , c i k and c o v s l k , s i k are needed; we consider that
c o v c l k , c i k = E c l k c i k E c l k E c i k c o v c l k , c i k = E c l k c i k E c l k 2
and
c o v s l k , s i k = E s l k s i k E s l k E s i k c o v s l k , s i k = E s l k s i k E s l k 2 ,
since the expected value E C k S k can be obtained as
E C k S k = E l = 1 M p = 1 N q = 1 N h l p g q k cos δ p q + { h ( d ) , k l } 2 ×                 l = 1 M p = 1 N q = 1 N h l p g q k sin δ p q + { h ( d ) , k l } 2 ,
thus
E c l k c i k = E p = 1 N q = 1 N h l p g q k cos δ p q + { h ( d ) , k l } ×                 p = 1 N q = 1 N h i p g q k cos δ p q + { h ( d ) , k i } .
To compute the expected value E c l k c i k , it is needed to change the summation indexes as
E c l k c i k = E p 1 = 1 N q 1 = 1 N h l p 1 g q 1 k cos δ p 1 q 1 + { h ( d ) , k l } ×                 p 2 = 1 N q 2 = 1 N h i p 2 g q 2 k cos δ p 2 q 2 + { h ( d ) , k i } .
After applying the product and considering the independent indexes, it follows that
E c l k c i k = E p 1 = 1 N q 1 = 1 N p 2 = 1 N q 2 = 1 N h l p 1 h i p 2 g q 1 k g q 2 k cos δ p 1 q 1 cos δ p 2 q 2 +         E { h ( d ) , k i } p 1 = 1 N q 1 = 1 N h l p 1 g q 1 k cos δ p 1 q 1 + E { h ( d ) , k l } p 2 = 1 N q 2 = 1 N h i p 2 g q 2 k cos δ p 2 q 2 + E { h ( d ) , k l } { h ( d ) , k i } ,
by expanding the previous equations, then
E c l k c i k = p 1 = 1 N q 1 = 1 N p 2 = 1 N q 2 = 1 N E h l p 1 h i p 2 E g q 1 k g q 2 k E cos δ p 1 q 1 cos δ p 2 q 2 + E { h ( d ) , k i } p 1 = 1 N q 1 = 1 N E h l p 1 E g q 1 k E cos δ p 1 q 1 + E { h ( d ) , k l } p 2 = 1 N q 2 = 1 N E h i p 2 E g q 2 k E cos δ p 2 q 2 + E { h ( d ) , k l } { h ( d ) , k i } .
Assuming that l i
E c l k c i k = 2 N 2 × μ { h ( d ) } μ h μ q α 1 + μ { h ( d ) } 2 + N 2 ( N 1 ) E h l p 1 2 E g q 1 k 2 E cos δ p 1 q 1 2 + N 2 ( N 1 ) E h l p 1 2 E g q 1 k 2 E cos δ p 1 q 1 2 + N 2 ( N 1 ) 2 E h l p 1 2 E g q 1 k 2 E cos δ p 1 q 1 2 + N 2 E h l p 1 2 E g q 1 k 2 E cos δ p 1 q 1 2 , l i ,
which can be simplified to
E c l k c i k = N 2 2 ξ h ξ g 1 + α 2 + N 2 ( N 1 ) ξ h μ q 2 α 1 2 + N 2 ( N 1 ) ξ h ξ g α 1 2 + N 2 ( N 1 ) 2 ξ h μ q 2 α 1 2 + 2 N 2 × μ { h ( d ) } μ h μ q α 1 + μ { h ( d ) } 2 , l i .
The term E s l k s i k , assuming that l i , can be computed as follows:
E s l k s i k = E p = 1 N q = 1 N h l p g q k sin δ p q + { h ( d ) , k l } ×                  p = 1 N q = 1 N h i p g q k sin δ p q + { h ( d ) , k i } ,
by expanding the previous equation, then
E s l k s i k = E p 1 = 1 N q 1 = 1 N p 2 = 1 N q 2 = 1 N h l p 1 h i p 2 g q 1 k g q 2 k sin δ p 1 q 1 sin δ p 2 q 2 +         E { h ( d ) , k i } p 1 = 1 N q 1 = 1 N h l p 1 g q 1 k sin δ p 1 q 1 + E { h ( d ) , k l } p 2 = 1 N q 2 = 1 N h i p 2 g q 2 k sin δ p 2 q 2 + E { h ( d ) , k l } { h ( d ) , k i } ,
and can be rewritten as
E s l k s i k = p 1 = 1 N q 1 = 1 N p 2 = 1 N q 2 = 1 N E h l p 1 h i p 2 E g q 1 k g q 2 k E sin δ p 1 q 1 sin δ p 2 q 2 + E { h ( d ) , k i } p 1 = 1 N q 1 = 1 N E h l p 1 E g q 1 k E sin δ p 1 q 1 + E { h ( d ) , k l } p 2 = 1 N q 2 = 1 N E h i p 2 E g q 2 k E sin δ p 2 q 2 + E { h ( d ) , k l } { h ( d ) , k i } ,
by substituting the statistical moments of the random variables, it follows that
E s l k s i k = N 2 E h l p 1 2 E g q 1 k 2 E sin δ p 1 q 1 2 + N 2 ( N 1 ) E h l p 1 2 E g q 1 k 2 E sin δ p 1 q 1 2 + N 2 ( N 1 ) E h l p 1 2 E g q 1 k 2 E sin δ p 1 q 1 2 + N 2 ( N 1 ) 2 E h l p 1 2 E g q 1 k 2 E sin δ p 1 q 1 2 + 2 N 2 × μ { h ( d ) } μ h μ q β 1 + μ { h ( d ) } 2 , for l i ,
that can be simplified to
E s l k s i k = N 2 2 ξ h ξ g 1 α 2 + N 2 ( N 1 ) ξ h μ q 2 β 1 2 + N 2 ( N 1 ) ξ h ξ g β 1 2 + N 2 ( N 1 ) 2 ξ h μ q 2 β 1 2 +                      2 N 2 × μ { h ( d ) } μ h μ q β 1 + μ { h ( d ) } 2 , for l i ,
since β 1 = 0 , therefore
E s l k s i k = N 2 2 ξ h ξ g 1 α 2 + μ { h ( d ) } 2 , for l i .
The covariance c o v c l k , c i k can be computed as
c o v c l k , c i k = E c l k c i k E c l k 2 ,
then
c o v c l k , c i k = N 2 2 ξ h ξ g 1 + α 2 + N 2 ( N 1 ) ξ h μ q 2 α 1 2 + N 2 ( N 1 ) ξ h ξ g α 1 2 +         N 2 ( N 1 ) 2 ξ h μ q 2 α 1 2 + 2 N 2 μ { h ( d ) } μ h μ q α 1 + μ { h ( d ) } 2 N 4 μ h 2 μ g 2 α 1 2 ,
and covariance c o v s l k , s i k can be calculated as
c o v s l k , s i k = E s l k s i k = N 2 2 ξ h ξ g 1 α 2 + μ { h ( d ) } 2 .
The variances v a r c l k and v a r s l k can be computed as
v a r c l k = E c l k 2 E c l k 2 ,
that can be rewritten as
v a r c l k = N 2 2 ξ h ξ g ( 1 + α 2 ) + N 2 ( N 1 ) ξ h μ q 2 α 1 2 + N 2 ( N 1 ) μ h 2 ξ g α 1 2 +         N 2 ( N 1 ) 2 μ h 2 μ q 2 α 1 2 + 2 N 2 μ { h ( d ) } μ h μ q α 1 + ξ { h ( d ) } N 4 μ h 2 μ g 2 α 1 2 ,
since
v a r s l k = E s l k 2 E s l k 2 = E s l k 2 ,
then
v a r s l k = N 2 2 ξ h ξ g ( 1 α 2 ) + ξ { h ( d ) } .
The variance v a r C k can be calculated by
σ C k 2 = v a r C k = M ( M 1 ) N 2 2 ξ h ξ g 1 + α 2 + N 2 ( N 1 ) ξ h μ q 2 α 1 2 +         N 2 ( N 1 ) ξ h ξ g α 1 2 + N 2 ( N 1 ) 2 ξ h μ q 2 α 1 2 + 2 N 2 μ { h ( d ) } μ h μ q α 1 + μ { h ( d ) } 2 N 4 μ h 2 μ g 2 α 1 2 +           M N 2 2 ξ h ξ g ( 1 + α 2 ) + N 2 ( N 1 ) ξ h μ q 2 α 1 2 + N 2 ( N 1 ) μ h 2 ξ g α 1 2 +                      N 2 ( N 1 ) 2 μ h 2 μ q 2 α 1 2 + 2 N 2 μ { h ( d ) } μ h μ q α 1 + ξ { h ( d ) } N 4 μ h 2 μ g 2 α 1 2 .
The variance v a r S k can be defined as
σ S k 2 = v a r S k = M ( M 1 ) N 2 2 ξ h ξ g 1 α 2 + μ { h ( d ) } 2 +                      M N 2 2 ξ h ξ g ( 1 α 2 ) + ξ { h ( d ) } ,
and the correlation E C k S k is
E C k S k = E l = 1 M p = 1 N q = 1 N h l p g q k cos δ p q + { h ( d ) , k l } 2 ×                      l = 1 M p = 1 N q = 1 N h l p g q k sin δ p q + { h ( d ) , k l } 2 .
The term E C k S k can be calculated as
E C k S k = E l 1 = 1 M s l 1 k 2 l 2 = 1 M c l 2 k 2 = l = 1 M l 2 = 1 M E s l 1 k 2 c l 2 k 2 ,
the term E s l 1 k 2 c l 2 k 2 can be computed as
E s l 1 k 2 c l 2 k 2 = E p 1 = 1 N p 2 = 1 N q 1 = 1 N q 2 = 1 N h l 1 p 1 h l 1 p 2 g q 1 k g q 2 k sin δ p 1 q 1 sin δ p 2 q 2 + { h ( d ) , k l 1 } 2 + 2 { h ( d ) , k l 1 } p 1 = 1 N q 1 = 1 N h l 1 p 1 g q 1 k sin δ p 1 q 1 × p 3 = 1 N p 4 = 1 N q 3 = 1 N q 4 = 1 N h l 2 p 3 h l 2 p 4 g q 3 k g q 4 k cos δ p 3 q 3 cos δ p 4 q 4 + { h ( d ) , k l 2 } 2 + 2 { h ( d ) , k l 2 } p 3 = 1 N q 3 = 1 N h l 2 p 3 g q 3 k cos δ p 3 q 3 ,
then, μ C k S k will be given by (A58).
μ C k S k = M ( M 1 ) ( N 1 ) 4 b 10 b 18 + N 2 b 14 b 17 b 29 α 1 2 + N b 14 b 27 μ g χ g b 28 + N b 12 b 27 μ g χ g b 28 + 2 b 12 b 27 ϵ g b 28 + b 12 μ h b 23 χ h b 28 + 4 b 8 μ h 2 ξ h χ g μ g b 28 + 2 N 2 ( N 1 ) μ h 2 ξ h ϵ g b 28 + b 12 b 17 b 28 + b 8 b 23 ξ h 2 b 28 + N 2 ( N 1 ) b 23 ξ h 2 b 28 + N 2 ( N 1 ) μ g ξ h 2 χ g b 28 + N 2 ξ h 2 ϵ g b 28 + ( N 1 ) N 2 ξ { h ( d ) } b 25 b 29 + N 2 ξ { h ( d ) } ξ h ξ g b 29 + N 2 ( ( N 1 ) ξ { h ( d ) } b 25 α 1 2 + ξ h ξ g b 1 ) + ξ { h ( d ) } + b 8 ξ { h ( d ) } b 24 + N 2 ( N 1 ) ξ { h ( d ) } μ h 2 ξ g α 1 2 + 2 ξ { h ( d ) } + M ( N 1 ) 4 b 10 b 18 + N 2 b 14 b 17 b 29 α 1 2 + N b 14 b 27 μ g χ g b 28 + N 2 b 14 b 27 μ g χ g b 28 + 2 b 12 b 27 ϵ g b 28 + b 12 b 27 μ g χ g b 28 + b 12 μ h b 23 χ h b 28 + 2 N 2 ( N 1 ) μ h χ h ϵ g b 28 + b 12 μ g 2 χ h μ h ξ g b 28 + 4 b 8 μ g χ h μ h χ g b 28 + b 8 b 23 ϵ h b 28 + N 2 ( N 1 ) b 23 ϵ h b 28 + N 2 ( N 1 ) μ g ϵ h χ g b 28 + N 2 ϵ h ϵ g b 28 + ( N 1 ) N 2 ξ { h ( d ) } ξ h μ g 2 b 29 + ξ { h ( d ) } N 2 ξ h ξ g b 29 + N 2 ξ { h ( d ) } ( ( N 1 ) b 25 α 1 2 + ξ h ξ g b 1 ) + ξ { h ( d ) } + b 8 ξ { h ( d ) } b 24 + N 2 ( N 1 ) ξ { h ( d ) } μ h 2 ξ g α 1 2 + 2 ξ { h ( d ) } .
The terms b i can be computed as b 1 = 1 2 ( 1 + α 2 ) , b 2 = 1 8 3 + 4 α 2 + α 4 , b 3 = α 1 2 ( 1 + α 2 ) , b 4 = 1 4 ( 3 α 1 + α 3 ) α 1 , b 5 = b 1 α 1 2 , b 6 = N 2 b 5 , b 7 = ( N 2 1 ) N 2 α 1 4 , b 8 = ( N 1 ) 2 N 2 , b 9 = N ( N 1 ) 2 , b 1 0 = ( N 1 ) N 2 α 1 4 , b 1 1 = N ( N 1 ) 3 , b 1 2 = N 2 ( N 1 ) 3 , b 1 3 = ( N 1 ) 3 , b 1 4 = ( N 1 ) 4 , b 15 = μ g 4 b 1 α 1 2 , b 16 = μ h χ h μ g 4 , b 17 = μ h 2 ξ h ξ g μ g 2 , b 18 = μ h 2 ξ h μ g 4 , b 19 = μ h 4 ξ g μ g 2 , b 20 = μ h 4 μ g 4 b 10 , b 21 = μ h χ h ξ g , b 22 = μ h χ h ξ g 2 , b 23 = ξ g μ g 2 , b 24 = μ g 2 μ h 2 α 1 2 , b 25 = ξ h μ g 2 , b 26 = μ g 2 b 1 α 1 2 , b 27 = ξ h μ h 2 , b 28 = α 1 2 1 α 2 2 , b 29 = 1 α 2 2 .
Given μ C k S k , it follows that
c o v C k , S k = μ C k S k μ C k μ S k ,
therefore, the variance will be
σ Z k 2 = P K 2 σ C k 2 + σ S k 2 + 2 μ C k S k μ C k μ S k .

Appendix B. Statistical Parameters of Fk

Appendix B.1. Expected Value of Fk

Since
F k = σ η 2 + i = 0 , i k K Z i ,
then, the expected value of F k can be calculated as
E F k = σ η 2 + E i = 0 , i k K Z i = σ η 2 + ( K 1 ) E Z i ,
since the expected value of Z k was previously computed, therefore
E F k = σ η 2 + ( K 1 ) P M K N 2 2 ξ h ξ g ( 1 + α 2 ) + N 2 ( N 1 ) ξ h μ q 2 α 1 2 + N 2 ( N 1 ) μ h 2 ξ g α 1 2 +                      N 2 ( N 1 ) 2 μ h 2 μ q 2 α 1 2 + 2 N 2 μ { h ( d ) } μ h μ q α 1 + ξ { h ( d ) } + N 2 2 ξ h ξ g ( 1 α 2 ) + ξ { h ( d ) } .

Appendix B.2. Variance of Fk

The variance v a r F k can be defined in terms of the statistics of Z i as
σ F k 2 = v a r F k = v a r σ η 2 + i = 0 , i k K Z i = v a r i = 0 , i k K Z i ,
since the terms are independent and equally likely, then
v a r F k = K ( K 1 ) c o v Z i , Z t + K v a r Z i ,
considering that
c o v Z i , Z t = E [ Z i Z t ] E [ Z i ] 2
where
E [ Z i Z t ] = P K 2 E R i R t ,
that can be rewritten as
E [ Z i Z t ] = P K 2 E ( C i + S i ) ( C t + S t ) ,
by expanding the product, it follows that
E [ Z i Z t ] = P K 2 E ( C i C t + S i S t + C i S t + S i C t ) ,
since E C i S t = E S i C t , then
E ( C i C t + S i S t + C i S t + S i C t ) = E C i C t + E S i S t + 2 E S i C t .
For i t
E C i C t = E l 1 = 1 M c l 1 i 2 l 2 = 1 M c l 2 t 2 = l 1 = 1 M l 2 = 1 M E c l 1 i 2 c l 2 t 2 ,
by expanding the terms, it follows that
E [ c l 1 i 2 c l 2 t 2 ] = E p 1 = 1 N p 2 = 1 N q 1 = 1 N q 2 = 1 N h l 1 p 1 h l 1 p 2 g q 1 i g q 2 i cos δ p 1 q 1 cos δ p 2 q 2 + { h ( d ) , i l 1 } 2 + 2 { h ( d ) , i l 1 } p 1 = 1 N q 1 = 1 N h l 1 p 1 g q 1 i cos δ p 1 q 1 × p 3 = 1 N p 4 = 1 N q 3 = 1 N q 4 = 1 N h l 2 p 3 h l 2 p 4 g q 3 t g q 4 t cos δ p 3 q 3 cos δ p 4 q 4 + { h ( d ) , t l 2 } 2 + 2 { h ( d ) , t l 2 } p 3 = 1 N q 3 = 1 N h l 2 p 3 g q 3 t cos δ p 3 q 3 .
By expanding the terms of E [ c l 1 i 2 c l 2 t 2 ] , the expected value can be rewritten as (A73).
E [ c l 1 i 2 c l 2 t 2 ] = p 1 = 1 N p 2 = 1 N p 3 = 1 N p 4 = 1 N q 1 = 1 N q 2 = 1 N q 3 = 1 N q 4 = 1 N E h l 1 p 1 h l 1 p 2 h l 2 p 3 h l 2 p 4 × E g q 1 i g q 2 i g q 3 t g q 4 t E cos δ p 1 q 1 cos δ p 2 q 2 cos δ p 3 q 3 cos δ p 4 q 4 + ξ { h ( d ) } p 1 = 1 N p 2 = 1 N q 1 = 1 N q 2 = 1 N E h l 1 p 1 h l 1 p 2 E g q 1 i g q 2 i E cos δ p 1 q 1 cos δ p 2 q 2 + ξ { h ( d ) } p 3 = 1 N p 4 = 1 N q 3 = 1 N q 4 = 1 N E h l 2 p 3 h l 2 p 4 g q 3 t g q 4 t cos δ p 3 q 3 cos δ p 4 q 4 + E { h ( d ) , i l 1 } 2 { h ( d ) , t l 2 } 2 + 2 E { h ( d ) , i l 1 } 2 { h ( d ) , t l 2 } p 3 = 1 N q 3 = 1 N E h l 2 p 3 E g q 3 t α 1 + 2 E { h ( d ) , t l 2 } 2 { h ( d ) , i l 1 } p 1 = 1 N q 1 = 1 N E h l 1 p 1 E g q 1 i α 1 + 4 E { h ( d ) , i l 1 } { h ( d ) , t l 2 } p 1 = 1 N q 1 = 1 N p 3 = 1 N q 3 = 1 N E h l 1 p 1 h l 2 p 3 E g q 1 i g q 3 t E cos δ p 1 q 1 cos δ p 3 q 3
Through the recursive expansion of the expression and analyzing the varying scenarios where the variables might be interdependent or independent, based on their index values, it can be inferred that, for l 1 l 2 , the expected value E [ c l 1 i 2 c l 2 t 2 ] will be given by (A74). For l 1 = l 2 , it can be calculated by (A75).
E [ c l 1 i 2 c l 2 t 2 ] = b 8 ξ { h ( d ) } b 24 + N b 9 ξ { h ( d ) } ( b 24 + b 25 α 1 2 + 2 μ h 2 ξ g ) + b 14 N 2 b 17 α 4 + b 14 b 20 ξ h ( d ) 2 N 2 ξ { h ( d ) } ( 2 ξ g ξ h b 1 + b 25 α 1 2 ) ( N 1 ) 5 b 20 + b 14 b 18 b 10 + b 14 b 18 b 10 + b 13 b 16 b 10 + b 14 b 18 b 10 + b 14 b 19 b 10 + b 14 N 2 b 17 b 5 + b 13 b 19 b 10 + b 13 b 17 b 10 + b 12 b 21 μ g 2 b 5 + b 13 b 18 b 10 + b 14 N 2 b 18 b 5 + ( N 1 ) 2 b 17 b 10 + b 12 b 16 b 5 + b 13 b 27 μ g 4 b 10 + b 13 b 19 b 10 + b 12 b 17 b 5 + b 12 b 17 b 5 + b 8 b 21 μ g 2 b 4 + ( N 1 ) 2 b 17 b 10 + b 14 b 20 + b 13 b 18 b 10 + b 13 b 10 b 18 + ( N 1 ) 2 b 16 b 10 + b 14 N 2 b 18 b 5 + b 12 b 17 b 1 + ( N 1 ) 2 b 17 b 10 + b 8 b 21 μ g 2 b 5 + b 12 b 17 b 5 + b 13 b 19 b 10 + b 12 b 17 b 5 + b 8 μ h χ h b 23 b 5 + b 12 b 17 b 5 + ( N 1 ) 2 μ h 4 ξ g 2 b 10 + b 8 b 27 ξ g 2 b 5 + ( N 1 ) N 2 b 22 b 4 + b 8 b 27 ξ g 2 b 5 + b 8 b 27 ξ g 2 b 5 + ( N 1 ) 4 N μ h χ h μ g 4 α 1 4 + b 11 μ h χ h b 23 b 1 α 1 2 + b 1 1 μ h χ h μ g 4 α 1 4 + b 9 b 21 b 26 + b 1 1 b 21 b 26 + b 9 b 21 μ g 2 b 4 + b 9 b 21 b 26 + N ( N 1 ) b 22 b 4 + ( N 1 ) 4 N b 16 α 1 4 + b 11 μ h χ h b 15 + b 11 μ h χ h b 15 + b 9 b 21 μ g 2 b 4 + b 11 b 21 μ g 2 α 1 4 + 2 b 9 b 21 b 26 + ( N 1 ) N b 22 b 4 + b 11 ϵ h μ g 4 α 1 4 + 2 b 9 ϵ h b 15 + N ( N 1 ) ϵ h b 23 b 4 + b 9 ϵ h b 23 b 1 α 1 2 + 2 N ( N 1 ) ϵ h b 23 b 4 + N ϵ h ξ g 2 b 2 , l 1 = l 2
E [ c l 1 i 2 c l 2 t 2 ] = b 8 ξ { h ( d ) } b 24 + N b 9 ξ { h ( d ) } b 24 + ( N 1 ) N 2 ξ { h ( d ) } ( b 25 α 1 2 + 2 μ h 2 ξ g ) + N 2 ξ { h ( d ) } ( 2 ξ g ξ h b 1 + b 25 α 1 2 ) + ξ h ( d ) 2 + N b 14 μ g 4 μ h 4 ( N 2 1 ) N 2 b 1 2 + N 2 b 2 + b 11 μ g 4 b 27 b 8 α 1 3 + N 2 ( N 1 ) b 3 + N 2 b 4 + b 11 b 27 μ g 4 N 2 1 2 ( N 2 1 ) b 3 + 2 b 4 + b 9 ξ h 2 μ g 4 N 2 α 1 2 ( N 1 ) 2 α 1 2 + ( N 1 ) α 1 2 + b 1 + b 9 b 17 b 8 b 5 + 2 ( N 1 ) b 6 + N 2 b 4 + b 9 b 17 b 8 α 1 4 + 2 b 10 + b 6 + b 11 μ h 4 ξ g μ g 2 b 6 ( N 2 1 ) + N 2 b 4 + b 11 ξ g μ g 2 μ h 4 ( N 2 1 ) b 6 + N 2 b 4 + b 9 b 17 b 7 + b 6 + b 9 b 17 b 8 b 5 + 2 ( N 1 ) b 6 + N 2 b 4 + N ( N 1 ) ξ g ξ h 2 μ g 2 b 7 + b 6 + N ( N 1 ) ξ h 2 μ g 2 ξ g b 7 + b 6 + b 9 μ h 4 ξ g 2 b 7 + b 6 + N ( N 1 ) ξ g 2 b 27 b 8 α 1 4 + 2 b 10 + b 6 + N ( N 1 ) b 27 ξ g 2 b 7 + b 6 + N ξ g 2 ξ h 2 b 7 + b 6 , l 1 l 2 .
Therefore, E C i C t can be calculated by (A76).
μ C i C t = E C i C t = M ( M 1 ) N b 9 ξ { h ( d ) } b 24 + ( N 1 ) N 2 ξ { h ( d ) } ( b 25 α 1 2 + 2 μ h 2 ξ g ) + b 8 ξ { h ( d ) } b 24 + N 2 ξ { h ( d ) } ( 2 ξ g ξ h b 1 + b 25 α 1 2 ) + ξ h ( d ) 2 + N b 14 μ g 4 μ h 4 ( N 2 1 ) N 2 b 1 2 + N 2 b 2 + b 11 μ g 4 b 27 b 8 α 1 3 + N 2 ( N 1 ) b 3 + N 2 b 4 + b 11 b 27 μ g 4 N 2 1 2 ( N 2 1 ) b 3 + 2 b 4 + b 9 ξ h 2 μ g 4 N 2 α 1 2 ( N 1 ) 2 α 1 2 + ( N 1 ) α 1 2 + b 1 + b 9 b 17 b 8 b 5 + 2 ( N 1 ) b 6 + N 2 b 4 + b 9 b 17 b 8 α 1 4 + 2 b 10 + b 6 + b 11 μ h 4 ξ g μ g 2 b 6 ( N 2 1 ) + N 2 b 4 + b 11 ξ g μ g 2 μ h 4 ( N 2 1 ) b 6 + N 2 b 4 + b 9 b 17 b 7 + b 6 + b 9 b 17 b 8 b 5 + 2 ( N 1 ) b 6 + N 2 b 4 + N ( N 1 ) ξ g ξ h 2 μ g 2 b 7 + b 6 + N ( N 1 ) ξ h 2 μ g 2 ξ g b 7 + b 6 + b 9 μ h 4 ξ g 2 b 7 + b 6 + N ( N 1 ) ξ g 2 b 27 b 8 α 1 4 + 2 b 10 + b 6 + N ( N 1 ) b 27 ξ g 2 b 7 + b 6 + N ξ g 2 ξ h 2 b 7 + b 6 + M b 8 ξ { h ( d ) } b 24 + N b 9 ξ { h ( d ) } ( b 24 + b 25 α 1 2 + 2 μ h 2 ξ g ) + N 2 ξ { h ( d ) } ( 2 ξ g ξ h b 1 + b 25 α 1 2 ) + ξ h ( d ) 2 + ( N 1 ) 5 b 20 + b 14 b 18 b 10 + b 14 b 18 b 10 + b 13 b 16 b 10 + b 14 b 18 b 10 + b 14 b 19 b 10 + b 14 N 2 b 17 b 5 + b 14 N 2 b 17 α 4 + b 14 b 20 b 13 b 19 b 10 + b 13 b 17 b 10 + b 12 b 21 μ g 2 b 5 + b 13 b 18 b 10 + b 14 N 2 b 18 b 5 + ( N 1 ) 2 b 17 b 10 + b 12 b 16 b 5 + b 13 b 27 μ g 4 b 10 + b 13 b 19 b 10 + b 12 b 17 b 5 + b 12 b 17 b 5 + b 8 b 21 μ g 2 b 4 + ( N 1 ) 2 b 17 b 10 + b 14 b 20 + b 13 b 18 b 10 + b 13 b 10 b 18 + ( N 1 ) 2 b 16 b 10 + b 14 N 2 b 18 b 5 + b 12 b 17 b 1 + ( N 1 ) 2 b 17 b 10 + b 8 b 21 μ g 2 b 5 + b 12 b 17 b 5 + b 13 b 19 b 10 + b 12 b 17 b 5 + b 8 μ h χ h b 23 b 5 + b 12 b 17 b 5 + ( N 1 ) 2 μ h 4 ξ g 2 b 10 + b 8 b 27 ξ g 2 b 5 + ( N 1 ) N 2 b 22 b 4 + b 8 b 27 ξ g 2 b 5 + b 8 b 27 ξ g 2 b 5 + ( N 1 ) 4 N μ h χ h μ g 4 α 1 4 + b 11 μ h χ h b 23 b 1 α 1 2 + b 1 1 μ h χ h μ g 4 α 1 4 + b 9 b 21 b 26 + b 1 1 b 21 b 26 + b 9 b 21 μ g 2 b 4 + b 9 b 21 b 26 + ( N 1 ) N b 22 b 4 + ( N 1 ) 4 N b 16 α 1 4 + b 11 μ h χ h b 15 + b 11 μ h χ h b 15 + b 9 b 21 μ g 2 b 4 + b 11 b 21 μ g 2 α 1 4 + 2 b 9 b 21 b 26 + ( N 1 ) N b 22 b 4 + b 11 ϵ h μ g 4 α 1 4 + b 9 ϵ h b 15 + b 9 ϵ h b 15 + N ( N 1 ) ϵ h b 23 b 4 + b 9 ϵ h b 23 b 1 α 1 2 + 2 N ( N 1 ) ϵ h b 23 b 4 + N ϵ h ξ g 2 b 2
The expected value E S i S t , for i t
E S i S t = E l 1 = 1 M s l 1 i 2 l 2 = 1 M s l 2 t 2 = l 1 = 1 M l 2 = 1 M E s l 1 i 2 s l 2 t 2 ,
where the expected value E s l 1 i 2 s l 2 t 2 can be calculated as
E s l 1 i 2 s l 2 t 2 = E p 1 = 1 N p 2 = 1 N q 1 = 1 N q 2 = 1 N h l 1 p 1 h l 1 p 2 g q 1 i g q 2 i sin δ p 1 q 1 sin δ p 2 q 2 + { h ( d ) , i l 1 } 2 + 2 { h ( d ) , i l 1 } p 1 = 1 N q 1 = 1 N h l 1 p 1 g q 1 i sin δ p 1 q 1 × p 3 = 1 N p 4 = 1 N q 3 = 1 N q 4 = 1 N h l 2 p 3 h l 2 p 4 g q 3 t g q 4 t sin δ p 3 q 3 sin δ p 4 q 4 + { h ( d ) , t l 2 } 2 + 2 { h ( d ) , t l 2 } p 3 = 1 N q 3 = 1 N h l 2 p 3 g q 3 t sin δ p 3 q 3 ,
by expanding this equation and removing the null terms, then E s l 1 i 2 s l 2 t 2 can be obtained by (A79).
E s l 1 i 2 s l 2 t 2 = p 1 = 1 N p 2 = 1 N p 3 = 1 N p 4 = 1 N q 1 = 1 N q 2 = 1 N q 3 = 1 N q 4 = 1 N E h l 1 p 1 h l 1 p 2 h l 2 p 3 h l 2 p 4 × E g q 1 i g q 2 i E g q 3 t g q 4 t E sin δ p 1 q 1 sin δ p 2 q 2 sin δ p 3 q 3 sin δ p 4 q 4 + ξ { h ( d ) } p 1 = 1 N p 2 = 1 N q 1 = 1 N q 2 = 1 N E h l 1 p 1 h l 1 p 2 E g q 1 i g q 2 i E sin δ p 1 q 1 sin δ p 2 q 2 + ξ { h ( d ) } p 3 = 1 N p 4 = 1 N q 3 = 1 N q 4 = 1 N E h l 2 p 3 h l 2 p 4 E g q 3 t g q 4 t E sin δ p 3 q 3 sin δ p 4 q 4 + E { h ( d ) , i l 1 } 2 E { h ( d ) , t l 2 } 2
by expanding the terms, it is easy to note that many expressions are equal to zero because of the expected value of the sine of a zero mean Von Mises random variable. The fourth-order trigonometric moment of the phase is E sin 4 δ = 1 2 b 1 + b 2 , since sin 4 δ = ( 1 cos 2 δ ) 2 = 1 2 cos δ cos 4 δ , therefore
E s l 1 i 2 s l 2 t 2 = N 2 ξ h 2 ξ g 2 ( 1 2 b 1 + b 2 ) + 2 N 2 ξ { h ( d ) } ξ h ξ g b 29 + ξ { h ( d ) } 2 , l 1 l 2 ,
E s l 1 i 2 s l 2 t 2 = N 2 ϵ h ϵ g ( 1 2 b 1 + b 2 ) + 2 N 2 ξ { h ( d ) } ξ h ξ g b 29 + ξ { h ( d ) } 2 , l 1 = l 2 ,
μ S i S t = E [ S i S t ] = M ( M 1 ) N 2 ξ h 2 ξ g 2 ( 1 2 b 1 + b 2 ) + 2 N 2 ξ { h ( d ) } ξ h ξ g b 29 + ξ { h ( d ) } 2 +                  M N 2 ϵ h ϵ g ( 1 2 b 1 + b 2 ) + 2 N 2 ξ { h ( d ) } ξ h ξ g b 29 .
The expected value E S i C t , considering that i t , can be computed as
E S i C t = E l 1 = 1 M s l 1 i 2 l 2 = 1 M c l 2 t 2 = l 1 = 1 M l 2 = 1 M E s l 1 i 2 c l 2 t 2 ,
where E s l 1 i 2 c l 2 t 2 can be defined as
E s l 1 i 2 c l 2 t 2 = E p 1 = 1 N p 2 = 1 N q 1 = 1 N q 2 = 1 N h l 1 p 1 h l 1 p 2 g q 1 i g q 2 i sin δ p 1 q 1 sin δ p 2 q 2 + { h ( d ) , i l 1 } 2 + 2 { h ( d ) , i l 1 } p 1 = 1 N q 1 = 1 N h l 1 p 1 g q 1 i sin δ p 1 q 1 × p 3 = 1 N p 4 = 1 N q 3 = 1 N q 4 = 1 N h l 2 p 3 h l 2 p 4 g q 3 t g q 4 t cos δ p 3 q 3 cos δ p 4 q 4 + { h ( d ) , t l 2 } 2 + 2 { h ( d ) , t l 2 } p 3 = 1 N q 3 = 1 N h l 2 p 3 g q 3 t cos δ p 3 q 3 ,
by expanding and removing the null terms, then E s l 1 i 2 c l 2 t 2 can be calculated by (A85).
E s l 1 i 2 c l 2 t 2 = p 1 = 1 N p 3 = 1 N p 4 = 1 N q 1 = 1 N q 2 = 1 N q 3 = 1 N q 4 = 1 N E h l 1 p 1 h l 1 p 1 h l 2 p 3 h l 2 p 4 × E g q 1 i g q 2 i g q 3 t g q 4 t E cos δ p 3 q 3 cos δ p 4 q 4 E sin δ p 1 q 1 sin δ p 1 q 2 + ξ { h ( d ) } p 1 = 1 N q 1 = 1 N q 2 = 1 N E h l 1 p 1 h l 1 p 1 E g q 1 i g q 2 i E sin δ p 1 q 1 sin δ p 1 q 2 + ξ { h ( d ) } p 3 = 1 N q 3 = 1 N q 4 = 1 N E h l 2 p 3 h l 2 p 3 E g q 3 t g q 4 t E cos δ p 3 q 3 cos δ p 3 q 4 + ξ { h ( d ) } + ( N 1 ) ξ { h ( d ) } p 3 = 1 N q 3 = 1 N q 4 = 1 N μ h 2 E g q 3 t g q 4 t α 1 2 + ξ { h ( d ) }
by expanding the summations and evaluating the expected values recursively, it follows that, for i t ,
E s l 1 i 2 c l 2 t 2 = b 12 b 27 μ g 2 ξ g b 28 + N 2 b 14 b 17 b 29 α 1 2 + N 2 b 14 b 27 μ g 2 ξ g b 28 + N b 14 b 27 μ g 2 ξ g b 28 + b 12 b 27 ξ g 2 b 28 + ( N 1 ) 4 b 10 b 18 + b 12 b 27 ξ g 2 b 28 + b 12 b 27 b 23 b 28 + 4 b 8 b 17 b 28 + N 2 ( N 1 ) ξ g 2 b 27 b 28 + b 12 b 17 b 28 + N 2 ( N 1 ) ξ g 2 b 27 b 28 + b 8 b 23 ξ h 2 b 28 ( b 8 + N 2 ( N 1 ) ) + N 2 ( N 1 ) μ g 2 ξ g ξ h 2 b 28 + N 2 ξ h 2 ξ g 2 b 28 + ( N 1 ) N 2 ξ { h ( d ) } ξ h μ g 2 b 29 + N 2 ξ { h ( d ) } ξ h 2 b 29 + ξ { h ( d ) } N 2 ( ( N 1 ) b 25 α 1 2 + ξ h ξ g b 1 ) + ξ { h ( d ) } + b 8 ξ { h ( d ) } b 24 + N 2 ( N 1 ) ξ { h ( d ) } μ h 2 ξ g α 1 2 + 2 ξ { h ( d ) } , l 1 l 2 ,
and E s l 1 i 2 c l 1 t 2 can be obtained by (A87).
E s l 1 i 2 c l 1 t 2 = ( N 1 ) 4 b 10 b 18 + N 2 b 14 b 17 b 29 α 1 2 + N b 14 b 27 μ g 2 ξ g b 28 + N 2 b 14 b 27 μ g 2 ξ g b 28 + b 12 b 27 ξ g 2 b 28 + b 12 b 27 μ g 2 ξ g b 28 + b 12 b 27 ξ g 2 b 28 + b 12 μ h 2 ξ h b 23 b 28 + b 8 μ h 2 ξ h μ g 2 ξ g b 28 + b 8 χ h μ h ξ g μ g 2 b 28 + N 2 ( N 1 ) μ h χ h ξ g 2 b 28 + b 12 μ g 2 χ h μ h ξ g b 28 + 2 b 8 μ g 2 ξ g χ h μ h b 28 + N 2 ( N 1 ) χ h μ h ξ g 2 b 28 + b 8 b 23 ϵ h b 28 + N 2 ( N 1 ) b 23 ϵ h b 28 + N 2 ( N 1 ) μ g 2 ξ g ϵ h b 28 + N 2 E χ h ξ g 2 b 28 + ( N 1 ) N 2 ξ { h ( d ) } ξ h μ g 2 b 29 + ξ { h ( d ) } N 2 ξ h ξ g b 29 + ξ { h ( d ) } N 2 ( ( N 1 ) b 25 α 1 2 + ξ h ξ g b 1 ) + ξ { h ( d ) } + N 2 ( N 1 ) ξ { h ( d ) } μ h 2 ξ g α 1 2 + b 8 ξ { h ( d ) } b 24 + 2 ξ { h ( d ) } , i t , l 1 = l 2 .
Therefore, the term E S i C t is given by (A88).
μ S i C t = E S i C t = M ( M 1 ) ( N 1 ) 4 b 10 b 18 + N 2 b 14 b 17 b 29 α 1 2 + N b 14 b 27 μ g 2 ξ g b 28 + 2 ξ { h ( d ) } + N 2 b 14 b 27 μ g 2 ξ g b 28 + b 12 b 27 ξ g 2 b 28 + b 12 b 27 μ g 2 ξ g b 28 + b 12 b 27 ξ g 2 b 28 + b 12 b 27 b 23 b 28 + 4 b 8 b 17 b 28 + N 2 ( N 1 ) ξ g 2 b 27 b 28 + b 12 b 17 b 28 + N 2 ( N 1 ) ξ g 2 b 27 b 28 + b 8 b 23 ξ h 2 b 28 ( b 8 + N 2 ( N 1 ) ) + N 2 ( N 1 ) μ g 2 ξ g ξ h 2 b 28 + N 2 ξ h 2 ξ g 2 b 28 + ( N 1 ) N 2 ξ { h ( d ) } ξ h μ g 2 b 29 + ξ { h ( d ) } N 2 ξ h 2 b 29 + ξ { h ( d ) } N 2 ( ( N 1 ) b 25 α 1 2 + ξ h ξ g b 1 ) + ξ { h ( d ) } + b 8 ξ { h ( d ) } b 24 + N 2 ( N 1 ) ξ { h ( d ) } μ h 2 ξ g α 1 2 + M ( N 1 ) 4 b 10 b 18 + N 2 b 14 b 17 b 29 α 1 2 + N b 14 b 27 μ g 2 ξ g b 28 + N 2 b 14 b 27 μ g 2 ξ g b 28 + b 12 b 27 ξ g 2 b 28 + b 12 b 27 b 28 ( μ g 2 ξ g + ξ g 2 ) + b 12 μ h 2 ξ h b 23 b 28 + b 8 μ h 2 ξ h μ g 2 ξ g b 28 + b 8 χ h μ h ξ g μ g 2 b 28 + N 2 E χ h ξ g 2 b 28 + N 2 ( N 1 ) μ h χ h ξ g 2 b 28 + b 12 μ g 2 χ h μ h ξ g b 28 + 2 b 8 μ g 2 ξ g χ h μ h b 28 + ξ { h ( d ) } b 8 ξ { h ( d ) } b 24 + N 2 ( N 1 ) χ h μ h ξ g 2 b 28 + b 8 b 23 ϵ h b 28 + N 2 ( N 1 ) b 23 ϵ h b 28 + N 2 ( N 1 ) μ g 2 ξ g ϵ h b 28 + 2 ξ { h ( d ) } + ( N 1 ) N 2 ξ { h ( d ) } ξ h μ g 2 b 29 + ξ { h ( d ) } N 2 ξ h ξ g b 29 + ξ { h ( d ) } N 2 ( ( N 1 ) b 25 α 1 2 + ξ h ξ g b 1 ) + N 2 ( N 1 ) ξ { h ( d ) } μ h 2 ξ g α 1 2 .
Since
E [ Z i Z t ] = P K 2 μ C i C t + μ S i S t + 2 μ S i C t ,
it follows that
c o v Z i , Z t = P K 2 μ C i C t + μ S i S t + 2 μ S i C t μ Z k 2 .
Therefore,
σ F k 2 = K ( K 1 ) P K 2 μ C i C t + μ S i S t + 2 μ S i C t μ Z k 2 + K σ Z k 2 .

Appendix C. Statistical Parameters of γk

Appendix C.1. Expected Value of γk

The expected value of γ k , considering the gamma distribution in
μ γ k = E γ k = μ Z k μ F k ,
since μ Z k and μ F k are already known, can be computed using the derived expressions.

Appendix C.2. Variance of γk

The variance of γ k can be computed considering the moments of F k and Z k as
σ γ k 2 = μ Z k μ F k 2 σ Z k 2 μ Z k 2 2 ( K 1 ) c o v ( Z i , Z k ) μ Z k μ F k + σ F k 2 μ F k 2 ,
since μ Z k , μ F k , σ Z k 2 , σ F k 2 and c o v ( Z i , Z k ) were previously derived, these parameters can be substituted here.

References

  1. Zhang, Z.; Dai, L. Reconfigurable Intelligent Surfaces for 6G: Nine Fundamental Issues and One Critical Problem. Tsinghua Sci. Technol. 2023, 28, 929–939. [Google Scholar] [CrossRef]
  2. Almekhlafi, M.; Arfaoui, M.A.; Assi, C.; Ghrayeb, A. A Low Complexity Passive Beamforming Design for Reconfigurable Intelligent Surface (RIS) in 6G Networks. IEEE Trans. Veh. Technol. 2023, 72, 6309–6321. [Google Scholar] [CrossRef]
  3. Dang, S.; Amin, O.; Shihada, B.; Alouini, M.-S. What should 6G be? Nat. Electron. 2020, 3, 20–29. [Google Scholar] [CrossRef]
  4. Pan, C.; Ren, H.; Wang, K.; Kolb, J.F.; Elkashlan, M.; Chen, M.; Di Renzo, M.; Hao, Y.; Wang, J.; Swindlehurst, A.L.; et al. Reconfigurable intelligent surfaces for 6G systems: Principles, applications, and research directions. IEEE Commun. Mag. 2021, 59, 14–20. [Google Scholar] [CrossRef]
  5. Akyildiz, I.F.; Kak, A.; Nie, S. 6G and beyond: The future of wireless communications systems. IEEE Access 2020, 8, 133995–134030. [Google Scholar] [CrossRef]
  6. Pereira de Figueiredo, F.A.; Mendes Lemes, D.A.; Ferreira Dias, C.; Fraidenraich, G. Massive MIMO channel estimation considering pilot contamination and spatially correlated channels. Electron. Lett. 2020, 56, 410–413. [Google Scholar] [CrossRef]
  7. Inserra, D.; Li, G.; Dai, J.; Shi, J.; Wen, G.; Li, J.; Huang, Y. Dual-orthogonal polarization amplifying reconfigurable intelligent surface with reflection amplifier based on passive circulator. IEEE Trans. Microw. Theory Technol. 2024, 1, 1–12. [Google Scholar] [CrossRef]
  8. Rana, B.; Cho, S.-S.; Hong, I.-P. Review paper on hardware of reconfigurable intelligent surfaces. IEEE Access 2023, 11, 29614–29634. [Google Scholar] [CrossRef]
  9. Chen, K.; Song, W.; Li, Z.; Wang, Z.; Ma, J.; Wang, X.; Sun, T.; Guo, Q.; Shi, Y.; Qin, W.-D.; et al. Chalcogenide phase-change material advances programmable terahertz metamaterials: A non-volatile perspective for reconfigurable intelligent surfaces. Nanophotonics 2024, 12, 399–412. [Google Scholar] [CrossRef]
  10. Li, X.; Sato, H.; Fujikake, H.; Chen, Q. Development of Two-dimensional Steerable Reflectarray with Liquid Crystal for Reconfigurable Intelligent Surface Application. IEEE Trans. Antennas Propag. 2024, 72, 2108–2123. [Google Scholar] [CrossRef]
  11. Tataria, H.; Tufvesson, F.; Edfors, O. Real-time implementation aspects of large intelligent surfaces. In Proceedings of the ICASSP 2020—2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Barcelona, Spain, 4–8 May 2020; pp. 9170–9174. [Google Scholar] [CrossRef]
  12. Wang, X.; Wang, X.; Ge, J.; Liu, Z.; Ma, Y.; Li, X. Reconfigurable Intelligent Surface-Assisted Secure Communication in Cognitive Radio Systems. Energies 2024, 17, 515. [Google Scholar] [CrossRef]
  13. Jull, E.; Ebbeson, G. The reduction of interference from large reflecting surfaces. IEEE Trans. Antennas Propag. 1977, 25, 565–570. [Google Scholar] [CrossRef]
  14. Karagiannidis, G.K.; Sagias, N.C.; Mathiopoulos, P.T. N*Nakagami: A Novel Stochastic Model for Cascaded Fading Channels. IEEE Trans. Commun. 2007, 55, 1453–1458. [Google Scholar] [CrossRef]
  15. Ferreira, R.C.; Facina, M.S.P.; de Figueiredo, F.A.P.; Fraidenraich, G.; de Lima, E.R. Secrecy Analysis and Error Probability of LIS-Aided Communication Systems under Nakagami-m Fading. Entropy 2021, 23, 1284. [Google Scholar] [CrossRef] [PubMed]
  16. Gong, S.; Lu, X.; Hoang, D.T.; Niyato, D.; Shu, L.; Kim, D.I.; Liang, Y.-C. Toward Smart Wireless Communications via Intelligent Reflecting Surfaces: A Contemporary Survey. IEEE Commun. Surv. Tutor. 2020, 22, 2283–2314. [Google Scholar] [CrossRef]
  17. Wu, Q.; Zhang, S.; Zheng, B.; You, C.; Zhang, R. Intelligent Reflecting Surface-Aided Wireless Communications: A Tutorial. IEEE Trans. Commun. 2021, 69, 3313–3351. [Google Scholar] [CrossRef]
  18. Vega Sánchez, J.D.; Ramírez-Espinosa, P.; López-Martínez, F.J. Physical Layer Security of Large Reflecting Surface Aided Communications with Phase Errors. IEEE Wirel. Commun. Lett. 2021, 10, 325–329. [Google Scholar] [CrossRef]
  19. Coelho Ferreira, R.; Facina, M.S.P.; de Figueiredo, F.A.P.; Fraidenraich, G.; de Lima, E.R. Large Intelligent Surfaces Communicating through Massive MIMO Rayleigh Fading Channels. Sensors 2020, 20, 6679. [Google Scholar] [CrossRef] [PubMed]
  20. Nadeem, Q.-U.-A.; Alwazani, H.; Kammoun, A.; Chaaban, A.; Débbah, M.; Alouini, M.-S. Intelligent Reflecting Surface-Assisted Multi-User MISO Communication: Channel Estimation and Beamforming Design. IEEE Open J. Commun. Soc. 2020, 1, 661–680. [Google Scholar] [CrossRef]
  21. Basar, E. Transmission Through Large Intelligent Surfaces: A New Frontier in Wireless Communications. In Proceedings of the 2019 European Conference on Networks and Communications (EuCNC), Valencia, Spain, 18–21 June 2019; pp. 112–117. [Google Scholar] [CrossRef]
  22. Lin, Z.; Niu, H.; An, K.; Wang, Y.; Zheng, G.; Chatzinotas, S.; Hu, Y. Refracting RIS-aided hybrid satellite-terrestrial relay networks: Joint beamforming design and optimization. IEEE Trans. Aerosp. Electron. Syst. 2022, 58, 3717–3724. [Google Scholar] [CrossRef]
  23. Lin, Z.; Niu, H.; An, K.; Hu, Y.; Li, D.; Wang, J.; Al-Dhahir, N. Pain without gain: Destructive beamforming from a malicious RIS perspective in IoT networks. IEEE Internet Things J. 2023, 11, 7619–7629. [Google Scholar] [CrossRef]
  24. Ma, R.; Yang, W.; Guan, X.; Lu, X.; Song, Y.; Chen, D. Covert mmWave communications with finite blocklength against spatially random wardens. IEEE Internet Things J. 2023, 11, 3402–3416. [Google Scholar] [CrossRef]
  25. Niu, H.; Chu, Z.; Zhou, F.; Zhu, Z.; Zhen, L.; Wong, K.-K. Robust design for intelligent reflecting surface-assisted secrecy SWIPT network. IEEE Trans. Wirel. Commun. 2021, 21, 4133–4149. [Google Scholar] [CrossRef]
  26. Kendall, M.G. The Advanced Theory of Statistics; Charles Griffin and Co., Ltd.: London, UK, 1948; Volume 1. [Google Scholar]
Figure 1. System model with an eavesdropper link.
Figure 1. System model with an eavesdropper link.
Sensors 24 03332 g001
Figure 2. Probability distribution function via Monte Carlo.
Figure 2. Probability distribution function via Monte Carlo.
Sensors 24 03332 g002
Figure 3. Error probability varying with N.
Figure 3. Error probability varying with N.
Sensors 24 03332 g003
Figure 4. Error probability for m = 2 , 16-QAM.
Figure 4. Error probability for m = 2 , 16-QAM.
Sensors 24 03332 g004
Figure 5. Error probability for different κ values.
Figure 5. Error probability for different κ values.
Sensors 24 03332 g005
Figure 6. Error probability for m = 1 (Rayleigh), 16-QAM.
Figure 6. Error probability for m = 1 (Rayleigh), 16-QAM.
Sensors 24 03332 g006
Figure 7. Error probability for m = 2 , 4-QAM.
Figure 7. Error probability for m = 2 , 4-QAM.
Sensors 24 03332 g007
Figure 8. Secrecy Outage Probability.
Figure 8. Secrecy Outage Probability.
Sensors 24 03332 g008
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Ferreira, R.C.; Fraidenraich, G.; de Figueiredo, F.A.P.; de Lima, E.R. Secrecy Analysis of a Mu-MIMO LIS-Aided Communication Systems under Nakagami-m Fading Channels. Sensors 2024, 24, 3332. https://doi.org/10.3390/s24113332

AMA Style

Ferreira RC, Fraidenraich G, de Figueiredo FAP, de Lima ER. Secrecy Analysis of a Mu-MIMO LIS-Aided Communication Systems under Nakagami-m Fading Channels. Sensors. 2024; 24(11):3332. https://doi.org/10.3390/s24113332

Chicago/Turabian Style

Ferreira, Ricardo Coelho, Gustavo Fraidenraich, Felipe A. P. de Figueiredo, and Eduardo Rodrigues de Lima. 2024. "Secrecy Analysis of a Mu-MIMO LIS-Aided Communication Systems under Nakagami-m Fading Channels" Sensors 24, no. 11: 3332. https://doi.org/10.3390/s24113332

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop