# Precoding-Aided Spatial Modulation for the Wiretap Channel with Relay Selection and Cooperative Jamming

Authors: Zied Bouida; Athanasios Stavridis; Ali Ghrayeb; Harald Haas; Mazen Hasna; Mohamed Ibnkahla
Journal: Wireless Communications and Mobile Computing
 (2018)

---

## Abstract

We propose in this paper a physical-layer security (PLS) scheme for dual-hop cooperative networks in an effort to enhance the communications secrecy. The underlying model comprises a transmitting node (Alice), a legitimate node (Bob), and an eavesdropper (Eve). It is assumed that there is no direct link between Alice and Bob, and the communication between them is done through trusted relays over two phases. In the first phase, precoding-aided spatial modulation (PSM) is employed, owing to its low interception probability, while simultaneously transmitting a jamming signal from Bob. In the second phase, the selected relay detects and transmits the intended signal, whereas the remaining relays transmit the jamming signal received from Bob. We analyze the performance of the proposed scheme in terms of the ergodic secrecy capacity (ESC), the secrecy outage probability (SOP), and the bit error rate (BER) at Bob and Eve. We obtain closed-form expressions for the ESC and SOP and we derive very tight upper-bounds for the BER. We also optimize the performance with respect to the power allocation among the participating relays in the second phase. We provide examples with numerical and simulation results through which we demonstrate the effectiveness of the proposed scheme.


---

## Body

## 1. Introduction

Due to the broadcast nature of the wireless propagation environment, information transmission security has been considered as prominent frontier in wireless communications [1]. In this context, physical-layer security (PLS) has been introduced in order to ensure confidential communication by applying communication techniques in the physical layer by exploiting the spatiotemporal characteristics of wireless channels [2]. The key idea behind PLS is to exploit different characteristics of both the main and the eavesdropper’s channels [3]. The pioneering work on wiretap channel [4] has shown that perfect secrecy can be achieved if the eavesdropper’s channel is a degraded version of the main channel. Later in [5], it has been shown that perfect secrecy can be achieved even if the eavesdropper’s channel is on average better than the main channel, by exploiting the channel fading.Due to the importance of physical-layer security, research work on this topic is gaining more and more interest in the context of next generation networks. In particular, information security is becoming very important in 5G systems where massive user connections and exponentially increasing wireless services are supported as investigated in [6, 7] and references therein. In this context, several techniques have been used in order to safeguard 5G systems. Focusing on precoding-aided spatial modulation and cooperative jamming, we provide in what follows the motivation behind each of these techniques and how it contributes to 5G systems safeguarding.In light of the above, a plethora of works has appeared in the literature, addressing different aspects of physical-layer security. Based on the concept of spatial modulation (SM) [8, 9] and owing to its spatial focusing property and its nondeterministic precoding algorithm, precoding-aided spatial modulation (PSM) has been presented as a suitable precoding technique to realize PLS [10–13]. In PSM, two types of modulations, namely, a variation of space shift keying (SSK) [14, 15] and conventional amplitude-phase modulation (APM), are jointly used to convey information. Specifically, Pre-SSK is implemented using the indices of receiver antennas rather than transmit antennas, with the aid of zero forcing precoding (ZFP) [16]. In this context, PSM employs two distinctive advantages: (i) additional information transmission in space domain and (ii) low-complexity detection [17]. Due to the several advantages of SM in terms of error performance, energy efficiency, and complexity (and PSM for all these advantages with additional security), it becomes a promising candidate for 5G systems [18, 19]. Therefore, using PSM for the security of 5G results from the combination of SM with additional security features.While PSM has gained attention in the literature as a solution to enhance the secrecy performance of wiretap channels, this technique has not been studied in the context of cooperative communications where the secrecy performance can be further improved and fit more in 5G systems. Indeed, relays can be used to enhance the secrecy of the system by increasing the capacity of the main channel while reducing the capacity of the eavesdropper channel [20]. In this context, an appropriate relay selection is used in [21] to enhance the secrecy performance by taking eavesdroppers’ links into consideration. In [22], relay selection with destination-based jamming under a total power constraint is proposed. While this technique enhances the secrecy performance, it assumes that Eve has no direct link with Alice and thus puts a limitation on the location of Eve. Moreover, it requires the channel state information (CSI) at the relays in order to select the best relay to the destination.Considering a dual-hop cooperative scenario, we propose a PSM-based scheme aimed at enhancing the communication secrecy between Alice and Bob in the presence of a passive Eve. Assuming that Alice and Bob can only communicate through the help of a number of trusted relays, we use different techniques to enhance the secrecy communication between these nodes without putting any constraint on the location of Eve with respect to Alice and Bob. In this context, using PSM at Alice while simultaneously transmitting a jamming signal from Bob guarantees the secrecy during the first phase. In the second phase, the secrecy performance is enhanced through the use of jamming from multiple relays. Specifically, the relay selected by PSM detects and forwards the useful signal while other relays contribute to the jamming of the eavesdropper. In this paper, we analyze the performance of the proposed scheme in terms of the ergodic secrecy capacity (ESC) and secrecy outage probability (SOP) where we obtain closed-form expressions for those metrics. We also optimize the performance with respect to the power allocation among the participating relays in the second phase. We provide examples with numerical and simulations results through which we demonstrate the effectiveness of the proposed scheme.In light of the above, the main contributions behind the work proposed in this paper can be summarized as follows:(i)
Taking advantage of its low probability of interception, PSM is extended in this paper to the cooperative communication scenario where Alice and Bob communicate through the help ofN
R trusted relays.
(ii)
While the secrecy performance for the first phase is enhanced using PSM, a cooperative jamming from multiple relays is considered to improve the secrecy performance during the second phase.
(iii)
The ESC and SOP are derived in closed-form expressions and the results are confirmed for accuracy using Monte-Carlo simulations. Power allocation optimization is also given by simulation to further enhance the secrecy performance of the proposed scheme.
(iv)
The ABEP upper-bound expressions at Bob and Eve are derived and the results are confirmed for accuracy using Monte-Carlo simulations. These results show the advantages of PSM and multirelay jamming during the first and the second phase, respectively. Indeed, the proposed techniques enhance the ABEP performance at Bob while degrading that of Eve.The remainder of this paper is organized as follows. Section2 defines the system and channel models and the mode of operation of the proposed PSM-based technique. Section 3 analyzes the secrecy performance in terms of the ESC and the OSC. Section 4 confirms this performance via selected numerical results. Section 5 concludes the paper.Notation. In this paper, we use boldface uppercase and lowercase letters to, respectively, denote matrices and vectors. The Hermitian transpose, inverse, and trace of a matrix A are, respectively, represented by A
H, A
-
1, and t
r
(
A
). The N-dimensional identity matrix is denoted by I
N. The Euclidean norm, Frobenius norm, absolute value, and real part are, respectively, represented by ·, ·
F, ·, and R
·. C
i
×
j stands for a set of complex matrices of i
×
j dimensions.


## 2. System and Channel Models

### 2.1. System Model

In Figure1, we consider a secure dual-hop communication system between Alice and Bob through the help of N
r single-antenna trusted relays in the presence of an eavesdropper, Eve, where Alice has no direct link to Bob. The number of antennas of Alice, Bob, and Eve are denoted as N
a, N
b, and N
e, respectively. The practical number of antennas at these nodes depends on the used wireless and antenna technologies. Indeed, while current LTE devices can accommodate a maximum of four antennas, future 5G user equipment will accommodate a larger number of antennas thanks to the use of millimeter-wave and massive MIMO [23].Figure 1
System model.In this work, we use a PSM-based relay-selection scheme in order to take advantage of the low probability of interception (LPI) of PSM. Following the principles of PSM [16, 17], we assume that N
a
>
N
r and that N
r
=
2
k
1, where k
1 is a positive integer to be able to use PSM. Hence, in PSM, relays’ indices can be used by Alice to convey k
1 bits per symbol information following SSK principles. Therefore, the relay intended by reception is selected based on the k
1 incoming bits. In addition to SSK, we assume that Alice also exploits a conventional M
(
=
2
k
2
)-ary APM. Thus, each PSM symbol to be transmitted consists of k
=
k
1
+
k
2 bits, which is first divided into two subsymbols, a k
1-bit SSK symbol and a k
2-bit APM symbol. The k
1-bit SSK symbol is mapped to a vector e
i, which is the ith column of an identity matrix I
N
r, and the subscript i is determined by the decimal value of the k
1-bit SSK symbol. The k
2-bit APM symbol is mapped to a unit-power symbol b
j chosen from the constellation according to the decimal value of the k
2-bit APM symbol. Then, the PSM symbol is formed as s
i
j
=
e
i
b
j. After precoding, this signal is transmitted via the N
a transmit antennas of Alice. An example of relay selected based on the k
1 incoming bits is given in Table 1.Table 1
Precoded SSK mapper rule example forN
r
=
4; i.e., k
1
=
2.
k
1 bits
Relay activated
e
i
0
0
1
1
0
0
0
T
0
1
2
0
1
0
0
T
1
0
3
0
0
1
0
T
1
1
4
0
0
0
1
T


### 2.2. Channel Models

In this work, we consider Rayleigh block fading channels and we denote byh
i
j the channel coefficient between nodes i and j. These coefficients have a complex Gaussian distribution with zero-mean and variance d
i
j
-
α, i.e., C
N
(
0
,
d
i
j
-
α
), where d
i
j is the distance between nodes i and j, and α is the path-loss exponent of wireless channels. Let H
A
R
=
[
h
A
R
1
,
h
A
R
2
,
…
,
h
A
R
N
r
]
T be the channel matrix between Alice and different relays, where h
A
R
i
∈
C
1
×
N
r is the channel vector between Alice and the ith relay having C
N
(
0
,
d
A
R
i
-
α
) distributed components, where d
A
R
i is the distance between Alice and the ith relay.


