Skip to main content
Top
Published in: EURASIP Journal on Wireless Communications and Networking 1/2023

Open Access 01-12-2023 | Research

Physical layer security analysis of IRS-based downlink and uplink NOMA networks

Authors: Si-Phu Le, Hong-Nhu Nguyen, Nhat-Tien Nguyen, Cuu Ho Van, Anh-Tu Le, Miroslav Voznak

Published in: EURASIP Journal on Wireless Communications and Networking | Issue 1/2023

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In recent years, the development of intelligent reflecting surface (IRS) in wireless communications has enabled control of radio waves to reduce the detrimental impacts of natural wireless propagation. These can achieve significant spectrum and energy efficiency in wireless networks. Non-orthogonal multiple access (NOMA) technology, on the other hand, is predicted to improve the spectrum efficiency of fifth-generation and later wireless networks. Motivated by this reality, we consider the IRS-based NOMA network in the downlink and uplink scenario with a pernicious eavesdropper. Moreover, we investigated the physical layer security (PLS) of the proposed system by invoking the connection outage probability (COP), secrecy outage probability (SOP), and average secrecy rate (ASR) with analytical derivations. The simulation results reveal that (i) it is carried out to validate the analytical formulas, (ii) the number of meta-surfaces in IRS, transmit power at the base station, and power allocation parameters all play an essential role in improving the system performance, and (iii) it demonstrates the superiority of NOMA to the traditional orthogonal multiple access (OMA).
Notes

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Abbreviations
IRS
Intelligent reflecting surface
RIS
Reflecting intelligent surface
LIS
Large intelligent surface
SE
Spectrum efficiency
EE
Energy efficiency
TDMA
Time division multiple access
FDMA
Frequency division multiple access
CDMA
Code division multiple access
NOMA
Non-orthogonal multiple access
OMA
Orthogonal multiple access
MA
Multiple access
SC
Superposition coding
PD
Power domain
SIC
Successive interference cancellation
IoT
Internet of thing
PLS
Physical layer security
COP
Connection outage probability
SOP
Secrecy outage probability
ASR
Average secrecy rate
BS
Base station
AWGN
Additive white Gaussian noises
SINR
Signal-to-interference-plus-noise ratio
SNR
Signal-to-noise ratio
PIC
Parallel interference cancelation
CLT
Central limit theorem
PDF
Probability density function
CDF
Cumulative distribution function

1 Introduction

Future wireless networks are expected to play a pivotal role in society as they will offer access to intelligent applications such as autonomous driving and virtual and augmented reality. [1]. In order to offer ubiquitous services, though, wireless connectivity should be provided for everyone and everywhere [2]. Recently, intelligent reflecting surfaces (IRSs) have been proposed as one of the important technologies to realize wireless communication smart radio environment (SRE) systems [2]. A IRS is specifically made up of a number of small, inexpensive, almost passive reflecting elements (REs) that may be programmed and controlled by the network operator. Moreover, IRS can be modified to reflect and direct incoming signals in the desired directions [35]. Additionally, the terms reflecting intelligent surfaces (RISs) and large intelligent surfaces (LISs) are also used interchangeably for IRSs in [6]. The IRSs are known to have very significant spectrum efficiency (SE), as well as energy efficiency (EE) with a large number of passive REs in [7]. As a result of the IRS structure’s simpler installation, it is now possible to deploy it more widely across the different urban infrastructures in both indoor and outdoor settings, including factory roofs, street lights, and traffic signal poles as well as residential ceilings and rooftops. As a result, IRS is simple to integrate into the current wireless communication networks [810].
Furthermore, the increased demand for wireless access has prompted researchers to look beyond the traditional multiple access strategies in which users are multiplexed orthogonally according to time, frequency, or codes. The terms for multiplexing in time, frequency, and code are time division multiple access (TDMA), frequency division multiple access (FDMA), and code division multiple access (CDMA), respectively. Non-orthogonal multiple access (NOMA) has recently drawn a lot of interest and is now thought to be a strong contender for future wireless networks [1114]. It is thought to support vast connectivity in addition to improving spectral efficiency when compared to orthogonal multiple access (OMA). It is possible to support more users than the number of accessible orthogonal resource blocks [15]. The main goal of NOMA is to enable non-orthogonal resource allocation among users in order to achieve multiple access (MA). The superposition coding (SC) technology, in which the signals of several users are multiplexed with varied power levels, served as an inspiration for NOMA in the power domain (PD)-NOMA. The overlaid messages are decoded at receivers using successive interference cancelation (SIC) [16]. Both downlink and uplink transmissions are compatible with NOMA. Users with poor channel conditions are typically given greater power for downlink NOMA so that their signals can be deciphered by treating other users’ signals as noise. The base station must be able to identify signals from all users, which requires a well-designed power control mechanism for uplink NOMA [17].
In recent years, because both IRS and NOMA are extremely promising approaches, IRS was combined with NOMA in [1821]. It has been demonstrated that combining IRS and NOMA allows for high data rate transfer while improving system performance. Furthermore, IRS-assisted NOMA improves spectrum resource usage. [22] proposed a simple concept for downlink transmission of IRS-assisted NOMA, in which the IRS is deployed to effectively serve the cell-edge user by aligning the reflected beam from the IRS. In [23], the authors proposed an energy-efficient approach for IRS-assisted NOMA, where the authors explore the tradeoff between the sum rate of NOMA users and total power usage. The authors of [24] provided various strategies to increase system performance for continuous phase shifts and discontinuous phase changes of IRS elements. [25] examined the downlink transmit power minimization problem for an IRS-powered NOMA network. The author in [26] investigated the performance of downlink and uplink IRS Networks. In [27], a IRS-assisted NOMA system was compared to a classic OMA system with/without IRS and a traditional NOMA system without IRS, and simulation results revealed that the IRS-assisted NOMA system outperformed the others in terms of rate performance.
Because electromagnetic transmission has the nature of broadcasting, which makes internet of thing (IoT) communication vulnerable to eavesdropping assaults, communication security, and secret protection are highly important in wireless communication networks [28, 29]. Traditional security approaches rely primarily on authentication and encryption, both of which are implemented at the upper layer of a wireless communication system but are generally independent of the physical layer. However, key management is problematic using classical encryption technologies [30]. From the standpoint of information theory, physical layer security (PLS) technology exploits the indeterminacy and time-variability of the wireless channel to realize secure communication of encrypted links without a key [31] and has established a potential solution for secure wireless communication. In [32], beamforming was employed to decrease the system’s transmitted power under the limitation of secrecy rate. When the eavesdropper’s channel is superior to the user’s and both channels are highly correlated in space, joint beamforming was utilized to improve the user’s secrecy rate in [33]. In [34], the secrecy outage probability (SOP) was calculated in a IRS-aided wireless communication system and the effect of the number of reflectors in the IRS on secrecy performance was investigated. In [35], two techniques were described to improve the PLS of a IRS-aided multiple-input single-output (MIMO) system. In [36], a minimum-secrecy-rate maximization problem was solved to improve the overall system’s secrecy performance when the system has several legitimate users and multiple eavesdroppers. The author in [37] studied the PLS of a multi-user situation for an IRS-NOMA network, providing accurate and asymptotic SOPs. An IRS was used to aid a cell-edge user in [38], where the secrecy performance in the Nakagami-m fading channel was examined. In [39], the secrecy performance and diversity order are analyzed for the IRS-based NOMA network. The SOP and average secrecy capacity (ASC) are studied of IRS-based NOMA network under the Rayleigh fading channel in [40].

1.1 Motivation and contribution

According to the previous study, current IRS research priorities include generic IRS applications, the inherent integration of NOMA and IRS, and the PLS of IRS-aided wireless networks. The author in [40] investigated the PLS of IRS-aided NOMA for a downlink scenario under the Rayleigh fading channel. But the author does not consider for uplink scenario and the Nakagami-m fading channel for direct link. Therefore, to fill this gap, we analyzed the PLS of the IRS-aided NOMA network under the Nakagami-m fading channel for the downlink–uplink scenario. In addition, we have added Table 1 to compare the proposed work with the current literature. The detailed contributions of this study, in particular, can be summarized as follows:
  • We considered the downlink–uplink IRS-based NOMA network, in which a base station (BS) sends and receives the signal from user 1 (\(D_1\)) and user 2 (\(D_2\)), IRS reflects and receives the signals from \(D_2\) in the presence of an eavesdropper.
  • We analyzed the PLS of the proposed system. Specifically, we provide the reliability and security analysis of the downlink–uplink by developing analytical formulas for the connection outage probability (COP), SOP, and ASR for the legitimate user \(D_1\), \(D_2\), an eavesdropper.
  • We offer thorough simulations not only to validate the theoretical analysis results but also to provide some important technical insights. Throughout the numerical results, we emphasize the critical influence of utilizing the IRS. Following that, we demonstrate the effect of the number of IRS elements on the proposed system’s downlink–uplink.
Table 1
A comparison of this work to related publications
 
Our study
[32]
[33]
[34]
[35]
[36]
[39]
[40]
Secure downlink IRS-OMA
 
Secure uplink IRS-OMA
       
Secure downlink IRS-NOMA
    
Secure uplink IRS-NOMA
       
All users use the Nakagami channel
       
COP Analysis
       
SOP Analysis
  
  
ASR Analysis
   
 

1.2 Organization

The rest of this paper is structured as follows. Section 2 analyzes the system model of IRS-based NOMA networks with the downlink and uplink cases. Section 3 presents the channel model for the system. In Sect. 4, the downlink performance analysis is carried out, and in Section 5, the uplink performance analysis. Section 6 depicts a simulation of the model. Section 7 concludes the paper.

2 Method

2.1 System model

