# Robust beamforming and cooperative jamming for secure transmission in DF relay systems

- Bin Li
^{1}and - Zesong Fei
^{1}Email author

**2016**:68

https://doi.org/10.1186/s13638-016-0560-1

© Li and Fei. 2016

**Received: **5 August 2015

**Accepted: **15 February 2016

**Published: **1 March 2016

## Abstract

In this paper, we study robust joint beamforming and cooperative jamming (CJ) in a secure decode-and-forward (DF) relay system in the presence of multiple eavesdroppers, in which a multi-antenna DF relay employs transmit beamforming to help the source deliver information to the destination and simultaneously generates Gaussian artificial noise to confuse these eavesdroppers. We assume that all the channel state information (CSI) is imperfectly known at the relay subject to norm-bounded CSI errors. Our objective is to maximize the achievable secrecy rate at the destination by jointly optimizing the transmit beamforming vector of information signals and the covariance matrix of jamming signals at the relay subject to its total transmit power constraint. Although this problem is non-convex and in general difficult to be solved, we obtain its optimal solution via the technique of semi-definite relaxation (SDR) together with a one-dimensional (1-D) search. Specifically, we prove that the SDR is tight for the problem of our interest. Finally, numerical results are provided to validate our proposed scheme.

### Keywords

Physical layer security Decode-and-forward (DF) relay Cooperative jamming (CJ) Robust beamforming Semi-definite relaxation (SDR)## 1 Introduction

Secure wireless transmissions have drawn significant attention due to the broadcast nature of radio propagation and the inherent openness of the transmission medium. In addition to the traditional encryption techniques, physical layer security has been recognized as a prominent technique to realize secure communication by exploiting wireless channel fading (see, e.g., [1–3]). Recently, the introduction of relay into physical layer security has attracted a lot of research interest as a promising solution to improve transmission security through cooperative diversity [4, 5]. Similar to the traditional relay systems, amplify-and-forward (AF) [6] and decode-and-forward (DF) [7] are two commonly used schemes in secure relay systems.

To further improve physical layer security, artificial noise (AN) or cooperative jamming (CJ) approach has been introduced in the secrecy system by embedding noise or jamming signal in the transmitted signal to confuse eavesdroppers [8–11]. In addition to helping relay the desirable information signals from source nodes to destination nodes, trusted relays can also implement CJ [12, 13] to confuse the potential eavesdroppers by simultaneously sending jamming signals together with the information signals. Furthermore, due to the success of multi-antenna techniques in wireless communications, employing multiple antennas in the secure relay systems has also been investigated in the literature recently [14–16], in which the multi-antenna nodes can adjust the directions of their transmitted information and jamming signals so as to further improve the secure performance.

Recently, there are some works [17–19] in the literature investigating joint relay beamforming and CJ design to maximize the achievable secrecy rate in relay systems. Specifically, [17] studied secure beamforming and CJ design in an AF relay system with multiple distributed relays and multiple eavesdroppers each with a single antenna, in which the secrecy rate was maximized subject to both total and individual power constraints at the relay nodes. Ding et al. [18] considered joint beamforming and CJ scheme in an AF-based multi-antenna relay system with an eavesdropper, in which interference alignment was used to ensure that jamming signals from the source and the relay can be aligned together at the destination. The most recent work [19] addressed DF-based multi-antenna relay beamforming and CJ design in the presence of multiple eavesdroppers. In [17–19], the global channel state information (CSI) is assumed to be perfectly known at both the source and the relay.

However, the practical implementation of beamforming and CJ design at the multi-antenna relay in secure wireless communications critically relies on the CSI availability from the source/relay to the destination/eavesdroppers at the transmitter [20–23]. This is difficult to be obtained perfectly in practice due to channel quantization and feedback errors. As a result, it is essential to investigate the robust relay transmission design under imperfect CSI. Robust transmit designs for multiple-input single-output (MISO) wiretap channels under both individual and global power constraints for the source and the helper were presented in [21], where transmit covariance matrices at the source and the helper were jointly optimized to maximize the secrecy rate. Zhao et al. [22] investigated robust beamforming design of sum secrecy rate optimization under sum power constraint for multiple user-eavesdropper pairs, and a low complexity zero-forcing (ZF) beamformers is developed. Ni et al. [23] and Fei et al. [24] discussed robust coordinated beamforming for multi-user interference channel secure communications under imperfect CSI. There have been no consideration of the relay system in [21–24]. It is worth noting that there has been a handful of works [25–27] investigating the robust relay beamforming design. Specifically, [25] investigated the AF-based relay beamforming scheme in the presence of multiple eavesdroppers to maximize the secrecy rate. The imperfect CSI of relay-destination and relay-eavesdroppers links was modeled using a norm-bounded CSI error model. Zhang et al. [26] designed robust joint optimization in bidirectional multi-user multi-relay MIMO systems, in which authors mainly concentrated on the sum mean square error (MSE) criterion as well as maximum user’s MSE. However, the two aforementioned works did not consider jamming signals generated by relays to confuse eavesdroppers. Wang and Wang [6] has considered an AF relaying system with the multiple distributed relays each with a single antenna. In [27], the relaying robust beamforming for device-to-device communication with channel uncertainty was considered. To the best of our knowledge, the DF-based robust joint beamforming and CJ design for maximizing secrecy rate in relay systems with imperfect CSI is much less known.

