Next Article in Journal
A Prototype Framework Design for Assisting the Detection of Atrial Fibrillation Using a Generic Low-Cost Biomedical Sensor
Previous Article in Journal
Automatic Distortion Rectification of Wide-Angle Images Using Outlier Refinement for Streamlining Vision Tasks
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Secrecy Outage Probability of a NOMA Scheme and Impact Imperfect Channel State Information in Underlay Cooperative Cognitive Networks

1
Department of Telecommunications, VSB-Technical University of Ostrava, 17. listopadu 2172/15, 708 00 Ostrava, Czech Republic
2
Department of Computer Networks and Data Communications, Eastern International University (EIU), Nam Ky Khoi Nghia, Binh Duong 75000, Vietnam
*
Author to whom correspondence should be addressed.
Sensors 2020, 20(3), 895; https://doi.org/10.3390/s20030895
Submission received: 29 December 2019 / Revised: 30 January 2020 / Accepted: 3 February 2020 / Published: 7 February 2020
(This article belongs to the Section Sensor Networks)

Abstract

:
Security performance and the impact of imperfect channel state information (CSI) in underlay cooperative cognitive networks (UCCN) is investigated in this paper. In the proposed scheme, relay R uses non-orthogonal multiple access (NOMA) technology to transfer messages e 1 , e 2 from the source node S to User 1 (U1) and User 2 (U2), respectively. An eavesdropper (E) is also proposed to wiretap the messages of U1 and U2. The transmission’s security performance in the proposed system was analyzed and performed over Rayleigh fading channels. Through numerical analysis, the results showed that the proposed system’s secrecy performance became more efficient when the eavesdropper node E was farther away from the source node S and the intermediate cooperative relay R. The secrecy performance of U1 was also compared to the secrecy performance of U2. Finally, the simulation results matched the Monte Carlo simulations well.

1. Introduction

The UCCN is known as the CR which is a promising technology and innovative solution for dealing with the radio spectrum allocation and precise requirements issues [1]. CR permits secondary users (SUs or unlicensed users) to access the dormant frequency spectrum without causing interruption to the primary users (PUs or licensed user). Due to SUs being accepted to the PUs at the same time, the SUs have to keep their transmit powers within the acceptable levels. Besides that, with rapidly extending wireless sensor networks (WSNs) in many areas of industry, the security of information transfer becomes a more serious problem. Many researchers investigated PLS to help security transmission between the source node and the destination node to improve and enhance the secrecy of WSNs.
Recently, many solutions and technologies have been investigated for the purposes of speeding up mobile data transmission, extending wireless communication range, and assisting users in connecting security together. Examples of these technologies include amplify-and-forward (AF), orthogonal multiple access (OMA), and energy harvesting [2,3,4]. NOMA technology, however, is a promising method and has attracted significant attention in recent years [5,6,7,8,9,10].
NOMA technology has gradually become one of the most efficient solutions in developing the fifth-generation mobile network (5G). In the NOMA technique, the users can share both time and frequency resources and only adjust their power allocation ratios. The users with better channel conditions can serve as relays to enhance the system performance by using SIC [9]. This technology improves the limitation of orthogonal multiple access (OMA). It meets the needs of end users in providing access to data quickly and securely. NOMA and PLS are therefore very important techniques in data transfer. They assist in transmitting signals from the source node to destination node with high speed, efficiency, and data confidentiality.
Several studies have examined NOMA and PLS in wireless systems [11,12,13]. In [11], the authors considered a cooperative relaying system using the NOMA technique to enhance the efficiency of the transmitted signal. The researchers in [13] investigated the effectiveness of new schemes that combined partial relay selection and NOMA in AF relaying systems to increase data transmission rates for 5G mobile networks.
A considerable amount of literature has been published on PLS [14,15,16]. In [14], the authors analyzed the secrecy performance of cooperative protocols with relay selection methods influenced by co-channel interference. The authors in [15] inspected the impact of correlated fading on the secrecy performance of multiple DF relaying that uses the optimal relay selection method. Some researchers have also combined the NOMA technique with PLS [17,18,19]. In [17], the authors resolved the problem of maximizing the minimum confidential information rate in users subject to the secrecy outage constraint and instantaneous transmit power constraint. Cooperative NOMA systems with PLS in both AF and DF were studied by the authors in [18].
The application of NOMA techniques and security principles in underlay cognitive radio networks were also suggested by some authors in [20,21,22,23,24]. In [20], the authors discussed a cooperative transmission scheme for a downlink NOMA in CR systems. This research exploited maximum spatial diversity. The researchers in [24] considered secure communication in cognitive DF relay networks in which a pair of cognitive relays were opportunistically selected for security protection against eavesdroppers.
Channel state information (CSI) has a vital role in wireless communication systems. It describes how a signal propagates from the source node to the relay, such as scattering, fading, and power decay over distance. During a receiver’s set-up period, the CSI is evaluated and transferred to related nodes in the system through a media access control protocol. In [25], the authors researched the effect of imperfect channel CSI on secondary users in an underlay DF cognitive network with multiple primary receivers. In [26], scientists studied the effect of imperfect CSI on a DF cooperative underlay cognitive radio NOMA network in order to determine the optimal power allocation factors for different user distances.
In most of the literature reported above, the combination of NOMA and PLS in a UCCN influenced by CSI was not proposed. Motivated and inspired by the above ideas, a cooperative scheme is suggested in this paper. In this scheme, a proposed UCCN using NOMA is required to both decode and forward the messages e 1 and e 2 from node S to two destination nodes (U 1 and U 2 ) under the effect of CSI and an eavesdropper. The secrecy performance of the communications e 1 and e 2 in the proposed system were then examined and estimated in terms of secrecy outage probability over Rayleigh fading channels to improve spectral efficiency and secure communication.
The main contributions of the paper are summarized as follows:
-
A study of the impact of imperfect CSI and the secrecy performance of a UCCN applying the NOMA technique to improve system performance in a 5G wireless network.
-
Secrecy outage probability (SOP) is performed over Rayleigh fading channels and verified with Monte Carlo simulations.
-
The results achieved by the proposed scheme demonstrate the security performance of U 1 and U 2 .
-
The secrecy performance of the proposed system improved when the distance between the eavesdropper node E and the source and cooperative relay increased.
The paper has five sections. Section 1 introduces the topic. Section 2 describes the proposed scheme’s system model. Section 3 presents the results of an analysis of the secrecy outage probability at the source nodes. Section 4 presents the simulation results. Section 5 summarizes the conclusions.