In Fig. 1, we consider the IRS-based downlink and uplink NOMA network, which consists of a BS, an IRS with N reflecting elements, and two receivers, \(D_1\) and \(D_2\). The network is communicating while being intercepted by an eavesdropper (E). In more detail, \(D_1\) is the near user that can be directly communicated with BS, but \(D_2\) is the far user that requires an IRS’s assistance in order to communicate due to the long distance and obstructions. In addition, the reflection-coefficient matrix of IRS is denoted by \({\mathbf {\Phi }} = \text {diag}\left( {{\alpha _1}{e^{j{\varphi _1}}},{\alpha _2}{e^{j{\varphi _2}}}, \ldots ,{\alpha _N}{e^{j{\varphi _N}}}} \right) ,\left( {j = \sqrt{ - 1} } \right)\), where \({\alpha _n} \in \left[ {0,1} \right]\) is the amplitude-reflection coefficient and \({\varphi _n} \in \left[ {0,2\pi } \right)\) is the phase-shift variable of the nth element that can be adjusted by the IRS with \(\left( {n = 1,2, \ldots ,N} \right)\). Furthermore, we assume all wireless links following Nakagami-m fading. Particularly, \({\textbf{h}}_1^d = \left[ {h_{1,1}^d,h_{1,2}^d, \ldots ,h_{1,N}^d} \right]\), \({\textbf{h}}_1^u =\left[ {h_{1,1}^u,h_{1,2}^u,\ldots ,h_{1,N}^u} \right] ^T\), \({\textbf{h}}_2^d = \left[ {h_{2,1}^d,h_{2,2}^d, \ldots ,h_{2,N}^d} \right] ^T\) and \({\textbf{h}}_2^u = \left[ {h_{2,1}^u,h_{2,2}^u,\ldots ,h_{2,N}^u}\right]\) denotes the complex channel coefficient from BS-IRS, IRS-BS, IRS-\(D_2\), \(D_2\)-IRS, respectively. Table 2 lists the primary parameters and functions.
Table 2
Definitions for key parameter
Symbol
Description
\(\mathrm{{diag}}\left( x \right)\)
Stands for a diagonal matrix for a vector x, where each diagonal element corresponds to an element in x
\({x^T}\)
The transposition of x
\({\mathbb {E}}\left[ {.} \right]\)
The expectation
\({f_x}\left( . \right)\)
The PDF of a random variable
\({F_x}\left( . \right)\)
The CDF of a random variable
k!
The factorial operation
\(\Pr \left( . \right)\)
The probability
\(\left| . \right|\)
The absolute operations
\({I_a}\left( . \right)\)
The modified Bessel function of the first kind
\({Q_a}\left( . \right)\)
The Marcum Q-function
\(\Gamma \left( . \right)\)
The gamma function
\(\gamma \left( {.,.} \right)\)
The lower incomplete gamma function
\(s_i^d\)
The transmitted signals to \(D_i\), \((i=1,2)\)
\(s_i^{u}\)
The transmit signals of \(D_i\)
\({{P_{BS}}}\)
The transmit power of BS
\({{P_{D_i}}}\)
The transmit power of \(D_i\)
\({{\eta _i}}\)
The power allocation coefficients with \(\left( {{\eta _1} + {\eta _2} = 1} \right)\)
\(\beta\)
The path loss exponent
\({\tau _1}\)
The additive white Gaussian noises (AWGN) at \(D_1\) with zero mean and variance \(N_0\)
\({\tau _2}\)
The AWGN at \(D_2\) with zero mean and variance \(N_0\)
\({\tau _{bs}}\)
The AWGN at BS
\({\tau _e}\)
The AWGN at E with the same variance \({N_e}\)
\(R_i\)
The target data rate of users \(D_i\)
\(R_{Ei}\)
The secrecy rate of the user \(D_i\)
K
Accuracy-complexity tradeoff parameter
\(d_1\)
The distance from BS-IRS
\(d_2\)
The distance from IRS-\(D_2\)
\(d_{g}\)
The distance from BS-\(D_1\)
\(d_{g_e}\)
The distance from BS-E
\(d_{g_{e1}}\)
The distance from \(D_1\)-E
\(d_{g_{e2}}\)
The distance from \(D_2\)-E
\(h_{1,n}^d\)
The channel coefficient from BS-nth reflecting element
\(h_{1,n}^u\)
The channel coefficient from nth reflecting element-BS
\(h_{2,n}^d\)
The channel coefficient from nth reflecting element-\(D_2\)
\(h_{2,n}^u\)
The channel coefficient from \(D_2\)-nth reflecting element
\(g_d\)
The channel coefficient from BS-\(D_1\)
\(g_u\)
The channel coefficient from \(D_1\)-BS
\(g_e\)
The channel coefficient from BS-E
\(g_{e1}\)
The channel coefficient from \(D_1\)-E
\(g_{e2}\)
The channel coefficient from \(D_2\)-E
In this downlink section, the BS sends the superposed signal \(s = \sqrt{{\eta _1}{P_{BS}}} s_1^d + \sqrt{{\eta _2}{P_{BS}}} s_2^d\) to \(D_i\), in which, is the signal of \(D_i\). Please take note that since user \(D_2\) is assumed to be further away than the other user, a larger portion of power must be provided for user \(D_2\), i.e., condition \({\eta _1} < {\eta _2}\) for user fairness and assume fixed power allocation splitting between two users [22]. The received signals at \(D_1\) are given by
$$\begin{aligned} y_{{D_1}}^{d} = d_g^{ - \frac{\beta }{2}}{g_d}s + {\tau _1}. \end{aligned}$$
(1)
The corresponding signal-to-interference-plus-noise ratio (SINR) at \(D_1\) to detect \(s^d_2\) is given by
$$\begin{aligned} \gamma _{{D_1}}^{d,2} = \frac{{d_g^{ - \beta }{\eta _2}\psi {{\left| {{g_d}} \right| }^2}}}{{d_g^{ - \beta }{\eta _1}\psi {{\left| {{g_d}} \right| }^2} + 1}}, \end{aligned}$$
(2)
where \(\psi = \frac{{{P_{BS}}}}{{{N_0}}}\) denotes the transmit signal-to-noise ratio (SNR) of the BS.
After implementing the SIC, the corresponding SNR of \(D_1\) when detecting the own signal is given by
$$\begin{aligned} \gamma _{{D_1}}^{d,1} = d_g^{ - \beta }{\eta _1}\psi {\left| {{g_d}} \right| ^2}. \end{aligned}$$
(3)
Next, the received signal at \(D_2\) is given by
$$\begin{aligned} y_{{D_2}}^{d} = d_1^{ - \frac{\beta }{2}}d_2^{ - \frac{\beta }{2}}{{\textbf{h}}}_1^d{\mathbf {\Phi h}}_2^ds + {\tau _2}. \end{aligned}$$
(4)
The corresponding SINR of \(D_2\) to detect the own signal is given by
$$\begin{aligned} \gamma _{{D_2}}^{d,2} = \frac{{d_1^{ - \beta }d_2^{ - \beta }{\eta _2}\psi {{\left| {{{\textbf{h}}}_1^d{\mathbf {\Phi h}}_2^d} \right| }^2}}}{{d_1^{ - \beta }d_2^{ - \beta }{\eta _1}\psi {{\left| {{{\textbf{h}}}_1^d{\mathbf {\Phi h}}_2^d} \right| }^2} + 1}}. \end{aligned}$$
(5)
At the E, the received signal can be expressed as
$$\begin{aligned} y_E^d = d_{{g_e}}^{ - \frac{\beta }{2}}{g_e}s + {\tau _e}. \end{aligned}$$
(6)
In this work, like [41] and [42], parallel interference cancelation (PIC) is used at E to distinguish the superimposed mixture. Then, the corresponding SNR at E can be expressed as
$$\begin{aligned} \gamma _E^{d,i} = d_{{g_e}}^{ - \beta }{\eta _i}{\psi _e}{\left| {{g_e}} \right| ^2}, \end{aligned}$$
(7)
where \({\psi _e} = \frac{{{P_{BS}}}}{{{N_e}}}\).
In the uplink section, the received signal at the BS is written by
$$\begin{aligned} y_{{D_1}}^{u} = d_g^{ - \frac{\beta }{2}}{g_u}\sqrt{{\eta _1}{P_{{D_1}}}} s_1^{u} \\ + d_1^{ - \frac{\beta }{2}}d_2^{ - \frac{\beta }{2}}{{\textbf{h}}}_1^u{\mathbf {\Phi h}}_2^u\sqrt{{\eta _2}{P_{D_2}}} s_2^{u} + {\tau _{bs}}. \\ \end{aligned}$$
(8)
The corresponding SINR of BS, when decoded the signal of \(D_1\), is given by
$$\begin{aligned} \gamma _{{D_1}}^{u} = \frac{{d_g^{ - \beta }{\eta _1}{\psi _1}{{\left| {{g_u}} \right| }^2}}}{{d_1^{ - \beta }d_2^{ - \beta }{\eta _2}{\psi _2}{{\left| {{{\textbf{h}}}_1^u{\mathbf {\Phi h}}_2^u} \right| }^2} + 1}}, \end{aligned}$$
(9)
where \({\psi _1} = \frac{{{P_{D_1}}}}{{{N_0}}}\), \({\psi _2} = \frac{{{P_{D_2}}}}{{{N_0}}}\).
Following the completion of the SIC, the corresponding SNR to detect the signal of \(D_2\) is given by
$$\begin{aligned} \gamma _{{D_2}}^{u} = d_1^{ - \beta }d_2^{ - \beta }{\eta _2}{\psi _2}{\left| {{{\textbf{h}}}_1^u{\mathbf {\Phi h}}_2^u} \right| ^2}. \end{aligned}$$
(10)
The received signal at E can be expressed as
$$\begin{aligned} y_E^{u} = d_{{g_{e1}}}^{ - \frac{\beta }{2}}{g_{e1}}\sqrt{{P_{{D_1}}}} s_1^{u} + d_{{g_{e2}}}^{ - \frac{\beta }{2}}{g_{e2}}\sqrt{{P_{{D_2}}}} s_2^{u} + {\tau _e}. \end{aligned}$$
(11)
Similar to (7), we can continue to apply PIC, then the SNR at E can be written by [41, 42]
$$\begin{aligned} \gamma _E^{u,i} = d_{{g_{ei}}}^{ - \beta }{\eta _i}{\psi _{ei}}{\left| {{g_{ei}}} \right| ^2}, \end{aligned}$$
(12)
where \({\psi _{ei}} = \frac{{{P_{D_i}}}}{{{N_e}}}\), \(\left( {i = 1,2} \right)\).

3 Channel model