- 1)
The relay operates in a half-duplex mode, accordingly the transmission is divided into two time slots. In the first time slot, the source transmits signals to the destination and the relay, and in the second time slot, the relay forwards the re-encoded signals (a jamming signal is embedded in the transmitted signal of relay) to the destination. It is presumed that the wireless channels from the source/relay to the destination/eavesdroppers are subject to norm-bounded CSI errors.

- 2)
By jointly optimizing the transmit beamforming vector of information signals and the covariance matrix of jamming signals at the relay to maximize the achievable secrecy rate at the destination while guaranteeing the total transmit power constraint. Although this problem is non-convex and in general difficult to be solved, we obtain its optimal solution via the techniques of semi-definite relaxation (SDR) together with a one-dimensional (1-D) search. Furthermore, we prove that the tightness of SDR of channel uncertainty, which can guarantee the optimality of the solution in this case.

The rest of this paper is organized as follows. Section 2 introduces the system model and problem formulation. Section 3 proposes the optimal solution to the considered problem. Section 4 presents numerical results to validate the proposed scheme. Finally, Section 5 concludes this paper.

*Notations*: Throughout this paper, boldface lowercase and uppercase letters denote vectors and matrices, respectively. The transpose, conjugate transpose, rank, and trace of matrix **A** are denoted as **A**
^{
T
}, **A**
^{
H
}, rank(**A**), and tr(**A**), respectively. **A**
^{∗} denotes the conjugate of matrix **A**, and **I** denotes the identity matrix. **A**≽0 means **A** is a positive semidefinite matrix. The distribution of a circularly symmetric complex Gaussian (CSCG) random vector with mean vector **x** and covariance matrix Σ is denoted by \(\mathcal {CN}(\mathbf {x},\Sigma)\); and ∼ stands for “distributed as.”

## 2 System model and problem formulation

### 2.1 System model

*K*>1 passive eavesdroppers (Es), as shown in Fig. 1. Suppose that the relay is equipped with

*N*>1 antennas, and each of the other nodes is equipped with a single antenna. Let \(\mathcal {K} = \{1,\ldots,K\}\) denote the set of Es. The relay operates in a half-duplex mode, and accordingly, the information transmission from S to D with the assistance of R requires two time slots to complete. In the first time slot, S transmits signals to R and D. After decoding the information, in the second time slot, R forwards the re-encoded signals to D. To enhance physical layer security by preventing the

*K*Es from eavesdropping the confidential signal sent by S to D, we consider that R employs the CJ-aided secure communication scheme. Specifically, R employs transmit beamforming for delivering the confidential information to D and at the same time generates Gaussian artificial noise to confuse the

*K*Es.

Throughout this paper, the *K* Es are passive and the goal is to interpret the transmission information without trying to modify it. It is assumed that S and R can (partially) obtain the CSI associated with Es through, e.g., estimating channels based on Es’ transmitted signals, while they do not know the location of Eve. As Es’ location changes, the proposed beamforming design is able to adapt dynamically to ensure the secure communications of Alice based on the associated channels. Note that the location-based secure robust beamforming design is beyond the scope of this paper, while the interested readers can refer to [28] and the reference therein for more information. Let the channel coefficients over links *S*→*D*, *S*→*E*
_{
k
}, *S*→*R*, *R*→*D*, and *R*→*E*
_{
k
} (\(k\in \mathcal {K}\)) be denoted by *h*
_{SD}, \(h_{\text {SE}_{k}}\phantom {\dot {i}\!}\), \(\mathbf {h}_{\text {SR}}\in \mathbb {C}^{N\times 1}\), \(\mathbf {h}_{\text {RD}}\in \mathbb {C}^{N\times 1}\), and \(\mathbf {h}_{\text {RE}_{k}}\in \mathbb {C}^{N\times 1}\), respectively. All channel coefficients are quasi-stationary with flat-fading Rayleigh distribution.

