2022 - Secrecy Performance of Transmit Antenna Selection For Underlay

17518636, 2022, 3, Downloaded from https://ietresearch.onlinelibrary.wiley.com/doi/10.1049/cmu2.12340 by National Medical Library The Director, Wiley Online Library on [27/10/2022].
See the Terms and Conditions (https://onlinelibrary.wiley.com/terms-and-conditions) on Wiley Online Library for rules of use; OA articles are governed by the applicable Creative Commons License
Received: 25 October 2021 Accepted: 6 January 2022 IET Communications
DOI: 10.1049/cmu2.12340
ORIGINAL RESEARCH PAPER
Secrecy performance of transmit antenna selection for underlay

MIMO cognitive radio relay networks with energy harvesting
Xiao Jiang1,2 Peng Li1,2 Bin Li3 Yulong Zou3 Ruchuan Wang1,2
1
School of Computer Science, Nanjing University of Abstract
Posts and Telecommunications, Nanjing, China
In this paper, the secrecy performance in a MIMO cognitive radio (CR) relay network
2
Jiangsu High Technology Research Key Laboratory with energy harvesting (EH) and transmit antenna selection/maximal ratio combining
for Wireless Sensor Networks, Jiangsu Province,
Nanjing, China
(TAS/MRC) is invstigated, where the DF relaying protocol and multiple colluding pas-
3
sive eavesdroppers are considered. To improve the security of wireless transmission, two
School of Telecommunications and Information
Engineering, Nanjing University of Posts and antenna selection schemes are proposed, namely, the optimal transmit antenna selection
Telecommunications, Nanjing, Jiangsu, P. R. China (OTAS) scheme and suboptimal transmit antenna selection (STAS) scheme. For the pur-
pose of comparison, the space-time transmission (STT) scheme is introduced as a baseline.
Correspondence The exact and asymptotic closed-form secrecy outage probability (SOP) expressions for
Peng Li, School of Computer Science, Nanjing
University of Posts and Telecommunications, Nanjing
OTAS, STAS and STT schemes are derived over Rayleigh fading channels. An extension
210023, China. of the TAS framework to an artificial noise (AN) aided MIMO network is further presented
Email: lipeng@njupt.edu.cn and an AN aided transmit antenna selection (AN-TAS) scheme is proposed, in which the
unselected antennas at R are used to emit AN for interfering with Es. Numerical results
Funding information
show that the OTAS and STAS schemes perform better than STT scheme in terms of
The National Natural Science Foundation of P.
R. China, Grant/Award Numbers: 61872196, SOP. Meanwhile, the SOP of AN-TAS scheme is much smaller than that of OTAS, STAS
61872194, 61902196, 62102194, 62102196; Sci- and STT schemes in the high SNR region, indicating the benefit of applying AN in MIMO
entific and Technological Support Project of Jiangsu
network.
Province, Grant/Award Numbers: BE2019740,
20KJB520001; Six Talent Peaks Project of Jiangsu
Province, Grant/Award Number: RJFW-111;
Natural Science Foundation of Jiangsu Province,
Grant/Award Number: BK20200753; NUPTSF,
Grant/Award Number: NY220120; Postgraduate
Research and Practice Innovation Program of Jiangsu
Province, Grant/Award Numbers: KYCX19_0909,
KYCX19_0911, KYCX20_0759, KYCX21_0787,
KYCX21_0788, KYCX21_0799
1 INTRODUCTION (TS) and power-splitting scheme (PS) [6, 7]. Specifically, PS pro-
tocol divides the received RF signals into two parts, one for
1.1 Background energy harvesting and the remaining for information process-
ing. By contrast, in the TS protocol, the time slot is divided into
ENERGY harvesting (EH), which captures energy from sur- two phases. In the first phase, the devices harvest energy from
rounding resources (wind energy, solar energy, radio frequency received signals and the harvested energy is used to perform
(RF) energy etc.), is emerging as a promising solution to improve transmission in the remaining phase.
the energy efficiency of energy-limited devices and prolong Cognitive radio (CR) networks has caused great concern
the network lifetime [1–3]. In recent years, simultaneous wire- of the research community since they can improve spectrum
less information and power transfer (SWIPT) has attracted an efficiency [8, 9]. CR consists of three modes: underlay, over-
increasing attention of researchers, which transmits informa- lay and interweave [10]. Since highly dynamic nature of the
tion and energy to destinations simultaneously [4, 5]. There CR networks, information transmission is vulnerable to eaves-
are two protocols for SWIPT, namely time-switching scheme dropping by internal and external attackers [11, 12]. Traditional
This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is
properly cited.
© 2022 The Authors. IET Communications published by John Wiley & Sons Ltd on behalf of The Institution of Engineering and Technology
IET Commun. 2022;16:227–245. wileyonlinelibrary.com/iet-com 227

17518636, 2022, 3, Downloaded from https://ietresearch.onlinelibrary.wiley.com/doi/10.1049/cmu2.12340 by National Medical Library The Director, Wiley Online Library on [27/10/2022]. See the Terms and Conditions (https://onlinelibrary.wiley.com/terms-and-conditions) on Wiley Online Library for rules of use; OA articles are governed by the applicable Creative Commons License
228 JIANG ET AL.
secure communication is realized by data encryption. However, of the proposed schemes are analyzed over Rayleigh fading
this increases the workload of the communication network, channels. [32] presented an optimal relay selection scheme to
and imposes extra system resource overhead [13, 14]. Physical enhance the security and efficiency for overlay CR networks.
layer security (PLS), which reduces the received signal quality The exact and asymptotic closed-form secrecy outage prob-
of unauthorized devices and enhances the secure transmission ability (SOP) expressions were derived. In [33], the authors
ability of legitimate information by effectively utilizing the ran- considered the secure transmission of a dual-hop EH-CR net-
domness and reciprocity of wireless channel, has attracted a lot works. The closed-form SOP expressions for this system were
of attention of researchers [15–17]. derived for independent but non-identically distributed (i.n.i.d)
and independent and identically distributed (i.i.d) Rayleigh fad-
ing channels. Wu et al. [34] proposed a secrecy beamforming
1.2 Related works concept for an EH-CR networks to improve the security of
the system.
In 1975, Wyner first proposed the wiretap channel model and TAS is a very flexible signal processing method, which can
proved that the secure communication can be ensured when improve the secrecy performance of the system, and has became
the wiretap link capacity is less than the main link capacity a research hotspot [35–39]. In [35], Yang et al. studied the TAS
[18]. After that, a growing number of researchers have focused schemes in which the receiver and the eavesdropper adopt
on signal processing technologies to improve the physical layer either MRC or selection combining (SC) to process the received
security of wireless networks, such as MIMO architecture [19, signals. [36] presented an optimal TAS scheme in a classical
20], relay selection [21, 22], user scheduling [23, 24], jamming MIMO system. The secrecy capacity probability and secrecy
[25, 26] and so on. Specifically, [19] and [20] introduced the diversity were analyzed to evaluate the secrecy performance of
MIMO network to improve the physical layer security. [21] proposed system. [37] proposed an optimal TAS scheme in a
proposed an optimal single relay selection scheme to against MIMO relay system without EH and CR. In [38], Zhao et al.
an eavesdropper in cooperative DF relay networks. Moreover, investigated the physical layer security of TAS/MRC in MIMO
Zou et al. presented multi-relay selection schemes based on AF CR networks over Nakagami-m fading channels. [39] analyzed
and DF protocols in [22]. Numerical results showed that the the security performance for a EH-MIMO network. The SOP
multi-relay selection scheme is better than single relay selection and secrecy diversity order were derived over Rayleigh fading
scheme. [23] and [24] considered user scheduling schemes in channels.
multi-user network, which can improve the security of infor-
mation transmission by selecting the best user to transmit infor-
mation. [25] presented two jammer and user selection schemes 1.3 Motivations and contributions
in which the jammer interferes with the eavesdropper by emit-
ting artificial noise. Wen et al. [26] proposed a trustworthy jam- As mentioned above, the combination of PLS technology and
mer selection scheme based on the trust degree in a coopera- EH technology applied to the CR network can not only ensure
tive cognitive radio network (CCRN). Furthermore, the authors secure communication, but also save energy and spectrum
study the influence of trust degree on physical layer security of [31–34], [40]. Motivated by above observation, in this paper
the CCRN. we explore the PLS of a dual-hop EH-MIMO CR relay net-
As a further development, an increasing research attention work consisting of a primary network and a secondary network,
has been paid to the combination of PLS and EH [27–30]. In where the secondary source (S) communicates with the sec-
[27], the authors proposed two EH jammer selection schemes ondary destination (D) with the help of a DF secondary relay
depending on whether the CSI of wiretap channel is available (R). Meanwhile, multiple passive colluding eavesdroppers (Es)
or not in the non-orthogonal multiple-access (NOMA) sys- attempt to tap the legitimate transmission. The main contribu-
tem. Connection outage probabilities and secrecy outage prob- tions of this paper can be summarized as follows.
abilities of the proposed schemes are derived to evaluate the
secure performance. Hoang et al. [28] investigated the physi- ∙ Depending on whether the CSIs of wiretap links are avail-
cal layer security in a cooperative wireless system and proposed able or not, we propose the optimal transmit antenna selec-
two relay and jammer selection schemes to improve the sys- tion (OTAS) scheme and the suboptimal transmit antenna
tem performance. [29] analyzed the secure performance of a selection (STAS) scheme to select the best transmit antenna
EH amplify and forward relay network. The authors derived the for improving the secrecy performance. The conventional
expressions of ergodic secrecy capacity for the PS and TS pro- space-time transmission (STT) scheme is also introduced as a
tocols. In [30], PS-based relaying protocol and TS-based relay- benchmark.
ing protocol are presented in a two-way relay system. The opti- ∙ We derive the exact closed-form SOP expressions for OTAS,
mal power splitting ratio and time switching ratio are obtained STAS and STT schemes in the EH-MIMO CR relay network
by maximizing the secrecy capacity. Differing from [27–30], subject to two power constraints: 1) the maximum transmit
where CR networks were not considered, [31–34] investigated power at S and R based on the harvested energy; 2) the
the physical layer security for EH-CR networks. In [31], Yan maximum interference power at the primary receiver (PR).
et al. studied the secure communication for a underlay EH- To get more insights, we derive the asymptotic SOP expres-
CR multi-user network and proposed two user scheduling sions for STT, STAS and OTAS schemes, while the average
schemes. The security-reliability trade-off (SRT) performances channel power gains of the main channels tend to infinity.
JIANG ET AL. 229
by Em , m ∈ {1, 2, … , M }. The primary network comprises two