Based on [43], the channel gain \(g_z\) follows Nakagami-m distribution with fading parameter \(m_{g_z}\) and \({\mathbb {E}}\left[ {{{\left| {{g_z}} \right| }^2}} \right] = {\lambda _{g_z}}\) with \(z = \left\{ {d,u,e,e1,e2} \right\}\). Therefore, the probability density function (PDF) of \({{{\left| g_z \right| }^2}}\) is given by
$$\begin{aligned} {f_{{{\left| {{g_z}} \right| }^2}}}\left( x \right) = \frac{{{m_{{g_z}}}^{{m_{{g_z}}}}{x^{{m_{{g_z}}} - 1}}}}{{{\lambda _{{g_z}}}^{{m_z}}\Gamma \left( {{m_{{g_z}}}} \right) }}{e^{ - \frac{{{m_{{g_z}}}x}}{{{\lambda _{{g_z}}}}}}}. \end{aligned}$$
(13)
Next, the cumulative distribution function (CDF) is expressed as
$$\begin{aligned} {F_{{{\left| {{g_z}} \right| }^2}}}\left( x \right) = 1 - \frac{1}{{\Gamma \left( {{m_{{g_z}}}} \right) }}\Gamma \left( {{m_{{g_z}}},\frac{{{m_{{g_z}}}x}}{{{\lambda _{{g_z}}}}}} \right) \\ = 1 - {e^{ - \frac{{{m_{{g_z}}}x}}{{{\lambda _{{g_z}}}}}}}\sum \limits _{k = 0}^{{m_{{g_z}}} - 1} {\frac{1}{{k!}}{{\left( {\frac{{{m_{{g_z}}}x}}{{{\lambda _{{g_z}}}}}} \right) }^k}} , \\ \end{aligned}$$
(14)
Next, we can rewrite the channel of \(D_2\) as \(\left| {{{\textbf{h}}}_1^v{\mathbf {\Phi h}}_2^v} \right| = \left| {\sum \limits _{n = 1}^N {{\alpha _n}} h_{1,n}^vh_{2,n}^v{e^{j{\varphi _n}}}} \right|\) with \(v = \left\{ {d,u} \right\}\). To obtain the best channel of BS-IRS-\(D_2\), we adjust the phase-shift element of IRS to maximize \(\left| {\sum \limits _{n = 1}^N {{\alpha _n}} h_{1,n}^vh_{2,n}^v{e^{j{\varphi _n}}}} \right|\). Next, by setting the optimal phase-shift \(\varphi _n\), this implies that the phases of all \(h_{1,n}^vh_{2,n}^v{e^{j{\varphi _n}}}\) can be set to be the same. Furthermore, the generalized solution can be obtained as \(\varphi _n = {{\bar{\varphi }}} - \arg (h_{1,n}^vh_{2,n}^v)\), where \({{\bar{\varphi }}} \in [0,2\pi )\) denotes the arbitrary constant. By applying the optimal phase-shift for \(\varphi _n\), we can express as [26]
$$\begin{aligned} {\left| {{{\textbf{h}}}_1^v{\mathbf {\Phi h}}_2^v} \right| ^2} = {\alpha ^2}{\left| {\sum \limits _{n = 1}^N {h_{1,n}^vh_{2,n}^v} } \right| ^2}, \end{aligned}$$
(15)
where \({\alpha _n} = \alpha ,{\forall _n}\). Denote \({X_v} = \frac{{{{\left( {\sum \limits _{n = 1}^N {\left| {h_{1,n}^v} \right| \left| {h_{2,n}^v} \right| } } \right) }^2}}}{{N\left( {1 - {\omega _v}} \right) }}\), in which, \({\lambda _v} = \frac{{N{\omega _v}}}{{1 - {\omega _v}}}\), \({\omega _v} = \frac{1}{{m_{1,n}^vm_{2,n}^v}}{\left( {\frac{{\Gamma \left( {m_{1,n}^v + 1/2} \right) }}{{\Gamma \left( {m_{1,n}^v} \right) }}} \right) ^2}\) \({\left( {\frac{{\Gamma \left( {m_{2,n}^v + 1/2} \right) }}{{\Gamma \left( {m_{2,n}^v} \right) }}} \right) ^2}\), where \(m_{i,n}^v\) are denoted fading parameters of \(h_{i,n}^v\). With N as a large number and applying the central limit theorem (CLT), \(X_v\) follows the noncentral chi-square distribution. Next, the PDF and CDF are given by [26]
$$\begin{aligned} {f_{{X_v}}}\left( x \right) = \frac{{\lambda _v^{1/4}}}{2}{e^{ - \frac{{x + {\lambda _v}}}{2}}}{x^{ - 1/4}}{I_{ - 1/2}}\left( {\sqrt{{\lambda _v}x} } \right) \\ = {e^{ - \frac{{x + {\lambda _v}}}{2}}}\sum \limits _{j = 0}^\infty {\frac{{\lambda _v^j{x^{j - 1/2}}}}{{j!{2^{2j + 1/2}}\Gamma \left( {j + 1/2} \right) }}} , \\ \end{aligned}$$
(16)
and
$$\begin{aligned} {F_{{X_v}}}\left( x \right) = 1 - {Q_{1/2}}\left( {\sqrt{{\lambda _v}} ,\sqrt{x} } \right) \\ = {e^{ - \frac{{{\lambda _v}}}{2}}}\sum \limits _{j = 0}^\infty {\frac{{\lambda _v^j\gamma \left( {j + 1/2,x/2} \right) }}{{j!{2^j}\Gamma \left( {j + 1/2} \right) }}} . \\ \end{aligned}$$
(17)

4 Performance analysis for downlink

In this section, we derive the closed-form of COP, SOP, and ASR for user \(D_i\) with the downlink scenario.

4.1 COP analysis

4.1.1 COP OF \(D_1\)

The COP of user \(D_1\) is defined as the probability of an interruption occurring in the connection of user \(D_1\) when the connection of user \(D_2\) is also interrupted. Therefore, the COP of user \(D_1\) can be expressed by [44, 45]
$$\begin{aligned} COP_{{D_1}}^d = 1 - \Pr \left( {\gamma _{{D_1}}^{d,2}> {\gamma _{th2}},\gamma _{{D_1}}^{d,1} > {\gamma _{th1}}} \right) , \end{aligned}$$
(18)
where \({\gamma _{thi}} = {2^{{R_i}}} - 1\).
Proposition 1
The closed-form expression for COP at \(D_1\) is given by
$$\begin{aligned} COP_{{D_1}}^d = 1 - {e^{ - \varepsilon }}\sum \limits _{k = 0}^{{m_{{g_d}}} - 1} {\frac{{{\varepsilon ^k}}}{{k!}}} , \end{aligned}$$
(19)
where \(\varepsilon = \frac{{{m_{{g_d}}}\rho }}{{{\lambda _{{g_d}}}}}\), \(\rho = \max \left( {\frac{{{\gamma _{th2}}}}{{\left( {{\eta _2} - {\gamma _{th2}}{\eta _1}} \right) d_g^{ - \beta }\psi }},\frac{{{\gamma _{th1}}}}{{d_g^{ - \beta }{\eta _1}\psi }}} \right)\).
Proof
From (18), \(COP_{{D_1}}^d\) can be written as
$$\begin{aligned} COP_{{D_1}}^d = 1 - \Pr \left( {\frac{{d_g^{ - \beta }{\eta _2}\psi {{\left| {{g_d}} \right| }^2}}}{{d_g^{ - \beta }{\eta _1}\psi {{\left| {{g_d}} \right| }^2} + 1}}> {\gamma _{th2}},} \right. \\ \left. {d_g^{ - \beta }{\eta _1}\psi {{\left| {{g_d}} \right| }^2}> {\gamma _{th1}}} \right) \\ = 1 - \Pr \left( {{{\left| {{g_d}} \right| }^2}> \frac{{{\gamma _{th2}}}}{{\left( {{\eta _2} - {\gamma _{th2}}{\eta _1}} \right) d_g^{ - \beta }\psi }},} \right. \\ \left. {{{\left| {{g_d}} \right| }^2} > \frac{{{\gamma _{th1}}}}{{d_g^{ - \beta }{\eta _1}\psi }}} \right) . \\ \end{aligned}$$
(20)
We let \(\rho = \max \left( {\frac{{{\gamma _{th2}}}}{{\left( {{\eta _2} - {\gamma _{th2}}{\eta _1}} \right) d_d^{ - \beta }\psi }},\frac{{{\gamma _{th1}}}}{{d_d^{ - \beta }{\eta _1}\psi }}} \right)\), note that when we set power allocation coefficients, we need to ensure that \({\eta _2} - {\gamma _{th2}}{\eta _1} > 0\). Based on the CDF function of \({{{\left| g_d \right| }^2}}\) from (14), \(COP_{{D_1}}^d\) can be derived as
$$\begin{aligned} COP_{{D_1}}^d = {F_{{{\left| {{g_d}} \right| }^2}}}\left( \rho \right) = 1 - {e^{ - \varepsilon }}\sum \limits _{k = 0}^{{m_{{g_d}}} - 1} {\frac{{{\varepsilon ^k}}}{{k!}}}, \end{aligned}$$
(21)
where \(\varepsilon = \frac{{{m_{{g_d}}}\rho }}{{{\lambda _{{g_d}}}}}\). The proof is now complete. \(\square\)

4.1.2 COP OF \(D_2\)

The COP of \(D_2\) occurs when \(D_2\) cannot detect correctly the own signal. So, the COP of \(D_2\) can be defined by
$$\begin{aligned} COP_{{D_2}}^d = 1 - \Pr \left( {\gamma _{{D_2}}^{d,2} > {\gamma _{th2}}} \right) . \end{aligned}$$
(22)
Proposition 2
The closed-form expression for COP at \(D_2\) is given by
$$\begin{aligned} COP_{{D_2}}^d = {e^{ - \frac{{{\lambda _d}}}{2}}}\sum \limits _{j = 0}^\infty {\frac{{\lambda _d^j\gamma \left( {j + 1/2,\frac{{{\gamma _{th2}}N\left( {1 - {\omega _d}} \right) }}{{2\left( {{\eta _2} - {\gamma _{th2}}{\eta _1}} \right) d_1^{ - \beta }d_2^{ - \beta }\psi {\alpha ^2}}}} \right) }}{{j!{2^j}\Gamma \left( {j + 1/2} \right) }}} . \end{aligned}$$
(23)
Proof
From (22), \(COP_{{D_2}}^d\) can write as (24), as shown at the top of the next page.
$$\begin{aligned}&COP_{{D_2}}^d = 1 - \Pr \left( {\frac{{d_1^{ - \beta }d_2^{ - \beta }{\eta _2}\psi {\alpha ^2}\frac{{{{\left( {\sum \limits _{n = 1}^N {\left| {h_{1,n}^d} \right| \left| {h_{2,n}^d} \right| } } \right) }^2}}}{{N\left( {1 - {\omega _d}} \right) }}}}{{d_1^{ - \beta }d_2^{ - \beta }{\eta _1}\psi {\alpha ^2}\frac{{{{\left( {\sum \limits _{n = 1}^N {\left| {h_{1,n}^d} \right| \left| {h_{2,n}^d} \right| } } \right) }^2}}}{{N\left( {1 - {\omega _d}} \right) }} + 1}}> {\gamma _{th2}}} \right) \\&\quad = 1 - \Pr \left( {{{\left( {\sum \limits _{n = 1}^N {\left| {h_{1,n}^d} \right| \left| {h_{2,n}^d} \right| } } \right) }^2} > \frac{{{\gamma _{th2}}N\left( {1 - {\omega _d}} \right) }}{{\left( {{\eta _2} - {\gamma _{th2}}{\eta _1}} \right) d_1^{ - \beta }d_2^{ - \beta }\psi {\alpha ^2}}}} \right) . \\ \end{aligned}$$
(24)
Similar to (20), note that when we set power allocation coefficients, we need to ensure that \({\eta _2} - {\gamma _{th2}}{\eta _1} > 0\). The CDF of \({{{\left( {\sum \limits _{n = 1}^N {\left| {h_{1,n}^d} \right| \left| {h_{2,n}^d} \right| } } \right) }^2}}\) is given by (17). \(COP_{{D_2}}^d\) can be derived as
$$\begin{aligned} COP_{{D_2}}^d = {F_{{{\left( {\sum \limits _{n = 1}^N {\left| {h_{1,n}^d} \right| \left| {h_{2,n}^d} \right| } } \right) }^2}}}\left( {\frac{{{\gamma _{th2}}N\left( {1 - {\omega _d}} \right) }}{{\left( {{\eta _2} - {\gamma _{th2}}{\eta _1}} \right) d_1^{ - \beta }d_2^{ - \beta }\psi {\alpha ^2}}}} \right) \\ = {e^{ - \frac{{{\lambda _d}}}{2}}}\sum \limits _{j = 0}^\infty {\frac{{\lambda _d^j\gamma \left( {j + 1/2,\frac{{{\gamma _{th2}}N\left( {1 - {\omega _d}} \right) }}{{2\left( {{\eta _2} - {\gamma _{th2}}{\eta _1}} \right) d_1^{ - \beta }d_2^{ - \beta }\psi {\alpha ^2}}}} \right) }}{{j!{2^j}\Gamma \left( {j + 1/2} \right) }}} . \\ \end{aligned}$$
(25)
The proof is now finished. \(\square\)