*x*, the received signals at R, D, and E

_{ k }in the first time slot are respectively denoted as

where *P*
_{
s
} is the transmit power at the S. **n**
_{
R
}, *n*
_{1D
}, and \(n_{1E_{k}}\) are the complex Gaussian noises at the R, D, and E _{
k
} with \(\mathbf {n}_{R}\sim \mathcal {CN}(\mathbf {0},\sigma ^{2}\mathbf {I})\), \(n_{1D}\sim \mathcal {CN}(0,\sigma ^{2})\) and \(n_{1E_{k}}\sim \mathcal {CN}(0,\sigma ^{2})\), respectively. For notational convenience, we assume that the noise power at R, D, and Es are identical and normalized to be unity (i.e., *σ*
^{2}=1) without loss of generality.

where the factor 1/2 accounts for the fact that the overall transmission is divided into two time slots.

*Ω*≽

**0**, i.e., \(\mathbf {z}\sim \mathcal {CN}(\mathbf {0},{\Omega })\). Then, the received signals at D and E

_{ k }are respectively denoted as

where *n*
_{2D
} and \(n_{2E_{k}}\) denote the complex Gaussian noises at D and E _{
k
} with \(n_{2D}\sim \mathcal {CN}(0,\sigma ^{2})\) and \(n_{2E_{k}}\sim \mathcal {CN}(0,\sigma ^{2})\), respectively.

_{ k }by exploiting the MRC is given by

*P*

_{ r }, i.e.,

### 2.2 Problem formulation

*S*→

*D*,

*S*→

*E*

_{ k },

*R*→

*D*, and

*R*→

*E*

_{ k }(\(k\in \mathcal {K}\)) are denoted by \(\tilde {h}_{\text {SD}}\), \(\tilde {h}_{\text {SE}_{k}}\), \(\tilde {\mathbf {h}}_{\text {RD}}\), and \(\tilde {\mathbf {h}}_{\text {RE}_{k}}\), respectively. We assume that the channel uncertainty is bounded, and accordingly denote the regions of the exact wireless channels

*h*

_{ SD }, \(h_{SE_{k}}\),

**h**

_{ RD }, and \(\mathbf {h}_{RE_{k}}\) as \( {\mathcal{H}}_{SD} \), \(\mathcal {H}_{SE_{k}}\), \( {\mathcal{H}}_{RD} \), and \(\mathcal {H}_{RE_{k}}\), respectively, which are given by

where *Δ*
*h*
_{SD}, \(\Delta h_{\text {SE}_{k}}\phantom {\dot {i}\!}\), *Δ*
**h**
_{RD}, and \(\phantom {\dot {i}\!}\Delta \mathbf {h}_{\text {RE}_{k}}\) denote the channel uncertainties, respectively. And *δ*
_{SD}, \(\phantom {\dot {i}\!}\delta _{\text {SE}_{k}}\), *δ*
_{RD}, \(\phantom {\dot {i}\!}\delta _{\text {RE}_{k}}\) denote the error bounds corresponding uncertainty regions, respectively.

**w**of the desirable signal and the transmit covariance

*Ω*of the jamming signal at R subject to the information rate constraint in (10) and its total transmit power constraint at R in (11). As a result, the optimization problem is formulated as

Problem (16) is challenging to be solved due to the non-convex objective function (16a) (the objective function is the difference of two logarithm functions) and the semi-infinite constraint (16b) (due to the norm-bounded CSI errors). We address this challenge in the following section.

## 3 Optimal solution

**W**=

**w**

**w**

^{ H }with

**W**≽

**0**and rank(

**W**)≤1. Then, by substituting

**w**

**w**

^{ H }as

**W**and introducing a slack variable

*α*≥0, problem (16) is equivalently expressed as

*γ*≥0, problem (17) is reformulated as

where function log2(·) is omitted since the logarithm is a monotonically increasing function that has no effect on the optimization problem.

*a,b*,

*c*, and

*d*to replace the worst-case direct link signal-to-noise ratio (SNR) at D and E