## 2.1. System Model

In Figure1, we consider a secure dual-hop communication system between Alice and Bob through the help of N
r single-antenna trusted relays in the presence of an eavesdropper, Eve, where Alice has no direct link to Bob. The number of antennas of Alice, Bob, and Eve are denoted as N
a, N
b, and N
e, respectively. The practical number of antennas at these nodes depends on the used wireless and antenna technologies. Indeed, while current LTE devices can accommodate a maximum of four antennas, future 5G user equipment will accommodate a larger number of antennas thanks to the use of millimeter-wave and massive MIMO [23].Figure 1
System model.In this work, we use a PSM-based relay-selection scheme in order to take advantage of the low probability of interception (LPI) of PSM. Following the principles of PSM [16, 17], we assume that N
a
>
N
r and that N
r
=
2
k
1, where k
1 is a positive integer to be able to use PSM. Hence, in PSM, relays’ indices can be used by Alice to convey k
1 bits per symbol information following SSK principles. Therefore, the relay intended by reception is selected based on the k
1 incoming bits. In addition to SSK, we assume that Alice also exploits a conventional M
(
=
2
k
2
)-ary APM. Thus, each PSM symbol to be transmitted consists of k
=
k
1
+
k
2 bits, which is first divided into two subsymbols, a k
1-bit SSK symbol and a k
2-bit APM symbol. The k
1-bit SSK symbol is mapped to a vector e
i, which is the ith column of an identity matrix I
N
r, and the subscript i is determined by the decimal value of the k
1-bit SSK symbol. The k
2-bit APM symbol is mapped to a unit-power symbol b
j chosen from the constellation according to the decimal value of the k
2-bit APM symbol. Then, the PSM symbol is formed as s
i
j
=
e
i
b
j. After precoding, this signal is transmitted via the N
a transmit antennas of Alice. An example of relay selected based on the k
1 incoming bits is given in Table 1.Table 1
Precoded SSK mapper rule example forN
r
=
4; i.e., k
1
=
2.
k
1 bits
Relay activated
e
i
0
0
1
1
0
0
0
T
0
1
2
0
1
0
0
T
1
0
3
0
0
1
0
T
1
1
4
0
0
0
1
T


## 2.2. Channel Models

In this work, we consider Rayleigh block fading channels and we denote byh
i
j the channel coefficient between nodes i and j. These coefficients have a complex Gaussian distribution with zero-mean and variance d
i
j
-
α, i.e., C
N
(
0
,
d
i
j
-
α
), where d
i
j is the distance between nodes i and j, and α is the path-loss exponent of wireless channels. Let H
A
R
=
[
h
A
R
1
,
h
A
R
2
,
…
,
h
A
R
N
r
]
T be the channel matrix between Alice and different relays, where h
A
R
i
∈
C
1
×
N
r is the channel vector between Alice and the ith relay having C
N
(
0
,
d
A
R
i
-
α
) distributed components, where d
A
R
i is the distance between Alice and the ith relay.


## 3. Performance Analysis

### 3.1. Received Signals

During the first phase, Alice transmits symbols
i
j via its N
a antennas. Assuming that the channel state information to all relays is known to Alice, let P
=
[
p
1
,
p
2
,
…
,
p
N
r
] be a N
a
×
N
r precoding matrix used by Alice in order to send information to one of the relays. Then, the received signal from Alice at the relays is expressed as(1)
y
R
=
H
A
R
P
s
i
j
+
η
R
,where η
R
∈
C
N
r
×
1 is the additive white Gaussian noise (AWGN) experienced by different relays, having complex Gaussian distributions of C
N
(
0
,
σ
r
2
). All channels are assumed to experience a block Rayleigh fading. While Alice knows the CSI of Alice-Relays channels, it is unable to acquire the CSI of Eve because this latter is assumed to be a passive eavesdropper.Using the zero forcing precoder, the precoding matrix used by Alice can be expressed similar to [16] as(2)
P
=
β
H
A
R
H
H
A
R
H
A
R
H
-
1
,where(3)
β
=
1
-
δ
1
P
/
2
t
r
H
A
R
H
A
R
H
-
1is a power normalization factor to achieve the power constraint of t
r
(
P
P
H
)
=
(
1
-
δ
1
)
P
/
2, P denotes the total transmitted power during the two phases, and δ
1 is a power allocation factor, δ
1
∈
(
0,1
]. In the proposed scheme, the total power P is divided equally between the two transmission phases. Thus, P
/
2 is used in the first phase while being divided between the useful signal from Alice and the jamming signal from Bob. This division happens through the use of the power allocation factor δ
1; i.e., (
1
-
δ
1
)
P
/
2 is used by Alice and δ
1
P
/
2 is used by Bob. During the second phase, the remaining P
/
2 is shared among all relays using the power allocation factor δ
2
∈
(
0,1
] as follows: (i) P
s
=
δ
2
P
/
2 is used by the selected relay to transmit the useful signal and (ii)  P
J
=
(
1
-
δ
2
)
P
/
(
2
(
N
r
-
1
)
) is used by each of the remaining N
r
-
1 relays to send the jamming signal received from Bob.Thanks to the use of ZFP, the signal is only received by theith relay and this can be seen by substituting (2) in (1). Thus, the received signal from Alice at different relays is given by(4)
y
R
i
=
β
b
j
+
η
R
i
,
y
R
k
=
η
R
k
,
∀
k
≠
i
.In this first phase, Bob also cooperates by broadcasting a jamming signalJ
B. Thus, the received signals from Alice and Bob during this phase at all relays is given by(5)
y
R
i
=
β
b
j
+
δ
1
P
2
h
B
R
i
J
B
+
η
R
i
,
y
R
k
=
δ
1
P
2
h
B
R
k
J
B
+
η
R
k
,
∀
k
≠
i
,where h
B
R
k
∈
C
N
b
×
1 is the channel vector between Bob and the kth relay R
k. To simplify the detection of Alice’s signal at the relays, the jamming signal is assumed to have a complex Gaussian distribution with zero-mean and variance σ
J
2; i.e., J
B
~
C
N
(
0
,
σ
J
2
). Thus, the received signal at different relays can be reformulated as(6)
y
R
i
=
β
b
j
+
η
~
R
i
,
y
R
k
=
η
~
R
k
,
∀
k
≠
i
,where η
~
R
k has a complex Gaussian distribution with zero-mean and variance σ
~
2
=
δ
1
P
/
2
h
B
R
k
F
2
σ
J
2
+
σ
r
2.Similar to [24], we assume that the relays communicate via a backhaul-link (this link can be established through control channels and does not necessary imply that the used channels are dedicated). Thus, taking into consideration the received CSI at the relays from Bob, we can employ the following centralized low-complexity Maximum Likelihood (ML) detector:(7)
i
^
,
j
^
=
a
r
g
m
i
n
i
,
j
y
R
-
β
s
i
j
=
a
r
g
m
i
n
i
,
j
β
b
j
2
-
2
R
y
R
i
∗
b
j
.The use of the ML detector in (7) ensures that a single relay is activated during the second transmission phase. In this context, the relay intended by the PSM selection is used at the second phase to transmit the decoded APM signal b
j using power P
s and the remaining N
r
-
1 relays send the perfectly estimated jamming signal received from Bob during the first phase each using a power P
J
=
(
P
/
2
-
P
s
)
/
(
N
r
-
1
). When the relayed signals are received by Bob, this latter can employ self-interference subtraction as it knows the jamming signal J
B and it has received channel estimations with all relays. Thus, the received signal at Bob is given by(8)
y
B
=
P
s
b
j
h
R
i
B
+
η
B
,where η
B is the C
N
(
0
,
σ
b
2
) AWGN at Bob and h
R
i
B is the channel coefficient between the ith relay R
i and Bob.During the first phase, the received signal from Alice and Bob at Eve is expressed as(9)
y
E
,
1
=
H
A
E
P
s
i
j
+
δ
1
P
2
H
B
E
J
B
+
η
E
,
1
,where η
E
,
1
∈
C
N
e
×
1 is the AWGN experienced by Eve during the first phase, having complex Gaussian distribution of C
N
(
0
,
σ
e
2
I
N
e
). H
A
E
∈
C
N
e
×
N
a is the channel matrix between Alice and Eve having C
N
(
0
,
d
A
E
-
α
) distributed components. H
B
E
∈
C
N
e
×
N
b is the channel matrix between Bob and Eve having C
N
(
0
,
d
B
E
-
α
) distributed components.The received signal at Eve for the second phase is given by(10)
y
E
,
2
=
P
s
b
j
h
R
i
E
+
P
J
∑
k
≠
i
h
R
k
E
J
B
+
η
E
,
2
,where η
E
,
2
∈
C
N
e
×
1 is the C
N
(
0
,
σ
e
2
) AWGN experienced by Eve during the second phase.


### 3.2. Ergodic Secrecy Capacity