4.2 SOP analysis

Assume the eavesdropper could decode sensitive information from BS by using multi-user detection techniques. Based on (7) and (14), the closed-form of user \(D_i\) can be given by [44]
$$\begin{aligned} SOP_{{D_i}}^d = \Pr \left( {\gamma _E^{d,i}> {\xi _i}} \right) = \Pr \left( {{{\left| {{g_e}} \right| }^2} > \frac{{{\xi _i}}}{{d_{{g_e}}^{ - \beta }{\eta _i}{\psi _e}}}} \right) \\ = 1 - {F_{{{\left| {{g_e}} \right| }^2}}}\left( {\frac{{{\xi _i}}}{{d_{{g_e}}^{ - \beta }{\eta _i}{\psi _e}}}} \right) = {e^{ - {\mu _i}}}\sum \limits _{k = 0}^{{m_{{g_e}}} - 1} {\frac{{{{\left( {{\mu _i}} \right) }^k}}}{{k!}}} , \\ \end{aligned}$$
(26)
where \({\mu _i} = \frac{{{m_{{g_e}}}{\xi _i}}}{{d_{{g_e}}^{ - \beta }{\eta _i}{\psi _e}{\lambda _{{g_e}}}}}\), \({\xi _i} = {2^{{R_i} - {R_{Ei}}}} - 1\).

4.3 ASR analysis

4.3.1 ASR OF \(D_1\)

The ASR of \(D_1\) can be expressed as [46]
$$\begin{aligned}&{\bar{C}}_{{D_1}}^d = {\mathbb {E}}{\left[ {{{\log }_2}\left( {{{1 + \gamma _{{D_1}}^{d,1}} \over {1 + \gamma _E^{d,1}}}} \right) } \right] ^ + } \\&\quad = \underbrace{{\mathbb {E}}\left[ {{{\log }_2}\left( {1 + \gamma _{{D_1}}^{d,1}} \right) } \right] }_{Z_1^d} - \underbrace{{\mathbb {E}}\left[ {{{\log }_2}\left( {1 + \gamma _E^{d,1}} \right) } \right] }_{Z_2^d}, \\ \end{aligned}$$
(27)
where \({\left[ X \right] ^ + } = \max \left\{ {0,X} \right\}\) is to ensure the secrecy capacity strictly positive.
Proposition 3
The closed-form expression for ASR at \(D_1\) is given by
$$\begin{aligned} {\bar{C}}_{{D_1}}^d = \frac{1}{{\ln 2}}\left[ {\frac{1}{{\Gamma \left( {{m_{{g_d}}}} \right) }}G_{2,3}^{3,1}\left( {\left. {\begin{array}{l} {0,1} \\ {0,{m_{{g_d}}},0} \end{array}} \right| \frac{{{m_{{g_d}}}}}{{d_g^{ - \beta }{\eta _1}\psi {\lambda _{{g_d}}}}}} \right) } \right. \left. { - \frac{1}{{\Gamma \left( {{m_{{g_e}}}} \right) }}G_{2,3}^{3,1}\left( {\left. {\begin{array}{l} {0,1} \\ {0,{m_{{g_e}}},0} \end{array}} \right| \frac{{{m_{{g_e}}}}}{{d_{{g_e}}^{ - \beta }{\eta _1}{\psi _e}{\lambda _{{g_e}}}}}} \right) } \right] . \\ \end{aligned}$$
(28)
Proof
The details are given in Appendix A. \(\square\)

4.3.2 ASR OF \(D_2\)

The ASR of \(D_2\) can be expressed as [46]
$$\begin{aligned}&{\bar{C}}_{{D_2}}^d = {\mathbb {E}}{\left[ {{{\log }_2}\left( {{{1 + \gamma _{{D_2}}^{d,2}} \over {1 + \gamma _E^{d,2}}}} \right) } \right] ^+ }\\&\quad = \underbrace{{\mathbb {E}}\left[ {{{\log }_2}\left( {1 + \gamma _{{D_2}}^{d,2}} \right) } \right] }_{W_1^d} - \underbrace{{\mathbb {E}}\left[ {{{\log }_2}\left( {1 + \gamma _E^{d,2}} \right) } \right] }_{W_2^d}. \\ \end{aligned}$$
(29)
Proposition 4
The closed-form expression for ASR at \(D_2\) is given by (30), as shown at the top of the next page, where \(\Theta = \frac{{{\eta _2}{t_k} + {\eta _2}}}{{2{\eta _1}}}\), \({t_k} = \cos \left[ {\frac{{\left( {2k - 1} \right) \pi }}{{2K}}} \right]\).
$$\begin{aligned} {\bar{C}}_{{D_2}}^d = \frac{1}{{\ln 2}}\left[ {\frac{{\pi {\eta _2}}}{{2{\eta _1}K}}{e^{ - \frac{{{\lambda _d}}}{2}}}\sum \limits _{j = 0}^\infty {\sum \limits _{k = 1}^K {\sqrt{1 - t_k^2} } \frac{{\lambda _d^j\Gamma \left( {j + 1/2,\frac{{\Theta N\left( {1 - {\omega _d}} \right) }}{{2\left( {{\eta _2} - \Theta {\eta _1}} \right) d_1^{ - \beta }d_2^{ - \beta }\psi {\alpha ^2}}}} \right) }}{{j!{2^j}\Gamma \left( {j + 1/2} \right) \left( {1 + \Theta } \right) }}- \frac{1}{{\Gamma \left( {{m_{{g_e}}}} \right) }}G_{2,3}^{3,1}\left( {\left. {\begin{array}{l} {0,1}\\ {0,{m_{{g_e}}},0} \end{array}} \right| \frac{{{m_{{g_e}}}}}{{d_{{g_e}}^{ - \beta }{\eta _2}{\psi _e}{\lambda _{{g_e}}}}}} \right) } } \right] . \end{aligned}$$
(30)
\(\square\)
Proof
The details are given in Appendix B. \(\square\)

5 Performance analysis for uplink

In this section, we derive the closed-form of COP, SOP, and ASR for user \(D_i\) with the uplink scenario.

5.1 COP analysis

5.1.1 COP OF \(D_1\)

If \(D_1\) is unable to accurately identify its own signal, the COP of \(D_1\) will occur. As a result, the COP for the uplink of \(D_1\) can be described as [26]
$$\begin{aligned} COP_{{D_1}}^{u} = 1 - \Pr \left( {\gamma _{{D_1}}^{u} > {\gamma _{th1}}} \right) . \end{aligned}$$
(31)
Proposition 5
The closed-form expression for COP at \(D_1\) is given by
$$\begin{aligned} COP_{{D_1}}^u = 1 - {e^{ - \frac{{{m_{{g_u}}}{\theta _1}}}{{{\lambda _{{g_u}}}}} - \frac{{{\lambda _u}}}{2}}}\sum \limits _{k = 0}^{{m_{{g_u}}} - 1} {\sum \limits _{j = 0}^\infty {\sum \limits _{q = 0}^k {\left( {\begin{array}{*{20}{c}} k \\ q \end{array}} \right) } } {{\left( {\frac{1}{{{\theta _2}}}} \right) }^{k - q}}} \\ \times \frac{{{\delta ^k}\lambda _u^j\Gamma \left( {j + q + 1/2} \right) }}{{k!j!{2^{2j + 1/2}}\Gamma \left( {j + 1/2} \right) }}{\left( {\delta + \frac{1}{2}} \right) ^{ - \left( {j + q + 1/2} \right) }}, \\ \end{aligned}$$
(32)
where \(\delta = \frac{{{m_{{g_u}}}{\theta _1}{\theta _2}}}{{{\lambda _{{g_u}}}}}\), \({\theta _1} = \frac{{{\gamma _{th1}}}}{{d_g^{ - \beta }{\eta _1}{\psi _1}}}\), \({\theta _2} = \frac{{d_1^{ - \beta }d_2^{ - \beta }{\eta _2}{\psi _2}{\alpha ^2}}}{{N\left( {1 - {\omega _u}} \right) }}\).
Proof
The details are given in Appendix C. \(\square\)

5.1.2 COP OF \(D_2\)

Similarly to (31), when \(D_2\) is unable to appropriately identify its own signal, the COP of \(D_2\) happens. Consequently, the COP of \(D_2\) can be described as follows:
$$\begin{aligned}&COP_{{D_2}}^u = 1 - \Pr \left( {\gamma _{{D_2}}^u> {\gamma _{th2}}} \right) \\&\quad = 1 - \Pr \left( {{\theta _2}{{\left( {\sum \limits _{n = 1}^N {\left| {h_{1,n}^u} \right| \left| {h_{2,n}^u} \right| } } \right) }^2}> {\gamma _{th2}}} \right) \\&\quad = 1 - \Pr \left( {{{\left( {\sum \limits _{n = 1}^N {\left| {h_{1,n}^u} \right| \left| {h_{2,n}^u} \right| } } \right) }^2} > \frac{{{\gamma _{th2}}}}{{{\theta _2}}}} \right) \\&\quad = {F_{{{\left( {\sum \limits _{n = 1}^N {\left| {h_{1,n}^u} \right| \left| {h_{2,n}^u} \right| } } \right) }^2}}}\left( {\frac{{{\gamma _{th2}}}}{{{\theta _2}}}} \right) \\&\quad = {e^{ - \frac{{{\lambda _u}}}{2}}}\sum \limits _{j = 0}^\infty {\frac{{\lambda _u^j\gamma \left( {j + 1/2,\frac{{{\gamma _{th2}}}}{{2{\theta _2}}}} \right) }}{{j!{2^j}\Gamma \left( {j + 1/2} \right) }}} . \\ \end{aligned}$$
(33)

5.2 SOP analysis

The SOP of user \(D_i\) can be given by
$$\begin{aligned}&SOP_{{D_i}}^u = \Pr \left( {\gamma _E^{u,i}> {\xi _i}} \right) \\ = \Pr \left( {{{\left| {{g_{ei}}} \right| }^2} > \frac{{{\xi _i}}}{{d_{{g_{ei}}}^{ - \beta }{\eta _i}{\psi _{ei}}}}} \right) \\&\quad = 1 - {F_{{{\left| {{g_{ei}}} \right| }^2}}}\left( {\frac{{{\xi _i}}}{{d_{{g_{ei}}}^{ - \beta }{\eta _i}{\psi _{ei}}}}} \right) \\&\quad = {e^{ - {\chi _i}}}\sum \limits _{k = 0}^{{m_{{g_{ei}}}} - 1} {\frac{{{{\left( {{\chi _i}} \right) }^k}}}{{k!}}} , \\ \end{aligned}$$
(34)
where \({\chi _i} = \frac{{{m_{{g_{ei}}}}{\xi _i}}}{{d_{{g_{ei}}}^{ - \beta }{\eta _i}{\psi _{ei}}{\lambda _{{g_{ei}}}}}}\).