_{ k }for constraints (18b)–(18d). First, we minimize the direct link SNR at D for constraint (18b), which is [26]

_{ k }for constraint (18c), which is

where *d*=*P*
_{
s
}∥**h**
_{SR}∥^{2}.

*t*≥0 is a complimentary slackness parameter. Using Charnes-Cooper transformation [32], problem (25) is equivalently transformed as

Problem (27) has semi-infinite constraints (27b)–(27e) and non-convex rank-one constraint (27h), which are intractable. Denoting the optimal solution to problem (27) as \((\hat {\mathbf {W}}^{o}, \hat {{\Omega }}^{o},t^{o})\) and the corresponding optimal objective value as *γ*
^{
o
}, using SDR to obtain \((\hat {\mathbf {W}}^{o}, {\hat {{\Omega }}^{o}},t^{o})\) under given *α*, and using 1-D line search to search the optimal *α*, we have the following proposition.

###
**Proposition**
**1**.

###
*Proof*.

Please refer to the “Appendix 1” section.

*S*-procedure [34] to convert the constraints (27b)–(27e) into linear matrix inequalities (LMIs) [35]. For constraint (27b), we substitute (13) into (27b) and rewrite it as follows

where \(\mathbf {\Sigma }_{1}=\hat {\mathbf {W}}+(1+a)\hat {{\Omega }}\).

*S*-procedure and introducing a slack variable

*λ*

_{1}≥0, we convert (29) into an LMI given by

where \(\mathbf {\Sigma }_{2}=(\alpha -1-b)\hat {{\Omega }}-\hat {\mathbf {W}}\), and \(\mathbf {\Sigma }_{3}=\alpha \hat {\mathbf {W}}\). *λ*
_{1}≥0, *λ*
_{2}≥0, *λ*
_{3}≥0, and *u*
_{
k
}≥0 are introduced slack variables.

Problem (34) is still non-convex due to the rank-one constraint of \(\hat {\mathbf {W}}\). To meet this challenge, we use the SDR technique here. By dropping the rank-one constraint, problem (34) becomes a convex semidefinite program (SDP) for a given *α* that consists of a linear objective function together with a set of LMI constraints, which can thus be solved effectively via standard convex optimization techniques such as the interior point method [35]. As a result, we can recast problem (34) as a two-layer optimization problem.

*α*, and the inner layer is a convex SDP problem with fixed

*α*. Thus, we need to search for

*α*. The upper bound of

*α*is derived as

s.t. all constraints in problem (34).

Here, if \(\hat {\mathbf {W}}^{o}\) is of rank-one, then the solution of the SDR is the optimal solution to the original problem (34) (in other words, the SDR of problem (34) is tight). In this case, the optimal robust beamforming vector at R can be exactly obtained as **w**
^{
o
} via employing the eigenvalue decomposition **W**
^{
o
}=**w**
^{
o
}(**w**
^{
o
})^{
H
}; otherwise, it is not in general. Fortunately, due to the specific structure of problem (34), we can prove in the following that \(\hat {\mathbf {W}}^{o}\) is indeed of rank one. Accordingly, the obtained optimal solution to the SDR of (34) is indeed the optimal solution to the original problem (34). The robust beamforming design without direct transmission (DT) from S to D and from S to Es is a special case of (34) with *a*=0,*b*=0.

###
**Proposition**
**2**.

The optimal solution to the SDR of problem (34), \(\hat {\mathbf {W}}^{o}\), is always of rank one.

###
*Proof*.

Please refer to the “Appendix 2” section.

###
**Remark**
**1**.

*m*

_{sdp}denotes the number of semidefinite cone constraints,

*n*

_{sdp}denotes the dimension of the semidefinite cone, and

*ε*is the accuracy of solving the SDP. Comparing the SDP of (34) with the standard form in [36], we have

*m*

_{sdp}=

*K*+4 and

*n*

_{sdp}=

*N*+1. As a result, the computational complexity of the proposed scheme is

where *L* is the number of 1-D search.

## 4 Numerical results

In this section, we present simulation results to show the performance of the proposed robust joint beamforming and CJ design in DF relay system under channel uncertainty. We assume relay has four antennas, i.e., *N*=4, and the number of eavesdroppers is *K*=3. All the channel coefficients are assumed to be independent and identically distributed (i.i.d.) CSCG random variables with zero mean and unit variance. The transmit power at S is *P*
_{
s
}=0 *d*
*B*. For simplicity, we assume the error bounds are the same, i.e., \(\phantom {\dot {i}\!}\delta _{\text {SD}}=\delta _{\text {SE}_{k}}=\delta _{\text {RD}}=\delta _{\text {RE}_{k}}=\delta \). We average the worst-case secrecy rate via conducting 1000 randomly generated channel realizations.