nodes: primary transmitter (PT) and primary receiver (PR). The
system model shown in Figure 1 can be applied to a scenario
where the mobile phone can harvest energy from received
signals and physical layer security issue is considered. Assume
that the direct links from the S to D and Es are not available
due to deep fading [21, 22]. We assume that the S, R, D, and Es
are equipped with NS , NR , ND , and NE antennas, respectively,
while the primary nodes are equipped with single antenna.
All wireless channels are subject to independent quasi-static
Rayleigh fading. Let hSiR j , hR jDd , hR jEme , hPSi , hPR j , hSiP and
hR jP , i ∈ {1, 2, … , NS }, j ∈ {1, 2, … , NR }, d ∈ {1, 2, … , ND }
and e ∈ {1, 2, … , NE }, respectively, represent the channel
coefficients of Si-R j , R j -Dd , R j -Eme, PT -Si, PT -R j , Si-PR
and R j -PR, where Si, R j , Dd and Eme denote the ith antenna
of S, j th antenna of R, d th antenna of D and eth antenna of
2 2 2 2
Em , respectively. Hence |hSiR j | , |hR jDd | , |hR jEme | , |hPSi | ,
2 2 2
|hPR j | , |hSiP | and |hR jP | follow independent exponential
distribution with respective means of ΩSR , ΩRD , ΩRE , ΩPS ,
FIGURE 1 A EH-MIMO cognitive radio relay network consisting of a ΩPR , ΩSP and ΩRP . Additionally, we assume that the noise
primary transmitter (PT), a primary receiver (PR), a secondary source (S), a encountered at each receiver is additive white Gaussian noise
secondary relay (R), a secondary destination (D), and M eavesdroppers (Es)
(AWGN) with variance of N0 . In this system, we adopt
TAS at both S and R in conjunction with MRC at R, D and
Es [36–39].
Furthermore, the secrecy diversity orders of the three The whole communication process is divided into three
schemes are obtained. phases. In the first phase 𝛼T , the S and R harvest energy from
∙ We examine an extension of the TAS framework to an AN (1−𝛼)T
the RF signals transmitted by PT. In the second phase ,
aided MIMO network and propose an AN-TAS scheme, in 2
which the unselected antennas at R are used to emit AN for the S transmits signals to R with harvested energy and the R
(1−𝛼)T
confusing the Es. forwards the messages to D in the third phase , where 𝛼
2
∙ We propose an iterative algorithm to obtain optimal time- is the time-switching ratio. Therefore, the harvested energy at S
switching ratio and power allocation factor by minimizing the and R can be expressed as
secrecy outage probabilities of OTAS, STAS, STT and AN-
TAS schemes. ∑
NS
2
ES = 𝛼𝜂TPT |hPSi | (1)
The rest of this paper is organized as follows. In Section 2, i=1
we introduce the system model of an EH-MIMO CR relay net-
work in the presence of multiple eavesdroppers. Moreover, we and
propose the OTAS, STAS and STT schemes. The exact closed- ∑
NR
2
form SOP expressions for all the schemes are derived in Sec- ER = 𝛼𝜂TPT |hPR j | , (2)
tion 3. Also, an iterative optimal time switching algorithm is j =1
proposed. In Section 4, we derive the asymptotic SOP expres-
sions. Next, an extension of our TAS framework to an AN aided where 𝜂 is the energy conversion efficiency and PT is the trans-
EH-MIMO CR relay scenario is presented in Section 5, where mit power of PT.
an AN-TAS scheme is proposed. Numerical results and discus- In the underlay spectrum sharing technique, the transmit
sions are presented in Section 6. Finally, we conclude this paper power of secondary user should be lower than a given inter-
in Section 7. ference threshold for ensuring the QoS of the primary net-
work. Therefore, the transmit power at S and R can be obtained
as
2 SYSTEM MODEL AND PROBLEM ( )
FORMULATION ∑
NS
2 PI
PSi = min aPT |hPSi | , 2
(3)
i=1 |hSiP |
2.1 System model
and
Consider the underlay EH-MIMO CR network described in
( )
Figure 1, where the DF secondary relay (R) aids the commu- ∑
NR
PI
2
nication between an secondary source (S) and a secondary PR j = min a𝜌PT |hPR j | , 2
, (4)
destination (D) in the presence of M eavesdroppers, denoted j =1 |hR jP |
230 JIANG ET AL.
2𝛼𝜂 messages. In the OTAS scheme, the CSIs of wiretap links are
where a = , P is the interference threshold at PR and 𝜌 is
1−𝛼 I available. Therefore, the selection criterion of OTAS can be
power allocation factor.
(1−𝛼)T defined as
In the next phase , we suppose that the ith antenna at S
2
2 [ ]+
transmits xs (E[|xs | ] = 1) to R with the power of PSi . Adopting RbOTAS = arg max Cse, j = arg max CR jD − CR jE ,
MRC at R, the channel capacity of Si-R can be expressed as 1≤ j ≤NR 1≤ j ≤NR
(10)
∑NR where CR jD and CR jE are given by (7) and (8).
⎛ 2⎞
(1 − 𝛼)T PSi j =1 |hSiR j | Thus, the secrecy capacity of OTAS scheme can be expressed
CSiR = log2 ⎜1 + ⎟. (5)
2 ⎜ N0 ⎟ as
⎝ ⎠
[ ]+
OTAS
Cse,b = max CR jD − CR jE . (11)
Following, the DF relay R decodes the received message. As 1≤ j ≤NR
discussed in [14], [17] and [22], R is supposed to achieve success-
ful decoding if the capacity of S -R is larger than transmission
rate R0 . Let H denote the decoding status. Specifically, H = H0 2.3 Suboptimal transmit antenna selection
represents the case that R achieves successful decoding, while scheme
H = H1 indicates that R can not succeed in decoding. In this
paper, we consider that a particular transmit antenna at S maxi- This subsection provides suboptimal transmit antenna selection
mizing the channel capacity of S -R is selected to send massage (STAS) scheme in which the CSIs of wiretap links are unavail-
to R, which can increase the probability that the relay R decodes able and the antenna at R that maximizes the CSI of R-D
the information successfully. Hence the selection can be inter- is selected to transmit information. That is to say, the STAS
preted as follows scheme only relies on the main channel gain of R-D. Thus, the
selection criterion of STAS scheme can be obtained as
{ }
∑
NR
2
Sb = arg max CSiR = arg max PSi |hSiR j | , (6) ∑
ND
2
1≤i≤NS 1≤i≤NS
j =1 RbSTAS = arg max |hR jDd | . (12)
1≤ j ≤NR
d =1
where b is the index of selected antenna.
(1−𝛼)T Therefore, the channel capacity of R-D and R-E can be
In the third phase , the j th antenna at R forwards the
2 expressed as
information from S to D. Adopting MRC at D and Es, the chan-
nel capacity of R j -D and R j -Es can be formulated as ∑ND
⎛ 2⎞
(1 − 𝛼)T ⎜
PRb max d =1 |hR jDd | ⎟
( ∑ND 2)
1≤ j ≤NR
(1 − 𝛼)T PR j d =1 |hR jDd |
STAS
CRbD = log2 ⎜1 + ⎟
CR jD = log2 1 + (7) 2 ⎜ N0 ⎟
2 N0 ⎝ ⎠
(13)
and and
( ( ∑M ∑NE 2)
∑M ∑NE 2) (1 − 𝛼)T PRb m=1 e=1 |hRbEme |
(1 − 𝛼)T PR j m=1 e=1 |hR jEme | STAS
CRbE = log2 1 + .
CR jE = log2 1 + . (8) 2 N0
2 N0
(14)
The secrecy capacity of STAS scheme can be calculated as
The secrecy capacity was defined as the difference between
the main link capacity and the wiretap link capacity [11], [25]. [ STAS ]
STAS +
Therefore the secrecy capacity of this system can be defined as
STAS
Cse,b = CRbD − CRbE . (15)
[ ]+ It is worth noting that the best antenna selection for D can be

Cse, j = CR jD − CR jE , (9)
regarded as equivalent to random antenna selection for Es and
∑M ∑NE 2
PR [11], [31], therefore, the PDFs of m=1 e=1 |hRbEme | and
where [x]+ = max{x, 0}. ∑M ∑NE
2 2 2
|hRbP | are the same as m=1 e=1 |hR jEme | and |hR jP | .
2.2 Optimal transmit antenna selection

scheme 2.4 The space-time transmission scheme
In this subsection, we propose optimal transmit antenna selec- This subsection presents the conventional space-time trans-
tion (OTAS) scheme in which the antenna at R maximizing mission (STT) scheme as a benchmark [36], [39]. In the STT
the secrecy capacity of secondary system is selected to transmit scheme, all antennas at R are used to transmit messages to D
JIANG ET AL. 231
with the same power PRSTT STT

j , where the PR j is shown as
where I1 and I2 can be obtained as
( )
∑NR 𝛾I ∑
NR
| |2 ∑
NS
𝛾I
⎛ a𝜌PT 2 ⎞
j =1 |hPR j |
2
P I1 = Pr |hSiR j | < 𝛼1 ,a𝛾T |hPSi | > , (23)
= min ⎜ , ∑N I ⎟. |hSiP | j =1 | |
2 2
PRSTT (16) i=1 |hSiP |
j ⎜ NR 2⎟
j =1 |hR jP | ⎠
R
⎝
and (
Thus the secrecy capacity of STT scheme can be obtained as ∑
NS
∑| 2
NR
|2
I2 = Pr a𝛾T |hPSi | |hSiR j | < 𝛼1 ,
[ STT ] i=1 j =1 | |
STT + ) (24)
STT
Cse,b = CRD − CRE , (17) ∑
NS
2 𝛾I
a𝛾T |hPSi | < 2 ,
i=1 |hSiP |
STT STT
where the CRD and CRE are given, respectively, by
2R0
P P
∑NR ∑ND where 𝛼1 = 2 (1−𝛼)T − 1, 𝛾T = T and 𝛾I = I .
⎛ 2⎞
(1 − 𝛼)T PRSTT d =1 |hR jDd |
N0 N0
⎜ j j =1
⎟ (18) ∑NR ∑NS
STT
CRD = log2 1 + Denoting X = j =1
2
|hSiR j | , Y = i=1 |hPSi |
2
and
2 ⎜ N0 ⎟
⎝ ⎠ 2
Z = |hSiP | . Therefore, the cumulative distribution functions
(CDFs) of X and Y can be written as [39]
and
NR −1
∑ 1
STT
CRE =
(1−𝛼)T
FX (x) = 1 − e−𝜆SR x (𝜆SR x )k , (25)
2 k!
∑NR ∑M ∑NE k=0
⎛ 2⎞
PRSTT j =1 e=1 |hR jEme | . (19)
× log2 ⎜1 + ⎟
j m=1
and
⎜ N0 ⎟ NS −1
⎝ ⎠ ∑ 1
FY (y) = 1 − e−𝜆PS y (𝜆PS y )k , (26)
k=0
k!
3 EXACT SECRECY OUTAGE 1 1
PROBABILITY ANALYSIS where 𝜆SR = and 𝜆PS = . Therefore, I1 can be obtained
ΩSR ΩPS
as
In this subsection, we analyze the SOP for OTAS, STAS and ∞ ( )[ ( )]
STT schemes and derive the exact closed-form SOP expres- 𝛼1 z 𝛾I
I1 = FX 1 − FY fZ (z )dz
sions for the three schemes over Rayleigh fading channels. The ∫0 𝛾I a𝛾T z
SOP is defined as the probability that the secrecy capacity is less
NS −1 ( )t ( ) 1−t
than a predefined threshold Rs [11], [25]. Therefore, the SOP of ∑ 2𝜆SP 𝜆PS 𝛾I 𝜆PS 𝛾I 2
the system can be formulated as =
t =0
t! a𝛾T a𝛾T 𝜆SP
( ) ( √ )
Psout = Pr (H = H0 ) Pr Cse, j < RS + Pr (H = H1 ), (20) NR −1 NS −1
∑ ∑ 2𝜆SP
𝜆SP 𝜆PS 𝛾I
× K1−t 2 −
a𝛾T k=0 t =0
k!t !
where Cse, j is given by (9).
1−t +k
3.1 OTAS scheme ⎛ ⎞ 2