5.3 ASR analysis

5.3.1 ASR OF \(D_1\)

The ASR of \(D_1\) can be expressed as
$$\begin{aligned}&{\bar{C}}_{{D_1}}^u = {\mathbb {E}}{\left[ {{{\log }_2}\left( {\frac{{1 + \gamma _{{D_1}}^u}}{{1 + \gamma _E^{u,1}}}} \right) } \right] ^+ } \\&\quad = \underbrace{{\mathbb {E}}\left[ {{{\log }_2}\left( {1 + \gamma _{{D_1}}^u} \right) } \right] }_{Z_1^u} - \underbrace{{\mathbb {E}}\left[ {{{\log }_2}\left( {1 + \gamma _E^{u,1}} \right) } \right] }_{Z_2^u}. \\ \end{aligned}$$
(35)
Proposition 6
The closed-form expression for ASR at \(D_1\) is given by (36), as shown at the top of the next page, where \(\phi = \frac{{{m_{{g_u}}}}}{{d_g^{ - \beta }{\eta _1}{\psi _1}{\lambda _{{g_u}}}}}\).
$$\begin{aligned}&{\bar{C}}_{{D_1}}^u = \frac{1}{{\ln \left( 2 \right) }}{e^{ - \frac{{{\lambda _u}}}{2}}}\sum \limits _{k = 0}^{{m_{{g_u}}} - 1} {\sum \limits _{j = 0}^\infty {\sum \limits _{q = 0}^k {\left( {\begin{array}{c} k \\ q \end{array}} \right) } } {{\left( {\frac{1}{{{\theta _2}}}} \right) }^{k - q}}} {\left( {\frac{1}{2}} \right) ^{ - \left( {j + q + 1/2} \right) }}\frac{{{{\left( {\phi {\theta _2}} \right) }^k}\lambda _u^j{\phi ^{ - k - 1}}}}{{k!j!{2^{2j + 1/2}}\Gamma \left( {j + 1/2} \right) }} \\&\qquad \times H_{1,0:1,1:1,1}^{0,1:1,1:1,1}\left( {\left. \begin{aligned} \left( { - k,1,1} \right) \\ - \\ \end{aligned} \right| \left. \begin{aligned} \left( {0,1} \right) \\ \left( {0,1} \right) \\ \end{aligned} \right| \left. \begin{aligned} \left( {1 - \left( {j + q + 1/2} \right) ,1} \right) \\ \left( {0,1} \right) \\ \end{aligned} \right| \frac{1}{\phi },2{\theta _2}} \right) \\&\qquad - \frac{1}{{\Gamma \left( {{m_{{g_{e1}}}}} \right) \ln \left( 2 \right) }}G_{2,3}^{3,1}\left( {\left. {\begin{array}{l} {0,1} \\ {0,{m_{{g_{e1}}}},0} \end{array}} \right| \frac{{{m_{{g_{e1}}}}}}{{d_{{g_{e1}}}^{ - \beta }{\eta _1}{\psi _{e1}}{\lambda _{{g_{e1}}}}}}} \right) . \\ \end{aligned}$$
(36)
\(\square\)
Proof
The details are given in Appendix D. \(\square\)

5.3.2 ASR OF \(D_2\)

The ASR of \(D_2\) can be expressed as
$$\begin{aligned}&{\bar{C}}_{{D_2}}^u = {\mathbb {E}}{\left[ {{{\log }_2}\left( {\frac{{1 + \gamma _{{D_2}}^u}}{{1 + \gamma _E^{u,2}}}} \right) } \right] ^ + } \\&\quad = \underbrace{{\mathbb {E}}\left[ {{{\log }_2}\left( {1 + \gamma _{{D_2}}^u} \right) } \right] }_{W_1^u} - \underbrace{{\mathbb {E}}\left[ {{{\log }_2}\left( {1 + \gamma _E^{u,2}} \right) } \right] }_{W_2^u}. \\ \end{aligned}$$
(37)
Proposition 7
The closed-form expression for ASR at \(D_2\) is given by
$$\begin{aligned} {\bar{C}}_{{D_2}}^u = \frac{1}{{\ln 2}}{e^{ - \frac{{{\lambda _u}}}{2}}}\sum \limits _{j = 0}^\infty {\frac{{\lambda _u^j}}{{j!{2^j}\Gamma \left( {j + 1/2} \right) }}} \\ \times G_{2,3}^{3,1}\left( {\left. {\begin{array}{*{20}{l}} {0,1} \\ {0,0,j + 1/2} \end{array}} \right| \frac{1}{{2{\theta _2}}}} \right) \\ - \frac{1}{{\Gamma \left( {{m_{{g_{e2}}}}} \right) \ln \left( 2 \right) }}G_{2,3}^{3,1}\left( {\left. {\begin{array}{*{20}{l}} {0,1} \\ {0,{m_{{g_{e2}}}},0} \end{array}} \right| \frac{{{m_{{g_{e2}}}}}}{{d_{{g_{e2}}}^{ - \beta }{\eta _2}{\psi _{e2}}{\lambda _{{g_{e2}}}}}}} \right) . \\ \end{aligned}$$
(38)
Proof
The details are given in Appendix E. \(\square\)

6 Simulation results and discussion

In this section, we define sim. and ana. as short for simulation and analytical. Next, we verify our theoretical analysis by using Monte-Carlo simulation.
In Fig. 2, we plot the COP for downlink versus \(\psi\) (dB) with varying the number of elements. First, it can be easily observed that the COP curve corresponds exactly to the Monte Carlo simulation results. The simulation points of \(D_1\) and \(D_2\) correspond well to the analytical results obtained from (19) and (22), respectively. Furthermore, when the \(\psi\) rises, so will the system COP’s performance. In terms of comparing the COPs of \(D_1\) and \(D_2\), the simulation results show that user \(D_2\) has the best scenario because it is assisted by IRS. In addition, the power allocation has a great impact on the COP performance. In addition, NOMA outperforms OMA for two users \(D_1\) and \(D_2\) in all SNR ranges.
Figure 3 illustrates the COP for downlink versus \(\psi\) (dB) with varying the number of elements N, we can see that the COP performance is improved by increasing the number of reflecting meta-surface elements N for \(D_2\). We can observe that the user \(D_2\) supported by IRS has better COP performance than the unsupported user \(D_1\). The research gap between two users \(D_1\) and \(D_2\) increases when N is large. Moreover, in the case without IRS, we can observe the COP performance of \(D_1\) is better than \(D_2\). This can be explained because the distance from BS to \(D_2\) is larger than \(D_1\). In Fig. 4, the impacts of the SOP for the downlink of \(D_1\) and \(D_2\) versus the transmit power \(\psi _E\) (dB) with varying the target data rate of two users. We can see that the SOP increases significantly with increasing \(\psi _E\) (dB). Under the intended parameters, the suggested NOMA method has somewhat lower secrecy outage performance than OMA in high transmission power locations.
Figure 5 depicts the ASR for downlink versus \(\psi\) (dB) varying the path loss \(\beta\), assumed to be K= 100 for the accuracy-complexity tradeoff parameter. First, it is obvious that ASR increases with transmit power \(\psi\) (dB). Second, the variation of \(\beta\) will change the ASR of two users \(D_i\). It means the ASR is decreased when \(\beta\) is increased. Finally, for \(D_2\), when \(\psi\) (dB) is large enough, ASR of \(D_2\) will converge at one point.
In Fig. 6, it plots the COP for uplink versus \(\psi _1 = \psi _2\) (dB) with varying the number of elements N. It is discovered that the simulation points of \(D_1\) and \(D_2\) correspond well to the analytical results obtained from (30) and (31), respectively. Then, we can observe that when the transmit \(\psi _1=\psi _2\) (dB) increases, the COP of \(D_1\) decreases and approaches a floor. Because of the uplink NOMA principle, \(D _2\)’s signal is viewed as interference when decoding \(D_1\)’s signal. Furthermore, when N increase, the performance COP of \(D_2\) is improve significantly.
Figure 7 shows the COP for the uplink of two users \(D_1\) and D with different fading values m = 1 and m = 2. It is apparent that m = 2 leads to a better channel, which is significant in improving the performance of destinations. The fundamental reason for this is those principal SINR and SNR expressions depend on channel gains. As a result, larger channel gains result in higher SINR and SNR, and outage performance can be improved.
Figure 8 shows the SOP for the uplink of two users \(D_1\) and \(D_2\) with different distances from \(D_1\) and \(D_2\) to E. We can see that the wider the distance between two users and E, the secrecy performance of the two users is better. This is because, as the distance increases, the power allocated to user \(D_2\) expands to meet its quality of service (QoS) requirements. As a result, the power assigned to user \(D_1\) will drop. Given a secrecy guard distance, two users perform better at a small distance than a large distance. In Fig. 9, the ASR curves for the uplink network of two users \(D_1\) and \(D_2\) are depicted. We observe that the simulated findings match the relevant analytical results obtained from (34) and (36). Then, we see that the ASR of user \(D_2\) also converges to a ceiling. Moreover, the distance \(d_1\) is large, which leads to a decrease in the ASR.

7 Conclusion

In this paper, we analyzed the secrecy performance for IRS-based downlink and uplink NOMA networks. Based on the proposed system, the closed-form of COP, SOP, and ASR are derived. All analytical results are verified by Monte Carlo simulations. We show numerical results for various secure performances under the influence of several parameters such as transmit SNR at the base station and the number of reflecting elements of IRS setup. In addition, the proposed IRS-based NOMA scheme is compared with OMA. The number of reflecting elements at the IRS and SNR level at the base station, as the major finding, contribute primarily to the improvement of security for IRS-aided NOMA systems.

Acknowledgements

Not applicable.

Declarations

Competing Interests

The authors declare that they have no competing interests.
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://​creativecommons.​org/​licenses/​by/​4.​0/​.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix

Appendix A