Using the received signal expression in (8), the signal-to-noise ratio (SNR) at Bob can be expressed as(11)
Γ
B
=
P
s
σ
b
2
h
R
i
B
F
2
.The SNRs at Eve for both the first and second phases are derived using (9) and (10), respectively, as follows:(12)
γ
E
,
1
=
H
A
E
P
F
2
δ
1
P
/
2
H
B
E
F
2
σ
g
2
+
σ
e
2and(13)
γ
E
,
2
=
P
s
h
R
i
E
F
2
P
J
∑
k
≠
i
h
R
k
E
F
2
σ
g
2
+
σ
e
2
.Similar to [22], the ergodic secrecy capacity for the considered dual-hop scheme can be given as(14)
C
s
=
E
1
2
l
o
g
2
1
+
Γ
B
1
+
Γ
E
+
,where Γ
E
=
max
⁡
γ
E
,
1
,
γ
E
,
2 in order to account for the worst-case scenario.In this paper, we take advantage of the low probability of interception of PSM to guarantee the secrecy of the transmission during the first phase and thus assume thatΓ
E
=
γ
E
,
2. Indeed, as discussed in [11], if the Alice-Relays channels vary fast enough, the transmission from Alice to each relay is more or less a “one-time pad” cryptographic scheme, which is rendered absolutely secure. In this scenario, Eve cannot detect any information sent from Alice to Bob due to the one-time pad effect. When the Alice-Bob channels vary sufficiently slow, Eve is still incapable of detecting the SSK symbol i, as Eve is unable to estimate the precoding matrix P separately. Consequently, Eve needs to have both its CSI of H
A
,
E and the perfect knowledge of P to successfully eavesdrop s
i
j. Thus, we assume that Eve is not able to get any useful information during the first phase. In order to confirm this assumption, we show in Figure 2 that γ
E
,
2 exceeds γ
E
,
1 almost surely for different simulation scenarios and parameters.Figure 2
Probability thatγ
E
,
2 exceeds γ
E
,
1 as a function of the average SNR with different N
a and N
b for N
r
=
N
e
=
4 and δ
1
=
δ
2
=
0.5.Due to intractability of (14), we can derive a lower bound on the ESC as follows:(15)
C
s
≥
C
s
l
b
=
E
1
2
l
o
g
2
1
+
Γ
B
1
+
Γ
E
+
=
1
2
ln
⁡
2
E
ln
⁡
1
+
Γ
B
-
E
ln
⁡
1
+
Γ
E
+
.Assuming that all noise variances are equal to σ
2, we define the average SNRs ρ
=
P
/
(
2
σ
2
) and ρ
s
=
P
s
/
σ
2. Thus, the received SNR at Bob can be written as(16)
Γ
B
=
ρ
s
∑
k
=
1
N
b
h
R
i
B
k
2
,and the cumulative distribution function (CDF) of Γ
B is given by(17)
F
Γ
B
γ
b
=
1
-
∑
k
=
0
N
b
-
1
1
k
!
γ
b
γ
¯
b
ρ
s
k
e
-
γ
b
/
ρ
s
γ
¯
b
,where γ
¯
b
=
d
R
,
B
-
α.Using the CDF approach, the first part of the ergodic secrecy capacity lower bound is given in closed-form by(18)
E
ln
⁡
1
+
Γ
B
=
∫
0
∞
1
-
F
Γ
B
γ
b
1
+
γ
b
d
γ
b
=
∑
k
=
0
N
b
-
1
1
k
!
γ
¯
b
k
ρ
s
k
∫
0
∞
γ
b
k
1
+
γ
b
e
-
γ
b
/
ρ
s
γ
¯
b
d
γ
b
=
∑
k
=
0
N
b
-
1
1
γ
¯
b
k
ρ
s
k
Ψ
k
+
1
,
k
+
1
;
1
ρ
s
γ
¯
b
,where Ψ
(
·
,
·
;
·
) is the Confluent Hypergeometric function of the second kind [25, equation (9.211.4)]. Similarly, using (13), the CDF of Eve’s SNR is given by(19)
F
γ
E
,
2
γ
e
=
∫
0
∞
F
X
1
ρ
s
P
J
y
+
1
γ
e
f
Y
y
d
y
,where F
X
(
·
) is the CDF of the random variable X
=
h
R
i
E
F
2 and f
Y
(
·
) is the probability density function (PDF) of the RV Y
=
∑
k
≠
i
‍
h
R
k
E
F
2 representing in this case the summation of N
=
N
e
(
N
r
-
1
) exponential random variables.Using the CDF approach, similar to (18), the second part of the ergodic secrecy capacity lower bound can be obtained: (20)
E
ln
⁡
1
+
Γ
E
=
∫
0
∞
1
-
F
Γ
E
γ
e
1
+
γ
e
d
γ
e
=
∑
k
=
0
N
e
-
1
∑
j
=
0
k
N
+
j
-
1
!
P
J
j
ρ
s
N
+
j
-
k
j
!
k
-
j
!
N
-
1
!
γ
¯
e
k
-
j
×
∫
0
∞
γ
e
k
γ
e
+
1
P
J
γ
e
+
ρ
s
N
+
j
e
-
γ
e
/
γ
¯
e
ρ
s
d
γ
e
,where γ
¯
e
=
d
R
i
,
E
-
α.


### 3.3. Secrecy Outage Probability

The secrecy outage probability is defined as the probability of the secrecy capacityC
s being less than a predetermined secrecy rate R
s [5] and it is given by(21)
P
o
u
t
R
s
=
P
r
C
s
≤
R
s
=
P
r
Γ
B
≤
2
R
s
1
+
Γ
E
-
1
=
∫
0
∞
F
Γ
B
2
R
s
1
+
γ
e
-
1
f
Γ
E
γ
e
d
γ
e
=
1
-
∑
l
=
0
N
b
-
1
P
J
N
l
!
γ
¯
b
l
ρ
s
l
∑
k
=
0
N
e
-
1
∑
j
=
0
k
N
+
j
-
1
!
ρ
s
N
+
j
-
k
j
!
k
-
j
!
N
-
1
!
γ
¯
e
k
-
j
×
∑
m
=
0
l
∑
n
=
0
m
l
m
m
n
-
1
l
-
m
2
m
R
s
e
-
2
R
s
-
1
/
ρ
s
γ
¯
e
×
∫
0
∞
1
ρ
s
γ
¯
e
γ
e
2
+
N
+
j
-
k
+
1
P
J
γ
¯
e
γ
e
-
k
ρ
s
P
J
×
γ
e
n
+
k
-
1
γ
e
+
ρ
s
/
P
J
N
+
j
+
1
e
-
2
R
s
+
1
γ
e
/
ρ
s
γ
¯
e
d
γ
e
.Using change of variables and Binomial expansion, the outage probability can be obtained in closed-form in (22) where  a
=
2
R
s
+
1
/
P
J
γ
¯
e, b
=
ρ
s
/
P
J, and Γ
(
·
,
·
) is the upper incomplete Gamma function:(22)
P
o
u
t
R
s
=
1
-
∑
l
=
0
N
b
-
1
P
J
N
l
!
γ
¯
b
l
ρ
s
l
∑
k
=
0
N
e
-
1
∑
j
=
0
k
N
+
j
-
1
!
ρ
s
N
+
j
-
k
j
!
k
-
j
!
N
-
1
!
γ
¯
e
k
-
j
∑
m
=
0
l
∑
n
=
0
m
l
m
m
n
-
1
l
-
m
2
m
R
s
e
-
2
R
s
-
1
/
ρ
s
γ
¯
e
×
1
ρ
s
γ
¯
e
∑
p
=
0
n
+
k
+
1
n
+
k
+
1
p
-
b
n
+
k
+
1
-
p
b
a
p
+
1
Γ
p
-
N
-
j
,
a
+
N
+
j
-
k
+
1
P
J
γ
¯
e
∑
q
=
0
n
+
k
n
+
k
q
×
-
b
n
+
k
-
q
b
a
q
+
1
Γ
q
-
N
-
j
,
a
-
k
b
∑
r
=
0
n
+
k
-
1
n
+
k
-
1
r
-
b
n
+
k
-
1
-
r
Γ
r
-
N
-
j
,
a
b
a
r
+
1
e
-
a
/
b
.


### 3.4. Average Bit Error Probability

#### 3.4.1. ABEP of Bob