2. System Model

Figure 1 illustrates the influence of imperfect CSI in a UCCN using NOMA and PLS. The system model consists of the source nodes S transferring a superimposed signal e 1 and e 2 to U 1 and U 2 , respectively, through relay node R. One eavesdropper node E is proposed to wiretap the signals e 1 , e 2 of the links S-U 1 , S-U 2 . In addition, the system model also consists of a node Pu which is known as the primary user having the license. Due to the interference constraint at the Pu node in the UCCN, the relay R and source S adjust their transmitting powers. In this model, we assume that the intermediate relay node R operates in DF relaying method and applies the NOMA principle under the influence of imperfect CSIs and PLS in UCCN. In addition, the variances of Zero-mean White Gaussian Noises (AWGNs) are equal, given as N 0 . In this work, the corresponding distances of the links S-Pu, R-Pu, S-R, S-E, R-E, R-Pu, R-U 1 , and R-U 2 in Figure 1 are given as l S P u , l R P u , l S R , l S E , l R E , l R P u , l 1 , and l 2 .
Regarding the system channels, h i represents the Rayleigh fading channel coefficient, i h S R , h S E , h S P u , h R E , h R P u , 1 , 2 . We assume that the channels h i do not change during block time T and are independently and identically distributed between two consecutive block times [10].
Finally, all of nodes in the system model have a single antenna for transmitting and receiving messages.
In principle, there are two time slots involved in each system communication process, and are given as follows:
At the first time slot, the source node S transfers the information e S to the relay R and the eavesdropper node E, which is given by the math expression as
e s = β 1 P s e 1 + β 2 P s e 2 ,
where Ps is the power at source node S, e 1 , and e 2 are the messages of U 1 , U 2 , respectively, with E { | e j | 2 } = 1 , j 1 , 2 , ( E { e } being notated for the expectation process of e). The β 1 and β 2 are the power allocation coefficients. Following the principle of the NOMA, we assume that β 1 > β 2 with β 1 + β 2 = 1 .
Because of the estimation errors of channels h i , the evaluated fading channel coefficients at the nodes are represented as follows [25]:
h i ^ = ρ h i + 1 ρ 2 ε i ,
where h i ^ , h i , and ε i are modeled as the additive white Gaussian noise (AWGN) with the random variable f i = | h i ^ | 2 . The correlation coefficient ρ 0 , 1 is described as the average quality of the channel estimation.
Notation: The Cumulative Distribution Function (CDF) and probability density function (pdf) of the random variable f i is denoted respectively as F f i ( x ) = 1 e 1 λ i x and f f i ( x ) = 1 λ i e 1 λ i x , where λ i = l i β , and β is a path-loss exponent.
The received signal at R from source node S for decode e 1 under impact imperfect CSIs is given as follows:
y S R e 1 = h S R e s + σ R .
Replace h S R from formula (2), the signal y S R e 1 is calculated as
y S R e 1 = β 1 P s e 1 h ^ S R 1 ρ 2 ε S R ρ + β 2 P s e 2 h ^ S R 1 ρ 2 ε S R ρ + n R = β 1 P s e 1 h ^ S R ρ + β 2 P s e 2 h ^ S R ρ β 1 P s e 1 1 ρ 2 ε S R ρ β 2 P s e 2 1 ρ 2 ε S R ρ + n R ,
where n R denotes the AWGNs at the relay R with the same variance N 0 .
Because of applying NOMA technology, thanks to the deployment of SIC in NOMA principle, firstly, the relay R decodes the signal e 1 from formula (3b) and removes it, then the signal e 2 will be decoded without the component β 1 P s e 1 h ^ S R ρ in formula (3b). Therefore, the signal e 2 received at R from source S after removing the signal e 1 is expressed as follows:
y S R e 2 = β 2 P s e 2 h ^ S R ρ β 1 P s e 1 1 ρ 2 ε S R ρ β 2 P s e 2 1 ρ 2 ε S R ρ + n R .
Similarly, the node E also wiretaps the packets e 1 and e 2 from S, respectively, and the received signals at node E are obtained as follows:
y S E e 1 = β 1 P s e 1 h ^ S E ρ + β 2 P s e 2 h ^ S E ρ β 1 P s e 1 1 ρ 2 ε S E ρ β 2 P s e 2 1 ρ 2 ε S E ρ + n E
y S E e 2 = β 2 P s e 2 h ^ S E ρ β 1 P s e 1 1 ρ 2 ε S E ρ β 2 P s e 2 1 ρ 2 ε S E ρ + n E ,
where n E denotes the AWGNs at the E with the same variance N 0 .
In the second time slot, after the received signals, the relay R sends them to the source nodes U 1 and U 2 . Hence, the received signals at the destination node U 1 , U 2 are given respectively as
y R U 1 e 1 = β 1 P R e 1 h 1 ^ ρ + β 2 P R e 2 h 1 ^ ρ β 1 P R e 1 1 ρ 2 ε 1 ρ β 2 P R e 2 1 ρ 2 ε 1 ρ + n U 1
y R U 2 e 2 = β 2 P R e 2 h 2 ^ ρ β 1 P R e 1 1 ρ 2 ε 2 ρ β 2 P R e 2 1 ρ 2 ε 2 ρ + n U 2 ,
where n U 1 , n U 2 denote the AWGNs at the destination U 1 , U 2 with the same variance N 0 , and P R is a transmit power of the relay R.
In the proposed scheme, under the interference constraint at the node Pu, the source node S and relay node R have to adjust their transmitting powers so that the interference power at the Pu must be less than a threshold value, which is assumed as I t h . The maximum powers of nodes S and R are given, respectively,
P S = I t h | h S R ^ | 2 = I t h f S R .
P R = I t h | h R P u ^ | 2 = I t h f R P u .
Because the node E connects to the relay R directly, so it wiretaps the packets e 1 and e 2 from relay R. Therefore, the received signals at E through the link R-E are expressed as
y R E e 1 = β 1 P R e 1 h ^ R E ρ + β 2 P R e 2 h ^ R E ρ β 1 P R e 1 1 ρ 2 ε R E ρ β 2 P R e 2 1 ρ 2 ε R E ρ + n E .
y R E e 2 = β 2 P R e 2 h ^ R E ρ β 1 P R e 1 1 ρ 2 ε R E ρ β 2 P R e 2 1 ρ 2 ε R E ρ + n E .
We define the received Signal-to-Interference and Noise Ratios (SINRs) as γ = E { | signal | 2 } E{|overall noise|2}.
Firstly, we calculate the received Signal-to-Interference and Noise Ratios (SINRs) for decoding the information signal e 1 .
Thus, from formula (3b), the SINR at the relay R with the link S-R is obtained as follows:
γ S R e 1 = β 1 P S | h S R ^ | 2 ρ 2 β 2 P S | h S R ^ | 2 ρ 2 + β 1 P S 1 ρ 2 λ S R ρ 2 + β 2 P S 1 ρ 2 λ S R ρ 2 + N 0 = β 1 P S f S R β 2 P S f S R + P S 1 ρ 2 λ S R ( β 1 + β 2 ) + ρ 2 N 0 .
Replacing P S = I t h f S R in (9a), and setting P = I t h N 0 , γ S R e 1 is rewritten as
γ S R e 1 = P β 1 f S R P β 2 f S R + P 1 ρ 2 λ S R + ρ 2 f S P u ,
Similarly, with the formula in (7), we also calculate γ R U 1 e 1 , and this is achieved by mathematical expression as
γ R U 1 e 1 = P β 1 f 1 P β 2 f 1 + P 1 ρ 2 λ 1 + ρ 2 f R P u ,
where P = I t h N 0 .
Applying formulas (5) and (10), the received SINRs at the eavesdropper node E with the link S-E and R-E are given, respectively, as follows:
γ S E e 1 = β 1 P s f S E β 2 P s f S E + P s 1 ρ 2 λ S E + ρ 2 N 0 = P β 1 f S E P β 2 f S E + P 1 ρ 2 λ S E + ρ 2 f S P u .
γ R E e 1 = P β 1 f R E P β 2 f R E + P 1 ρ 2 λ R E + ρ 2 f R P u .
In the second, similar to decoding the information signal e 1 , we find the received SINRs for decoding the information signal e 2 as follows.
We apply formulas (4) and (6), the received SINRs at the nodes R with the link S-R, and at the eavesdropper node E with the link S-E are expressed, respectively, as follows:
γ S R e 2 = β 2 P s f S R β 1 P s 1 ρ 2 λ S R + β 2 P s 1 ρ 2 λ S R + ρ 2 N 0 = P β 2 f S R P 1 ρ 2 λ S R + ρ 2 f S P u .
γ S E e 2 = β 2 P s f S E P s 1 ρ 2 λ S E + ρ 2 N 0 = P β 2 f S E P 1 ρ 2 λ S E + ρ 2 f S P u .
Similarly, with formulas (8) and (12), the received SINRs at the nodes U 2 and E from relay R are inferred, respectively, as follows:
γ R U 2 e 2 = P β 2 f 2 P 1 ρ 2 λ 2 + ρ 2 f R P u .
γ R E e 2 = P β 2 f R E P 1 ρ 2 λ R E + ρ 2 f R P u .
Applying the Shannon capacity formula, the achievable rates of the links X–Y are formulated as
R X Y e j = 1 2 log 2 ( 1 + γ X Y e j ) .
where the ratio 1/2 represents the fact that data transmission is split into two time slots, X S , R , and Y E , U 1 , U 2 . The secrecy capacity of the UCCN systems with DF-based NOMA for the S-U j communication can be expressed as
S C j = S C U j e j S C E e j + ,
where x + = max 0 , x ; S C S R e i and S C R U j e j are the secrecy capacities from the source node S to the relay R and from the relay R to the destination U i are given, respectively, as
S C S R e j = max ( 0 , R S R e j R S E e j ) .
S C R U i e j = max ( 0 , R R U i e j R R E e j ) .