From (27), \(Z_1^d\) can be written by
$$\begin{aligned} {Z_1^d} = \frac{1}{{\ln 2}}\int _0^\infty {\frac{{1 - {F_{\gamma _{{D_1}}^{d,1}}}\left( x \right) }}{{1 + x}}dx} . \end{aligned}$$
(39)
Next, the formula for \({F_{\gamma _{{D_1}}^{{d,1}}}}\left( x \right)\) is as follows
$$\begin{aligned}&{F_{\gamma _{{D_1}}^{{d,1}}}}\left( x \right) = 1 - \Pr \left( {{{\left| {{g_d}} \right| }^2} > \frac{x}{{d_g^{ - \beta }{\eta _1}\psi }}} \right) \\&\quad = {F_{{{\left| {{g_d}} \right| }^2}}}\left( {\frac{x}{{d_g^{ - \beta }{\eta _1}\psi }}} \right) \\&\quad = 1 - \frac{1}{{\Gamma \left( {{m_{{g_d}}}} \right) }}\Gamma \left( {{m_{{g_d}}},\frac{{{m_{{g_d}}}x}}{{d_g^{ - \beta }{\eta _1}\psi {\lambda _{{g_d}}}}}} \right) . \\ \end{aligned}$$
(40)
From (40) into (39), \(Z_1^d\) can be given by
$$\begin{aligned} {Z_1^d} = \frac{1}{{\Gamma \left( {{m_{{g_d}}}} \right) \ln \left( 2 \right) }}\int _0^\infty {\frac{{\Gamma \left( {{m_{{g_d}}},\frac{{{m_{{g_d}}}x}}{{d_g^{ - \beta }{\eta _1}\psi {\lambda _{{g_d}}}}}} \right) }}{{1 + x}}dx} \\ = \frac{1}{{\Gamma \left( {{m_{{g_d}}}} \right) \ln \left( 2 \right) }} \\ \times \int _0^\infty {{{\left( {x + 1} \right) }^{ - 1}}G_{1,2}^{2,0}\left( {\left. {\begin{array}{*{20}{l}} 1 \\ {{m_{{g_d}}},0} \end{array}} \right| \frac{{{m_{{g_d}}}x}}{{d_g^{ - \beta }{\eta _1}\psi {\lambda _{{g_d}}}}}} \right) dx} , \\ \end{aligned}$$
(41)
where the Meijer G-function is \(G_{p,1}^{m,n}\left( . \right)\) [47, Eq. (9.301)]. Moreover, we employ the equalities [48, Eq. (2.6)] as
$$\begin{aligned} \Gamma \left( {A,Bx} \right) = G_{1,2}^{2,0}\left( {\left. \begin{array}{l} 1\\ A,0 \end{array} \right| Bx} \right) . \end{aligned}$$
(42)
With the extra help of [47, Eq. (7.811.5)], \(Z_1^d\) can be written by
$$\begin{aligned} {Z_1^d} = \frac{1}{{\Gamma \left( {{m_{{g_d}}}} \right) \ln \left( 2 \right) }}G_{2,3}^{3,1}\left( {\left. {\begin{array}{*{20}{l}} {0,1} \\ {0,{m_{{g_d}}},0} \end{array}} \right| \frac{{{m_{{g_d}}}}}{{d_g^{ - \beta }{\eta _1}\psi {\lambda _{{g_d}}}}}} \right) . \end{aligned}$$
(43)
From (27), \(Z_2^d\) can be written by
$$\begin{aligned} {Z_2^d} = \frac{1}{{\ln 2}}\int _0^\infty {\frac{{1 - {F_{\gamma _E^{{d,1}}}}\left( x \right) }}{{1 + x}}dx} . \end{aligned}$$
(44)
According to (14), \({F_{\gamma _E^{{d,1}}}}\left( x \right)\) can be given by
$$\begin{aligned} {F_{\gamma _E^{{d,1}}}}\left( x \right) = 1 - \frac{1}{{\Gamma \left( {{m_{{g_e}}}} \right) }}\Gamma \left( {{m_{{g_e}}},\frac{{{m_{{g_e}}}x}}{{d_{{g_e}}^{ - \beta }{\eta _1}{\psi _e}{\lambda _{{g_e}}}}}} \right) . \end{aligned}$$
(45)
From (45) into (44), and base on (42), \(Z_2^d\) can be formulated as
$$\begin{aligned} {Z_2^d} = \frac{1}{{\Gamma \left( {{m_{{g_e}}}} \right) \ln \left( 2 \right) }}\int _0^\infty {\frac{{\Gamma \left( {{m_{{g_e}}},\frac{{{m_{{g_e}}}x}}{{d_{{g_e}}^{ - \beta }{\eta _1}{\psi _e}{\lambda _{{g_e}}}}}} \right) }}{{1 + x}}dx} \\ = \frac{1}{{\Gamma \left( {{m_{{g_e}}}} \right) \ln \left( 2 \right) }}\int _0^\infty {\frac{{G_{1,2}^{2,0}\left( {\left. {\begin{array}{*{20}{l}} 1 \\ {{m_{{g_e}}},0} \end{array}} \right| \frac{{{m_{{g_e}}}x}}{{d_{{g_e}}^{ - \beta }{\eta _1}{\psi _e}{\lambda _{{g_e}}}}}} \right) }}{{1 + x}}dx}. \\ \end{aligned}$$
(46)
Similar to (43), with the aid of the [47, Eq. (7.811.5)], \(Z_2^d\) can be written by
$$\begin{aligned} {Z_2^d} = \frac{1}{{\Gamma \left( {{m_{{g_e}}}} \right) \ln \left( 2 \right) }}G_{2,3}^{3,1}\left( {\left. {\begin{array}{*{20}{l}} {0,1} \\ {0,{m_{{g_e}}},0} \end{array}} \right| \frac{{{m_{{g_e}}}}}{{d_{{g_e}}^{ - \beta }{\eta _1}{\psi _e}{\lambda _{{g_e}}}}}} \right) . \end{aligned}$$
(47)
We can obtain (28) by converting (43) and (47) into (27).

Appendix B

From (29), \(W_1^d\) can be written by
$$\begin{aligned} {W_1^d} = \frac{1}{{\ln 2}}\int _0^\infty {\frac{{1 - {F_{\gamma _{{D_2}}^{d,2}}}\left( x \right) }}{{1 + x}}dx}. \end{aligned}$$
(48)
According to (17) and (23), \({F_{\gamma _{{D_2}}^{d,2}}}\left( x \right)\) can be given by
$$\begin{aligned}&{F_{\gamma _{{D_2}}^{d,2}}}\left( x \right) = 1 - {e^{ - \frac{{{\lambda _d}}}{2}}} \\&\quad \times \sum \limits _{j = 0}^\infty {\frac{{\lambda _d^j\Gamma \left( {j + 1/2,\frac{{xN\left( {1 - {\omega _d}} \right) }}{{2\left( {{\eta _2} - x{\eta _1}} \right) d_1^{ - \beta }d_2^{ - \beta }\psi {\alpha ^2}}}} \right) }}{{j!{2^j}\Gamma \left( {j + 1/2} \right) }}} . \\ \end{aligned}$$
(49)
From (49) into (48), and \(W_1^d\) has to meet the requirement that \(x < \frac{{{\eta _2}}}{{{\eta _1}}}\). So, \(W_1^d\) can be expressed as
$$\begin{aligned}&{W_1^d} = \frac{1}{{\ln 2}}{e^{ - \frac{{{\lambda _d}}}{2}}} \\&\quad \times \int _0^{\frac{{{\eta _2}}}{{{\eta _1}}}} {\sum \limits _{j = 0}^\infty {\frac{{\lambda _d^j\Gamma \left( {j + 1/2,\frac{{xN\left( {1 - {\omega _d}} \right) }}{{2\left( {{\eta _2} - x{\eta _1}} \right) d_1^{ - \beta }d_2^{ - \beta }\psi {\alpha ^2}}}} \right) }}{{j!{2^j}\Gamma \left( {j + 1/2} \right) \left( {1 + x} \right) }}} dx} . \\ \end{aligned}$$
(50)
Applying Gaussian–Chebyshev quadrature [47], \(W_1^d\) is given by
$$\begin{aligned}&{W_1^d} = \frac{{\pi {\eta _2}}}{{2{\eta _1}K\ln 2}}{e^{ - \frac{{{\lambda _d}}}{2}}} \\&\quad \times \sum \limits _{j = 0}^\infty {\sum \limits _{k = 1}^K {\frac{{\sqrt{1 - t_k^2} \lambda _d^j\Gamma \left( {j + 1/2,\frac{{\Theta N\left( {1 - {\omega _d}} \right) }}{{2\left( {{\eta _2} - \Theta {\eta _1}} \right) d_1^{ - \beta }d_2^{ - \beta }\psi {\alpha ^2}}}} \right) }}{{j!{2^j}\Gamma \left( {j + 1/2} \right) \left( {1 + \Theta } \right) }}} } , \\ \end{aligned}$$
(51)
where \(\Theta = \frac{{{\eta _2}{t_k} + {\eta _2}}}{{2{\eta _1}}}\), \({t_k} = \cos \left[ {\frac{{\left( {2k - 1} \right) \pi }}{{2K}}} \right]\).
Similarly, \(Z_2^d\), \(W_2^d\) can be written as
$$\begin{aligned} {W_2^d} = \frac{1}{{\Gamma \left( {{m_{{g_e}}}} \right) \ln \left( 2 \right) }}G_{2,3}^{3,1}\left( {\left. {\begin{array}{*{20}{l}} {0,1} \\ {0,{m_{{g_e}}},0} \end{array}} \right| \frac{{{m_{{g_e}}}}}{{d_{{g_e}}^{ - \beta }{\eta _2}{\psi _e}{\lambda _{{g_e}}}}}} \right) . \end{aligned}$$
(52)
We can obtain (30) by converting (51) and (52) into (29).

Appendix C