In this part, the theoretical ABEP of Bob is derived. Based on the analysis of [26, 27], the end-to-end ABEP is expressed as (23)
P
B
o
b
γ
1
,
γ
2
=
P
1
γ
1
+
P
2
γ
2
-
P
1
γ
1
P
2
γ
2
.Here, P
1
(
γ
1
) is the ABEP between Alice and the RN, during the first time slot, for a given transmit SJNR γ
1 and P
2
(
γ
2
) is the ABEP between the RN and Bob, during the second slot, for a given transmit SNR γ
2. Hence the evaluation of the ABEP of Bob requires the evaluation of P
1
(
γ
1
) and P
2
(
γ
2
).During the first slot, assuming ZF precoding at Alice with(24)
P
=
H
A
R
H
H
A
R
H
A
R
H
-
1
,the received signal at the RN is given as(25)
y
R
=
P
A
d
A
R
-
α
D
x
+
w
~
.Here, it holds that H
A
R
=
d
A
R
-
α
H
~
A
R, with H
~
A
R
~
C
N
(
0
,
I
). In (25), P
A denotes Alice’s transmit power and w
~ is a vector denoting the composite effect of noise plus jamming from Bob. Also, D is the N
r
×
N
r diagonal normalization matrix defined as D
=
d
A
R
-
a
d
i
a
g
d
1
,
…
,
d
N
r, where(26)
d
i
=
1
H
~
A
R
H
~
A
R
H
-
1
i
,
i
.Here, we note that the ZF precoder defined in (24) is equivalent to the one defined in (2). We use the new definition only for analytical tractability and for the sake of the simplicity of the derived ABEP results. This also enriches the paper by giving two different ways of defining the ZF precoder used at Alice under the same assumptions.Since jamming is treated as noise at the RN, the detector at the RN is given as(27)
x
¯
=
a
r
g
m
i
n
x
y
R
-
D
x
2
2
.In particular, (27) is the ML detector of PSM. Therefore, P
1
(
γ
1
) is the ABEP of PSM with the jamming effect. Hence, the ABEP during the first hop at the RN is given as(28)
P
1
γ
1
≤
1
M
k
t
∑
x
∑
x
≠
x
^
d
x
→
x
^
P
R
-
S
M
x
→
x
^
,where d
(
x
→
x
^
) is the Hamming distance between the bit sequences represented by x and x
^. k
t
=
(
k
1
+
k
2
)
/
2 is equal to the total number of bits transmitted per symbol period. We note that k
1
+
k
2 is divided by two because the transmitted bitstream requires two symbol periods to reach Bob. Also, P
R
-
S
M
(
x
→
x
^
) is the PEP of transmitting x at Alice and erroneously detecting x
^ at the relay nodes.Based on the analysis presented in [28, Section IV], the instantaneous PEP is given as(29)
P
R
-
S
M
x
→
x
^
,
γ
1
∣
D
2
=
Q
c
H
D
2
c
2
P
A
d
A
R
-
a
γ
1
,where c
=
x
-
x
^. Considering the following upper bound of the Q-function [29]:(30)
Q
x
≤
∑
i
=
1
3
β
i
e
-
μ
i
x
2
,in (29) and averaging over all possible realizations of the Alice-RN channel, the average PEP of PSM is expressed as [28, Section IV] (31)
P
R
-
S
M
x
→
x
^
≤
∑
i
=
1
3
β
i
∏
l
=
1
N
α
1
/
α
l
L
2
μ
i
α
1
P
A
d
A
R
-
a
γ
+
1
L
×
∑
k
=
0
+
∞
δ
k
μ
i
α
1
P
A
d
A
R
-
a
γ
+
1
-
k
.Here, it holds thatβ
1
=
1
/
2, β
2
=
1
/
12, β
3
=
1
/
4, μ
1
=
2, μ
2
=
1, and μ
3
=
1
/
2. Furthermore, for a given pair of x
i and x
^
i, N is the number of nonzero elements of c. Also, α
l, l
=
1
,
…
,
N, stand for the eigenvalues of A
=
B
R in ascending order. Here, B is a diagonal matrix, defined as B
=
d
i
a
g
b
1
,
…
,
b
N, where b
l, l
=
1
,
…
,
N, is the absolute value of the lth nonzero element of c
i. In addition, R is a N
×
N matrix given as shown in (33).(32)
δ
k
+
1
=
1
,
k
=
-
1
,
k
k
+
1
∑
i
=
1
k
+
1
∑
j
=
1
N
1
-
α
1
α
j
i
δ
k
+
1
-
i
,
k
=
0,1
,
2
,
…
.
(33)
R
=
1
ρ
c
⋯
ρ
c
ρ
c
⋱
⋱
⋮
⋮
⋱
⋱
ρ
c
ρ
c
⋯
ρ
c
1
.In (33), ρ
c denotes the Pearson product-moment correlation coefficient between any pair of two different random variables (RVs) d
1
2
,
…
,
d
R
2. Moreover, δ
k, k
=
0,1
,
2
,
…, are given in (32). Finally, it holds that L
=
N
t
-
N
r
+
1.During the second hop, the received signal at Bob is expressed as(34)
y
B
=
P
R
H
R
B
x
¯
+
w
B
,after the ideal removal of the jamming signal. In (34), it holds that H
R
B
=
d
R
B
-
a
H
~
R
B, with H
~
R
B
~
C
N
(
0
,
I
). Also, P
R is the transmission power at the RN. Note that the value of P
R is selected such that the transmitted signal at the RN is normalized. As the RN retransmits binary information by using SM, Bob can deploy the following ML detector [8]:(35)
x
˘
=
a
r
g
m
i
n
x
y
B
-
P
B
d
R
B
-
a
H
~
R
B
x
2
2
.Therefore, the ABEP of the second hop is given as(36)
P
2
γ
2
≤
1
M
k
t
∑
x
∑
x
≠
x
^
d
x
→
x
^
,
P
S
M
x
→
x
^
,where P
S
M
(
x
→
x
^
) is the average PEP of transmitting x at the RN, while the detector of Bob decides in favor of x
^. Considering the statistical characteristics of the noise at Bob, it can be shown that the instantaneous PEP is given as(37)
P
S
M
x
→
x
^
,
γ
2
∣
H
~
R
B
=
Q
H
~
R
B
c
2
2
2
P
R
d
R
B
-
a
γ
2
.In (37), it is shown that the RV X
=
H
~
R
B
c
2
2 follows an Erlang distribution with the following PDF [30]: (38)
f
X
x
=
1
c
2
2
N
r
Γ
N
r
x
N
r
e
x
/
c
2
2
H
0
x
,where H
0
(
x
) is the Heaviside step function defined as H
0
(
x
)
=
0 for x
<
0 and H
0
(
x
)
=
1 for x
≥
0. Considering (30) and (38) in (37), the average PEP of the second hop is given as(39)
P
S
M
x
→
x
^
≤
∑
i
=
1
3
β
i
c
2
2
N
r
Γ
N
r
×
∫
0
+
∞
x
N
r
-
1
e
-
P
R
d
R
B
-
a
μ
i
γ
2
+
1
/
∥
c
∥
2
2
x
d
x
,by averaging over possible realizations of the RV X. From [25, p.346, 3.381, 4], it holds that(40)
∫
0
+
∞
x
ν
-
1
e
-
μ
x
d
x
=
μ
-
ν
Γ
ν
.The use of (30) and (40) into (39), after a straightforward elaboration, results in(41)
P
S
M
x
→
x
^
≤
∑
i
=
1
3
β
i
c
2
2
μ
i
P
R
d
R
B
-
a
γ
2
+
1
-
N
r
.In this way, the ABEP of Bob is computed via (23) by using (28), (31), (36), and (41).


#### 3.4.2. ABEP of Eve

In this part, the theoretical ABEP of Eve is derived. As previously shown in Figure2, the Signal-to-Jamming-Plus-Noise Ratio at Eve during the second phase is much higher than the SJNR during the first phase for different simulation scenarios and parameters. Thus, the ABEP of Eve during the first phase is much worse than the ABEP during the second phase. Accounting for the worst-case scenario (i.e., taking the highest SNR at Eve and assuming perfect detection at the relays during the first phase), the SJNR at Eve when the ith relay is used during the second phase is given by(42)
γ
E
=
P
s
h
R
i
E
F
2
P
J
∑
k
≠
i
h
R
k
E
F
2
σ
g
2
+
σ
e
2
.In light of the above, the asymptotic performance bound of the ABEP at Eve with optimal detection is derived using the union bound as(43)
P
E
≤
∑
q
=
1
M
∑
q
^
=
1
M
N
r
N
q
,
q
^
M
P
x
j
q
→
x
j
^
q
^
,where N
(
q
,
q
^
) is the number of bits in error between the symbol x
q and x
q
^, and P
(
x
j
q
→
x
j
^
q
^
) denotes the PEP of deciding on the constellation vector x
j
^
q
^ given that x
j
q is transmitted and can be formulated as(44)
P
x
j
q
→
x
j
^
q
^
=
∫
v
=
0
∞
Q
v
f
κ
v
d
v
,where f
κ
(
·
) is the PDF and is a chi-squared random variable with 2
N
e degrees of freedom given by [31, p. 41] as(45)
f
κ
v
=
v
N
e
-
1
e
x
p
-
v
/
2
α
2
2
α
2
N
e
N
e
-
1
!
,where(46)
α
2
=
δ
2
ρ
1
-
δ
2
ρ
+
1
x
q
2
+
x
q
^
2
4
.Thus, the PEP in (44) is obtained in closed-form as(47)
P
x
j
q
→
x
j
^
q
^
=
γ
N
e
∑
w
=
0
N
e
-
1
N
e
+
w
-
1
w
1
-
γ
w
,where(48)
γ
=
1
2
1
-
α
2
1
+
α
2
.Finally, plugging in (47) in (43), the ABEP at Eve is obtained as(49)
P
E
≤
∑
q
=
1
M
∑
q
^
=
1
M
N
r
N
q
,
q
^
γ
N
e
∑
w
=
0
N
e
-
1
N
e
+
w
-
1
w
1
-
γ
w
M
.


## 3.1. Received Signals

