ROBUST JOINT BEAMFORMING AND ARTIFICIAL NOISE DESIGN FOR
AMPLIFY-AND-FORWARD MULTI-ANTENNA RELAY SYSTEMS
Lijian Zhang, Liang Jin, Wenyu Luo, Yanqun Tang and Dingjiu Yu
Zhengzhou Information Science and Technology Institute, Zhengzhou 450002, China
ABSTRACT
In this paper, we address physical layer security for amplify-and-
forward (AF) multi-antenna relay systems in the presence of multi-
ple eavesdroppers. A robust joint design of cooperative beamform-
ing (CB) and artificial noise (AN) is proposed with imperfect chan-
nel state information (CSI) of both the destination and the eavesdrop-
pers. We aim to maximize the worst-case secrecy rate subject to the
sum power and the per-antenna power constraints at the relay. Such
joint design problem is non-convex. By utilizing the semidefinite
relaxation (SDR) technique, S-procedure and the successive convex
approximation (SCA) algorithm, the original non-convex optimiza-
tion problem is recast into a series of semidefinite programs (SDPs)
which can be efficiently solved using interior-methods. Simulation
results are presented to verify the effectiveness of the proposed de-
sign.
Index Terms— Physical layer security, amplify-and-forward re-
laying, cooperative beamforming, artificial noise, secrecy rate
1. INTRODUCTION
As a complement to cryptographic methods on upper layers, physi-
cal layer security has been regarded as a promising technique to pro-
vide secure data communication. Recently, substantial research has
been dedicated toward improving the secrecy rate of various wire-
less communication systems [1], [2], among which the cooperative
relay system has attracted considerable attention [3]. The secrecy
rate maximization problem for the single-antenna relay systems has
been explored in [4–9]. And the secure transmission approaches for
multi-antenna relay systems have been investigated in [10–14].
In this paper, we focus on the robust joint design of coopera-
tive beamforming (CB) and artificial noise (AN) for amplify-and-
forward (AF) multi-antenna relay systems. The imperfect channel
state information (CSI) of both the destination and the eavesdrop-
pers is assumed to be available at the relay. The worst-case secrecy
rate is maximized by jointly optimizing the beamforming and AN
covariance matrices at the relay subject to the sum power and the
per-antenna power constraints. Even if the worst-case secrecy rate
maximization (WCSRM) problem is non-convex, we can find the
suboptimal solution using the semidefinite relaxation (SDR) tech-
nique [15], S-procedure [16], and the successive convex approxima-
tion (SCA) algorithm [17], [18].
This paper addresses the WCSRM problem for AF multi-
antenna relay systems. It is worthwhile to mention some related
works. In [8] and [9], the robust design for secure single-antenna
relay systems was investigated, while we consider the case with a
Corresponding author: Liang Jin, Email: liangjin ndsc@163.com. This
work was supported in part by the National Natural Science Foundation of
China under Grants 61171108, 61401510 and 61379006.
multi-antenna relay. The works [10] and [11] considered a multi-
antenna relay scenario, but the method is only applicable for the
single eavesdropper case. Besides, it is assumed that only the CSI
of the eavesdropper(s) is imperfect in [8–11, 19]. Actually, the CSI
of the destination may be also imperfect, which is considered in
this paper. To the best of our knowledge, robust approaches to the
WCSRM problem for AF multi-antenna relay systems overheard by
multiple eavesdroppers are not available in the literature.
Notations: We use ⊗, , I
N
and 1
N×1
to denote the Hadamard
product, Kronecker product, identity matrix of dimension N and the
all-one column vector of dimension N, respectively. D(q) repre-
sents a diagonal matrix with q on the main diagonal. Re(·) extracts
the real part of a complex variable. q=vec(Q) denotes a column
vector by stacking all the elements of Q and vec
−1
(q) is the inverse
operation of vec(Q) for recovering Q.
2. SYSTEM MODEL AND PROBLEM FORMULATION
We consider a two-hop AF relay system, which consists of one
source (Alice), one relay, one legitimate destination (Bob) and mul-
tiple eavesdroppers (Eves). All the nodes are equipped with a single
antenna, except that the relay is equipped with N (N ≥ 2) anten-
nas. We assumed that the direct links between Alice and Bob as
well as Alice and Eves can be ignored due to the weak quality of the
channels. Alice intends to transmit confidential information to Bob
aided by the trusted relay, while keeping it secret from the Eves.
The whole information transmission includes two phases. In the
first phase, Alice transmits a symbol s with the average power P
s
to
the relay. The received signal vector at the relay is
y
r
= f s + n
r
, (1)
where f ∈ C
N
represents the channel vector from Alice to the re-
lay; n
r
∼CN(0, I) is the additive white Gaussian noise (AWGN)
vector received at the relay. In the second phase, the relay forwards
the signal multiplied by a beamforming matrix A ∈ C
N×N
. Con-
currently, the AN is transmitted for confusing the Eves. Hence, the
signal vector to be transmitted by the relay is x
R
= Af s+An
r
+v.
Here v ∼CN(0, Σ) is the artificial noise vector with Σ 0 being
the AN covariance matrix.
According to the expression of x
R
, the sum power of all anten-
nas and the power of the nth antenna can be computed, respectively,
as
P
r
= Tr(P
s
Af f
H
A
H
)+Tr(AA
H
)+Tr(Σ), (2a)
P
n
= e
T
n
(P
s
Af f
H
A
H
+ AA
H
+ Σ)e
n
, ∀n ∈N, (2b)
where e
n
is a unit vector with the nth entry being one; and
N {1, ··· ,N}. Let h ∈ C
N
and g
k
∈ C
N
, ∀k ∈K,
K {1, ··· ,K}, denote the channel vector from the relay to
Bob and the channel vector from the relay to the kth Eve, respec-
tively. Then the signals received at Bob and the kth Eve is expressed,
1732978-1-4673-6997-8/15/$31.00 ©2015 IEEE ICASSP 2015