From (31), \(COP_{{D_1}}^{u}\) can be given by (53), as shown at the top of the next page, where \({\theta _1} = \frac{{{\gamma _{th1}}}}{{d_g^{ - \beta }{\eta _1}{\psi _1}}}\), \({\theta _2} = \frac{{d_1^{ - \beta }d_2^{ - \beta }{\eta _2}{\psi _2}{\alpha ^2}}}{{N\left( {1 - {\omega _u}} \right) }}\).
$$\begin{aligned}&COP_{{D_1}}^u = 1 - \Pr \left( {\frac{{d_g^{ - \beta }{\eta _1}{\psi _1}{{\left| {{g_u}} \right| }^2}}}{{d_1^{ - \beta }d_2^{ - \beta }{\eta _2}{\psi _2}{\alpha ^2}\frac{{{{\left( {\sum \limits _{n = 1}^N {\left| {h_{1,n}^u} \right| \left| {h_{2,n}^u} \right| } } \right) }^2}}}{{N\left( {1 - {\omega _u}} \right) }} + 1}}> {\gamma _{th1}}} \right) \\&\quad = 1 - \Pr \left( {{{\left| {{g_u}} \right| }^2}> \frac{{{\gamma _{th1}}}}{{d_g^{ - \beta }{\eta _1}{\psi _1}}}\left( {d_1^{ - \beta }d_2^{ - \beta }{\eta _2}{\psi _2}{\alpha ^2}\frac{{{{\left( {\sum \limits _{n = 1}^N {\left| {h_{1,n}^u} \right| \left| {h_{2,n}^u} \right| } } \right) }^2}}}{{N\left( {1 - {\omega _u}} \right) }} + 1} \right) } \right) \\&\quad = 1 - \Pr \left( {{{\left| {{g_u}} \right| }^2} > {\theta _1}\left( {{\theta _2}{{\left( {\sum \limits _{n = 1}^N {\left| {h_{1,n}^u} \right| \left| {h_{2,n}^u} \right| } } \right) }^2} + 1} \right) } \right) . \\ \end{aligned}$$
(53)
Next, the CDF function of \({{{\left| g_u \right| }^2}}\) and the PDF of \({{{\left( {\sum \limits _{n = 1}^N {\left| {h_{1,n}^u} \right| \left| {h_{2,n}^u} \right| } } \right) }^2}}\) are given by (14) and (16), respectively. \(COP_{{D_1}}^{u}\) can be derived as (54), as shown at the top of the next page, where \(\delta = \frac{{{m_{{g_u}}}{\theta _1}{\theta _2}}}{{{\lambda _{{g_u}}}}}\).
$$\begin{aligned}&COP_{{D_1}}^u = 1 - \int _0^\infty {\left( {1 - {F_{{{\left| {{g_u}} \right| }^2}}}\left( {{\theta _1}\left( {{\theta _2}x + 1} \right) } \right) } \right) } {f_{{{\left( {\sum \limits _{n = 1}^N {\left| {h_{1,n}^u} \right| \left| {h_{2,n}^u} \right| } } \right) }^2}}}\left( x \right) dx \\&\quad = 1 - \int _0^\infty {{e^{ - \frac{{{m_{{g_u}}}{\theta _1}\left( {{\theta _2}x + 1} \right) }}{{{\lambda _{{g_u}}}}}}}\sum \limits _{k = 0}^{{m_{{g_u}}} - 1} {\frac{1}{{k!}}{{\left( {\frac{{{m_{{g_u}}}{\theta _1}\left( {{\theta _2}x + 1} \right) }}{{{\lambda _{{g_u}}}}}} \right) }^k}} {e^{ - \frac{{x + {\lambda _u}}}{2}}}\sum \limits _{j = 0}^\infty {\frac{{\lambda _u^j{x^{j - 1/2}}}}{{j!{2^{2j + 1/2}}\Gamma \left( {j + 1/2} \right) }}} } dx \\&\quad = 1 - {e^{ - \frac{{{m_{{g_u}}}{\theta _1}}}{{{\lambda _{{g_u}}}}} - \frac{{{\lambda _u}}}{2}}}\sum \limits _{k = 0}^{{m_{{g_u}}} - 1} {\sum \limits _{j = 0}^\infty {{{\int _0^\infty {\frac{{\lambda _u^j{x^{j - 1/2}}}}{{k!j!{2^{2j + 1/2}}\Gamma \left( {j + 1/2} \right) }}\left( {\frac{{{m_{{g_u}}}{\theta _1}\left( {{\theta _2}x + 1} \right) }}{{{\lambda _{{g_u}}}}}} \right) } }^k}} } {e^{ - \left( {\delta + \frac{1}{2}} \right) x}}dx. \\ \end{aligned}$$
(54)
Then, using the [47, Eq. (1.111)], \(COP_{{D_1}}^{u}\) may be written by
$$\begin{aligned} COP_{{D_1}}^u = 1 - {e^{ - \frac{{{m_{{g_u}}}{\theta _1}}}{{{\lambda _{{g_u}}}}} - \frac{{{\lambda _u}}}{2}}}\sum \limits _{k = 0}^{{m_{{g_u}}} - 1} {\sum \limits _{j = 0}^\infty {\sum \limits _{q = 0}^k {\left( {\begin{array}{c} k \\ q \end{array}} \right) } } {{\left( {\frac{1}{{{\theta _2}}}} \right) }^{k - q}}} \\ \times \frac{{{\delta ^k}{\lambda ^j}\Gamma \left( {j + q + 1/2} \right) }}{{k!j!{2^{2j + 1/2}}\Gamma \left( {j + 1/2} \right) }} \int _0^\infty {{x^{j + q + 1/2 - 1}}} {e^{ - \left( {\delta + \frac{1}{2}} \right) x}}dx. \\ \end{aligned}$$
(55)
The equation (32) can be attained from (55) with the aid of the [47, Eq. (3.381.4)].

Appendix D

Like (39) and (35), \(Z_1^{u}\) can be written by
$$\begin{aligned} Z_1^{u} = \frac{1}{{\ln 2}}\int _0^\infty {\frac{{1 - {F_{\gamma _{{D_1}}^{u}}}\left( x \right) }}{{1 + x}}dx} . \end{aligned}$$
(56)
According to (32), the formula for \({F_{\gamma _{{D_1}}^{{u}}}}\left( x \right)\) is as follows
$$\begin{aligned} {F_{\gamma _{{D_1}}^u}}\left( x \right) = 1 - {e^{ - \frac{{{\lambda _u}}}{2}}}\sum \limits _{k = 0}^{{m_{{g_u}}} - 1} {\sum \limits _{j = 0}^\infty {\sum \limits _{q = 0}^k {\left( {\begin{array}{*{20}{c}} k \\ q \end{array}} \right) } } {{\left( {\frac{1}{{{\theta _2}}}} \right) }^{k - q}}} \\ \times \frac{{{\lambda ^j}\Gamma \left( {j + q + 1/2} \right) }}{{k!j!{2^{2j + 1/2}}\Gamma \left( {j + 1/2} \right) }} \\ \times {\left( {\phi {\theta _2}x + \frac{1}{2}} \right) ^{ - \left( {j + q + 1/2} \right) }}{\left( {\phi {\theta _2}x} \right) ^k}{e^{ - \phi x}}, \\ \end{aligned}$$
(57)
where \(\phi = \frac{{{m_{{g_u}}}}}{{d_g^{ - \beta }{\eta _1}{\psi _1}{\lambda _{{g_u}}}}}\).
As seen at the top of the following page, (58) can provide \(Z_1^{u}\) from (57) into (56).
$$\begin{aligned} Z_1^u = \frac{1}{{\ln \left( 2 \right) }}{e^{ - \frac{{{\lambda _u}}}{2}}}\sum \limits _{k = 0}^{{m_{{g_u}}} - 1} {\sum \limits _{j = 0}^\infty {\sum \limits _{q = 0}^k {\left( {\begin{array}{*{20}{c}} k \\ q \end{array}} \right) } } {{\left( {\frac{1}{{{\theta _2}}}} \right) }^{k - q}}} {\left( {\frac{1}{2}} \right) ^{ - \left( {j + q + 1/2} \right) }}\frac{{{{\left( {\phi {\theta _2}} \right) }^k}\lambda _u^j\Gamma \left( {j + q + 1/2} \right) }}{{k!j!{2^{2j + 1/2}}\Gamma \left( {j + 1/2} \right) }} \\ \times \int _0^\infty {\frac{{{x^k}{e^{ - \phi x}}}}{{1 + x}}} {\left( {2\phi {\theta _2}x + 1} \right) ^{ - \left( {j + q + 1/2} \right) }}dx \\ = \frac{1}{{\ln \left( 2 \right) }}{e^{ - \frac{{{\lambda _u}}}{2}}}\sum \limits _{k = 0}^{{m_{{g_u}}} - 1} {\sum \limits _{j = 0}^\infty {\sum \limits _{q = 0}^k {\left( {\begin{array}{*{20}{c}} k \\ q \end{array}} \right) } } {{\left( {\frac{1}{{{\theta _2}}}} \right) }^{k - q}}} {\left( {\frac{1}{2}} \right) ^{ - \left( {j + q + 1/2} \right) }}\frac{{{{\left( {\phi {\theta _2}} \right) }^k}\lambda _u^j}}{{k!j!{2^{2j + 1/2}}\Gamma \left( {j + 1/2} \right) }} \\ \times \int _0^\infty {{x^{k + 1 - 1}}} G_{0,1}^{1,0}\left( {\phi x\left| {\begin{array}{*{20}{l}} - \\ 0 \end{array}} \right. } \right) G_{1,1}^{1,1}\left( {x\left| {\begin{array}{*{20}{l}} 0 \\ 0 \end{array}} \right. } \right) G_{1,1}^{1,1}\left( {2\phi {\theta _2}x\left| {\begin{array}{*{20}{l}} {1 - \left( {j + q + 1/2} \right) } \\ 0 \end{array}} \right. } \right) dx. \\ \end{aligned}$$
(58)
We employ the equalities [48, Eq. (2.6)] in (58) as
$$\begin{aligned} \frac{1}{{1 + x}}= & {} G_{1,1}^{1,1}\left( {x\left| \begin{array}{l} 0\\ 0 \end{array} \right. } \right) , \end{aligned}$$
(59)
$$\begin{aligned} {e^{ - Ax}}= & {} G_{0,1}^{1,0}\left( {Ax\left| {\begin{array}{*{20}{l}} - \\ 0 \end{array}} \right. } \right) , \end{aligned}$$
(60)
$$\begin{aligned} {\left( {Ax + 1} \right) ^{ - B}}= & {} \frac{1}{{\Gamma \left( B \right) }}G_{1,1}^{1,1}\left( {Ax\left| {\begin{array}{*{20}{l}} {1 - B} \\ 0 \end{array}} \right. } \right) . \end{aligned}$$
(61)
From (58), with the help of the [49, Eq. (2.3)], \(Z_1^{u}\) can be written by (62), as shown at the top of the next page, where \(H\left[ { \cdot , \ldots , \cdot } \right]\) is the multivariable Fox’s H-function whose definition in terms of multiple Mellin–Barnes type contour integral is given in [48].
$$\begin{aligned} Z_1^u = \frac{1}{{\ln \left( 2 \right) }}{e^{ - \frac{{{\lambda _u}}}{2}}}\sum \limits _{k = 0}^{{m_{{g_u}}} - 1} {\sum \limits _{j = 0}^\infty {\sum \limits _{q = 0}^k {\left( {\begin{array}{*{20}{c}} k \\ q \end{array}} \right) } } {{\left( {\frac{1}{{{\theta _2}}}} \right) }^{k - q}}} {\left( {\frac{1}{2}} \right) ^{ - \left( {j + q + 1/2} \right) }}\frac{{{{\left( {\phi {\theta _2}} \right) }^k}\lambda _u^j{\phi ^{ - k - 1}}}}{{k!j!{2^{2j + 1/2}}\Gamma \left( {j + 1/2} \right) }} \\ \times H_{1,0:1,1:1,1}^{0,1:1,1:1,1}\left( {\left. \begin{aligned} \left( { - k,1,1} \right) \\ - \\ \end{aligned} \right| \left. \begin{aligned} \left( {0,1} \right) \\ \left( {0,1} \right) \\ \end{aligned} \right| \left. \begin{aligned} \left( {1 - \left( {j + q + 1/2} \right) ,1} \right) \\ \left( {0,1} \right) \\ \end{aligned} \right| \frac{1}{\phi },2{\theta _2}} \right) . \\ \end{aligned}$$
(62)
From (35) and similar (44), \(Z_2^{u}\) can be written by
$$\begin{aligned} Z_2^u = \frac{1}{{\ln 2}}\int _0^\infty {\frac{{1 - {F_{\gamma _E^{u,1}}}\left( x \right) }}{{1 + x}}dx} . \\ \end{aligned}$$
(63)
The formula for calculating \({F_{\gamma _E^{u,1}}}\left( x \right)\) using (14) and (34) is as follows
$$\begin{aligned} {F_{\gamma _E^{u,1}}}\left( x \right) = 1 - \frac{1}{{\Gamma \left( {{m_{{g_{e1}}}}} \right) }}\Gamma \left( {{m_{{g_{e1}}}},\frac{{{m_{{g_{e1}}}}x}}{{d_{{g_{e1}}}^{ - \beta }{\eta _1}{\psi _{e1}}{\lambda _{{g_{e1}}}}}}} \right) . \end{aligned}$$
(64)
Based on (42) and (64) into (63), \(Z_2^{u}\) can give by
$$\begin{aligned} Z_2^{u} = \frac{1}{{\Gamma \left( {{m_{{g_{e1}}}}} \right) \ln \left( 2 \right) }}\int _0^\infty {\frac{{\Gamma \left( {{m_{{g_{e1}}}},\frac{{{m_{{g_{e1}}}}x}}{{d_{{g_{e1}}}^{ - \beta }{\eta _1}{\psi _{e1}}{\lambda _{{g_{e1}}}}}}} \right) }}{{1 + x}}dx} \\ = \frac{1}{{\Gamma \left( {{m_{{g_{e1}}}}} \right) \ln \left( 2 \right) }}\int _0^\infty {\frac{{G_{1,2}^{2,0}\left( {\left. {\begin{array}{*{20}{l}} 1 \\ {{m_{{g_{e1}}}},0} \end{array}} \right| \frac{{{m_{{g_{e1}}}}x}}{{d_{{g_{e1}}}^{ - \beta }{\eta _1}{\psi _{e1}}{\lambda _{{g_{e1}}}}}}} \right) }}{{1 + x}}dx} . \\ \end{aligned}$$
(65)
In a manner similar (47), with the assistance of [47, Eq. (7.811.5)], \(Z_2^{u}\) can be written by
$$\begin{aligned} Z_2^{u} = \frac{1}{{\Gamma \left( {{m_{{g_{e1}}}}} \right) \ln \left( 2 \right) }}G_{2,3}^{3,1}\left( {\left. {\begin{array}{*{20}{l}} {0,1} \\ {0,{m_{{g_{e1}}}},0} \end{array}} \right| \frac{{{m_{{g_{e1}}}}}}{{d_{{g_{e1}}}^{ - \beta }{\eta _1}{\psi _{e1}}{\lambda _{{g_{e1}}}}}}} \right) . \end{aligned}$$
(66)
We can obtain (36) by converting (62) and (66) into (35).