During the first phase, Alice transmits symbols
i
j via its N
a antennas. Assuming that the channel state information to all relays is known to Alice, let P
=
[
p
1
,
p
2
,
…
,
p
N
r
] be a N
a
×
N
r precoding matrix used by Alice in order to send information to one of the relays. Then, the received signal from Alice at the relays is expressed as(1)
y
R
=
H
A
R
P
s
i
j
+
η
R
,where η
R
∈
C
N
r
×
1 is the additive white Gaussian noise (AWGN) experienced by different relays, having complex Gaussian distributions of C
N
(
0
,
σ
r
2
). All channels are assumed to experience a block Rayleigh fading. While Alice knows the CSI of Alice-Relays channels, it is unable to acquire the CSI of Eve because this latter is assumed to be a passive eavesdropper.Using the zero forcing precoder, the precoding matrix used by Alice can be expressed similar to [16] as(2)
P
=
β
H
A
R
H
H
A
R
H
A
R
H
-
1
,where(3)
β
=
1
-
δ
1
P
/
2
t
r
H
A
R
H
A
R
H
-
1is a power normalization factor to achieve the power constraint of t
r
(
P
P
H
)
=
(
1
-
δ
1
)
P
/
2, P denotes the total transmitted power during the two phases, and δ
1 is a power allocation factor, δ
1
∈
(
0,1
]. In the proposed scheme, the total power P is divided equally between the two transmission phases. Thus, P
/
2 is used in the first phase while being divided between the useful signal from Alice and the jamming signal from Bob. This division happens through the use of the power allocation factor δ
1; i.e., (
1
-
δ
1
)
P
/
2 is used by Alice and δ
1
P
/
2 is used by Bob. During the second phase, the remaining P
/
2 is shared among all relays using the power allocation factor δ
2
∈
(
0,1
] as follows: (i) P
s
=
δ
2
P
/
2 is used by the selected relay to transmit the useful signal and (ii)  P
J
=
(
1
-
δ
2
)
P
/
(
2
(
N
r
-
1
)
) is used by each of the remaining N
r
-
1 relays to send the jamming signal received from Bob.Thanks to the use of ZFP, the signal is only received by theith relay and this can be seen by substituting (2) in (1). Thus, the received signal from Alice at different relays is given by(4)
y
R
i
=
β
b
j
+
η
R
i
,
y
R
k
=
η
R
k
,
∀
k
≠
i
.In this first phase, Bob also cooperates by broadcasting a jamming signalJ
B. Thus, the received signals from Alice and Bob during this phase at all relays is given by(5)
y
R
i
=
β
b
j
+
δ
1
P
2
h
B
R
i
J
B
+
η
R
i
,
y
R
k
=
δ
1
P
2
h
B
R
k
J
B
+
η
R
k
,
∀
k
≠
i
,where h
B
R
k
∈
C
N
b
×
1 is the channel vector between Bob and the kth relay R
k. To simplify the detection of Alice’s signal at the relays, the jamming signal is assumed to have a complex Gaussian distribution with zero-mean and variance σ
J
2; i.e., J
B
~
C
N
(
0
,
σ
J
2
). Thus, the received signal at different relays can be reformulated as(6)
y
R
i
=
β
b
j
+
η
~
R
i
,
y
R
k
=
η
~
R
k
,
∀
k
≠
i
,where η
~
R
k has a complex Gaussian distribution with zero-mean and variance σ
~
2
=
δ
1
P
/
2
h
B
R
k
F
2
σ
J
2
+
σ
r
2.Similar to [24], we assume that the relays communicate via a backhaul-link (this link can be established through control channels and does not necessary imply that the used channels are dedicated). Thus, taking into consideration the received CSI at the relays from Bob, we can employ the following centralized low-complexity Maximum Likelihood (ML) detector:(7)
i
^
,
j
^
=
a
r
g
m
i
n
i
,
j
y
R
-
β
s
i
j
=
a
r
g
m
i
n
i
,
j
β
b
j
2
-
2
R
y
R
i
∗
b
j
.The use of the ML detector in (7) ensures that a single relay is activated during the second transmission phase. In this context, the relay intended by the PSM selection is used at the second phase to transmit the decoded APM signal b
j using power P
s and the remaining N
r
-
1 relays send the perfectly estimated jamming signal received from Bob during the first phase each using a power P
J
=
(
P
/
2
-
P
s
)
/
(
N
r
-
1
). When the relayed signals are received by Bob, this latter can employ self-interference subtraction as it knows the jamming signal J
B and it has received channel estimations with all relays. Thus, the received signal at Bob is given by(8)
y
B
=
P
s
b
j
h
R
i
B
+
η
B
,where η
B is the C
N
(
0
,
σ
b
2
) AWGN at Bob and h
R
i
B is the channel coefficient between the ith relay R
i and Bob.During the first phase, the received signal from Alice and Bob at Eve is expressed as(9)
y
E
,
1
=
H
A
E
P
s
i
j
+
δ
1
P
2
H
B
E
J
B
+
η
E
,
1
,where η
E
,
1
∈
C
N
e
×
1 is the AWGN experienced by Eve during the first phase, having complex Gaussian distribution of C
N
(
0
,
σ
e
2
I
N
e
). H
A
E
∈
C
N
e
×
N
a is the channel matrix between Alice and Eve having C
N
(
0
,
d
A
E
-
α
) distributed components. H
B
E
∈
C
N
e
×
N
b is the channel matrix between Bob and Eve having C
N
(
0
,
d
B
E
-
α
) distributed components.The received signal at Eve for the second phase is given by(10)
y
E
,
2
=
P
s
b
j
h
R
i
E
+
P
J
∑
k
≠
i
h
R
k
E
J
B
+
η
E
,
2
,where η
E
,
2
∈
C
N
e
×
1 is the C
N
(
0
,
σ
e
2
) AWGN experienced by Eve during the second phase.


## 3.2. Ergodic Secrecy Capacity

Using the received signal expression in (8), the signal-to-noise ratio (SNR) at Bob can be expressed as(11)
Γ
B
=
P
s
σ
b
2
h
R
i
B
F
2
.The SNRs at Eve for both the first and second phases are derived using (9) and (10), respectively, as follows:(12)
γ
E
,
1
=
H
A
E
P
F
2
δ
1
P
/
2
H
B
E
F
2
σ
g
2
+
σ
e
2and(13)
γ
E
,
2
=
P
s
h
R
i
E
F
2
P
J
∑
k
≠
i
h
R
k
E
F
2
σ
g
2
+
σ
e
2
.Similar to [22], the ergodic secrecy capacity for the considered dual-hop scheme can be given as(14)
C
s
=
E
1
2
l
o
g
2
1
+
Γ
B
1
+
Γ
E
+
,where Γ
E
=
max
⁡
γ
E
,
1
,
γ
E
,
2 in order to account for the worst-case scenario.In this paper, we take advantage of the low probability of interception of PSM to guarantee the secrecy of the transmission during the first phase and thus assume thatΓ
E
=
γ
E
,
2. Indeed, as discussed in [11], if the Alice-Relays channels vary fast enough, the transmission from Alice to each relay is more or less a “one-time pad” cryptographic scheme, which is rendered absolutely secure. In this scenario, Eve cannot detect any information sent from Alice to Bob due to the one-time pad effect. When the Alice-Bob channels vary sufficiently slow, Eve is still incapable of detecting the SSK symbol i, as Eve is unable to estimate the precoding matrix P separately. Consequently, Eve needs to have both its CSI of H
A
,
E and the perfect knowledge of P to successfully eavesdrop s
i
j. Thus, we assume that Eve is not able to get any useful information during the first phase. In order to confirm this assumption, we show in Figure 2 that γ
E
,
2 exceeds γ
E
,
1 almost surely for different simulation scenarios and parameters.Figure 2
Probability thatγ
E
,
2 exceeds γ
E
,
1 as a function of the average SNR with different N
a and N
b for N
r
=
N
e
=
4 and δ
1
=
δ
2
=
0.5.Due to intractability of (14), we can derive a lower bound on the ESC as follows:(15)
C
s
≥
C
s
l
b
=
E
1
2
l
o
g
2
1
+
Γ
B
1
+
Γ
E
+
=
1
2
ln
⁡
2
E
ln
⁡
1
+
Γ
B
-
E
ln
⁡
1
+
Γ
E
+
.Assuming that all noise variances are equal to σ
2, we define the average SNRs ρ
=
P
/
(
2
σ
2
) and ρ
s
=
P
s
/
σ
2. Thus, the received SNR at Bob can be written as(16)
Γ
B
=
ρ
s
∑
k
=
1
N
b
h
R
i
B
k
2
,and the cumulative distribution function (CDF) of Γ
B is given by(17)
F
Γ
B
γ
b
=
1
-
∑
k
=
0
N
b
-
1
1
k
!
γ
b
γ
¯
b
ρ
s
k
e
-
γ
b
/
ρ
s
γ
¯
b
,where γ
¯
b
=
d
R
,
B
-
α.Using the CDF approach, the first part of the ergodic secrecy capacity lower bound is given in closed-form by(18)
E
ln
⁡
1
+
Γ
B
=
∫
0
∞
1
-
F
Γ
B
γ
b
1
+
γ
b
d
γ
b
=
∑
k
=
0
N
b
-
1
1
k
!
γ
¯
b
k
ρ
s
k
∫
0
∞
γ
b
k
1
+
γ
b
e
-
γ
b
/
ρ
s
γ
¯
b
d
γ
b
=
∑
k
=
0
N
b
-
1
1
γ
¯
b
k
ρ
s
k
Ψ
k
+
1
,
k
+
1
;
1
ρ
s
γ
¯
b
,where Ψ
(
·
,
·
;
·
) is the Confluent Hypergeometric function of the second kind [25, equation (9.211.4)]. Similarly, using (13), the CDF of Eve’s SNR is given by(19)
F
γ
E
,
2
γ
e
=
∫
0
∞
F
X
1
ρ
s
P
J
y
+
1
γ
e
f
Y
y
d
y
,where F
X
(
·
) is the CDF of the random variable X
=
h
R
i
E
F
2 and f
Y
(
·
) is the probability density function (PDF) of the RV Y
=
∑
k
≠
i
‍
h
R
k
E
F
2 representing in this case the summation of N
=
N
e
(
N
r
-
1
) exponential random variables.Using the CDF approach, similar to (18), the second part of the ergodic secrecy capacity lower bound can be obtained: (20)
E
ln
⁡
1
+
Γ
E
=
∫
0
∞
1
-
F
Γ
E
γ
e
1
+
γ
e
d
γ
e
=
∑
k
=
0
N
e
-
1
∑
j
=
0
k
N
+
j
-
1
!
P
J
j
ρ
s
N
+
j
-
k
j
!
k
-
j
!
N
-
1
!
γ
¯
e
k
-
j
×
∫
0
∞
γ
e
k
γ
e
+
1
P
J
γ
e
+
ρ
s
N
+
j
e
-
γ
e
/
γ
¯
e
ρ
s
d
γ
e
,where γ
¯
e
=
d
R
i
,
E
-
α.


## 3.3. Secrecy Outage Probability