*δ*=0.2. Here, the robust without CJ scheme is obtained by solving problem (34) with

*Ω*=0 [26]. From Fig. 2, it is observed that the average secrecy rate increases as the maximum total transmit power of relay increases and our proposed robust beamforming with CJ scheme is superior to all its counterparts in improving the secrecy rate.

*K*=3,6,9 eavesdroppers under

*N*=4, respectively. It can be observed that as eavesdropper number

*K*increases, the average secrecy rate would decrease. More eavesdroppers would surely degrade system performance. Figure 5 depicts the comparison of the average secrecy rate for different transmit antennas at relay. It is shown in Fig. 5 that the average secrecy rate is lifted to a higher level when more transmit antennas are equipped on relay. This is due to the fact that when the number of antennas increases, it means that there are more channels in the relay system and then more spatial degrees of freedom are utilized. Since the secrecy rate of each channel is non-negative, the increasing number of channels means an increase of system secrecy rate.

## 5 Conclusions

In this paper, we investigated robust beamforming and CJ design for a DF-based relay system in the presence of multiple eavesdroppers. We jointly optimized the transmit beamforming vector and the covariance matrix of jamming signals at the relay to maximize the achievable secrecy rate at the destination while ensuring the total transmit power constraint at the relay, in which we took into account imperfect CSI subject to norm-bounded errors. By applying the techniques of SDR together with a 1-D search, we have obtained the optimal solution. Furthermore, we proved that the SDR of the problem is tight. Simulation results have shown that the validity of the proposed scheme.

## 6 Appendix 1

### 6.1 Proof of proposition 1

Following the idea of [33] to prove this proposition, by reduction ad absurdum, we consider the following two situations. If \(\max _{\Delta \mathbf {h}_{\text {RD}}\in \mathcal {H}_{\text {RD}}}\mathbf {h}_{\text {RD}}^{T}\hat {{\Omega }}^{o}\mathbf {h}_{\text {RD}}^{*}+t^{o}\leq 1/\alpha \) and \(\text {tr}(\hat {\mathbf {W}}^{o})+\text {tr}(\hat {{\Omega }}^{o})< t^{o}P_{r}\), we can always find *t*=*t*
^{
o
}+*Δ*
*t*,*Δ*
*t*>0, which satisfies constraints (27c)-(27f). Thus, we can find the large objective value *γ*
^{
o
}+*Δ*
*t* which satisfies (39). If \(\max _{\Delta \mathbf {h}_{\text {RD}}\in \mathcal {H}_{\text {RD}}}\mathbf {h}_{\text {RD}}^{T}\hat {{\Omega }}^{o}\mathbf {h}_{\text {RD}}^{*}+t^{o}\leq 1/\alpha \) and \(\text {tr}(\hat {\mathbf {W}}^{o})+\text {tr}(\hat {{\Omega }}^{o})= t^{o}P_{r}\), we can find a solution \((\hat {\mathbf {W}}^{o}, \hat {{\Omega }}^{o}+\Delta \hat {{\Omega }},t^{o}+\Delta t),\Delta \hat {{\Omega }}\succ \mathbf {0},\Delta t>0\), which makes the constraint \(\max _{\Delta \mathbf {h}_{\text {RD}}\in \mathcal {H}_{\text {RD}}}\mathbf {h}_{\text {RD}}^{T}\hat {{\Omega }}^{o}\mathbf {h}_{\text {RD}}^{*}+t^{o}\leq 1/\alpha \) tighter while satisfying constraints (27c), (27d). As a result, these contradict that \((\hat {\mathbf {W}}^{o}, \hat {{\Omega }}^{o},t^{o})\) is the optimal solution to problem (27).

## 7 Appendix 2

### 7.1 Proof of proposition 2