3. Secrecy Outage Probability Analysis

In this section, the secrecy outage probability for eavesdropping the signals of U 1 and U 2 in the proposed scheme are analyzed. We assume that a node successfully and safely decodes the received packet if its achievable secrecy capacity is larger than a threshold secrecy capacity S C t h .

3.1. Secrecy Outage Probability of U1

The secrecy outage probability of U 1 occurring when U 1 does not receive a signal safely from the source node S under the malicious attempt of the eavesdropper E is expressed as follows:
O P U 1 = Pr [ m i n ( S C S R e 1 , S C R U 1 e 1 ) < S C t h ] = 1 Pr [ S C S R e 1 S C t h , S C R U 1 e 1 S C t h ] .
Replacing S C S R e 1 = max ( 0 , R S R e 1 R S E e 1 ) at formula (22) and S C R U 1 e 1 = max ( 0 , R R U 1 e 1 R R E e 1 ) at (23) in formula (24), the O P U 1 is rewritten as follows:
O P U 1 = 1 Pr R S R e 1 R S E e 1 S C t h Pr 1.1 × Pr R R U 1 e 1 R R E e 1 S C t h Pr 1.2
Proposition 1.
The probability of the Pr1.1, and Pr1.2 in (25) is given as
Pr 1.1 = 0 a θ b 1 / λ S P u e ψ 11 / λ S R 1 / λ S P u + ψ 2 / λ S R 1 1 λ S R λ S P u λ S R λ S P u I 1 a > θ b .
where
ψ 11 = ϕ c λ S E a ϕ b ; ψ 2 = ϕ ρ 2 a ϕ b I 1 = 0 ψ 11 + ψ 2 x e 1 λ S P u x + 1 λ S R y e 1 λ S E ζ 1 d x d y , ζ 1 = c λ S E + ρ 2 x a y ϕ b y + c λ S R + ρ 2 x ϕ b + ( ϕ + 1 ) a b y + c λ S R + ρ 2 x a b y ,
Proof: See Appendix A.
Pr 1.2 = 0 a θ b 1 / λ R P u e ψ 12 / λ 1 1 / λ R P u + ψ 2 / λ 1 1 / λ 1 λ R P u I 2 a > θ b
where
ψ 12 = ϕ c λ 1 a ϕ b ; ψ 2 = ϕ ρ 2 a ϕ b I 2 = 0 ψ 12 + ψ 2 x e 1 λ R P u x + 1 λ 1 y e 1 λ R E ζ 2 d x d y , ζ 2 = c λ R E + ρ 2 x a y ϕ b y + c λ 1 + ρ 2 x ϕ b + ( ϕ + 1 ) a b y + c λ 1 + ρ 2 x a b y ,
Proof: See Appendix B.
From formulas in (26) and (27), the secrecy outage probability of the U 1 is obtained as
O P U 1 = 1 a ϕ b 1 1 / λ S P u e ψ 11 / λ S R 1 / λ S P u + ψ 2 / λ S R 1 / λ S R λ S P u × I 1 × 1 / λ R P u e ψ 12 / λ 1 1 / λ R P u + ψ 2 / λ 1 1 / λ 1 λ R P u × I 2 a > ϕ b