( )k ( )t ⎜ ⎟
𝜆SR 𝛼1 𝜆PS 𝛾I ⎜ 𝜆PS 𝛾I
× ( )⎟
The definition of SOP for OTAS scheme can be expressed as 𝛾I a𝛾T ⎜ 𝜆SR 𝛼1 ⎟
( ) ⎜ a𝛾T 𝜆SP + ⎟
⎝ 𝛾I ⎠
OTAS
Psout = Pr (H = H0 ) Pr Cse,b
OTAS
< RS + Pr (H = H1 ).
√ ( )⎞
⎛
𝜆PS 𝛾I 𝜆 𝛼
(21) × K1−t +k ⎜2 𝜆SP + SR 1 ⎟, (27)
⎜ a𝛾T 𝛾I ⎟
⎝ ⎠
As mentioned above, H = H0 represents the case that R
achieves successful decoding, which means the channel capacity where Km (x) is the modified Bessel function of second kind for
of S -R is greater than R0 . Thus we can formulate Pr(H = H0 ) order m [41].
as ∑NS 2
( ) Letting U = i=1 |hPSi | , and the probability density func-
tion (PDF) of U is given by [39]
Pr (H = H0 ) = Pr max CSiR > R0
1≤i≤NS
(22) N
∏
NS 𝜆PSS
=1− [I1 + I2 ], fU (u) = uNS −1 e−𝜆PS u . (28)
i=1
(NS − 1 )!
232 JIANG ET AL.
Thus the I2 can be rewritten as and

∞ ( ) ( ) NR −1 ( )k
𝛼1 𝛾I
N
𝜆PSS ∑ 1 𝜆SR 𝛼1
I2 = FX FZ f (u)du, Φ3 =
∫0 a𝛾T u a𝛾T u U (NS − 1 )! k=0 k! a𝛾T
(29)
𝜆 𝛾
∞ − 𝜆SR 𝛼1 − SP I −𝜆 u
= 1 − Φ 1 − Φ2 + Φ3 ,
× e
a𝛾T u a𝛾T u PS uNS −k−1 du
∫0
where the Φ1 , Φ2 and Φ3 can be computed as
NR −1 ( )k ( ) NS −k
∑ 1
2𝜆PSS
N
𝜆SR 𝛼1 𝜆SR 𝛼1 + 𝜆SP 𝛾I 2
N
𝜆PSS ∞ 𝜆 𝛾 =
− SP I −𝜆PS u N −1 (NS − 1 )! k=0 k! a𝛾T a𝛾T 𝜆PS
Φ1 = e a𝛾T u u S du
(NS − 1 )! ∫0 √
⎛ 𝜆PS (𝜆SR 𝛼1 + 𝜆SP 𝛾I ) ⎞⎟
N ( ) NS ( √ ) × KNS −k ⎜2 . (32)
2𝜆PSS 𝜆SP 𝛾I 2 𝜆PS 𝜆SP 𝛾I ⎜ a𝛾T ⎟
= KNS 2 , ⎝ ⎠
(NS − 1 )! a𝛾T 𝜆PS a𝛾T
Substituting Φ1 , Φ2 and Φ3 from (30), (31) and (32) into (29),
(30)
the I2 can be obtained. Finally, substituting I1 and I2 from (27)
and (29) into (22), we can derive Pr(H = H0 ).
N ( )
NR −1
𝜆PSS ∑ 1 𝜆SR 𝛼1 k Additionally, the Pr(H = H1 ) can be formulated as
Φ2 =
(NS − 1 )! k=0 k! a𝛾T
Pr (H = H1 ) = 1 − Pr (H = H0 ), (33)
∞ 𝜆 𝛼
− SR 1 −𝜆PS u N −k−1 where Pr(H = H0 ) is given by (22).
× e a𝛾T u u S du
∫0 OTAS
Afterwards, Pr(Cse,b < RS ) can be calculated and
2Rs
expressed as (34) at the top of next page, where 𝛼2 = 2 (1−𝛼)T .
( ) ( ) NR
∏ ( )
OTAS
Pr Cse,b < RS = Pr max CR jD − CR jE < RS = Pr CR jD − CR jE < RS
1≤ j ≤NR j =1
⎡
⎢ ( ∑ND 2 ∑M ∑NE 2 )
NR ⎢
∏ 𝛾I d =1 |hR jDd | 𝛼2 𝛾I m=1 e=1 |hR jEme | ∑
NR
2 𝛾I
= ⎢Pr 2
< 𝛼2 − 1 + 2
, a𝜌𝛾T |hPR j | > 2
j =1 ⎢ |hR jP | |hR jP | j =1 |hR jP |
⎢⏟⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⏟⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⏟
⎣ T1
⎤
( )⎥
∑ NR
2
∑ 2
ND
∑ 2
NR
2
∑
M ∑
NE
∑ 2 𝛾I ⎥
NR
+ Pr a𝜌𝛾T |hPR j | |hR jDd | < 𝛼2 − 1 + 𝛼2 a𝜌𝛾T |hPR j | |hR jEme | , a𝜌𝛾T |hPR j | < 2 ⎥
.
j =1 d =1 j =1 m=1 e=1 j =1 |hR jP | ⎥
⏟⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⏟⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⏟⎥
T2 ⎦
(34)
∑ND 2 ∑NR 2
Denoting X = d =1 |hR jDd | , Y = j =1 |hPR j | , V =
2 ∑M ∑NE 2
N (
NR −1 ) ( ) NS −k |hR jP | and U = m=1 e=1 |hR jEme | , the T1 can be rewritten
2𝜆PSS ∑ 1 𝜆SR 𝛼1 k 𝜆SR 𝛼1 2
as
=
(NS − 1 )! k=0 k! a𝛾T a𝛾T 𝜆PS [ ( )]
∞
𝜉
( √ ) T1 = G1 (v ) 1 − FY fV (v )dv, (35)
𝜆PS 𝜆SR 𝛼1 ∫0 v
× KNS −k 2 , (31)
a𝛾T
JIANG ET AL. 233
𝛾I where the G2 (y) can be obtained as

where 𝜉= and we have
a𝜌𝛾T
∞ ( )
𝛽
∞ G2 ( y ) = FX + 𝛼2 u fU (u )du
∫0 y
G1 ( v ) = FX (𝜃v + 𝛼2 u ) fU (u )du
∫0 ( )
𝛽 ND −1 ( )k
∞ −𝜆RD +𝛼 u ∑ 𝜆RD
k
y 2 𝛽
MN D −1 ∑
𝜆RE E e−𝜆RD 𝜃v N∑ k
𝜆RD
k
𝜃k−l v k−l 𝛼2 l = 1− e + 𝛼2 u
∫0 k! y
= 1− k=0
(MNE − 1 )! k=0 l =0
(k − l )!l !
MN
𝜆RE E
× uMNE −1 e−𝜆RE u du
∞ (MNE − 1 )!
× uMNE −1+l e−𝜆RE u−𝜆RD 𝛼2 u du
∫0 𝛽𝜆RD ND −1 k
∑ ∑
−
= 1−e y E2 y−l , (39)
ND −1 k k=0 l =0
∑ ∑
= 1 − e−𝜆RD 𝜃v E1 v k−l , (36)
where
k=0 l =0
MN
where 𝜆RE E 𝜆RD
k
𝛽 l 𝛼2 k−l (MNE − 1 + k − l )!
E2 = MNE +k−l
,
𝛼 −1 (MNE − 1)!(k − l )!l !(𝜆RE + 𝜆RD 𝛼2 )
𝜃= 2 ,
𝛾I 𝛼2 − 1
𝛽=
𝜌a𝛾T
MN and the second equation is obtained by using the binomial

𝜆RE E 𝜆RD
k
𝜃k−l 𝛼2 l (MNE − 1 + l )!
E1 = MNE +l
expansion. Substituting (39) into (38), T2 can be rewritten as
(MNE − 1)!(k − l )!l !(𝜆RE + 𝜆RD 𝛼2 )
∞[ ][ ND −1 k
]
𝜆 𝜉
− RP −
𝛽𝜆RD ∑ ∑
and the second equation is obtained by using the bino- T2 = 1−e y 1−e y E2 y−l
∫0 k=0 l =0
mial expansion.
Substituting (36) into (35), the T1 can be obtained as N
𝜆PRR
[ ] × yNR −1 e−𝜆PR y dy
∞ ND −1 k
∑ ∑ (NR − 1 )!
T1 = 1 − e−𝜆RD 𝜃v E1 v k−l
∫0 k=0 l =0
= 1 − Φ4 − Φ 5 + Φ 6 , (40)
NR −1 ( )t where the Φ4 , Φ5 and Φ6 can be computed as

𝜆 𝜉
− PR ∑ 𝜆PR
t
𝜉
×e v 𝜆RP e−𝜆RP v dv
t! v ND −1 k N ∞
t =0 ∑ ∑ E2 𝜆PRR −𝜆PR y−
𝛽𝜆RD
Φ4 = yNR −1−l e y dy
( ) 1−t (NR − 1 )! ∫0
NR −1
∑ t
2𝜆PR 𝜉 t 𝜆RP 𝜆PR 𝜉 2 ( √ ) k=0 l =0
= K1−t 2 𝜆PR 𝜉𝜆RP N ( ) NR −l
t =0
t! 𝜆RP ND −1 k
∑ ∑ 2E2 𝜆PRR 𝛽𝜆RD 2
=
k=0 l =0
(NR − 1 )! 𝜆PR
NR −1 ND −1 k ( ) k−l −t +1
∑ ∑ ∑ t
2𝜆PR 𝜉 t E1 𝜆RP 𝜆PR 𝜉 2 ( √ )
− × KNR −l 2 𝛽𝜆RD 𝜆PR ,
t =0 k=0 l =0
t! 𝜆RP + 𝜆RD 𝜃 (41)
( √ )
× Kk−l −t +1 2 𝜆PR 𝜉 (𝜆RP + 𝜆RD 𝜃 ) . (37) N ∞
𝜆PRR 𝜆 𝜉
− RP −𝜆PR y N −1
Φ5 = e y y R dy
(NR − 1 )! ∫0
Additionally, the T2 can be expressed as
N ( ) NR ( √ )
∞ ( ) 2𝜆PRR𝜆RP 𝜉 2
𝜉 = KNR 2 𝜆RP 𝜉𝜆PR , (42)
T2 = ( )
G2 y FV f (y )dy, (38) (NR − 1 )! 𝜆PR
∫0 y Y
234 JIANG ET AL.
and Denoting
ND −1 k N
∑ ∑ E2 𝜆PRR ∑
ND
Φ6 = X = max
2
|hR jDd | ,
k=0 l =0
(NR − 1 )! 1≤ j ≤NR
d =1
∞
𝛽𝜆RD 𝜆RP 𝜉
−𝜆PR y− − thus the CDF of X can be obtained as
× yNR −1−l e y y dy
∫0 [ ]NR
ND −1
∑ 1
ND −1 k N ( ) NR −l FX (x ) = 1 − e−𝜆RD x (𝜆RD x )k
∑ ∑ 2E2 𝜆PRR 𝛽𝜆RD + 𝜆RP 𝜉 2 k!
= k=0 (46)
(NR − 1 )! 𝜆PR ∑
k=0 l =0 = AxC e−Bx ,
( √ ) SS
( )
× KNR −l 2 𝛽𝜆RD + 𝜆RP 𝜉 𝜆PR . (43) where
{ ND +1
}
Substituting Φ4 , Φ5 and Φ6 from (41), (42) and (43) into (40), ∑
SS = n1 , n2 , … , nND +1 | ni = NR ,
the T2 can be obtained. Then substituting T1 and T2 from (37)
i=1
OTAS
and (40) into (34), the Pr(Cse,b < RS ) can be derived. Finally,
OTAS ( p−1 )n p
the SOP of OTAS scheme Psout can be calculated by combin- NR ! ∏
ND
𝜆RD
ing (22), (33) and (34). A= − ,
ND +1
∏ p=1
(p − 1)!
ni !
i=1
B = 𝜆RD (NR − nND +1 ),