The secrecy outage probability is defined as the probability of the secrecy capacityC
s being less than a predetermined secrecy rate R
s [5] and it is given by(21)
P
o
u
t
R
s
=
P
r
C
s
≤
R
s
=
P
r
Γ
B
≤
2
R
s
1
+
Γ
E
-
1
=
∫
0
∞
F
Γ
B
2
R
s
1
+
γ
e
-
1
f
Γ
E
γ
e
d
γ
e
=
1
-
∑
l
=
0
N
b
-
1
P
J
N
l
!
γ
¯
b
l
ρ
s
l
∑
k
=
0
N
e
-
1
∑
j
=
0
k
N
+
j
-
1
!
ρ
s
N
+
j
-
k
j
!
k
-
j
!
N
-
1
!
γ
¯
e
k
-
j
×
∑
m
=
0
l
∑
n
=
0
m
l
m
m
n
-
1
l
-
m
2
m
R
s
e
-
2
R
s
-
1
/
ρ
s
γ
¯
e
×
∫
0
∞
1
ρ
s
γ
¯
e
γ
e
2
+
N
+
j
-
k
+
1
P
J
γ
¯
e
γ
e
-
k
ρ
s
P
J
×
γ
e
n
+
k
-
1
γ
e
+
ρ
s
/
P
J
N
+
j
+
1
e
-
2
R
s
+
1
γ
e
/
ρ
s
γ
¯
e
d
γ
e
.Using change of variables and Binomial expansion, the outage probability can be obtained in closed-form in (22) where  a
=
2
R
s
+
1
/
P
J
γ
¯
e, b
=
ρ
s
/
P
J, and Γ
(
·
,
·
) is the upper incomplete Gamma function:(22)
P
o
u
t
R
s
=
1
-
∑
l
=
0
N
b
-
1
P
J
N
l
!
γ
¯
b
l
ρ
s
l
∑
k
=
0
N
e
-
1
∑
j
=
0
k
N
+
j
-
1
!
ρ
s
N
+
j
-
k
j
!
k
-
j
!
N
-
1
!
γ
¯
e
k
-
j
∑
m
=
0
l
∑
n
=
0
m
l
m
m
n
-
1
l
-
m
2
m
R
s
e
-
2
R
s
-
1
/
ρ
s
γ
¯
e
×
1
ρ
s
γ
¯
e
∑
p
=
0
n
+
k
+
1
n
+
k
+
1
p
-
b
n
+
k
+
1
-
p
b
a
p
+
1
Γ
p
-
N
-
j
,
a
+
N
+
j
-
k
+
1
P
J
γ
¯
e
∑
q
=
0
n
+
k
n
+
k
q
×
-
b
n
+
k
-
q
b
a
q
+
1
Γ
q
-
N
-
j
,
a
-
k
b
∑
r
=
0
n
+
k
-
1
n
+
k
-
1
r
-
b
n
+
k
-
1
-
r
Γ
r
-
N
-
j
,
a
b
a
r
+
1
e
-
a
/
b
.


## 3.4. Average Bit Error Probability

### 3.4.1. ABEP of Bob

In this part, the theoretical ABEP of Bob is derived. Based on the analysis of [26, 27], the end-to-end ABEP is expressed as (23)
P
B
o
b
γ
1
,
γ
2
=
P
1
γ
1
+
P
2
γ
2
-
P
1
γ
1
P
2
γ
2
.Here, P
1
(
γ
1
) is the ABEP between Alice and the RN, during the first time slot, for a given transmit SJNR γ
1 and P
2
(
γ
2
) is the ABEP between the RN and Bob, during the second slot, for a given transmit SNR γ
2. Hence the evaluation of the ABEP of Bob requires the evaluation of P
1
(
γ
1
) and P
2
(
γ
2
).During the first slot, assuming ZF precoding at Alice with(24)
P
=
H
A
R
H
H
A
R
H
A
R
H
-
1
,the received signal at the RN is given as(25)
y
R
=
P
A
d
A
R
-
α
D
x
+
w
~
.Here, it holds that H
A
R
=
d
A
R
-
α
H
~
A
R, with H
~
A
R
~
C
N
(
0
,
I
). In (25), P
A denotes Alice’s transmit power and w
~ is a vector denoting the composite effect of noise plus jamming from Bob. Also, D is the N
r
×
N
r diagonal normalization matrix defined as D
=
d
A
R
-
a
d
i
a
g
d
1
,
…
,
d
N
r, where(26)
d
i
=
1
H
~
A
R
H
~
A
R
H
-
1
i
,
i
.Here, we note that the ZF precoder defined in (24) is equivalent to the one defined in (2). We use the new definition only for analytical tractability and for the sake of the simplicity of the derived ABEP results. This also enriches the paper by giving two different ways of defining the ZF precoder used at Alice under the same assumptions.Since jamming is treated as noise at the RN, the detector at the RN is given as(27)
x
¯
=
a
r
g
m
i
n
x
y
R
-
D
x
2
2
.In particular, (27) is the ML detector of PSM. Therefore, P
1
(
γ
1
) is the ABEP of PSM with the jamming effect. Hence, the ABEP during the first hop at the RN is given as(28)
P
1
γ
1
≤
1
M
k
t
∑
x
∑
x
≠
x
^
d
x
→
x
^
P
R
-
S
M
x
→
x
^
,where d
(
x
→
x
^
) is the Hamming distance between the bit sequences represented by x and x
^. k
t
=
(
k
1
+
k
2
)
/
2 is equal to the total number of bits transmitted per symbol period. We note that k
1
+
k
2 is divided by two because the transmitted bitstream requires two symbol periods to reach Bob. Also, P
R
-
S
M
(
x
→
x
^
) is the PEP of transmitting x at Alice and erroneously detecting x
^ at the relay nodes.Based on the analysis presented in [28, Section IV], the instantaneous PEP is given as(29)
P
R
-
S
M
x
→
x
^
,
γ
1
∣
D
2
=
Q
c
H
D
2
c
2
P
A
d
A
R
-
a
γ
1
,where c
=
x
-
x
^. Considering the following upper bound of the Q-function [29]:(30)
Q
x
≤
∑
i
=
1
3
β
i
e
-
μ
i
x
2
,in (29) and averaging over all possible realizations of the Alice-RN channel, the average PEP of PSM is expressed as [28, Section IV] (31)
P
R
-
S
M
x
→
x
^
≤
∑
i
=
1
3
β
i
∏
l
=
1
N
α
1
/
α
l
L
2
μ
i
α
1
P
A
d
A
R
-
a
γ
+
1
L
×
∑
k
=
0
+
∞
δ
k
μ
i
α
1
P
A
d
A
R
-
a
γ
+
1
-
k
.Here, it holds thatβ
1
=
1
/
2, β
2
=
1
/
12, β
3
=
1
/
4, μ
1
=
2, μ
2
=
1, and μ
3
=
1
/
2. Furthermore, for a given pair of x
i and x
^
i, N is the number of nonzero elements of c. Also, α
l, l
=
1
,
…
,
N, stand for the eigenvalues of A
=
B
R in ascending order. Here, B is a diagonal matrix, defined as B
=
d
i
a
g
b
1
,
…
,
b
N, where b
l, l
=
1
,
…
,
N, is the absolute value of the lth nonzero element of c
i. In addition, R is a N
×
N matrix given as shown in (33).(32)
δ
k
+
1
=
1
,
k
=
-
1
,
k
k
+
1
∑
i
=
1
k
+
1
∑
j
=
1
N
1
-
α
1
α
j
i
δ
k
+
1
-
i
,
k
=
0,1
,
2
,
…
.
(33)
R
=
1
ρ
c
⋯
ρ
c
ρ
c
⋱
⋱
⋮
⋮
⋱
⋱
ρ
c
ρ
c
⋯
ρ
c
1
.In (33), ρ
c denotes the Pearson product-moment correlation coefficient between any pair of two different random variables (RVs) d
1
2
,
…
,
d
R
2. Moreover, δ
k, k
=
0,1
,
2
,
…, are given in (32). Finally, it holds that L
=
N
t
-
N
r
+
1.During the second hop, the received signal at Bob is expressed as(34)
y
B
=
P
R
H
R
B
x
¯
+
w
B
,after the ideal removal of the jamming signal. In (34), it holds that H
R
B
=
d
R
B
-
a
H
~
R
B, with H
~
R
B
~
C
N
(
0
,
I
). Also, P
R is the transmission power at the RN. Note that the value of P
R is selected such that the transmitted signal at the RN is normalized. As the RN retransmits binary information by using SM, Bob can deploy the following ML detector [8]:(35)
x
˘
=
a
r
g
m
i
n
x
y
B
-
P
B
d
R
B
-
a
H
~
R
B
x
2
2
.Therefore, the ABEP of the second hop is given as(36)
P
2
γ
2
≤
1
M
k
t
∑
x
∑
x
≠
x
^
d
x
→
x
^
,
P
S
M
x
→
x
^
,where P
S
M
(
x
→
x
^
) is the average PEP of transmitting x at the RN, while the detector of Bob decides in favor of x
^. Considering the statistical characteristics of the noise at Bob, it can be shown that the instantaneous PEP is given as(37)
P
S
M
x
→
x
^
,
γ
2
∣
H
~
R
B
=
Q
H
~
R
B
c
2
2
2
P
R
d
R
B
-
a
γ
2
.In (37), it is shown that the RV X
=
H
~
R
B
c
2
2 follows an Erlang distribution with the following PDF [30]: (38)
f
X
x
=
1
c
2
2
N
r
Γ
N
r
x
N
r
e
x
/
c
2
2
H
0
x
,where H
0
(
x
) is the Heaviside step function defined as H
0
(
x
)
=
0 for x
<
0 and H
0
(
x
)
=
1 for x
≥
0. Considering (30) and (38) in (37), the average PEP of the second hop is given as(39)
P
S
M
x
→
x
^
≤
∑
i
=
1
3
β
i
c
2
2
N
r
Γ
N
r
×
∫
0
+
∞
x
N
r
-
1
e
-
P
R
d
R
B
-
a
μ
i
γ
2
+
1
/
∥
c
∥
2
2
x
d
x
,by averaging over possible realizations of the RV X. From [25, p.346, 3.381, 4], it holds that(40)
∫
0
+
∞
x
ν
-
1
e
-
μ
x
d
x
=
μ
-
ν
Γ
ν
.The use of (30) and (40) into (39), after a straightforward elaboration, results in(41)
P
S
M
x
→
x
^
≤
∑
i
=
1
3
β
i
c
2
2
μ
i
P
R
d
R
B
-
a
γ
2
+
1
-
N
r
.In this way, the ABEP of Bob is computed via (23) by using (28), (31), (36), and (41).