3.2. Secrecy Outage Probability of U2

Similar to U 1 , the SOP of U 2 can be expressed as
O P U 2 = Pr min S C S R e 2 , S C R U 2 e 2 < S C t h = 1 Pr S C S R e 2 S C t h , S C R U 2 e 2 S C t h .
Proposition 2.
The secrecy outage probability of U 2 in (26) is given as
O P U 2 = 1 1 1 λ S P u λ S E × I 3 × 1 1 λ R P u λ R E I 4
where
  • ζ 3 = ϕ c λ S R + ρ 2 x b + ϕ + 1 c λ S R + ρ 2 x c λ S E + ρ 2 x y ,
  • ζ 4 = ϕ c λ 2 + ρ 2 x b + ϕ + 1 c λ 2 + ρ 2 x c λ R E + ρ 2 x y ,
  • I 3 = 0 0 e 1 λ S P u x + 1 λ S E y × 1 e ζ 3 λ S R d x d y ,
  • I 4 = 0 0 e 1 λ R P u x + 1 λ R E y × 1 e ζ 4 λ 2 d x d y .
Proof: See Appendix C.
The integrals I 1 and I 2 in (28) and I 3 and I 4 in (30) are complex integrals and are difficult to resolve practically. In this paper, however, the value of I 1 , I 2 , I 3 and I 4 can be found using numerical methods.

4. Simulation Results

In this section, the secrecy performance of a NOMA scheme and the impact of imperfect CSI in a UCCN were examined, analyzed, and evaluated. The theoretical results of the analyses were verified with Monte Carlo simulations. The coordinates of S, R, U 1 , U 2 , Pu, and E were set to S ( 0 , 0 ) , R x R , 0 ), U 1 x U 1 , y U 1 = 1 , 0 , U 2 x U 2 , y U 2 = 0.75 , 0.5 , P u x P u , y P u ) , E x E , y E ) , respectively, in the two-dimensional plane and satisfying x i > 0 ) . Hence, l S R = x R , l R U 1 = x U 1 x R , l R U 2 = y U 2 2 + x U 2 x R ) 2 , l R P u = y P u 2 + x P u x R ) 2 , l R E = y E 2 + x E x R ) 2 , l S E = y E 2 + x E 2 , and l S P u = x P u 2 + y P u 2 . We assume that the target secrecy capacity S C t h = 0.5 (bit/s/Hz) and the exponent β is set to a constant β = 3 .
Figure 2 and Figure 3 graph the SOP of the two Users U 1 and U 2 via SNR (dB) with S C t h = 0.5 (bit/s/Hz). The relay R, Pu, U 1 , U 2 , and eavesdropper E are located in positions R x R , 0 = 0.5 , 0 , Pu x P u , y P u = 0.5 , 1 , U 1 x U 1 , y U 1 = 1 , 0 , U 2 x U 2 , y U 2 = 0.75 , 0.5 , E x E , y E = 0.5 , 1 , respectively. From the results in Figure 2, we can see the effect of the eavesdropping node E to the SOP when SNR is changed from 0 dB to 20 dB. With ρ = 0.95 , the SOP values of User U 1 are greater than User U 2 when SNR < 2.5 dB. Nevertheless, when the SNR increases from 2.5 dB to 30 dB, the SOP of User U 2 is better than User U 1 , and both also increase when the SNR increases as a result of large transmitting power. Besides that, it is noted that imperfect CSI degrades the SOP of the signal.
In Figure 3, we observe the obvious affection of the channel estimation coefficient ρ to the SOP. The SOP of the two users in case ρ = 0.95 outperforms the SOP in case ρ = 0.9 . It means that the system has been impacted by imperfect CSI. We also can see that the secrecy performance of the two Users also decreases when the SNR increases. The security system will be better and it is difficult for the eavesdropper to wiretap the signal. These theoretical results match the simulation results of the proposed system well. Hence, the derived equations are sufficiently accurate for use in analysis.
Figure 4 graphs the SOP of the two Users U 1 and U 2 via ρ when SNR = 10 (dB) with S C t h = 0.5 (bit/s/Hz). The relay R, Pu, U 1 , U 2 , and eavesdropper E are located in positions R x R , 0 = 0.5 , 0 , Pu x P u , y P u = 0.5 , 1 , U 1 x U 1 , y U 1 = 1 , 0 , U 2 x U 2 , y U 2 = 0.75 , 0.5 , E x E , y E = 0.5 , 1 , respectively. As observed in Figure 4, the secrecy performance of U 1 is better than U 2 when ρ < 0.9 . However, when the correlation coefficient ρ > 0.9 , the SOP of U 2 is less than U 1 . This means that the effects of the evaluation errors decrease when the correlation coefficients ρ increase. In addition, the secrecy performance of two Users is more efficient when the channel estimation coefficient ρ is higher.
Figure 5 graphs the SOP of the proposed scheme versus the position of the of eavesdropper E on the y-axis when the coordinate value y E changes from 0.2 to 2 when SNR = 10 (dB), (bit/s/Hz), R x R , 0 = 0.5 , 0 , Pu x P u , y P u = 0.5 , 1 , U 1 x U 1 , y U 1 = 1 , 0 , U 2 x U 2 , y U 2 = 0.75 , 0.5 . Figure 5 shows that the SOP of U 1 and U 2 decrease when y E increases. This means that the secrecy transmission of the two Users will be intact when eavesdropper E moves farther away from source S and relay R.
We can also see that the secrecy performance of U 2 is better than U 1 as a result of the proposed scheme applying NOMA and using SIC to detect the signal under the effect of imperfect CSI on the system.
Figure 6 graphs the SOP of User U 1 and U 2 versus the power allocation coefficients β 1 (changing from 0.6 to 0.95) when SNR = 10 (dB), S C t h = 0.5 (bit/s/Hz), R x R , 0 = 0.5 , 0 , Pu x P u , y P u = 0.5 , 1 , U 1 x U 1 , y U 1 = 1 , 0 , U 2 x U 2 , y U 2 = 0.75 , 0.5 , E x E , y E = 0.5 , 1 . This figure shows the impact of a varying β 1 on the system. When β 1 increases from 0.6 to 0.85, the SOP of U 2 outperforms the SOP of U 1 . The secrecy transmission of U 1 is then better than U 2 when β 1 > 0.85 . We can thus observe the impact of β 1 on the security performance of a UCCN system with a NOMA solution under the effect of imperfect CSI.