where the dual variables \(\mathbf {B}_{1}\in \mathbb {H}_{+}\), \(\mathbf {B}_{2k}\in \mathbb {H}_{+}\), \(\mathbf {B}_{3}\in \mathbb {H}_{+}\), \(\mathbf {B}_{4}\in \mathbb {H}_{+}\) (\(\mathbb {H}_{+}\) denotes Hermitian matrix), and *μ*≥0 are corresponding to the constraints **T**
_{1}≽**0**, **T**
_{2k
}≽**0**, **T**
_{3}≽**0**, \(\hat {\mathbf {W}}\succeq \mathbf {0}\), and \(\text {tr}(\hat {\mathbf {W}})+\text {tr}(\hat {{\Omega }})- tP_{r}\leq 0\) in (34), respectively.

where \(\mathbf {H}_{\text {RD}}=\,[\mathbf {I}_{N},\tilde {\mathbf {h}}_{\text {RD}}]\), \(\mathbf {H}_{\text {RE}_{k}}=\,[\mathbf {I}_{N},\tilde {\mathbf {h}}_{\text {RE}_{k}}]\). It is noted that \(\mathbf {B}_{4}\hat {\mathbf {W}}=\mathbf {0}\) from KKT conditions. Since the size of **B**
_{1} and **T**
_{1} is (*N*+1)×(*N*+1), we have rank(**B**
_{1})+rank(**T**
_{1})≤*N*+1. Since the dimension of **B**
_{1} and **T**
_{1} is (*N*+1)×(*N*+1), according to the Sylvester’s rank inequality [37], we have rank(**B**
_{1})+rank(**T**
_{1})−(*N*+1)≤rank(**B**
_{1}
**T**
_{1}), then rank(**B**
_{1})+rank(**T**
_{1})≤*N*+1.

From *S*-procedure [34], we get the slack variable *λ*
_{1}≥0. Next, we show that *λ*
_{1}>0 via reduction ad absurdum. We consider the following situation. If *λ*
_{1}=0, the constraint ∥*Δ*
**h**
_{RD}∥≤*δ*
_{RD} is not active because *λ*
_{1} is its dual variable associated with the constraint in (30). If \(\|\Delta \mathbf {h}_{\text {RD}}^{\star }\|\leq \delta _{\text {RD}}\), \(\|\Delta \mathbf {h}_{\text {RD}}^{\star }\|\) is the worst channel uncertainty to minimize \((1+a)t+\mathbf {h}_{\text {RD}}^{T}[\!\hat {\mathbf {W}}+(1+a)\hat {{\Omega }}]\mathbf {h}_{\text {RD}}^{*}\) in constraint (27b), we can always find a scaler *ρ*>1 which satisfies \(\|\rho \Delta \mathbf {h}_{\text {RD}}^{\star }\|\leq \delta _{\text {RD}}\). By substituting \(\rho \Delta \mathbf {h}_{\text {RD}}^{\star }\) into \((1+a)t+\mathbf {h}_{\text {RD}}^{T}[\!\hat {\mathbf {W}}+(1+a)\hat {{\Omega }}]\mathbf {h}_{\text {RD}}^{*}\), we get the lower value than that obtained by \(\Delta \mathbf {h}_{\text {RD}}^{\star }\). It is contradictory to the assumption that \(\Delta \mathbf {h}_{\text {RD}}^{\star }\) minimizes \((1+a)t+\mathbf {h}_{\text {RD}}^{T}[\!\hat {\mathbf {W}}+(1+a)\hat {{\Omega }}]\mathbf {h}_{\text {RD}}^{*}\). As a result, rank(**T**
_{1})≥*N* and rank(**B**
_{1})≤1 hold when *λ*
_{1}>0. Furthermore, rank(**B**
_{1})≠0, so we have rank(**B**
_{1})=1. Similarly, we have rank(**B**
_{2k
})=rank(**B**
_{3})=rank(**B**
_{4})=1.

Due to the fact that rank(**B**
_{1})=1 from the above proof, we obtain \(\text {rank}\left (\mathbf {H}_{\text {RD}}\mathbf {B}_{1}\mathbf {H}_{\text {RD}}^{H}\right)=1\); thus, we have \(\text {rank}(\hat {\mathbf {W}})\leq 1\). As \(R_{D}(\hat {\mathbf {W}},\hat {{\Omega }}) > 0\), \(\text {rank}(\hat {\mathbf {W}})\) must not be 0, we have \(\text {rank}(\hat {\mathbf {W}})=1\). This completes the proof.

## Declarations

### Acknowledgements

This work was supported by the National Natural Science Foundation of China (Grant No. 61371075 and 61421001) and 863 Project (Grant No. 2015AA01A708).

**Open Access** This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

## Authors’ Affiliations

## References