3.2 STAS scheme
As noted above, the definition of SOP for STAS scheme can be ∑

ND
C = n p (p − 1)
formulated as p=1
( )
STAS
Psout = Pr (H = H0 ) Pr Cse,bSTAS
< RS + Pr (H = H1 ), and the second equation is obtained by using the multino-
mial theorem.
(44)
Therefore, T3 can be rewritten as
STAS
where Cse,b STAS
is given by (15). Thus the Pr(Cse,b < RS ) ∞ [ ( )]
𝜉
can be computed and expressed as (45) at the top of next T3 = J1 v 1 − FY
( ) fV (v )dv, (47)
∫0 v
page.
⎛ 𝛾I max ∑ND |hR jDd |2 ∑M ∑NE ⎞

( ) ⎜ 1≤ j ≤NR d =1 𝛼2 𝛾I m=1 e=1 |hR jEme |
2
∑
NR
𝛾I ⎟
2
Pr Cse,b < RS = Pr ⎜
STAS
2
< 𝛼2 − 1 + 2
, a𝜌𝛾T |hPR j | > 2⎟
⎜ |hR jP | |hR jP | j =1 |hR jP | ⎟
⎝ ⎠
⏟⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⏟⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⏟
T3
( )
∑
NR
2
∑
ND
2
∑
NR
2
∑
M ∑
NE
2
∑
NR
2 𝛾I
+ Pr a𝜌𝛾T |hPR j | max |hR jDd | < 𝛼2 − 1 + 𝛼2 a𝜌𝛾T |hPR j | |hR jEme | , a𝜌𝛾T |hPR j | < .
1≤ j ≤NR |hR jP |
2
j =1 d =1 j =1 m=1 e=1 j =1
⏟ ⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴ ⏟ ⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴ ⏟
T4
(45)
JIANG ET AL. 235
where J1 (v) can be computed as Additionally, T4 can be rewritten as

∞ ∞ ( )
𝜉
J1 (v ) = FX (𝜃v + 𝛼2 u ) fU (u )du T4 = J2 (y )FV f (y )dy, (52)
∫0 ∫0 y Y
∞
∑
A(𝜃v + 𝛼2 u ) e−B (𝜃v+𝛼2 u )
C
= where J2 (y) can be obtained as
SS ∫0 (48)
∞ ( )
MN
𝜆RE E 𝛽
J2 (y ) = FX + 𝛼2 u fU (u )du
× uMNE −1 e−𝜆RE u du. ∫0 y
(MNE − 1 )!
( )
∞ ( )C
C
∑ 𝛽 −B
𝛽
+𝛼2 u
Using the binomial expansion, the (𝜃v + 𝛼2 u) can be = A + 𝛼2 u e y
∫0 y
expressed as SS
MN
𝜆RE E
∑
C
C !𝜃C −l vC −l 𝛼2 l ul × uMNE −1 e−𝜆RE u du
(𝜃v + 𝛼2 u )C = . (49) (MNE − 1 )!
l =0
(C − l )!l !
−
B𝛽 ∑∑
C
Substituting (49) into (48), J1 (v) can be derived as =e y E4 y−C +l , (53)

SS l =0
∑∑
C
where
J1 (v ) = e−B𝜃v E3 vC −l , (50)
SS l =0
AC !𝛽C −l 𝛼2 l 𝜆RE E (l + MNE − 1)!
MN
E4 = l +MNE
where (C − l )!l !(MNE − 1)!(B𝛼2 + 𝜆RE )
AC !𝜃C −l 𝛼2 l 𝜆RE E (l + MNE − 1)!