5. Conclusions

A NOMA scheme with imperfect CSI in a UCCN was proposed in this paper. We also researched the physical layer security to improve the secrecy performance. The secrecy performance was examined analyzed, evaluated by the secrecy outage probability of the achievable secrecy capacity, and over Rayleigh fading channels. The obtained results show that the security performance of the system model is decreased when the imperfect CSIs exists as well as the SNR increases. The proposed scheme with the optimal imperfect CSIs can achieve the best performance. Besides that, we can see that the node eavesdropper E is far from the source S and relay R, the security performance became more security. In addition, the security performance of U1 and the security performance of U2 are also compared with together. Lastly, the achieved results of the SOP matched well with the Monte Carlo simulation results.

Author Contributions

T.-P.H. designed the concept; D.-H.H. and C.T.T. analyzed and performed the simulation; C.T.T. contributed to developing some of the mathematical analyses; T.-P.H. organized and wrote the paper; M.V. and P.F. improved and critically reviewed the paper. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the institutional grant SGS reg. No. SP2019/41 conducted at VSB—Technical University of Ostrava and also by the ESF project “Science without borders” reg. No. CZ.02.2.69/0.0/0.0/16 027/0008463 within the Operational Programme Research, Development and Education in the Czech Republic.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Abbreviations

The following abbreviations were used in this manuscript:
AFAmplify-and-forward
CRCognitive radio
DFDecode-and-forward
NOMANon-orthogonal multiple access
PLSPhysical layer security
SICSuccessive interference cancellation
SOPSecrecy outage probability
UCCNUnderlay cooperative cognitive network

Appendix A

The probability Pr1.1 in formula (25) is rewritten as
Pr 1.1 = Pr R S R e 1 R S E e 1 S C t h = 1 Pr R S R e 1 R S E e 1 < S C t h .
Applying formula in (20), we calculate R S R e 1 = 1 2 log 2 ( 1 + γ S R e 1 ) , and R S E e 1 = 1 2 log 2 ( 1 + γ S E e 1 ) . Hence, the probability Pr1.1 in (A1) is calculated by replacing R S R e 1 , R S E e 1 and is expressed as
Pr 1.1 = 1 Pr 1 2 l o g 2 ( 1 + γ S R e 1 ) < S C t h + 1 2 l o g 2 ( 1 + γ S E e 1 )
Replacing γ S R e 1 in (12b) and γ S E e 1 (14) into (A2), the probability Pr1.1 is obtained as
Pr 1.1 = 1 Pr a f S R b f S R + c λ S R + ρ 2 f S P u < ϕ + ( ϕ + 1 ) a f S E b f S E + c λ S E + ρ 2 f S P u = 1 Pr f S E > a f S R c λ S E + ρ 2 f S P u ϕ c λ S E + ρ 2 f S P u b f S R + c λ S R + ρ 2 f S P u ϕ b + ( ϕ + 1 ) a b f S R + c λ S R + ρ 2 f S P u a b f S R
where
ϕ = 2 2 S C t h 1 ; a = P β 1 ; b = P β 2 ; c = P 1 ρ 2
Using the pdf of the random variable f S P u into (A3), the probability Pr1.1 is expressed as
Pr 1.1 = 1 Pr f S E > a f S R c λ S E + ρ 2 f S P u ϕ c λ S E + ρ 2 f S P u b f S R + c λ S R + ρ 2 f S P u ϕ b + ( ϕ + 1 ) a b f S R + c λ S R + ρ 2 f S P u a b f S R = 1 0 f f S P u x Pr f S E > a f S R c λ S E + ρ 2 x ϕ c λ S E + ρ 2 x b f S R + c λ S R + ρ 2 x ϕ b + ( ϕ + 1 ) a b f S R + c λ S R + ρ 2 x a b f S R d x .
We can see that ϕ b + ( ϕ + 1 ) a b f S R + c λ S R + ρ 2 f S P u a b f S R > 0 .
Set M = a f S R c λ S E + ρ 2 f S P u , and N = ϕ c λ S E + ρ 2 f S P u b f S R + c λ S R + ρ 2 f S P u .
If M N , then a ϕ b f S R ϕ c λ S R + ρ 2 x .
If M > N , then a ϕ b f S R > ϕ c λ S R + ρ 2 x .
Hence, Pr 1.1 in (A4) is rewritten as
Pr 1.1 = 1 0 f f S P u x × K 1 + K 2 d x ,
where
  • K 1 = Pr a ϕ b f S R ϕ c λ S R + ρ 2 x ;
  • K 2 = Pr f S E > a f S R c λ S E + ρ 2 x ϕ c λ S E + ρ 2 x b f S R + c λ S R + ρ 2 x ϕ b + ( ϕ + 1 ) a b f S R + c λ S R + ρ 2 x a b f S R ; a ϕ b f S R > ϕ c λ S R + ρ 2 x