### 3.4.2. ABEP of Eve

In this part, the theoretical ABEP of Eve is derived. As previously shown in Figure2, the Signal-to-Jamming-Plus-Noise Ratio at Eve during the second phase is much higher than the SJNR during the first phase for different simulation scenarios and parameters. Thus, the ABEP of Eve during the first phase is much worse than the ABEP during the second phase. Accounting for the worst-case scenario (i.e., taking the highest SNR at Eve and assuming perfect detection at the relays during the first phase), the SJNR at Eve when the ith relay is used during the second phase is given by(42)
γ
E
=
P
s
h
R
i
E
F
2
P
J
∑
k
≠
i
h
R
k
E
F
2
σ
g
2
+
σ
e
2
.In light of the above, the asymptotic performance bound of the ABEP at Eve with optimal detection is derived using the union bound as(43)
P
E
≤
∑
q
=
1
M
∑
q
^
=
1
M
N
r
N
q
,
q
^
M
P
x
j
q
→
x
j
^
q
^
,where N
(
q
,
q
^
) is the number of bits in error between the symbol x
q and x
q
^, and P
(
x
j
q
→
x
j
^
q
^
) denotes the PEP of deciding on the constellation vector x
j
^
q
^ given that x
j
q is transmitted and can be formulated as(44)
P
x
j
q
→
x
j
^
q
^
=
∫
v
=
0
∞
Q
v
f
κ
v
d
v
,where f
κ
(
·
) is the PDF and is a chi-squared random variable with 2
N
e degrees of freedom given by [31, p. 41] as(45)
f
κ
v
=
v
N
e
-
1
e
x
p
-
v
/
2
α
2
2
α
2
N
e
N
e
-
1
!
,where(46)
α
2
=
δ
2
ρ
1
-
δ
2
ρ
+
1
x
q
2
+
x
q
^
2
4
.Thus, the PEP in (44) is obtained in closed-form as(47)
P
x
j
q
→
x
j
^
q
^
=
γ
N
e
∑
w
=
0
N
e
-
1
N
e
+
w
-
1
w
1
-
γ
w
,where(48)
γ
=
1
2
1
-
α
2
1
+
α
2
.Finally, plugging in (47) in (43), the ABEP at Eve is obtained as(49)
P
E
≤
∑
q
=
1
M
∑
q
^
=
1
M
N
r
N
q
,
q
^
γ
N
e
∑
w
=
0
N
e
-
1
N
e
+
w
-
1
w
1
-
γ
w
M
.


## 3.4.1. ABEP of Bob

In this part, the theoretical ABEP of Bob is derived. Based on the analysis of [26, 27], the end-to-end ABEP is expressed as (23)
P
B
o
b
γ
1
,
γ
2
=
P
1
γ
1
+
P
2
γ
2
-
P
1
γ
1
P
2
γ
2
.Here, P
1
(
γ
1
) is the ABEP between Alice and the RN, during the first time slot, for a given transmit SJNR γ
1 and P
2
(
γ
2
) is the ABEP between the RN and Bob, during the second slot, for a given transmit SNR γ
2. Hence the evaluation of the ABEP of Bob requires the evaluation of P
1
(
γ
1
) and P
2
(
γ
2
).During the first slot, assuming ZF precoding at Alice with(24)
P
=
H
A
R
H
H
A
R
H
A
R
H
-
1
,the received signal at the RN is given as(25)
y
R
=
P
A
d
A
R
-
α
D
x
+
w
~
.Here, it holds that H
A
R
=
d
A
R
-
α
H
~
A
R, with H
~
A
R
~
C
N
(
0
,
I
). In (25), P
A denotes Alice’s transmit power and w
~ is a vector denoting the composite effect of noise plus jamming from Bob. Also, D is the N
r
×
N
r diagonal normalization matrix defined as D
=
d
A
R
-
a
d
i
a
g
d
1
,
…
,
d
N
r, where(26)
d
i
=
1
H
~
A
R
H
~
A
R
H
-
1
i
,
i
.Here, we note that the ZF precoder defined in (24) is equivalent to the one defined in (2). We use the new definition only for analytical tractability and for the sake of the simplicity of the derived ABEP results. This also enriches the paper by giving two different ways of defining the ZF precoder used at Alice under the same assumptions.Since jamming is treated as noise at the RN, the detector at the RN is given as(27)
x
¯
=
a
r
g
m
i
n
x
y
R
-
D
x
2
2
.In particular, (27) is the ML detector of PSM. Therefore, P
1
(
γ
1
) is the ABEP of PSM with the jamming effect. Hence, the ABEP during the first hop at the RN is given as(28)
P
1
γ
1
≤
1
M
k
t
∑
x
∑
x
≠
x
^
d
x
→
x
^
P
R
-
S
M
x
→
x
^
,where d
(
x
→
x
^
) is the Hamming distance between the bit sequences represented by x and x
^. k
t
=
(
k
1
+
k
2
)
/
2 is equal to the total number of bits transmitted per symbol period. We note that k
1
+
k
2 is divided by two because the transmitted bitstream requires two symbol periods to reach Bob. Also, P
R
-
S
M
(
x
→
x
^
) is the PEP of transmitting x at Alice and erroneously detecting x
^ at the relay nodes.Based on the analysis presented in [28, Section IV], the instantaneous PEP is given as(29)
P
R
-
S
M
x
→
x
^
,
γ
1
∣
D
2
=
Q
c
H
D
2
c
2
P
A
d
A
R
-
a
γ
1
,where c
=
x
-
x
^. Considering the following upper bound of the Q-function [29]:(30)
Q
x
≤
∑
i
=
1
3
β
i
e
-
μ
i
x
2
,in (29) and averaging over all possible realizations of the Alice-RN channel, the average PEP of PSM is expressed as [28, Section IV] (31)
P
R
-
S
M
x
→
x
^
≤
∑
i
=
1
3
β
i
∏
l
=
1
N
α
1
/
α
l
L
2
μ
i
α
1
P
A
d
A
R
-
a
γ
+
1
L
×
∑
k
=
0
+
∞
δ
k
μ
i
α
1
P
A
d
A
R
-
a
γ
+
1
-
k
.Here, it holds thatβ
1
=
1
/
2, β
2
=
1
/
12, β
3
=
1
/
4, μ
1
=
2, μ
2
=
1, and μ
3
=
1
/
2. Furthermore, for a given pair of x
i and x
^
i, N is the number of nonzero elements of c. Also, α
l, l
=
1
,
…
,
N, stand for the eigenvalues of A
=
B
R in ascending order. Here, B is a diagonal matrix, defined as B
=
d
i
a
g
b
1
,
…
,
b
N, where b
l, l
=
1
,
…
,
N, is the absolute value of the lth nonzero element of c
i. In addition, R is a N
×
N matrix given as shown in (33).(32)
δ
k
+
1
=
1
,
k
=
-
1
,
k
k
+
1
∑
i
=
1
k
+
1
∑
j
=
1
N
1
-
α
1
α
j
i
δ
k
+
1
-
i
,
k
=
0,1
,
2
,
…
.
(33)
R
=
1
ρ
c
⋯
ρ
c
ρ
c
⋱
⋱
⋮
⋮
⋱
⋱
ρ
c
ρ
c
⋯
ρ
c
1
.In (33), ρ
c denotes the Pearson product-moment correlation coefficient between any pair of two different random variables (RVs) d
1
2
,
…
,
d
R
2. Moreover, δ
k, k
=
0,1
,
2
,
…, are given in (32). Finally, it holds that L
=
N
t
-
N
r
+
1.During the second hop, the received signal at Bob is expressed as(34)
y
B
=
P
R
H
R
B
x
¯
+
w
B
,after the ideal removal of the jamming signal. In (34), it holds that H
R
B
=
d
R
B
-
a
H
~
R
B, with H
~
R
B
~
C
N
(
0
,
I
). Also, P
R is the transmission power at the RN. Note that the value of P
R is selected such that the transmitted signal at the RN is normalized. As the RN retransmits binary information by using SM, Bob can deploy the following ML detector [8]:(35)
x
˘
=
a
r
g
m
i
n
x
y
B
-
P
B
d
R
B
-
a
H
~
R
B
x
2
2
.Therefore, the ABEP of the second hop is given as(36)
P
2
γ
2
≤
1
M
k
t
∑
x
∑
x
≠
x
^
d
x
→
x
^
,
P
S
M
x
→
x
^
,where P
S
M
(
x
→
x
^
) is the average PEP of transmitting x at the RN, while the detector of Bob decides in favor of x
^. Considering the statistical characteristics of the noise at Bob, it can be shown that the instantaneous PEP is given as(37)
P
S
M
x
→
x
^
,
γ
2
∣
H
~
R
B
=
Q
H
~
R
B
c
2
2
2
P
R
d
R
B
-
a
γ
2
.In (37), it is shown that the RV X
=
H
~
R
B
c
2
2 follows an Erlang distribution with the following PDF [30]: (38)
f
X
x
=
1
c
2
2
N
r
Γ
N
r
x
N
r
e
x
/
c
2
2
H
0
x
,where H
0
(
x
) is the Heaviside step function defined as H
0
(
x
)
=
0 for x
<
0 and H
0
(
x
)
=
1 for x
≥
0. Considering (30) and (38) in (37), the average PEP of the second hop is given as(39)
P
S
M
x
→
x
^
≤
∑
i
=
1
3
β
i
c
2
2
N
r
Γ
N
r
×
∫
0
+
∞
x
N
r
-
1
e
-
P
R
d
R
B
-
a
μ
i
γ
2
+
1
/
∥
c
∥
2
2
x
d
x
,by averaging over possible realizations of the RV X. From [25, p.346, 3.381, 4], it holds that(40)
∫
0
+
∞
x
ν
-
1
e
-
μ
x
d
x
=
μ
-
ν
Γ
ν
.The use of (30) and (40) into (39), after a straightforward elaboration, results in(41)
P
S
M
x
→
x
^
≤
∑
i
=
1
3
β
i
c
2
2
μ
i
P
R
d
R
B
-
a
γ
2
+
1
-
N
r
.In this way, the ABEP of Bob is computed via (23) by using (28), (31), (36), and (41).