MN
and the second equation is obtained by using the bino-
E3 = l +MNE
.
(C − l )!l !(MNE − 1)!(B𝛼2 + 𝜆RE ) mial expansion.
Substituting J2 (y) from (53) into (52), we can obtain the T4 as
Combining (50) and (47), we can obtain the T3 as (54) at the top of next page, where
∑∑ R −1 E 𝜆t 𝜉 t 𝜆
C N∑ ⎧ (NR − C + l − 1 )! , N = n
3 PR RP
⎪ N −C +l R ND +1
T3 = 𝜆PRR
SS l =0 t =0
t! ⎪
Ψ1 = ⎨ .
⎪ ( B𝛽 ) 2
NR −C +l
∞ 𝜆 𝜉
( √ )
− PR −B𝜃v−𝜆RP v ⎪2 KNR −C +l 2 𝜆PR B𝛽 , NR ≠ nND +1
× vC −l −t e v dv ⎩ 𝜆PR
∫0
N [ ∞ ∞ ]
∑∑ C
𝜆PRR E4 B𝛽
− −𝜆PR y
B𝛽 𝜆 𝜉
− −𝜆PR y− RP
T4 = y NR −C +l −1 e y dy − y NR −C +l −1 e y y dy
SS l =0
(NR − 1 )! ∫0 ∫0
(54)
( ) NR −C +l ( √ )⎤
𝜆PRR E4 ⎡
N
∑∑ C
B𝛽 + 𝜆 𝜉 2
= ⎢Ψ1 − 2 RP
KNR −C +l 2 𝜆PR (B𝛽 + 𝜆RP 𝜉) ⎥.
(NR − 1 )! ⎢ 𝜆PR ⎥
SS l =0 ⎣ ⎦
R −1 2E 𝜆t 𝜉 t 𝜆 ( ) C −t −l +1
∑∑
C N∑
3 PR RP 𝜆PR 𝜉 2
Substituting T3 and T4 from (51) and (54) into (45), the
=
SS l =0 t =0
t ! B𝜃 + 𝜆RP STAS
Pr(Cse,b < RS ) can be derived as (55) at the top of next page.
( √ ) Substituting (55) into (45), we can obtain the SOP of STAS
STAS
×KC −t −l +1 2 𝜆PR 𝜉 (B𝜃 + 𝜆RP ) . (51) scheme Psout .
236 JIANG ET AL.
( ) ∑∑ C N∑R −1 2E 𝜆t 𝜉 t 𝜆 ( ) C −t −l +1
( √ )
3 PR RP 𝜆PR 𝜉 2
STAS
Pr Cse,b < RS = × KC −t −l +1 2 𝜆PR 𝜉 (B𝜃 + 𝜆RP )
SS l =0 t =0
t! B𝜃 + 𝜆RP
( ) NR −C +l ( √ ) (55)
𝜆PRR E4 ⎡ ) ⎤
N
∑∑ C
B𝛽 + 𝜆 𝜉 2 (
+ ⎢Ψ −2 RP
KNR −C +l 2 𝜆PR B𝛽 + 𝜆RP 𝜉 ⎥.
(NR − 1 )! ⎢ 1 𝜆PR ⎥
SS l =0 ⎣ ⎦
∞
K1 (y ) = FX (𝜃y + 𝛼2 u ) fU (u )du
∫0
NR ND −1 k MN N
∑ ∑ 𝜆RD
k
𝜃k−l 𝛼2l 𝜆RE R E yk−l
3.3 STT scheme = 1 − e𝜆RD 𝜃y
k=0 l =0
l !(k − l )!(MNR NE − 1 )!
The SOP of STT scheme can be defined as ∞
( ) × uMNR NE −1+l e−𝜆RE u−𝜆RD 𝛼2 u du
STT
Psout = Pr (H = H0 ) Pr Cse,b
STT
< RS + Pr (H = H1 ), (56) ∫0
NR ND −1 k
∑ ∑
where STT
Cse,b is given by (17). Thus the STT
Pr(Cse,b < RS ) can be = 1 − e−𝜆RD 𝜃y E5 yk−l , (59)
expressed as (57) at the top of next page. k=0 l =0
∑NR ∑ND ∑NR ∑M ∑NE ∑NR

⎛𝛾 |hR jDd |
2
𝛼2 𝛾I
2
|hR jEme | a𝜌𝛾T |hPR j |
2 ⎞
( ) ⎜ I j =1 d =1 j =1 m=1 e=1 j =1 𝛾I ⎟
Pr Cse,b < RS = Pr ⎜
STT
∑NR < 𝛼2 − 1 + ∑NR , > ∑NR ⎟
⎜ 2 2 NR 2⎟
|hR jP | |hR jP | |hR jP |
⎝ j =1 j =1 j =1 ⎠
⏟ ⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴ ⏟ ⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴ ⏟
T5
∑NR ∑NR ∑ND ∑NR ∑NR ∑M ∑NE ∑NR

⎛ a𝜌𝛾 |hPR j |
2
|hR jDd |
2
𝛼2 a𝜌𝛾T |hPR j |
2 2
|hR jEme | a𝜌𝛾T |hPR j |
2 ⎞
⎜ T
j =1 j =1 d =1 j =1 j =1 m=1 e=1 j =1 𝛾 ⎟
+ Pr ⎜ < 𝛼2 − 1 + , < ∑N I ⎟.
⎜ NR NR NR R 2⎟
|hR jP |
⎝ j =1 ⎠
⏟⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⏟⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⎴⏟
T6
(57)
where
∑NR ∑ND 2 ∑NR 2
Denoting X = j =1 d =1 |hR jDd | , V = j =1 |hPR j | , 𝜆RD
k MN NE
𝜃k−l 𝛼2l 𝜆RE R (MNR NE − 1 + l )!
∑NR ∑M ∑NE 2 ∑NR 2 E5 = .
U = j =1 m=1 e=1 |hR jEme | and Y = j =1 |hR jP | . Thus l !(k − l )!(MNR NE − 1)!(𝜆RE + 𝜆RD 𝛼2 )
MNR NE +l
the T5 can be rewritten as
Combining (58) and (59), the T5 can be computed as (60) at the
∞ [ ( )]
𝜉2 top of this page.
T5 = K1 (y ) 1 − FV fY (y )dy, (58)
∫0 y
NR −1 N ∞
∑ 𝜆PR t
𝜉2t 𝜆RPR 𝜆 𝜉
− PR 2 −𝜆RP y
T5 = yNR −1−t e y dy
where 𝜉2 = 𝜉NR and the K1 (y) can be obtained as t =0
t !(NR − 1 )! ∫0
JIANG ET AL. 237
NR −1 NR ND −1 k
∑ ∑ ∑ E5 𝜆PR
t
𝜉2t 𝜆RPR
N NR ND −1 k ( ) NR +l −k
∑ ∑ 2E6 𝜆PR NR
𝜆RD 𝛽2 2
− −
t =0 k=0 l =0
t !(NR − 1 )! k=0 l =0
(NR − 1 )! 𝜆PR
∞ 𝜆PR 𝜉2
( √ )
− −𝜆RP y−𝜆RD 𝜃y × KNR +l −k 2 𝜆PR 𝜆RD 𝛽2
× yNR −1−t +k−l e y dy
∫0
NR −1 NR ND −1 k ( ) NR +l −t −k
∑ ∑ ∑ 𝜆RP 𝜉2 + 𝜆RD 𝛽2
( ) NR −t
2
NR −1
∑ t
2𝜆PR
N
𝜉2t 𝜆RPR
𝜆PR 𝜉2 ( √ ) +
=
2
KNR −t 2 𝜆PR 𝜉2 𝜆RP t =0 k=0 l =0
𝜆PR
t =0
t !(NR − 1 )! 𝜆RP
N ( √ )
2E6 𝜆RP
t
𝜉2t 𝜆PRR ( )
NR −1 NR ND −1 k ( ) NR −l −t +k × KNR +l −t −k 2 𝜆PR 𝜆RD 𝛽2 + 𝜆RP 𝜉2 .
∑ ∑ ∑ 𝜆PR 𝜉2 2 t !(NR − 1 )!
−
t =0 k=0 l =0
𝜆RP + 𝜆RD 𝜃 (63)
2E5 𝜆PR
t N
𝜉2t 𝜆RPR ( √ ) Substituting T5 and T6 from (60) and (63) into (57), the
× KNR −l −t +k 2 𝜆PR 𝜉2 (𝜆RP + 𝜆RD 𝜃 ) .
t !(NR − 1 )!
STT
Pr(Cse,b < RS ) can be derived. Substituting (57) into (56), the
STT
(60) Psout can be obtained.
Furthermore, the T6 can be rewritten as

3.4 Iterative optimal time switching
∞ ( ) algorithm
𝜉2
T6 = K2 (v )FY fV (v )dv, (61)
∫0 v In this subsection, we propose a golden search iterative method
to obtain the optimal time-switching ratios by minimizing the
where the K2 (v) can be obtained as SOPs of the OTAS, STAS and STT schemes. The proposed iter-
∞ ( ) ative algorithm is given as follows.
𝛽2
K2 (v ) = FX + 𝛼2 u fU (u )du
∫0 v
NR ND −1 k
∑ ∑ MN N 4 ASYMPTOTIC SECRECY OUTAGE
−
𝜆RD 𝛽2 𝜆RD
k
𝛽2k−l 𝛼2l 𝜆RE R E
= 1−e v PROBABILITY ANALYSIS
k=0 l =0
l !(k − l )!(MNR NE − 1 )!v k−l
∞ To obtain more insights, this section analyzes the asymptotic
× uMNR NE −1+l e−𝜆RE u−𝜆RD 𝛼2 u du SOP for OTAS, STAS and STT schemes in the high SNR
∫0
region. And the secrecy diversity orders of the three schemes are
𝜆RD 𝛽2
NR ND −1 k
∑ ∑ derived. Similar to [11], [17] and [38], we suppose that the aver-
−
= 1−e v E6 v −k+l , (62) age channel power gains ΩRD → ∞ and ΩSR = 𝜀ΩRD , where 𝜀
k=0 l =0 is constant.
where
MN NE 4.1 OTAS scheme
𝜆RD
k
𝛽2k−l 𝛼2l 𝜆RE R (MNR NE − 1 + l )!
E6 = MNR NE +l
, OTAS,∞
l !(k − l )!(MNR NE − 1)!(𝜆RE + 𝜆RD 𝛼2 ) Utilizing (21), (22) and (34), the Psout can be rewritten as
( ( )NS )( ∞ )NR
𝛽2 = NR 𝛽 . Substituting (62) into (61), the T6 can be derived as OTAS,∞
Psout = 1 − I1∞ + I2∞ T1 + T2∞
(63) shown on next page. (64)
( )NS
[ ] + I1∞ + I2∞ ,
∞ NR ND −1 k
𝜆PRR
N
−
𝜆RD 𝛽2 ∑ ∑
T6 = 1−e v E6 v −k+l where I1∞ , I2∞ , T1∞ and T2∞ is the asymptotic expression for I1 ,
(NR − 1 )! ∫0 k=0 l =0
I2 , T1 and T2 with ΩRD → ∞, respectively.
[ NR −1
]
𝜆RP 𝜉2 ∑ 𝜆RPt
𝜉2t N −1 −𝜆 v According to [11, Lemma 2], the asymptotic CDFs of
× 1−e
−
v R e PR dv ∑ND 2 ∑NR 2
X = d =1 |hR jDd | and W = j =1 |hSiR j | can be formulated
v
t =0
t !vt
as
NR −1 ( ) NR −t ( √ )
∑ 2𝜆RP t N
𝜉2t 𝜆PRR 𝜆RP 𝜉2 2
= 1− KNR −t 2 𝜆PR 𝜉2 𝜆RP FX∞ (x ) = 1 − e−𝜆RD x
t =0
t !(NR − 1 )! 𝜆PR
238 JIANG ET AL.
( ) ∞
(𝜆RD x )ND ( N ) and Γ(𝛼, x) = ∫x e−t t 𝛼−1 dt is the upper incompletely Gamma
× e𝜆RD x − +o x D (65)
ND ! function [42].
Combining (36) and (65), we obtain
(𝜆RD x )ND ( ) ∞
= + o x ND
ND ! G1∞ (v ) = FX∞ (𝜃v + 𝛼2 u ) fU (u )du
∫0
and (69)
∑
ND
Ξ1 v ND −k ,
N
( ) = 𝜆RDD
(𝜆 w )NR
FW∞ (w ) = SR + o w NR . (66) k=0
NR !
where
Combining (23), (24) and (66), the I1∞ and I2∞ can be com-
puted as 𝜃ND −k 𝛼2k (MNE − 1 + k)!
Ξ1 =
( )NR (MNE − 1)!k!(ND − k)!𝜆RE
k
∞ 𝜆SR 𝛼1 z 𝜆 𝛾
− PS I
I1∞ = e a𝛾T z
∫0 N
𝛾I R NR !
Substituting (69) into (35), we have
( ) ∞ [ ( )]
NS −1
∑ 1 𝜆PS 𝛾I t 𝜉
× 𝜆SP e−𝜆SP z dz T1∞ = G1∞ (v ) 1 − FY fV (v )dv
∫0 v
t =0
t ! a𝛾 T z
NR −1 ND
NS −1
NR NR t ∑ ∑ 2𝜆PR
t
𝜉 t Ξ1 𝜆RP
∑ 2𝜆SR 𝛼1 𝜆PS 𝜆SP = 𝜆RDD
N
(70)
= t =0 k=0
t!
NR −t t t
t =0 NR !t !𝛾I 𝛾T a
( ) ND −k−t +1 ( √ )
( ) NR −t +1 ( √ ) 𝜆PR 𝜉 2
𝜆PS 𝛾I 2 𝜆PS 𝛾I 𝜆SP × KND −k−t +1 2 𝜆PR 𝜉𝜆RP .
× KNR −t +1 2 (67) 𝜆RP
a𝛾T 𝜆SP a𝛾T
Combining (39) and (65), the G2∞ (y) can be expressed as
and
∞ ( )
[ 𝜆 𝛾 ]
𝛽
∞
(𝜆SR 𝛼1 ) NR
− SP I G2∞ (y ) = FX∞ + 𝛼2 u fU (u )du
I2∞ = 1 − e a𝛾T u ∫0 y
∫0 ( )NR
a𝛾T u NR ! (71)
∑
ND
y−ND +k ,
N
N = 𝜆RDD Ξ2
𝜆PSS
× uNS −1 e−𝜆PS u du k=0
(NS − 1 )!
NS
where
(𝜆SR 𝛼1 )NR 𝜆PS Δ1
= ( )NR 𝛽 ND −k 𝛼2k (MNE − 1 + k)!
a𝛾T NR !(NS − 1 )! Ξ2 = .
(MNE − 1)!k!(ND − k)!𝜆RE
k
N N
2(𝜆SR 𝛼1 ) R 𝜆PSS
−( )NR Substituting (71) into (38), we can derive the T2∞ as
a𝛾T NR !(NS − 1 )!
∞ ( )
( ) NS −NR ( √ ) 𝜉
𝜆SP 𝛾I 2 𝜆PS 𝜆SP 𝛾I T2∞ = G2∞ (y )FV f (y )dy
× KNS −NR 2 , (68) ∫0 y Y
a𝛾T 𝜆PS a𝛾T
N
N ∑
ND
Ξ2 𝜆PRR Δ2
= 𝜆RDD
where
k=0
(NR − 1 )!
⎧ (NS − NR − 1)! , NS − NR > 0 ∑

ND ( ) NR −ND +k
⎪ N −N N 𝜆RP 𝜉 2
⎪ 𝜆PSS R − 2𝜆RDD
Δ1 = ⎨ , k=0
𝜆PR
⎪ Γ(NS − NR , 0)
⎪ N −N
, NS − NR ≤ 0 Ξ2 𝜆PRR
N ( √ )
⎩ 𝜆PSS R × KNR −ND +k 2 𝜆PR 𝜉𝜆RP , (72)
(NR − 1 )!
JIANG ET AL. 239
where Combining (53) and (74), we arrive at

( )
⎧ (NR − ND + k − 1)! ∞
𝛽
⎪ N −N +k
, NR − ND + k > 0 J2∞ (y ) = FX∞ + 𝛼2 u fU (u )du
⎪ 𝜆PRR D ∫0 y
Δ2 = ⎨ .
⎪ Γ(NR − ND + k, 0) , NR − ND + k ≤ 0 ∑
ND NR
Ξ4 y−ND NR +k ,
N N
⎪ N −N +k
𝜆PRR D = 𝜆RDD R (77)
⎩ k=0
Substituting I1∞ , I2∞ , T1∞ and T2∞ from (67), (68), (70) and where
OTAS,∞
(72) into (64), the asymptotic SOP of OTAS scheme Psout
can be obtained. (ND NR )!𝛽 ND NR −k 𝛼2k (MNE − 1 + k)!
Ξ4 = .
(MNE − 1)!k!(ND NR − k)!𝜆RE
k
(ND !)NR
4.2 STAS scheme
Substituting (77) into (52), the T4∞ can be obtained as
Combining (22), (44) and (45), the asymptotic SOP of STAS ( )
∞
scheme can be expressed as 𝜉
T4∞ = J2∞ (y )FV f (y )dy
( ( )NS )( ∞ ) ∫0 y Y
STAS,∞
Psout = 1 − I1∞ + I2∞ T3 + T4∞
NR
∑ 𝜆PR
ND NR
E4 Δ3
( )
∞ NS =
N N
𝜆RDD R
+ I1∞ + I2 , (73) ( NR − 1 )!
k=0
where T3∞ and T4∞ is the asymptotic expression for T3 and T4 ( ) −ND NR +k+NR
with ΩRD → ∞, respectively. N N ∑
ND NR
𝜆RP 𝜉 2
∑ND − 2𝜆RDD R
The asymptotic CDF of X = max1≤ j ≤NR d =1
2
|hR jDd | can k=0
𝜆PR
be formulated as
N
𝜆PRR E4 ( √ )
(𝜆RD x )ND NR
FX∞ (x ) ≈ . (74) × K−ND NR +k+NR 2 𝜆PR 𝜉𝜆RP , (78)
(NR − 1 )!
(ND ! )NR
where
Combining (48) and (74), we obtain
∞ ⎧ (−ND NR + k + NR − 1 )! , −ND NR + k + NR > 0
J1∞ (v ) = FX∞ (𝜃v + 𝛼2 u ) fU (u )du ⎪ −N N +k+NR
𝜆PR D R
∫0 ⎪
Δ3 = ⎨ .
∑
ND NR ⎪ Γ(−ND NR + k + NR , 0 )
⎪ , −ND NR + k + NR ≤ 0
Ξ3 v ND NR −k ,
N NR
= 𝜆RDD (75) ⎩ −N N +k+NR
𝜆PR D R
k=0
where Substituting I1∞ , I2∞ , T3∞ and T4∞ from (67), (68), (76) and
STAS,∞
(78) into (73), the asymptotic SOP of STAS scheme Psout
(ND NR )!𝜃ND NR −k 𝛼2k (MNE − 1 + k)!
Ξ3 = . can be obtained.
k
(ND !)NR
Substituting (75) into (47), the T3∞ can be calculated as

4.3 STT scheme
∞ [ ( )]
𝜉
T3∞ = ∞( )
J v 1 − FY fV (v )dv Combining (22), (56) and (57), the asymptotic SOP of STT
∫0 1 v scheme can be expressed as
NR −1 ND NR
∑ ∑ 2𝜆PR
t N N
𝜉 t Ξ3 𝜆RDD R 𝜆RP ( ( )NS )( ∞ )
=
STT,∞
Psout = 1 − I1∞ + I2∞ T5 + T6∞
t =0 k=0
t!
( )NS
( ) ND NR −k−t +1 + I1∞ + I2∞ , (79)
𝜆PR 𝜉 2 ( √ )
× KND NR −k−t +1 2 𝜆PR 𝜉𝜆RP .
𝜆RP where T5∞ and T6∞ is the asymptotic expression for T5 and T6
(76) with ΩRD → ∞, respectively.
240 JIANG ET AL.
∑NR ∑ND 2 ND NR NR −1 ( ) −ND NR −t +k+NR

The asymptotic CDF of X = j =1 d =1 |hR jDd | can be ∑ ∑ 𝜆RP 𝜉2 2
N N
formulated as − 𝜆RDD R
k=0 t =0
𝜆PR
(𝜆 x )ND NR N t ( √ )
FX∞ (x ) ≈ RD . (80) 2Ξ6 𝜆PRR 𝜆RP 𝜉2t
(ND NR )! × K−ND NR −t +k+NR 2 𝜆PR 𝜉2 𝜆RP .
(NR − 1 )!t !
Combining (59) and (80), we obtain (84)
∞
Substituting I1∞ , I2∞ , T5∞ and T6∞ from (67), (68), (82) and
K1∞ (y ) = FX∞ (𝜃y + 𝛼2 u ) fU (u )du
∫0 (84) into (79), the asymptotic SOP of STAS scheme Psout STT,∞
can
be obtained.
∑
ND NR
Remark: Based on the definition of secrecy diversity order
Ξ5 yND NR −k ,
N NR
= 𝜆RDD (81) ∞
log Psout
k=0 as d = −limΩRD →∞ , we can obtain d OTAS = d STAS =
log ΩRD
d STT = NR min{NS , ND }. Obviously, the OTAS, STAS and
where
STT schemes achieve the same secrecy diversity order, which
𝜃ND NR −k 𝛼2k (NR M NE − 1 + k)! is independent of the number of antennas at eavesdroppers.
Ξ5 = .
(NR M NE − 1)!k!(ND NR − k)!𝜆RE
k
5 EXTENSION TO ARTIFICIAL NOISE

Substituting (81) into (58), the T5∞ can be calculated as AIDED EH-MIMO CR RELAY NETWORKS
∞ [ ( )]
𝜉2 In this section, we examine an extension of the aforementioned
T5∞ = K1∞ (y ) 1 − FV fY (y )dy
∫0 y TAS scheme to an artificial noise (AN) aided EH-MIMO CR
relay scenario and propose an AN aided transmit antenna selec-
ND NR NR −1 ( ) ND NR −t −k+NR
N N ∑ ∑ 𝜆PR 𝜉2 2
tion (AN-TAS) scheme. More specifically, in the first phase,
= 𝜆RDD R the S transmits signals to R, which attempts to decode the
t =0
𝜆RP
k=0 received signals. In the second phase, when an antenna Rr at R is
selected to relaying the signals to D with power Pr , the remain-
2Ξ5 𝜆PR
t N
𝜉2t 𝜆RPR ( √ ) ing NR − 1 antennas J j , j = 1, 2, … , NR − 1 at R are used as
× KND NR −t −k+NR 2 𝜆PR 𝜉2 𝜆RP . (82) jamming antennas to emit AN for interfering with the Es. Each
t !(NR − 1 )!
jamming antenna J j emits an AN signal z j , and the AN vector
Combining (62) and (80), we have z = [z1 , z2 , … , zNR −1 ]T should be normalized. The total trans-
mit power of jamming antennas is represented as Pz . For the
∞ ( )
𝛽2 sake of a fair comparison with aforementioned TAS schemes,
K2∞ (v ) = FX∞ + 𝛼2 u fU (u )du the total transmit power of all antennas at R is constrained to
∫0 v
PR , that is, Pr + Pz = PR . We define a power allocation factor 𝜇,
∑
ND NR so that Pr = 𝜇PR and Pz = (1 − 𝜇)PR . It should be pointed out
Ξ6 v −ND NR +k ,
N NR
= 𝜆RDD (83) that the total transmit power of the relay R is constrained to the
k=0 maximum interference power of the primary receiver. Similarly
to (4), the total transmit power of R can be expressed as
where
N NR −k k ⎛ ∑
NR ⎞
𝛽2 D 𝛼2 (MNE − 1 + k)! ⎜a𝜌PT | |2 ⎟
Ξ6 = . |hPR j | ,
⎜ | | ⎟
k
PR = min ⎜ j =1
⎟, (85)
PI
⎜ ⎟
Substituting (83) into (61), the T6∞ can be obtained as ⎜ 𝜇|h |
2
+ (1 − 𝜇)h zzH hH ⎟
⎝ RrP JP JP ⎠
∞ ( )
𝜉2 where hJP = [hJ1 P , hJ2 P , … , hJN −1 P ] and hJ j P denotes the fading
T6∞ = K2∞ (v )FY fV (v )dv R
∫0 v coefficient of channel from J j to the PR.
Therefore, the received signals at D can be expressed as
N
∑
ND NR
Ξ6 𝜆PRR
= 𝜆RDD
N NR
Δ3 √ √
k=0
(NR − 1 )! yD = Pr hRrD xs + Pz HD z + nd , (86)
JIANG ET AL. 241
where hRrD = [hRrD1 , hRrD2 , … , hRrDN ]T , HD is a ND × 10 0

D
(NR − 1) channel matrix between the jamming antennas at R
and the receiver antennas at D, and nd is the AWGN vec-
tor introduced by the receiver antennas at D. The received
Secrecy outage probability

signal of the eth antenna at the eavesdropper Em is given
10 -1
by
√ √
yEme = Pr hRrEme xs + Pz hJEme z + ne , (87)
10 -2
where hJEme = [hJ1 Eme , hJ2 Eme , … , hJN −1 Eme ] and hJ j Eme denotes
R
the fading coefficient of channel from jamming antenna J j to
OTAS (s.)
the eth antenna at Em . STAS (s.)
In order to make the artificial noise not interfere with D, we STT (s.)
t.
design the z onto the null space of HD so that HD z = 0. There- 10 -3
fore, the (86) can be rewritten as -15 -10 -5 0 5 10 15 20
√ FIGURE 2 SOP versus 𝛾T (dB) of the OTAS, STAS and STT schemes
yD = Pr hRrD xs + nd . (88) for different ΩRD with 𝛼 = 0.5, 𝜂 = 0.8, 𝜌 = 0.6, T = 1 ms, M = 2, R0 = 1
bit/s/Hz, Rs = 0.6 bit/s/Hz, NS = NR = ND = 4, NE = 2, ΩSR = 10 dB
Thus, the channel capacity of R-D and R-Es can be obtained and 𝛾I = 10 dB
as
( ∑ND 2) where Pr(H = H0 ) and Pr(H = H1 ) are given by (22) and (33).
(1 − 𝛼)T Pr d =1 |hRrDd | AN-TAS
And the Pr(max1≤r≤NR Cse,r < RS ) can be evaluate through
CRrD = log2 1 + , (89)
2 N0 using computer simulations.
and
6 NUMERICAL RESULTS AND
(1 − 𝛼)T DISCUSSIONS
CRrE =
2
In this section, we provide the numerical SOP results and
⎛ ∑M ∑NE 2 ⎞ discussions for the OTAS, STAS and STT as well as AN-
⎜ Pr |hRrEme | ⎟
m=1 e=1 TAS schemes. Following the existing literature [11], [25]
× log2 ⎜1 + ∑M ∑NE ⎟.
⎜ H ⎟ and [39], the main parameters are set as ΩPS = ΩPR =
N0 + Pz H
hJEme zz hJEme
⎝ m=1 e=1 ⎠ ΩSP = ΩRP = ΩRE = 0 dB and 𝜀 = 1. For simplicity, letting
“t” denotes the theoretical result and “s” represents the sim-
(90)
ulated result. As shown in Figures 2–7, the theoretical results
match well with the simulated results, which demonstrates the
The secrecy capacity of AN-TAS scheme is given by
correctness of our analysis.
In Figure 2, we show SOP versus 𝛾T (dB) of the OTAS, STAS
AN-TAS
Cse,r = CRrD − CRrE , (91) and STT schemes for different ΩRD . Observe in Figure 2, for
the both cases of ΩRD = 5 dB and ΩRD = 10 dB, the OTAS
Next, the “best” antenna at R for relaying is selected based scheme is better than STAS and STT schemes in terms of SOP,
on the criterion as follows demonstrating that the OTAS scheme can enhance the wireless
security significantly. Meanwhile, as the average channel power
gain ΩRD increases from ΩRD = 5 dB to ΩRD = 10 dB, the
r ∗ = arg max Cse,r
AN-TAS
. (92) SOPs of OTAS, STAS and STT schemes reduce, implying that
1≤r≤NR
SOP performance can be improved while ΩRD increasing. Due
As mentioned above, a secrecy outage event happens when to the fact that a higher ΩRD signifies the better secondary chan-
the secrecy capacity is less than Rs . Similarly to (20), the SOP nel performance, which leads to a lower SOP. Figure 2 also
definition of AN-TAS can be expressed as shows that there exists a lower bound in the high 𝛾T region
since the transmit power of S and R is independent of PT as
( ) 𝛾T → ∞.
AN-TAS
Psout = Pr (H = H0 ) Pr max AN-TAS
Cse,r < RS Figure 3 depicts SOP versus 𝛾T (dB) of the OTAS, STAS and
1≤r≤NR STT schemes for different energy conversion efficiency 𝜂. One
can find that with the increase of 𝜂 from 0.4 to 0.8, the SOPs of
+ Pr (H = H1 ). (93) OTAS, STAS and STT schemes decrease. This is due to the fact
242 JIANG ET AL.
10 0 10 0
10 -1

10 -1
10 -2
10 -3
10 -2
OTAS (s.)
STAS (s.)
OTAS (s.) 10 -4 STT (s.)
STAS (s.) t.
STT (s.) Iterative optimal value
t.
10 -3 10 -5
-15 -10 -5 0 5 10 15 20 0 0.2 0.4 0.6 0.8 1
FIGURE 3 SOP versus 𝛾T (dB) of the OTAS, STAS and STT schemes FIGURE 5 SOP versus 𝛼 of the OTAS, STAS and STT schemes with
for different 𝜂 with 𝛼 = 0.5, 𝜌 = 0.6, T = 1 ms, M = 2, R0 = 1 bit/s/Hz, 𝜂 = 0.8, 𝜌 = 0.6, T = 1 ms, R0 = 1 bit/s/Hz, Rs = 0.6 bit/s/Hz, ΩSR =
Rs = 0.6 bit/s/Hz, NS = NR = ND = 4, NE = 2, ΩSR = ΩRD = 10 dB and ΩRD = 10 dB, NS = NR = ND = 4, NE = 2 and 𝛾T = 𝛾I = 10 dB
𝛾I = 10 dB
10 0
10 0
10 -1
10 -5
10 -2
10 -3
10 -10
OTAS
10 -4 OTAS (s.) STAS
STAS (s.) STT
STT (s.) Asymptotic
t.
10 -5 10 15 20 25 30 35 40
-15 -10 -5 0 5 10 15 20
FIGURE 6 Exact and asymptotic SOPs versus ΩRD of the OTAS, STAS
FIGURE 4 SOP versus 𝛾I (dB) of the OTAS, STAS and STT schemes for and STT schemes with 𝛼 = 0.5, 𝜂 = 0.8, 𝜌 = 0.6, T = 1 ms, M = 2, R0 = 1
different NR with 𝛼 = 0.5, 𝜂 = 0.8, 𝜌 = 0.6, T = 1 ms, M = 2, R0 = 1 bit/s/Hz, Rs = 0.6 bit/s/Hz, 𝛾T = 𝛾I = 0 dB, ΩPS = ΩPR = ΩSP = ΩRP =
bit/s/Hz, Rs = 0.6 bit/s/Hz, NS = ND = 4, NE = 2, ΩSR = ΩRD = 10 dB ΩRE = 10 dB and NS = NR = ND = NE = 3
and 𝛾T = 10 dB
that a higher 𝜂 means the S and R convert more energy from interference power at PR 𝛾I → ∞, the interference to the PR
received RF signals for information transmission, which leads can be ignored, this results in that the transmit power at S and
to a lower SOP. Meanwhile, Figure 3 also shows that the SOPs R is independent of 𝛾I in the high 𝛾I region. Additionally, for
for both cases of 𝜂=0.4 and 𝜂=0.8 converge to the same floor the both cases of NR =2 and NR =6, the OTAS scheme outper-
in the high 𝛾T region since the transmit power of S and R is forms STAS and STT schemes in terms of SOP.
independent of 𝜂 as 𝛾T → ∞. Figure 5 presents the SOP versus time-switching ratio 𝛼 of
Figure 4 depicts the SOP versus 𝛾I (dB) of the OTAS, STAS the OTAS, STAS and STT schemes. It can be seen from Fig-
and STT schemes for different NR . As shown in Figure 4, the ure 5, the SOPs of OTAS, STAS and STT schemes first decrease
SOPs of the three schemes is decreased while 𝛾I increasing since and then increase with an increasing 𝛼, showing that the opti-
a higher 𝛾I implies a larger tolerated interference power at PR. mal SOP performance can be achieved by optimizing 𝛼. Fig-
Meanwhile, Figure 4 also shows that there exists a floor in the ure 5 also shows that the optimal time-switching ratios can be
high 𝛾I region. This is due to the fact that with the tolerated obtained by the proposed iterative algorithm.
JIANG ET AL. 243
10 0 10 0
10 -2

10 -5
10 -4
10 -10
OTAS (s.)
STAS (s.) 10 -6
STT (s.)
t.
AN-TAS
10 -15 10 -8
-15 -10 -5 0 5 10 15 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9
FIGURE 7 SOP versus 𝛾T (dB) of the OTAS, STAS, STT and AN-TAS FIGURE 8 SOP versus 𝜇 of the AN-TAS scheme for different NR with
schemes with 𝛼 = 0.5, 𝜂 = 0.8, 𝜌 = 0.6, 𝜇 = 0.5, T = 1 ms, M = 2, R0 = 1 𝛼 = 0.5, 𝜂 = 0.8, 𝜌 = 0.6, T = 1 ms, M = 2, R0 = 1 bit/s/Hz, Rs = 0.6
bit/s/Hz, Rs = 0.6 bit/s/Hz, NS = ND = 4, NE = 2, NR = 6, bit/s/Hz, NS = ND = 4, NE = 2, ΩSR = ΩRD = 10 dB and 𝛾I = 𝛾T = 0 dB
ΩSR = ΩRD = 10 dB and 𝛾I = 10 dB
ALGORITHM 1 Proposed Golden Search Iterative Algorithm
1: Initialization: a = 0.001, b = 0.999, and the maximum tolerance 𝛿 = 10−4

Figure 6 shows the exact and asymptotic secrecy outage prob-
2: Calculate 𝜑1 = b − 0.618(b − a)
ability versus ΩRD of the OTAS, STAS and STT schemes. As
3: Calculate 𝜑2 = a + 0.618(b − a)
observed in Figure 6, the asymptotic SOP curves of OTAS,
STAS and STT schemes match the exact ones very well in high 4: while |𝜑1 − 𝜑2 | > 𝛿 do
ΩRD region. It can also be seen from Figure 6 that both the 5: Let 𝛼 = 𝜑1
exact and asymptotic SOPs of OTAS, STAS and STT schemes Φ
6: Calculate Psout ,1 , where Φ ∈ {STT, STAS, OTAS}
all decrease significantly as ΩRD increases, showing that SOP 7: Φ
Let 𝛼 = 𝜑2 , calculate Psout ,2 again
performance can be enhanced while ΩRD increasing. Since a Φ Φ
8: if Psout ,2 > Psout ,1 then
higher ΩRD means the better channel performance, which leads
9: b = 𝜑2 , 𝜑2 = 𝜑1 , and 𝜑1 = b − 0.618(b − a)
to a lower SOP.
As shown in Figure 7, we present the SOP versus 𝛾T of 10: else
OTAS, STAS, STT and AN-TAS schemes. It can be seen from 11: a = 𝜑1 , 𝜑1 = 𝜑2 , and 𝜑2 = a + 0.618(b − a)
Figure 7 that SOPs of all schemes decrease as 𝛾T increasing. 12: end if
This is because a higher 𝛾T means a larger transmit power at 13: end while
PT, which leads to a lower SOP. One can observe that in the
14: returnoptimal time-switching ratio 𝛼 ∗ = (a + b)∕2
low SNR 𝛾T region, the AN-TAS scheme shows no advan-
tage in secrecy performance, while as the SNR increases, the
secrecy performance advantage of the AN-TAS scheme grad-
ually increases until reaches an upper bound. Due to the fact 7 CONCLUSION
that in the AN-TAS scheme, a portion of the transmit power is
used to emit AN, which leads to less power to transmit legiti- This paper investigated the physical-layer security for an EH-
mate information. In fact, in the low SNR region, more power MIMO CR relay network, where S communicates with D with
is needed to send legitimate information for ensuring the relia- the help of R, while multiple colluding eavesdroppers attempt
bility of the system. to tap the information transmission. To improve the physical
Figure 8 presents the SOP versus power allocation factor 𝜇 of layer security, we proposed OTAS and STAS schemes depend-
the AN-TAS scheme for different NR . Figure 8 shows that for ing on the availability of the CSIs of wiretap links. We derived
both cases of NR = 6 and NR = 8, the SOP curve of AN-TAS the exact and asymptotic closed-form expressions of SOP for
scheme first decrease and then increase with an increasing 𝜇, OTAS, STAS and STT schemes over Rayleigh fading channels.
showing that there exists an optimal power allocation factor to We futher extended the TAS framework to an AN aided EH-
minimize the SOP. Figure 8 also shows that the optimal power MIMO CR relay scenario and proposed an AN-TAS scheme.
allocation factor can be obtained by the proposed golden search Numerical results showed that the proposed OTAS and STAS
iterative algorithm, which is given by Algorithm 1. Algorithm 1 schemes perform better than STT scheme in terms of SOP.
depicts the iterative process for searching the optimal 𝛼, which Moreover, the AN-TAS scheme outperforms OTAS, STAS and
can be similarly used to seek the best 𝜇. STT schemes in terms of SOP. Additionally, due to the influence
244 JIANG ET AL.
of interference threshold at PR, there exists a SOP floor in the 13. Olteanu, A. and Xiao, Y.: Security overhead and performance for aggre-
high transmit SNR region. gation with fragment retransmission (AFR) in very high-speed wireless
802.11 LANs. IEEE Trans. Wireless Commun. 9(1), 218–226 (2010)
14. Zou, Y., Champagne, B., Zhu, W., Hanzo, L.: Relay-selection improves the
FUNDING INFORMATION security-reliability trade-off in cognitive radio systems. IEEE Trans. Com-
The subject is sponsored by the National Natural Science Foun- mun. 63(1), 215–228 (2015)
dation of P. R. China (Nos. 61872196, 61872194, 61902196, 15. Zou, Y., Zhu, J., Wang, X., Hanzo, L.: A survey on wireless security: Tech-
62102194 and 62102196), Scientific and Technological Sup- nical challenges, recent advances, and future trends. Proc. IEEE 104(9),
1727–1765 (2016)
port Project of Jiangsu Province (Nos. BE2019740 and
16. Liu, C., Yang, N., Malaney, R., Yuan, J.: Artificial-noise-aided transmission
20KJB520001), Six Talent Peaks Project of Jiangsu Province in multi-antenna relay wiretap channels with spatially random eavesdrop-
(No. RJFW-111), Natural Science Foundation of Jiangsu pers. IEEE Trans. Wireless Commun. 15(11), 7444–7456 (2016)
Province (No.BK20200753), the NUPTSF (NY220120), 17. Hu, J., Cai, Y., Yang, N., Zhou, X., Yang, W.: Artificial-noise-aided secure
Postgraduate Research and Practice Innovation Program transmission scheme with limited training and feedback overhead. IEEE
Trans. Wireless Commun. 16(1), 193–205 (2017)
of Jiangsu Province (Nos. KYCX19_0909, KYCX19_0911,
18. Wyner, A.D.: The wiretap channel. Bell Syst. Tech. J. 54(8), 1355–1387
KYCX20_0759, No. KYCX21_0787, No. KYCX21_0788 and (1975)
No. KYCX21_0799). 19. Chen, X., Zhang, Y.: Mode selection in MU-MIMO downlink networks: A
physical-layer security perspective. IEEE Syst. J. 11(2), 1128–1136 (2017)
CONFLICT OF INTEREST 20. Wu, Y., Schober, R., D. W. K.Ng, Xiao, C., Caire, G.: Secure massive MIMO
transmission with an active eavesdropper. IEEE Trans. Inf. Theory 62(7),
The authors have declared no conflict of interest.
3880–3900 (2016)
21. Liu, Y., Wang, L., Duy, T.T., Elkashlan, M., Duong, T.Q.: Relay selection for
DATA AVAILABILITY STATEMENT security enhancement in cognitive relay networks. IEEE Wireless Com-
The data that support the findings of this study are available mun. Lett. 4(1), 46–49 (2015)
from the corresponding author upon request. 22. Zou, Y., Wang, X., Shen, W.: Optimal relay selection for physical-layer secu-
rity in cooperative wireless networks. IEEE J. Sel. Areas Commun. 31(10),
2099–2111 (2013)
ORCID 23. He, B., Ni, Q., Chen, J., Yang, L., Lv, L.: User-pair selection in multiuser
Xiao Jiang https://orcid.org/0000-0002-3953-2683 cooperative networks with an untrusted relay. IEEE Trans. Veh. Tech.
Peng Li https://orcid.org/0000-0001-5026-5347 68(1), 869–882 (2019)
24. Deng, H., Wang, H., Yuan, J., Wang, W., Yin, Q.: Secure communication
in uplink transmissions: User selection and multiuser secrecy gain. IEEE
REFERENCES
Trans. Commun. 64(8), 3492–3506 (2016)
1. Mamaghani, M.T., Kuhestani, A., Wong, K.: Secure two-way transmission 25. Li, B., Zou, Y., Zhou, J., Wang, F., Cao, W., Yao, Y.: Secrecy outage prob-
via wireless-powered untrusted relay and external jammer. IEEE Trans. ability analysis of friendly jammer selection aided multiuser scheduling for
Veh. Tech. 67(9), 8451–8465 (2018) wireless networks. IEEE Trans. Commun. 67(5), 3482–3495 (2019)
2. Ren, J., Hu, J., Zhang, D., Guo, H., Zhang, Y., Shen, X.: RF energy har- 26. Wen, Y., Huo, Y., Ma, L., Jing, T., Gao, Q.: A scheme for trustworthy
vesting and transfer in cognitive radio sensor networks: Opportunities and friendly jammer selection in cooperative cognitive radio networks. IEEE
challenges. IEEE Commun. Mag. 56(1), 104–110 (2018) Trans. Veh. Tech. 68(4), 3500–3512 (2019)
3. Zou, Y., Zhu, J., Jiang, X.: Joint power splitting and relay selection 27. Cao, K., et al.: Improving physical layer security of uplink NOMA via
in energy-harvesting communications for IoT networks. IEEE Internet energy harvesting jammers. IEEE Trans. Inf. Forensics Security 16, 786–
Things J. 7(1), 584–597 (2020) 799 (2021)
4. Varshney, L.R.: Transporting information and energy simultaneously. Proc. 28. Hoang, T.M., Duong, T.Q., Vo, N., Kundu, C.: Physical layer security in
IEEE ISIT, pp. 1612–1616. IEEE, Piscataway (2008) cooperative energy harvesting networks with a friendly jammer. IEEE
5. Wang, L., Hu, F., Ling, Z., Wang, B.: Wireless information and power Wireless Commun. Lett. 6(2), 174–177 (2017)
transfer to maximize information throughput in WBAN. IEEE Internet 29. Salem, A., Hamdi, K.A., Rabie, K.M.: Physical layer security with RF
of Things J. 4(5), 1663–1670 (2017) energy harvesting in AF multi-antenna relaying networks. IEEE Trans.
6. Li, T., Fan, P., Letaief, K.B.: Outage probability of energy harvesting relay- Commun. 64(7), 3025–3038 (2016)
aided cooperative networks over Rayleigh fading channel. IEEE Trans. 30. Lee, K., Hong, J., Choi, H., Quek, T.Q.S.: Wireless-powered two-way
Veh. Tech. 65(2), 972–978 (2016) relaying protocols for optimizing physical layer security. IEEE Trans. Inf.
7. Jiang, X., Li, P., Li, B., Zou, Y., Wang, R.: Security-reliability tradeoff for Forensics Security 14(1), 162–174 (2019)
friendly jammer aided multiuser scheduling in energy harvesting commu- 31. Yan, P., Zou, Y., Zhu, J.: Energy-aware multiuser scheduling for physical-
nications. Secur. Commun. Networks (2021) layer security in energy-harvesting underlay cognitive radio systems. IEEE
8. Ali, A., Hamouda, W.: Advances on spectrum sensing for cognitive radio Trans. Veh. Tech. 67(3), 2084–2096 (2018)
networks: Theory and applications. IEEE Commun. Surveys Tuts. 19(2), 32. Li, M., Yin, H., Huang, Y., Wang, Y., Yu, R.: Physical layer security in over-
1277–1304 (2017) lay cognitive radio networks with energy harvesting. IEEE Trans. Veh.
9. Jiang, X., Li, P., Li, B., Zou, Y., Wang, R.: Intelligent jamming strategies for Tech. 67(11), 11274–11279 (2018)
secure spectrum sharing systems. IEEE Trans. Commun. (2022) 33. Bouabdellah, M., et al.: Cooperative energy harvesting cognitive radio net-
10. Goldsmith, A., Jafar, S.A., Maric, I., Srinivasa, S.: Breaking spectrum grid- works with spectrum sharing and security constraints. IEEE Access 7,
lock with cognitive radios: An information theoretic perspective. Proc. 173329–173343 (2019)
IEEE 97(5), 894–914 (2009) 34. Wu, Y., Chen, X.: Robust beamforming and power splitting for secrecy
11. Lei, H., et al.: Secrecy outage performance of transmit antenna selection wireless information and power transfer in cognitive relay networks. IEEE
for mimo underlay cognitive radio systems over Nakagami- m channels. Commun. Lett. 20(6), 1152–1155 (2016)
IEEE Trans. Veh. Tech. 66(3), 2237–2250 (2017) 35. Yang, N., Yeoh, P.L., Elkashlan, M., Schober, R., Collings, I.B.: Transmit
12. Zhang, M., Liu, Y.: Secure beamforming for untrusted MISO cognitive antenna selection for security enhancement in MIMO wiretap channels.
radio networks. IEEE Trans. Wireless Commun. 17(7), 4861–4872 (2018) IEEE Trans. Commun. 61(1), 144–154 (2013)
JIANG ET AL. 245
36. Zhu, J., Zou, Y., Wang, G., Y.-D.Yao, Karagiannidis, G.K.,: On secrecy per- 41. Gradshteyn, I.S., Ryzhik, I.M.: Tables of Integrals, Series, Products, 7th ed.
formance of antenna-selection-aided MIMO systems against eavesdrop- Academic Press, New York (2007)
ping. IEEE Trans. Veh. Tech. 65(1), 214–225 (2016) 42. Olver, F.W., Lozier, D.W., Boisvert, R.F., Charles, W.C.: NIST Hand-
37. Zhao, R., Lin, H., He, Y., Chen, D., Huang, Y., Yang, L.: Secrecy perfor- book of Mathematical Functions. Cambridge University Press, Cambridge
mance of transmit antenna selection for MIMO relay systems with out- (2010)
dated CSI. IEEE Trans. Commun. 66(2), 546–559 (2018)
38. Zhao, H., Tan, Y., Pan, G., Chen, Y., Yang, N.: Secrecy outage on trans-
mit antenna selection/maximal ratio combining in MIMO cognitive radio
networks. IEEE Trans. Veh. Tech. 65(12), 10236–10242 (2016)
How to cite this article: Jiang X, Li P, Li B, Zou Y,
39. Yan, P., Yang, J., Liu, M., Sun, J., Gui, G.: Secrecy outage analysis of transmit
antenna selection assisted with wireless power beacon. IEEE Trans. Veh. Wang R.: Secrecy performance of transmit antenna
Tech. 69(7), 7473–7482 (2020) selection for underlay MIMO cognitive radio relay
40. Liu, Y., Wang, L., Raza Zaidi, S.A., Elkashlan, M., Duong, T.Q.: Secure networks with energy harvesting. IET Commun. 16,
D2D communication in large-scale cognitive cellular networks: A wire- 227–245 (2022). https://doi.org/10.1049/cmu2.12340
less power transfer model. IEEE Trans. Commun. 64(1), 329–342
(2016)

2022 - Secrecy Performance of Transmit Antenna Selection For Underlay

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

2022 - Secrecy Performance of Transmit Antenna Selection For Underlay

Uploaded by

Copyright:

Available Formats

17518636, 2022, 3, Downloaded from https://ietresearch.onlinelibrary.wiley.com/doi/10.1049/cmu2.12340 by National Medical Library The Director, Wiley Online Library on [27/10/2022].

ORIGINAL RESEARCH PAPER

Secrecy performance of transmit antenna selection for underlay

IET Commun. 2022;16:227–245. wileyonlinelibrary.com/iet-com 227

by Em , m ∈ {1, 2, … , M }. The primary network comprises two

[ ]+ It is worth noting that the best antenna selection for D can be

2.2 Optimal transmit antenna selection

with the same power PRSTT STT

3.1 OTAS scheme ⎛ ⎞ 2

Thus the I2 can be rewritten as and

𝛾I where the G2 (y) can be obtained as

MN and the second equation is obtained by using the binomial

NR −1 ( )t where the Φ4 , Φ5 and Φ6 can be computed as

B = 𝜆RD (NR − nND +1 ),

As noted above, the definition of SOP for STAS scheme can be ∑

⎛ 𝛾I max ∑ND |hR jDd |2 ∑M ∑NE ⎞

where J1 (v) can be computed as Additionally, T4 can be rewritten as

Substituting (49) into (48), J1 (v) can be derived as =e y E4 y−C +l , (53)

AC !𝜃C −l 𝛼2 l 𝜆RE E (l + MNE − 1)!

∑NR ∑ND ∑NR ∑M ∑NE ∑NR

∑NR ∑NR ∑ND ∑NR ∑NR ∑M ∑NE ∑NR

Furthermore, the T6 can be rewritten as

⎧ (NS − NR − 1)! , NS − NR > 0 ∑

where Combining (53) and (74), we arrive at

Substituting (75) into (47), the T3∞ can be calculated as

∑NR ∑ND 2 ND NR NR −1 ( ) −ND NR −t +k+NR

5 EXTENSION TO ARTIFICIAL NOISE

where hRrD = [hRrD1 , hRrD2 , … , hRrDN ]T , HD is a ND × 10 0

Secrecy outage probability

Secrecy outage probability

Secrecy outage probability

ALGORITHM 1 Proposed Golden Search Iterative Algorithm

1: Initialization: a = 0.001, b = 0.999, and the maximum tolerance 𝛿 = 10−4

You might also like