K 1 is resolved as follows:
K 1 = Pr a ϕ b f S R ϕ c λ S R + ρ 2 x
= 1 a ϕ b Pr f S R ϕ c λ S R + ρ 2 x a ϕ b a > ϕ b = 1 a ϕ b F f S R ϕ c λ S R + ρ 2 x a ϕ b a > ϕ b
Applying the CDF of the random variable f S R into (A6), K1 is solved in a closed-form expression as
K 1 = 1 a ϕ b 1 e 1 λ S R ϕ c λ S R a ϕ b + ϕ ρ 2 x a ϕ b a > ϕ b = 1 a ϕ b 1 e 1 λ S R ψ 11 + ψ 2 x a > ϕ b
where ψ 11 = ϕ c λ S R a ϕ b ; ψ 2 = ϕ ρ 2 a ϕ b .
Similar to calculating K 1 , K 2 is resolved as
K 2 = 0 a ϕ b ψ 11 + ψ 2 x f f S R ( y ) Pr f S E > c λ S E + ρ 2 x a y ϕ b y + c λ S R + ρ 2 x ϕ b + ( ϕ + 1 ) a b y + c λ S R + ρ 2 x a b y d y a > ϕ b
We apply the pdf of the random variable f S R and the CDF of the random variable f S E , K 2 in (A8) is obtained as
K 2 = 0 a ϕ b ψ 11 + ψ 2 x f f S R ( y ) × e 1 λ S E c λ S E + ρ 2 x a y ϕ b y + c λ S R + ρ 2 x ϕ b + ( ϕ + 1 ) a b y + c λ S R + ρ 2 x a b y d y a > ϕ b
Substituting K 1 in (A7), and K 2 in (A9) into (A5), Pr 1.1 is shown in two cases as
If a ϕ b :
Pr 1.1 = 1 0 1 λ S P u × e 1 λ S P u x d x = 0
If a > ϕ b :
Pr 1.1 = 1 0 f f S p u ( x ) ( 1 e 1 λ S R ψ 11 + ψ 2 x ) Ω 1.1 d x + 0 f f S P u ( x ) ψ 11 + ψ 2 x f f S R ( y ) e 1 λ S R ζ 1 d x d y Ω 1.2
where
ζ 1 = c λ S E + ρ 2 x a y ϕ b y + c λ S R + ρ 2 x ϕ b + ( ϕ + 1 ) a b y + c λ S R + ρ 2 x a b y
The Ω 1.1 in (A11) is calculated as
Ω 1.1 = 0 f f S P u ( x ) ( 1 e 1 λ S R ψ 11 + ψ 2 x ) d x = 0 1 λ S P u e 1 λ S P u x 1 e 1 λ S R ψ 11 + ψ 2 x d x = 1 1 λ S P u e 1 λ S R ψ 11 1 λ S P u + 1 λ S R ψ 2
The Ω 1.2 in (A11) is presented as
Ω 1.2 = 0 f f S P u x ψ 11 + ψ 2 x f f 1 y e 1 λ S E ζ 1 d x d y = 0 1 λ S P u e 1 λ S P u x ψ 11 + ψ 2 x 1 λ S R e 1 λ S R y e 1 λ S E ζ 1 d x d y = 1 λ S R λ S P u 0 ψ 11 + ψ 2 x e 1 λ S P u x + 1 λ S R y e 1 λ S E ζ 1 d x d y
Replacing the results of Ω 1.1 in (A12), and Ω 1.2 in (A13) into (A11), we resolved the probability Pr1.1 as follows:
Pr 1.1 = 0 a θ b 1 / λ S P u e ψ 11 / λ S R 1 / λ S P u + ψ 2 / λ S R 1 1 λ S R λ S P u λ S R λ S P u I 1 a > θ b
where
I 1 = 0 ψ 11 + ψ 2 x e 1 λ S P u x + 1 λ S R y e 1 λ S E ζ 1 d x d y

Appendix B

The probability Pr1.2 in formula (25) is rewrited as follows
Pr 1.2 = Pr R R U 1 e 1 R R E e 1 S C t h = 1 Pr R R U 1 e 1 < R R E e 1 + S C t h .
using formula in (20), we calculate R R U 1 e 1 , R R E e 1 and they achieved, respectively, as R R U 1 e 1 = 1 2 log 2 ( 1 + γ R U 1 e 1 ) , R R E e 1 = 1 2 log 2 ( 1 + γ R E e 1 ) .
Hence, the probability Pr1.2 in (A15) is calculated by replacing R R U 1 e 1 , R R E e 1 , γ R U 1 e 1 in (13), and γ R E e 1 in (15), we have a result as
Pr 1.2 = 1 Pr 1 2 log 2 1 + γ R U 1 e 1 < 1 2 log 2 1 + γ R E e 1 + S C t h = 1 Pr a f 1 b f 1 + c λ 1 + ρ 2 f R P u < θ + θ + 1 a f R E b f R E + c λ R E + ρ 2 f R P u
Similar as Pr1.1 at (A2), Pr1.2 is obtained as
Pr 1.2 = 0 a θ b 1 / λ R P u e ψ 12 / λ 1 1 / λ R P u + ψ 2 / λ 1 1 / λ 1 λ R P u I 2 a > θ b
where
ψ 12 = θ c λ 1 a θ b ;
I 2 = 0 ψ 12 + ψ 2 x e 1 λ R P u x + 1 λ 1 y e 1 λ R E ζ 2 d x d y ;
ζ 2 = c λ R E + ρ 2 x a y θ b y + c λ 1 + ρ 2 x θ b + ( θ + 1 ) a b y + c λ 1 + ρ 2 x a b y .
Finally, from (A14) and (A17), the secrecy outage probability O P U 1 of U 1 is resolved as (28)