- Y Liang, HV Poor, S Shamai, Secure communication over fading channels. IEEE Trans. Inf. Theory.
**54**(6), 2470–2492 (2008).MathSciNetView ArticleMATHGoogle Scholar - M Dehghan, DL Goeckel, M Ghaderi, Z Ding, Energy efficiency of cooperative jamming strategies in secure wireless networks. IEEE Trans. Wirel. Commun.
**11**(9), 3025–3029 (2012).View ArticleGoogle Scholar - Q Li, M Hong, HT Wai, YF Liu, WK Ma, ZQ Luo, Transmit solutions for MIMO wiretap channels using alternating optimization. IEEE J. Sel. Areas Commun.
**31**(9), 1714–1727 (2013).View ArticleGoogle Scholar - AP Shrestha, KS Kwak, Performance of opportunistic scheduling for physical layer security with transmit antenna selection. EURASIP J. Wirel. Commun. Netw.
**1**(33), 1–9 (2014).Google Scholar - Y Zou, J Zhu, X Wang, VCM Leung. Improving physical-layer security in wireless communications using diversity techniques.IEEE Netw.
**29**(1), 42–48 (2015).Google Scholar - C Wang, HM Wang, Robust joint beamforming and jamming for secure AF networks: low-complexity design. IEEE Trans. Veh. Technol.
**64**(5), 2192–2198 (2014).View ArticleGoogle Scholar - TM Hoang, TQ Duong, HA Suraweera, C Tellambura, HV Poor, Cooperative beamforming and user selection for improving the security of relay-aided systems. IEEE Trans. Commun.
**63**(12), 5039–5051 (2015).View ArticleGoogle Scholar - SAA Fakoorian, AL Swindlehurst, Solutions for the MIMO Gaussian wiretap channel with a cooperative jammer. IEEE Trans. Signal Process.
**59**(10), 5013–5022 (2011).MathSciNetView ArticleGoogle Scholar - J Li, AP Petropulu, S Weber, On cooperative relaying schemes for wireless physical layer security. IEEE Trans. Signal Process.
**59**(10), 4985–4997 (2011).MathSciNetView ArticleGoogle Scholar - M Ghaderi, DL Goeckel, A Orda, M Dehghan, in Proceedings of 10th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON). Efficient Wireless Security Through Jamming, Coding and Routing (New Orleans, LA, 2013), pp. 505–513.Google Scholar
- M Ghaderi, D Goeckel, A Orda, M Dehghan, Minimum energy routing and jamming to thwart wireless network eavesdroppers. IEEE Trans. Mobile Comput.
**14**(7), 1433–1448 (2014).View ArticleGoogle Scholar - L Dong, Z Han, AP Petropulu, HV Poor, Improving wireless physical layer security via cooperating relays. IEEE Trans. Signal Process.
**58**(3), 1875–1888 (2010).MathSciNetView ArticleGoogle Scholar - G Zheng, LC Choo, KK Wong, Optimal cooperative jamming to enhance physical layer security using relays. IEEE Trans. Signal Process.
**59**(3), 1317–1322 (2011).MathSciNetView ArticleGoogle Scholar - PH Lin, SH Lai, SC Lin, HJ Su, On secrecy rate of the generalized artificial-noise assisted secure beamforming for wiretap channels. IEEE J. Sel. Areas Commun.
**31**(9), 1728–1740 (2013).View ArticleGoogle Scholar - Q Li, WK Ma, Spatially selective artificial-noise aided transmit optimization for MISO multi-eves secrecy rate maximization. IEEE Trans. Signal Process.
**61**(10), 2704–2717 (2013).MathSciNetView ArticleGoogle Scholar - Z Chu, K Cumanan, Z Ding, M Johnston, S Le Goff, Secrecy rate optimizations for a MIMO secrecy channel with a cooperative jammer. IEEE Trans. Veh. Technol.
**64**(5), 1833–1847 (2015).View ArticleGoogle Scholar - Y Yang, Q Li, WK Ma, J Ge, PC Ching, Cooperative secure beamforming for AF relay networks with multiple eavesdroppers. IEEE Signal Process. Lett.
**20**(1), 35–38 (2013).View ArticleGoogle Scholar - Z Ding, M Peng, HH Chen, A general relaying transmission protocol for MIMO secrecy communications. IEEE Trans. Commun.
**60**(11), 3461–3471 (2012).View ArticleGoogle Scholar - S Vishwakarma, A Chockalingam, in
*Twentieth National Conference on Communications (NCC)*. MIMO Decode-and-Forward Relay Beamforming for Secrecy with Cooperative Jamming (IEEEKanpur, 2014), pp. 1–6.View ArticleGoogle Scholar - X Wang, K Wang, X Zhang, Secure relay beamforming with imperfect channel state information. IEEE Trans. Veh. Technol.
**62**(5), 2140–2155 (2013).View ArticleGoogle Scholar - J Huang, AL Swindlehurst, Robust secure transmission in MISO channels based on worst-case optimization. IEEE Trans. Signal Process.
**60**(4), 1696–1707 (2012).MathSciNetView ArticleGoogle Scholar - P Zhao, M Zhang, H Yu, H Luo, W Chen, Robust beamforming design for sum secrecy rate optimization in MU-MISO networks. IEEE Trans. Inf. Forensics Secur.
**10**(9), 1812–1823 (2015).View ArticleGoogle Scholar - J Ni, Z Fei, KK Wong, C Xing, J Kuang, K-F Tong, Robust coordinated beamforming for secure MISO interference channels with bounded ellipsoidal uncertainties. IEEE Wirel. Commun. Lett.
**2**(4), 407–410 (2013).View ArticleGoogle Scholar - Z Fei, J Ni, D Zhao, C Xing, N Wang, J Kuang, Ergodic secrecy rate of two-user MISO interference channels with statistical CSI.SCIENCE CHINA Inf. Sci.
**57**(10), 1–14 (2014).Google Scholar - S Vishwakarma, A Chockalingam, in Proceedings of IEEE International Conference on Communications (ICC). Amplify-and-Forward Relay Beamforming for Secrecy with Cooperative Jamming and Imperfect CSI (Budapest, 2013), pp. 3047–3052.Google Scholar
- M Zhang, H Yi, H Yu, H Luo, W Chen, Joint optimization in bidirectional multi-user multi-relay MIMO systems: non-robust and robust cases. IEEE Trans.Veh. Technol.
**62**(7), 3228–3244 (2013).View ArticleGoogle Scholar - Y Qin, M Ding, M Zhang, H Yu, H Luo, Relaying robust beamforming for device-to-device communication with channel uncertainty. IEEE Commun.Lett.
**18**(10), 1859–1862 (2014).View ArticleGoogle Scholar - C Liu, N Yang, J Yuan, R Malaney, Location-based secure transmission for wiretap channels. IEEE J. Sel. Areas Commun.
**33**(7), 1458–1470 (2015).View ArticleGoogle Scholar - F He, H Man, W Wang, Maximal ratio diversity combining enhanced security. IEEE Commun. Lett.
**15**(5), 509–511 (2011).View ArticleGoogle Scholar - MZI Sarkar, T Ratnarajah. Enhancing security in correlated channel with maximal ratio combining diversity.IEEE Trans. on Signal Process.
**60**(12), 6745–6751 (2012).MathSciNetGoogle Scholar - M Tian, X Huang, Q Zhang, J Qin, Robust AN-aided secure transmission scheme in MISO channels with simultaneous wireless information and power transfer. IEEE Signal Process. Lett.
**22**(6), 723–727 (2015).View ArticleGoogle Scholar - ZQ Luo, JF Sturm, S Zhang, Multivariate nonnegative quadratic mappings.SIAM. J. Optim.
**14**(4), 1140–1162 (2004).MathSciNetMATHGoogle Scholar - R Feng, Q Li, Q Zhang, J Qin, Robust secure transmission in MISO simultaneous wireless information and power transfer system. IEEE Trans. Veh. Technol.
**60**(1), 400–405 (2015).View ArticleGoogle Scholar - A Beck, YC Eldar, Strong duality in nonconvex quadratic optimization with two quadratic constraints.SIAM. J. Optim.
**17**(3), 844–860 (2006).MathSciNetMATHGoogle Scholar - S Boyd, L Vandenberghe,
*Convex Optimization*(Cambridge University Press, Cambridge, 2004).View ArticleMATHGoogle Scholar - I Polik, T Terlaky, in Nonlinear Optimization, ed. by G Di Pillo, F Schoen, and 1. Interior Point Methods for Nonlinear Optimization (SpringerBerlin, 2010). ch.4.Google Scholar
- RA Horn, CR Johnson,
*Matrix Analysis*(Cambridge University Press, Cambridge, 1985).View ArticleMATHGoogle Scholar