Appendix E

From (37) and similar to (48), \(W_1^{u}\) can be written by
$$\begin{aligned} W_1^{u} = \frac{1}{{\ln 2}}\int _0^\infty {\frac{{1 - {F_{\gamma _{{D_2}}^{u}}}\left( x \right) }}{{1 + x}}dx} . \end{aligned}$$
(67)
Based on (33) \({F_{\gamma _{{D_2}}^{u}}}\left( x \right)\) can be calculated by
$$\begin{aligned} {F_{\gamma _{{D_2}}^{u}}}\left( x \right) = 1 - {e^{ - \frac{{{\lambda _u}}}{2}}}\sum \limits _{j = 0}^\infty {\frac{{\lambda _u^{^j}\Gamma \left( {j + 1/2,\frac{x}{{2{\theta _2}}}} \right) }}{{j!{2^j}\Gamma \left( {j + 1/2} \right) }}} . \end{aligned}$$
(68)
Based on (42) and (68) into (67), \(W_1^{u}\) can give by
$$\begin{aligned}&W_1^{u} = \frac{1}{{\ln 2}}{e^{ - \frac{{{\lambda _u}}}{2}}}\sum \limits _{j = 0}^\infty {\frac{{\lambda _u^{^j}}}{{j!{2^j}\Gamma \left( {j + 1/2} \right) }}} \\&\quad \times \int _0^\infty {\frac{{\Gamma \left( {j + 1/2,\frac{x}{{2{\theta _2}}}} \right) }}{{1 + x}}dx} \\ = \frac{1}{{\ln 2}}{e^{ - \frac{{{\lambda _u}}}{2}}}\sum \limits _{j = 0}^\infty {\frac{{\lambda _u^{^j}}}{{j!{2^j}\Gamma \left( {j + 1/2} \right) }}} \\&\quad \times \int _0^\infty {{{\left( {x + 1} \right) }^{ - 1}}G_{1,2}^{2,0}\left( {\left. \begin{aligned} 1 \\ 0,j + 1/2 \\ \end{aligned} \right| \frac{x}{{2{\theta _2}}}} \right) dx}. \\ \end{aligned}$$
(69)
Similar to (47), with the assistance of the [47, Eq. (7.811.5)], \(W_1^{u}\) can be written by
$$\begin{aligned} W_1^{u} = \frac{1}{{\ln 2}}{e^{ - \frac{{{\lambda _u}}}{2}}}\sum \limits _{j = 0}^\infty {\frac{{\lambda _u^{^j}}}{{j!{2^j}\Gamma \left( {j + 1/2} \right) }}} \\ \times G_{2,3}^{3,1}\left( {\left. \begin{aligned} 0,1 \\ 0,0,j + 1/2 \\ \end{aligned} \right| \frac{1}{{2{\theta _2}}}} \right) . \\ \end{aligned}$$
(70)
Similar to \(Z_2^{u}\), \(W_2^{u}\) can write as
$$\begin{aligned} W_2^{u} = \frac{1}{{\Gamma \left( {{m_{{g_{e2}}}}} \right) \ln \left( 2 \right) }}G_{2,3}^{3,1}\left( {\left. {\begin{array}{*{20}{l}} {0,1} \\ {0,{m_{{g_{e2}}}},0} \end{array}} \right| \frac{{{m_{{g_{e2}}}}}}{{d_{{g_{e2}}}^{ - \beta }{\eta _2}{\psi _{e2}}{\lambda _{{g_{e2}}}}}}} \right) . \end{aligned}$$
(71)
From (70) and (71) into (37), we’re able to get (38).
Literature
9.
go back to reference B.C. Nguyen, T. Manh Hoang, A.-T. Le, V.D. Nguyen, P.T. Tran, Performance analysis of intelligent reflecting surface aided full-duplex amplify-and-forward relay networks. Int. J. Commun. Syst. 35(10), 5172 (2022)CrossRef B.C. Nguyen, T. Manh Hoang, A.-T. Le, V.D. Nguyen, P.T. Tran, Performance analysis of intelligent reflecting surface aided full-duplex amplify-and-forward relay networks. Int. J. Commun. Syst. 35(10), 5172 (2022)CrossRef
10.
go back to reference N.D. Nguyen, A.-T. Le, M. Munochiveyi, F. Afghah, E. Pallis, Intelligent reflecting surface aided wireless systems with imperfect hardware. Electronics 11(6), 900 (2022)CrossRef N.D. Nguyen, A.-T. Le, M. Munochiveyi, F. Afghah, E. Pallis, Intelligent reflecting surface aided wireless systems with imperfect hardware. Electronics 11(6), 900 (2022)CrossRef
12.
go back to reference D.-T. Do, A.-T. Le, Noma based cognitive relaying: transceiver hardware impairments, relay selection policies and outage performance comparison. Comput. Commun. 146, 144–154 (2019)CrossRef D.-T. Do, A.-T. Le, Noma based cognitive relaying: transceiver hardware impairments, relay selection policies and outage performance comparison. Comput. Commun. 146, 144–154 (2019)CrossRef
15.
go back to reference Y. Saito, A. Benjebbour, Y. Kishiyama, T. Nakamura, System-level performance evaluation of downlink non-orthogonal multiple access (noma). In: 2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC), pp. 611–615 (2013). https://doi.org/10.1109/PIMRC.2013.6666209 Y. Saito, A. Benjebbour, Y. Kishiyama, T. Nakamura, System-level performance evaluation of downlink non-orthogonal multiple access (noma). In: 2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC), pp. 611–615 (2013). https://​doi.​org/​10.​1109/​PIMRC.​2013.​6666209
18.
go back to reference A.S.d. Sena, D. Carrillo, F. Fang, P.H.J. Nardelli, D.B.d. Costa, U.S. Dias, Z. Ding, C.B. Papadias, W. Saad, What role do intelligent reflecting surfaces play in multi-antenna non-orthogonal multiple access? IEEE Wirel. Commun. 27(5), 24–31 (2020). https://doi.org/10.1109/MWC.001.2000061 A.S.d. Sena, D. Carrillo, F. Fang, P.H.J. Nardelli, D.B.d. Costa, U.S. Dias, Z. Ding, C.B. Papadias, W. Saad, What role do intelligent reflecting surfaces play in multi-antenna non-orthogonal multiple access? IEEE Wirel. Commun. 27(5), 24–31 (2020). https://​doi.​org/​10.​1109/​MWC.​001.​2000061
29.
go back to reference D.-T. Do, A.-T. Le, N.-D.X. Ha, N.-N. Dao, Physical layer security for internet of things via reconfigurable intelligent surface. Fut. Gener. Comput. Syst. 126, 330–339 (2022)CrossRef D.-T. Do, A.-T. Le, N.-D.X. Ha, N.-N. Dao, Physical layer security for internet of things via reconfigurable intelligent surface. Fut. Gener. Comput. Syst. 126, 330–339 (2022)CrossRef
30.
go back to reference B. Schneier, Cryptographic design vulnerabilities. Computer 31(9), 29–33 (1998)CrossRef B. Schneier, Cryptographic design vulnerabilities. Computer 31(9), 29–33 (1998)CrossRef
47.
go back to reference I.S. Gradshteyn, I.M. Ryzhik, Table of Integrals, Series, and Products. Academic press (2014) I.S. Gradshteyn, I.M. Ryzhik, Table of Integrals, Series, and Products. Academic press (2014)
48.
go back to reference A.M. Mathai, R.K. Saxena, H.J. Haubold, The H-function: Theory and Applications. Springer (2009) A.M. Mathai, R.K. Saxena, H.J. Haubold, The H-function: Theory and Applications. Springer (2009)
49.
go back to reference P. Mittal, K. Gupta, An integral involving generalized function of two variables. In: Proceedings of the Indian Academy of Sciences-section A, vol. 75, pp. 117–123 (1972). Springer P. Mittal, K. Gupta, An integral involving generalized function of two variables. In: Proceedings of the Indian Academy of Sciences-section A, vol. 75, pp. 117–123 (1972). Springer
Metadata
Title
Physical layer security analysis of IRS-based downlink and uplink NOMA networks
Authors
Si-Phu Le
Hong-Nhu Nguyen
Nhat-Tien Nguyen
Cuu Ho Van
Anh-Tu Le
Miroslav Voznak
Publication date
01-12-2023
Publisher
Springer International Publishing
DOI
https://doi.org/10.1186/s13638-023-02309-5

Other articles of this Issue 1/2023

EURASIP Journal on Wireless Communications and Networking 1/2023 Go to the issue

Premium Partner