Appendix C

Substituting formulas (22) and (23) into (29), we calculate similar to Appendix A and Appendix B, and the O P U 2 is given as
O P U 2 = 1 Pr R S R e 2 R S E e 2 S C t h Ω 2.1 × Pr R R U 2 e 2 R R E e 2 S C t h Ω 2.2
Firstly, we calculate the probability of Ω 2.1 as follows:
Ω 2.1 = Pr R S R e 2 R S E e 2 S C t h = 1 Pr R S R e 2 < S C t h + R S E e 2 = 1 Pr 1 2 log 2 1 + γ S R e 2 < S C t h + 1 2 log 2 1 + γ S E e 2 = 1 Pr f S R < ϕ c λ S R + ρ 2 f S P u b + ϕ + 1 c λ S R + ρ 2 f S P u c λ S E + ρ 2 f S P u f S E
Applying the pdf of the random variables f S P u and f S E , (A19) is written as
Ω 2.1 = 1 0 0 Pr f S R < ϕ c λ S E + ρ 2 x b + ϕ + 1 c λ S R + ρ 2 x c λ S E + ρ 2 x y × f f S P u x f f S E y d x d y = 1 1 λ S P u λ S E 0 0 e 1 λ S P u x + 1 λ S E y × 1 e 1 λ S R ϕ c λ S R + ρ 2 x b + ϕ + 1 c λ S R + ρ 2 x c λ S E + ρ 2 x y d x d y
Ω 2.2 is calculated similarly as (A20) and is given as
Ω 2.2 = 1 1 λ R P u λ R E 0 0 e 1 λ R P u x + 1 λ R E y × 1 e 1 λ 2 ϕ c λ 2 + ρ 2 x b + ϕ + 1 c λ 2 + ρ 2 x c λ R E + ρ 2 x y d x d y
Finally, with formulas (A20) and (A21), the secrecy outage probability of U 2 is obtained by the expression as (30).

References

  1. Liu, X.; Zhang, X. NOMA-based Resource Allocation for Cluster-based Cognitive Industrial Internet of Things. IEEE Trans. Ind. Inf. 2019. [Google Scholar] [CrossRef]
  2. Liu, X.; Jia, M.; Zhang, X.; Lu, W. A Novel Multichannel Internet of Things Based on Dynamic Spectrum Sharing in 5G Communication. IEEE Internet Things J. 2019, 6, 5962–5970. [Google Scholar] [CrossRef]
  3. Gelenbe, E.; Zhang, Y. Performance Optimization With Energy Packets. IEEE Syst. J. 2019, 13, 3770–3780. [Google Scholar] [CrossRef] [Green Version]
  4. Gelenbe, E.; Abdelrahman, O.-H. An Energy Packet Network model for mobile networks with energy harvesting. Nonlinear Theory App. IEICE 2018, 9, 322–336. [Google Scholar] [CrossRef] [Green Version]
  5. Anwar, A.; Seet, B.-C.; Ding, Z. Non-Orthogonal Multiple Access for Ubiquitous Wireless Sensor Networks. Sensors 2018, 18, 516. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  6. Rauniyar, A.; Engelstad, P.; Østerbø, O.-N. RF Energy Harvesting and Information Transmission Based on NOMA for Wireless Powered IoT Relay Systems. Sensors 2018, 18, 3254. [Google Scholar] [CrossRef] [Green Version]
  7. Yang, Z.; Ding, Z.; Fan, P.; Karagiannidis, G.-K. On the Performance of Non-orthogonal Multiple Access Systems With Partial Channel Information. IEEE Trans. Commun. 2016, 64, 654–667. [Google Scholar] [CrossRef]
  8. Yang, Z.; Ding, Z.; Fan, P.; Al-Dhahir, N. The Impact of Power Allocation on Cooperative Non-orthogonal Multiple Access Networks With SWIPT. IEEE Trans. Wireless Commun. 2017, 16, 4332–4343. [Google Scholar] [CrossRef] [Green Version]
  9. Tran, T.-N.; Voznak, M. Multi-Points Cooperative Relay in NOMA System with N-1 DF Relaying Nodes in HD/FD Mode for N User Equipments with Energy Harvesting. Electronics 2019, 8, 167. [Google Scholar] [CrossRef] [Green Version]
  10. Zhang, Y.; Wang, X.; Wang, D.; Zhao, Q. A Range-Division User Relay Selection Scheme and Performance Analysis in NOMA-based Cooperative Opportunistic Multicast Systems. Electronic 2019, 8, 554. [Google Scholar] [CrossRef] [Green Version]
  11. Ding, Z.; Peng, M.; Poor, H.-V. Cooperative Non-Orthogonal Multiple Access in 5G Systems. IEEE Commun. Lett. 2015, 19, 1462–1465. [Google Scholar] [CrossRef] [Green Version]
  12. Jiao, R.; Dai, L.; Zhang, J.; MacKenzie, R.; Hao, M. On the Performance of NOMA-Based Cooperative Relaying Systems over Rician Fading Channels. IEEE Trans. Veh. Technol. 2017. [Google Scholar] [CrossRef] [Green Version]
  13. Lee, S.; da Costa, D.-B.; Vien, Q.; Duong, T.-Q.; de Sousa, R.-T. Non-orthogonal multiple access schemes with partial relay selection. IET Commun. 2017, 11, 846–854. [Google Scholar] [CrossRef] [Green Version]
  14. Duy, T.-T.; Duong, T.-Q.; Thanh, T.-L.; Bao, V.N.-Q. Secrecy performance analysis with relay selection methods under impact of co-channel interference. IET Commun. 2015, 9, 1427–1435. [Google Scholar] [CrossRef]
  15. Fan, L.; Lei, X.; Yang, N.; Duong, T.-Q.; Karagiannidis, G.-K. Secrecy Cooperative Networks With Outdated Relay Selection Over Correlated Fading Channels. IEEE Trans. Veh. Technol. 2017, 66, 7599–7603. [Google Scholar] [CrossRef] [Green Version]
  16. Hu, H.; Gao, Z.; Liao, X.; Leung, V.C.M. Secure Communications in CIoT Networks with a Wireless Energy Harvesting Untrusted Relay. Sensors 2017, 17, 2023. [Google Scholar] [CrossRef] [Green Version]
  17. He, B.; Liu, A.; Yang, N.; Lau, V.K. On the Design of Secure Non-Orthogonal Multiple Access Systems. IEEE J. Sel. Areas Commun. 2017, 35, 2196–2206. [Google Scholar] [CrossRef] [Green Version]
  18. Chen, J.; Yang, L.; Alouini, M.S. Physical Layer Security for Cooperative NOMA Systems. IEEE Trans. Veh. Technol. 2018, 67, 4645–4649. [Google Scholar] [CrossRef] [Green Version]
  19. Do, D.T.; Van Nguyen, M.S.; Hoang, T.A.; Voznak, M. NOMA-Assisted Multiple Access Scheme for IoT Deployment: Relay Selection Model and Secrecy Performance Improvement. Sensors 2019, 19, 736. [Google Scholar] [CrossRef] [Green Version]
  20. Liu, X.; Wang, Y.; Liu, S.; Meng, J. Spectrum Resource Optimization for NOMA-Based Cognitive Radio in 5G Communications. IEEE Access 2018, 6, 24904–24911. [Google Scholar] [CrossRef]
  21. Lv, L.; Chen, J.; Ni, Q. Cooperative Non-Orthogonal Multiple Access in Cognitive Radio. IEEE Commun. Lett. 2016, 20, 2059–2062. [Google Scholar] [CrossRef] [Green Version]
  22. Lee, S.; Duong, T.Q.; Benevides daCosta, D.; Ha, D.B.; Nguyen, S.Q. Underlay cognitive radio networks with cooperative non-orthogonal multiple access. IET Commun. 2018, 12, 359–366. [Google Scholar] [CrossRef]
  23. Lv, L.; Chen, J.; Ni, Q.; Ding, Z. Design of Cooperative Non-Orthogonal Multicast Cognitive Multiple Access for 5G Systems: User Scheduling and Performance Analysis. IEEE Trans. Commun. 2017, 65, 2641–2656. [Google Scholar] [CrossRef] [Green Version]
  24. Liu, Y.; Wang, L.; Duy, T.T.; Elkashlan, M.; Duong, T.Q. Relay Selection for Security Enhancement in 251 Cognitive Relay Networks. IEEE Wirel. Commun. Lett. 2015, 4, 46–49. [Google Scholar] [CrossRef] [Green Version]
  25. Son, P.N. Joint impacts of Hardware impairments, Imperfect CSIs, and Interference constraints on Underlay Cooperative Cognitive Networks with reactive relay selection. Telecommun. Syst. 2019, 71, 65–76. [Google Scholar] [CrossRef]
  26. Arzykulov, S.; Tsiftsis, T.A.; Nauryzbayev, G.; Abdallah, M. Outage Performance of Cooperative Underlay CR-NOMA With Imperfect CSI. IEEE Commun. Lett. 2019, 23, 176–179. [Google Scholar] [CrossRef]