## 3.4.2. ABEP of Eve

In this part, the theoretical ABEP of Eve is derived. As previously shown in Figure2, the Signal-to-Jamming-Plus-Noise Ratio at Eve during the second phase is much higher than the SJNR during the first phase for different simulation scenarios and parameters. Thus, the ABEP of Eve during the first phase is much worse than the ABEP during the second phase. Accounting for the worst-case scenario (i.e., taking the highest SNR at Eve and assuming perfect detection at the relays during the first phase), the SJNR at Eve when the ith relay is used during the second phase is given by(42)
γ
E
=
P
s
h
R
i
E
F
2
P
J
∑
k
≠
i
h
R
k
E
F
2
σ
g
2
+
σ
e
2
.In light of the above, the asymptotic performance bound of the ABEP at Eve with optimal detection is derived using the union bound as(43)
P
E
≤
∑
q
=
1
M
∑
q
^
=
1
M
N
r
N
q
,
q
^
M
P
x
j
q
→
x
j
^
q
^
,where N
(
q
,
q
^
) is the number of bits in error between the symbol x
q and x
q
^, and P
(
x
j
q
→
x
j
^
q
^
) denotes the PEP of deciding on the constellation vector x
j
^
q
^ given that x
j
q is transmitted and can be formulated as(44)
P
x
j
q
→
x
j
^
q
^
=
∫
v
=
0
∞
Q
v
f
κ
v
d
v
,where f
κ
(
·
) is the PDF and is a chi-squared random variable with 2
N
e degrees of freedom given by [31, p. 41] as(45)
f
κ
v
=
v
N
e
-
1
e
x
p
-
v
/
2
α
2
2
α
2
N
e
N
e
-
1
!
,where(46)
α
2
=
δ
2
ρ
1
-
δ
2
ρ
+
1
x
q
2
+
x
q
^
2
4
.Thus, the PEP in (44) is obtained in closed-form as(47)
P
x
j
q
→
x
j
^
q
^
=
γ
N
e
∑
w
=
0
N
e
-
1
N
e
+
w
-
1
w
1
-
γ
w
,where(48)
γ
=
1
2
1
-
α
2
1
+
α
2
.Finally, plugging in (47) in (43), the ABEP at Eve is obtained as(49)
P
E
≤
∑
q
=
1
M
∑
q
^
=
1
M
N
r
N
q
,
q
^
γ
N
e
∑
w
=
0
N
e
-
1
N
e
+
w
-
1
w
1
-
γ
w
M
.


## 4. Numerical Results

In this section, we present selected numerical examples to confirm the ergodic secrecy capacity and the secrecy outage probability results derived in the previous section. We also present the bit error rate (BER) comparison for Bob and Eve by simulations. In these results, we assume that the secrecy during the first phase is guaranteed thanks to the use of PSM [10]. Indeed, the received SNR at Eve during the second phase exceeds that of the first phase with very high probability as discussed in Section 3.2 and shown in Figure 2.As discussed earlier, the total power is allocated during the first and second phases using the power allocation factorsδ
1 and δ
2, respectively. While both power allocation factors have effect on the performance of the proposed scheme, δ
2 has more weight and affects the BER performance more than δ
1. Indeed, the beamforming used at Alice during the first phase maximizes the received SNR at the intended relay which reduces the effect of the power allocation factor δ
1. In what follows, we study the effect of δ
2 and show that it has more weight and affects the performance more than δ
1. In this context, Figure 3 presents the effect of the power allocation coefficient δ
2 during the second phase on the secrecy outage probability. We can see from this figure that the value of the optimal power allocation coefficient δ
2
∗ depends on different parameters including the number of antennas at different nodes. For instance, while δ
2
∗ is equal to 0.3 for N
b
=
4 and N
e
=
2, it is equal to 0.45 for N
b
=
4 and N
e
=
16. The exact values for the optimal power allocation coefficient can be mathematically derived by optimizing the SOP expression in (22). It can also be obtained through the asymptotic outage secrecy performance and we look at addressing this as a future extension to this work in order to further enhance the performance of the proposed scheme. In the following results, we use the optimal power allocation coefficient values obtained by simulations when generating the SOP curves.Figure 3
Effect of the power allocation at the second phase on the SOP with differentN
b and N
r, for N
e
=
4, ρ
=
20dB, R
s
=
1, and δ
1
=
0.5.In Figure4, we present the secrecy outage probability as a function of the average received SNR with both simulation and analysis. This figure is given for a secrecy rate threshold R
s
=
1 bits/s/Hz, N
r
=
4, N
e
=
4, and for different number of antennas at Bob. The power allocation coefficient δ
2 is selected as discussed above and is equal to δ
2
∗ corresponding to each number of antennas at Bob. Figure 4 also compares the performance of the proposed scheme to the case where a single relay participates in transmitting the jamming signal at the second phase. We can clearly see the advantage of using multiple relays for jamming as it enhances the secrecy outage probability by further degrading the received SNR at Eve.Figure 4
SOP comparison with the case where a single relay is used for jamming, forR
s
=
1 bits/s/Hz, N
a
=
4, N
r
=
4, N
e
=
4, and δ
1
=
0.5.Figure5 presents the ESC in bits/s/Hz as a function of the average SNR ρ
=
P
/
(
2
σ
2
) with different number of antennas at Bob and Eve, for N
a
=
4, N
r
=
4, δ
1
=
0.5, and δ
2
=
0.75. These results show the accuracy of the analytical derivations presented in the previous section. We can also see from this figure the effect of different parameters on the ESC. In this context, we can confirm the improvement of the secrecy rate through increasing the number of antennas at Bob and its degradation by increasing the number of antennas at Eve. We can also see that, for high average SNRs, the number of antennas at Eve has less effect of the ESC performance and the curves for N
e
=
1 and N
e
=
4 converge.Figure 5
ESC with different number of antennas at Bob and Eve, forN
a
=
4, N
r
=
4, δ
1
=
0.5, and δ
2
=
0.75.Figure6 depicts the BER at Bob and Eve as a function of ρ for different power allocation coefficients δ
2. This figure confirms the tightness of the ABEP bounds derived in the previous section. The main goal of the proposed scheme is to make sure that Eve is not able to detect the information exchanged between Alice and Bob. To this end, we use precoding-aided spatial modulation and cooperative jamming. Thanks to these techniques, the SNR at Eve becomes very low and, thus, the error performance degrades. The simulation results shown in Figure 6 confirm the improvement of the BER at Bob compared to the BER at Eve thanks to the use of the multirelay jamming. From this figure, we can also see that the BER at both Bob and Eve improves when more power is allocated for the relay selected by PSM (i.e., the relay transmitting the message). On the other hand, the BER at both receivers degrades when more power is allocated to the jamming relays.Figure 6
BER comparison at Bob and Eve for different power allocations during the second phase, forN
a
=
4, N
r
=
4, N
b
=
4, N
e
=
4, and δ
1
=
0.5.In Figure7, we study the effect of the number of receive antennas on the BER at Bob and Eve as a function of ρ for N
a
=
4, N
r
=
4, δ
1
=
0.5, and δ
2
=
0.7. These simulation results show the improvement of the BER at Bob and Eve for higher number of receive antennas at each of these nodes. From this figure, we can also confirm that the use of multirelay jamming comes with improved BER at Bob compared to the BER at Eve. Indeed, Eve experiences much worse detection performance thanks to the use of PSM and jamming from Bob in the first phase and the use of jamming from N
r
-
1 relays in the second phase.Figure 7
BER comparison at Bob and Eve for different number of receive antennas, forN
a
=
4, N
r
=
4, δ
1
=
0.5, and δ
2
=
0.7.In the above results, we note that we used a fixed number of relays, equal to four, only to simplify the simulations. However, we need to highlight that the performance of the proposed scheme depends on the number of available relays. Indeed, in the proposed work, while increasing the number of relays enhances the spectral efficiency as a property of precoding-aided spatial modulation, it causes a degradation in the BER performance [32]. Indeed, the increase in N
r is equivalent to increasing the constellation size of the index modulation used during the second phase while keeping the same transmit power. This case will generate more errors at the ML detector as the distance between different constellation points shrinks with a higher N
r and a constant transmit power, divided between all relays using the power allocation factor δ
2.


## 5. Conclusion

In this paper, we have studied the physical-layer security of a wiretap channel using a PSM-based relay-selection scheme with multiple relays’ jamming. The performance of the proposed system is evaluated in terms of the ergodic secrecy capacity, secrecy outage probability, and bit error rate performances. Numerical results, confirmed by analysis, show an enhanced secrecy performance when compared to selected schemes. Using simulations, we use power allocation optimization in order to divide the power between the relay transmitting the useful information and the jamming relays, and thus we further improve the secrecy performance of the proposed scheme. In this paper, we have also provided closed-form expressions for the ESC and SOP and we derive very tight upper-bounds for the BER. These results confirm the ESC, SOP, and BER performance improvements at Bob and its degradation at Eve, which confirms the high secrecy performance of the proposed scheme.



---

*Source: 8407297-2018-08-05.xml*