Figure 1. System model of NOMA and PLS under imperfect CSI in a UCCN.
Figure 1. System model of NOMA and PLS under imperfect CSI in a UCCN.
Sensors 20 00895 g001
Figure 2. The SOP of U 1 and U 2 versus SNR (dB).
Figure 2. The SOP of U 1 and U 2 versus SNR (dB).
Sensors 20 00895 g002
Figure 3. The SOP of U 1 and U 2 versus SNR (dB) when ρ = 0.9 and ρ = 0.95 .
Figure 3. The SOP of U 1 and U 2 versus SNR (dB) when ρ = 0.9 and ρ = 0.95 .
Sensors 20 00895 g003
Figure 4. The SOP of U 1 and U 2 via ρ when SNR = 10 (dB).
Figure 4. The SOP of U 1 and U 2 via ρ when SNR = 10 (dB).
Sensors 20 00895 g004
Figure 5. The SOP of U 1 and U 2 versus coordinate y E of eavesdropper E when SNR = 10 (dB).
Figure 5. The SOP of U 1 and U 2 versus coordinate y E of eavesdropper E when SNR = 10 (dB).
Sensors 20 00895 g005
Figure 6. The SOP of U 1 and U 2 versus the power allocation coefficients β 1 when SNR = 10 (dB).
Figure 6. The SOP of U 1 and U 2 versus the power allocation coefficients β 1 when SNR = 10 (dB).
Sensors 20 00895 g006

Share and Cite

MDPI and ACS Style

Huynh, T.-P.; Ha, D.-H.; Thanh, C.T.; Fazio, P.; Voznak, M. Secrecy Outage Probability of a NOMA Scheme and Impact Imperfect Channel State Information in Underlay Cooperative Cognitive Networks. Sensors 2020, 20, 895. https://doi.org/10.3390/s20030895

AMA Style

Huynh T-P, Ha D-H, Thanh CT, Fazio P, Voznak M. Secrecy Outage Probability of a NOMA Scheme and Impact Imperfect Channel State Information in Underlay Cooperative Cognitive Networks. Sensors. 2020; 20(3):895. https://doi.org/10.3390/s20030895

Chicago/Turabian Style

Huynh, Tan-Phuoc, Duy-Hung Ha, Cong Truong Thanh, Peppino Fazio, and Miroslav Voznak. 2020. "Secrecy Outage Probability of a NOMA Scheme and Impact Imperfect Channel State Information in Underlay Cooperative Cognitive Networks" Sensors 20, no. 3: 895. https://doi.org/10.3390/s20030895

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