# Multi-objective robust resource allocation for secure communication in full-duplex MIMO systems

- Min Zhu
^{1, 2}and - Dengyin Zhang
^{1}Email author

**2017**:190

https://doi.org/10.1186/s13638-017-0975-3

© The Author(s) 2017

**Received: **1 January 2017

**Accepted: **24 October 2017

**Published: **14 November 2017

## Abstract

In this paper, we study robust resource allocation for the multi-user full-duplex (FD) multiple-input multiple-output (MIMO) communication systems. Particularly, we aim at minimizing uplink (UL) transmit power and downlink (DL) transmit power simultaneously while guaranteeing the quality of service (QoS) requirements regarding secure UL and DL communication, under the consideration of the imperfect channel state information (CSI) of the wiretap channels and the inter-user interference channels. In view of the conflicting of two objectives, we propose a multi-objective optimization (MOO) framework to achieve the trade-off between them. The formulated MOO problem is non-convex and intractable. By employing the weighted Tchebycheff, the Taylor series expansion, and the S-procedure approaches, we convert the MOO problem into the convex one and propose an iterative algorithm to solve it optimally. Simulation results not only demonstrate an interesting trade-off between the considered conflicting objectives but also show the efficiency of our proposed robust resource allocation designs.

## Keywords

## 1 Introduction

Owing to the exponential growth of demand in ubiquitous high data rate and secure wireless communication, the next generation communication systems suffer from severe limitation in radio resources such as energy and bandwidth. A promising technique for reducing the energy consumption and improving the bandwidth efficiency is multiple-input multiple-output (MIMO) which guarantees the efficient radio resource allocation by providing the extra degree of freedom. Moreover, as a practical realization, the multi-user MIMO (MU-MIMO) wireless communication systems which possess multiple receivers and shift the computational complexity from the receivers to the multi-antenna base station (BS) have drawn much attention of the researchers [1–5]. However, though the employment of the MU-MIMO wireless communication systems facilitate the efficiency for radio resource allocation, the spectral resource is still underutilized since the uplink (UL) and downlink (DL) transmission phases must be operated orthogonally in either time or frequency under the regime of half-duplex (HD) BS.

Recently, full-duplex (FD) wireless communication systems attract significant attention from both the academia and industry due to the ability in supporting the concurrent transmission and reception over the same frequency, which, thus, double the spectral efficiency compared with the HD communication systems [5–8]. However, owing to the strong loopback self-interference (SI), the implementation of FD communication encounters big challenges in the past decades. The protocols and resource allocation schemes need to be redesigned to fit with the context of FD communications. In [5], the authors studied the dynamic resource allocation and scheduling for the FD and hybrid relaying MIMO orthogonal frequency division multiple access (MIMO-OFDMA) systems. The authors in [6] studied the low-complexity scheme for the end-to-end performance in MIMO FD relay systems under the consideration of outage. A close to optimal beamformer design is proposed in [7] to maximize the spectral efficiency of FD small cell wireless systems. In [8], to restrain the SI and promote the spectral efficiency, both the massive MIMO antenna array and the multi-pair FD relays are introduced. Nevertheless, resource allocation scheme design for the systems with simultaneous UL and DL wireless communications have not been discussed in above literatures yet. Moreover, the UL and DL transmit power minimization are two conflicting design objectives. Thus, the frameworks adopted for the single-objective optimization in [5–8] may not be applicable in this scenario.

Simultaneous UL and DL wireless communication in FD systems have been studied in many literatures, recently. In [9], the authors investigated the robust power efficient problems under the premise of secure communication for the UL and DL users with FD BS. A multi-objective optimization framework was proposed to balance different design indexes. The similar system was considered in [10], where, in addition, the dual use of the radio frequency (RF) signals for simultaneous wireless information and power transfer (SWIPT) are incorporated. In [11], the multi-objective resource allocation problem is studied for multi-user multiple-input single-output (MISO) secondary communication system with SWIPT. By exploiting both the primal and dual solutions of the semidefinite relaxation (SDR) problem, the global optimal solution of the original problem is constructed. However, the problems investigated in above literatures are mainly focused on the MISO systems. The more complex systems, MIMO systems, are still remains little research, especially for the FD systems with simultaneous UL and DL transmission.

Motivated by the aforementioned observations, in this paper, we study the UL and DL transmission power minimization problem for the multi-user full-duplex (FD) multiple-input multiple-output (MIMO) communication systems. From the perspective of practice, the problem formulation takes into account the imperfectness of the CSI of the wiretap channels and the interference channels between UL user and DL users. Based on the MOO framework, the considered non-convex optimization problem is resolved by employing the weighted Tchebycheff, the Taylor series expansion, and the extended S-procedure approaches. Finally, from the derived approximate optimal solutions, the robust resource allocation schemes which balance UL and DL power consumption are proposed.

**Notation:** The lower-case, boldface lower-case, and boldface upper-case letters are used to denote scalars, vectors, and matrices, respectively; Tr(**X**),|**X**|(det(**X**)),**X**
^{
H
},(**X**)^{−1}, and ∥**X**∥_{
F
} denote trace, determinant, Hermitian transpose, inverse, and Frobenius norm; **I** represents the identity matrix; *C*
^{
n×m
} denotes the space of *n*×*m* complex matrices; **x**∼*CN*(μ,Σ) means that the random vector **x** follows a circularly symmetric complex Gaussian (CSCG) distribution with mean μ and covariance Σ; **X**≥**0**(**X**>**0**) means that **X** is positive semidefinite (definite); \(\mathbf {H}_{+}^{n} \) represents *n*×*n* Hermitian positive semidefinite matrices; \(\mathbb {R}^{n}\) means n-dimensional real vectors; *vec*(**X**) denotes the vectorization of matrix of **X** by stacking its columns; **X**⊗**Y** denotes the Kronecker product of **X** and **Y**. Diag(**X**) returns a diagonal matrix containing the diagonal elements of matrix **X** in its main diagonal.

## 2 System model

We consider a multi-user FD MIMO communication system which is comprised of an FD radio base station (BS), an UL user, *K* DL users, and *M* eavesdroppers. The BS is assumed to be equipped with *N*
_{
B
}>1 antennas while the *k*th DL user and *m*th eavesdropper are equipped with *N*
_{
D
}>1 and *N*
_{
E
}>1 antennas, respectively. To facilitate efficient UL information transfer, which may be wiretapped by the eavesdroppers, we also presume that the UL user is equipped with multiple, *N*
_{
U
}>1, antennas. Considering the existence of the eavesdroppers in our system, for guaranteeing the secure communication of both UL and DL channels, an efficient resource allocation scheme by joint design of UL/DL transmit covariance matrices has to be employed. The potential applications of our considered system could be the cognitive radio networks with full-duplex primary transmitter who simultaneous receives the confidential messages sent by the secondary transmitter and transmits confidential signals to the desired primary users via the same spectrum.

###
**Remark 1**

Note that for simplicity, in this paper, we consider the multi-user full-duplex MIMO communication system with only one uplink user. The more general multiple uplink users setup will be left as our future work. The single uplink user setup is widely assumed in the literatures for mathematical tractability and optimization *[*
12
*]*. Moreover, it is also of practical interest in many scenarios due to its low implementation complexity. For example, for the single uplink user setup, there is no multiple access interference, while for the multiple uplink users setup, the complicated multiple access interference management is required to suppress the co-channel interference among the uplink users *[*
9
*,*
10
*]*.

**u**(

*t*)∼

*CN*(

**0**,Σ), where \({\boldsymbol {\Sigma }} \succeq {\mathbf {0}}\ \left (\mathbf {\Sigma } \in \mathbf {H}_ +^{{N_{U}}}\right)\) is the transmit covariance and is to be designed, to the FD BS. For the DL communication, sharing the same frequency with the UL channel, the FD BS transmits K independent signal streams to the K DL users. Meanwhile, the artificial noise (AN) is also generated by the FD BS to disturb the reception of the eavesdroppers. Thus, the transmitted signal at the FD BS possesses the following form

*k*∈

*K*, \( K\buildrel \Delta \over =\left \{{1, \cdots, K} \right \}\); \(\mathbf {s}_{k} (t)\in \mathbb {C}^{N_{B}} \) denotes the confidential signal intend for the

*k*th DL user, which follows a complex Gaussian distribution

*CN*(

**0**,

**W**

_{ k }), \({\mathbf {W}}_{k} \succeq \mathbf {0}\ \left ({\mathbf {W}_{k}} \in \mathbf {H}_{+}^{{N_{B}}}\right)\) is the transmit covariance;

**z**(

*t*)∼

*CN*(

**0**,

**V**) is the generated AN, \(\mathbf {V}\succeq \mathbf {0}\ \left (\mathbf {V} \in \mathbf {H}_ +^{{N_{B}}}\right)\) is the AN covariance. Under the assumption that all the communication links are undergoing quasi-static frequency-flat fading. The received signals at the BS, the

*k*th DL user, and the

*m*th eavesdropper are modeled as

respectively, where *M*∈{1,⋯,*M*}; \(\phantom {\dot {i}\!}{\mathbf {G}}\in C^{N_{U} \times N_{B}}\), \(\mathbf {H}_{k} \in C^{N_{B} \times N_{D}}\phantom {\dot {i}\!}\), and \(\mathbf {L}_{m} \in C^{N_{B} \times N_{E}}\phantom {\dot {i}\!}\) are the channel matrices between the FD BS and the UL user, the DL user *k*, and the eavesdropper *m*, respectively; \(\phantom {\dot {i}\!}\mathbf {F}_{k} \in C^{N_{U} \times N_{D}} \) and \(\phantom {\dot {i}\!}\mathbf {E}_{m} \in C^{N_{U} \times N_{E}} \) are the channel matrices between the UL user and DL user *k*, and the eavesdropper *m*, resp.; \(\mathbf {H}_{SI} \in \mathbb {C}^{N_{B} \times N_{B}} \) is the self-interference (SI) channel of the FD BS; \(\mathbf {n}^{\text {UL}}\sim CN\left ({\mathbf {0}, \mathbf {I}_{N_{B}}} \right)\), \(\mathbf {n}_{k}^{\text {DL}} \sim CN\left ({\mathbf {0}, \mathbf {I}_{N_{D}}} \right)\), and \(\mathbf {n}_{m}^{E} \sim CN\left ({\mathbf {0}, \mathbf {I}_{N_{E}}} \right)\) are standard additive white complex Gaussian noises at BS, *k*th DL user, and *m*th eavesdropper, resp.

## 3 Problem formulation

**V**such that the minimum tolerable secure communication requirements for UL and DL channels can be ensured with the transmit power consumption as small as possible. Assuming perfect CSI at the FD BS, given Σ, \(\left \{{\mathbf {W}_{k}} \right \}_{k=1}^{K} \) and

**V**, the channel capacity (bit/s/Hz) between the UL user and the FD BS is given by

*ρ*≤1, a constant, denotes the noisiness of the SI elimination at the FD BS. The eavesdroppers overheard the uplink communication channel, and the mutual information between UL user and the

*m*th eavesdropper is given by

*C*

^{UL}and \(C_{m}^{\text {UL-E}}\), the achievable secrecy rate of the UL channel can be given by [14]

*k*th DL user can be given by

*m*th eavesdropper for eavesdropping the desired DL user

*k*is given by

*k*th DL user to promote the DL channel estimation at the beginning of each scheduling slot. Then, by sending the acknowledgement packets periodically to inform the FD BS of successful reception of data packets during the transmission, the CSI of the FD BS to the

*k*th DL user link can be perfectly known (with negligible estimation error) during whole transmission period. Consequently, here, we assume perfect CSI of both the UL and DL channels,

**G**and \(\left \{{\mathbf {H}_{k}} \right \}_{k=1}^{K}\). However, for the wiretap and co-channel interference channels, since there is no interaction between two different communication nodes during the transmission, their CSI at the FD BS is imperfect. To capture the effect of the imperfect CSI, a deterministic model [16

*,*17] is introduced to model the resulting CSI uncertainty, while the Gaussian estimation error model [18] will be left as future work. In particular, the CSI between the FD BS and the

*m*th eavesdropper, i.e.,

**L**

_{ m },

*m*∈

*M*, the CSI between the UL user and the

*m*th eavesdropper, i.e.,

**E**

_{ m },

*m*∈

*M*, the CSI between the UL user and the

*k*th DL user, i.e.,

**F**

_{ k },

*k*∈

*K*, are given as

resp., where **L**
_{
m
}, **E**
_{
m
}, and **F**
_{
k
} are the actual channel states at the FD BS and UL user, resp., while \({\bar {\mathbf {L}}}_{m}\), \({\bar {\mathbf {E}}}_{m}, \) and \({{\bar {\mathbf {F}}}}_{k} \) are the channel estimation values, and *Δ*
**L**
_{
m
}, *Δ*
**E**
_{
m
}, and *Δ*
**F**
_{
m
} are the channel estimation errors which are bounded in the deterministic regions ∥*Δ*
**L**
_{
m
}∥_{
F
}, ∥*Δ*
**E**
_{
m
}∥_{
F
}, and ∥*Δ*
**F**
_{
m
}∥_{
F
}, resp., for *ε*
_{
L,m
}>0, *ε*
_{
E,m
}>0, and *ε*
_{
F,k
}>0.

*k*th DL channel, resp.; \(P_{\max }^{\text {UL}} >0\) in C3 gives the maximum allowable UL transmit power of the UL user while \(P_{\max }^{\text {DL}} >0\) in C4 gives the maximum allowable DL transmit power of the FD BS; C5 implies the positive semi-definiteness of the optimization variables.

It is obvious that the aforementioned system design objectives in problems (P1) and (P2) are desirable for our system operator to provide the reliable quality of service (QoS) regarding secrecy communications for different users with the least possible power consumption. However, as mentioned above, each objective concerns only one aspect of the system and the two designed objectives even conflict with each other. For instance, large transmit power of the UL user provides high communication quality of the UL channel, and ensures reliable communication security to some extent. But, this will lead to severe co-channel interference to the DL users, degrade the communication performances of the DL channels. To circumvent it, the FD BS increases the DL transmit power to offset the adverse impact caused by co-channel interference and enhance the DL signal reception. Yet, higher FD BS transmission power results in strong SI which in turn impairing the reception of the signals intended for the FD BS. Hence, a non-trivial trade-off design for balancing two conflicting objectives arises in our considered multi-user FD MIMO communication system.

where O_{1}(**W**,**V**,Σ)=Tr(Σ), \(\mathrm {O}_{2}\left ({\mathbf {W}, \mathbf {V}, {\boldsymbol {\Sigma }}}\right)=\sum \limits _{k=1}^{K} {\text {Tr}\left ({\mathbf {W}_{k}} \right)} +\text {Tr}\left ({\mathbf {V}} \right)\), \(\mathrm {O}_{j}^{\ast } \) represents the optimal objective value with respect to (w.r.t) problems (P1) and (P2), 0<*λ*
_{
j
}<1, a constant with \(\sum \limits _{j=1}^{2} {\lambda _{j}} =1\), is the weight imposed on the *j*th objective. Different pre-specified weights \(\left \{{\lambda _{j}} \right \}_{j=1}^{2} \) are assigned to each of the objectives to show the preferences of the system operator. The optimal solutions of the MOO problem (P3) (by varying the weights) consist of the Pareto frontier or the Pareto optimal set, each point in the frontier denotes one preferential design of the system operator.

In fact, the MOO problem (P3) is a generalization of the single-objective optimization problems (P1) and (P2). In other words, problem (P3) is equivalent to problem (Pj) when *λ*
_{
j
}=1 and *λ*
_{
i
}=0, *i*≠*j*. As a consequence, in the following section, we mainly focus on the methodology for solving the MOO problem (P3).

## 4 Robust resource allocation algorithm design to MOOP

*τ*, the objective can be transformed into a convex one, and the transformed problem of (P3) is given by

Next, we focus on dealing with the non-convex constraints C1 and C2. It is noteworthy that the terms on the left side of the inequalities of both constraints C1 and C2 are constructed in the form of the difference between two convex expressions. Moreover, the uncertainties of CSI also lead to the semi-infiniteness of the constraints C1 and C2, which further enhances the complexity of the non-convex constraints. Hence, reformulation is needed to transform them into the convex constraints with finite numbers. To this end, we first endeavor to dispose of constraint C1 while the processing of C2 can be performed in a similar way.

*α*

_{1}and

*α*

_{2}, it can be recast as

**W**

_{ k0},

**V**

_{0}, and Σ

_{0}are the initial feasible points of the first-order Taylor approximation of the original problem (P3). For easy identification, we rename the transformed constraints in (18) and (19) as \(\overline {C1.1}\) and \(\overline {C1.2}\), respectively. The optimal solution can be obtained through iteration that updating

**W**

_{ k0},

**V**

_{0}, and Σ

_{0}from the optimal \(\mathbf {W}_{k0}^{*}\), \(\mathbf {V}_{0}^{*}\), and \({\boldsymbol {\Sigma }}_{0}^{*}\) of the previous iteration by solving problem \(\left ({\widetilde {{\mbox{{P}}3}}} \right)\) as listed in (44). The iteration will be ended once \({\mathbf {W}_{k0}} = \mathbf {W}_{k0}^{*}\), \({\mathbf {V}_{0}} = \mathbf {V}_{0}^{*}\), and \({{\boldsymbol {\Sigma }}_{0}} = {\boldsymbol {\Sigma }}_{0}^{*}\) hold [20]; and

###
**Remark 2**

Given a convex function *f*(**X**), where **X** includes all the matrix variables associated with it. The implication \(\tilde f\left (\mathbf {X} \right) \ge c \Rightarrow f\left (\mathbf {X} \right) \ge c\) holds, where \(\tilde f\left (\mathbf {X} \right)\) denotes the first-order Taylor approximation of *f*(**X**) at any initial feasible point **X**
_{0} and *c*>0 denotes any real constant, since \(\tilde f\left (\mathbf {X} \right) \le f\left (\mathbf {X} \right)\) satisfies at any **X**≽**0** and the equation holds if and only if **X**=**X**
_{0}[20]. If *f*(**X**) is a concave function, then the implication will be \(\tilde f\left (\mathbf {X} \right) \leq c \Rightarrow f\left (\mathbf {X} \right) \leq c\). In other words, for the convex function − ln|**Q**| and the concave function ln|**Δ**
_{
m
}| in (18) and (19), respective, after performing the first-order Taylor approximation on them, we can conclude that if constraints \(\overline {C1.1}\) and \(\overline {C1.2}\) satisfied, then the constraints C1.1 and C1.2 in (17) must be satisfied too.

**V**, while constraint \(\overline {C1.2}\) still remains non-convex due to the channel uncertainty sets. Focusing on constraint \(\overline {C1.2}\), introducing additional slack variables

*α*

_{3},

*α*

_{4},

*α*

_{5}, and

*α*

_{6}, we have

Considering that most of the constraints in (20) still remain non-convex. Firstly, we make a reformulation about C1.2.1 as in the following proposition.

###
**Proposition 1**

_{ m0}|≤ ln

*α*

_{3},∀

**L**

_{ m }∈

*B*

_{ L,m },

**E**

_{ m }∈

*B*

_{ E,m }. Then, we have the following implication

###
*Proof*

The equivalence transformation of the constraint C1.2.1 is easy to understand. Here, we devote ourselves to the proof of the implication (21). Before the start of the proof, consider such a lemma which will be used to assist the convex transformation of constraint C1.2.1. □

###
**Lemma 1**

**A**≥

**0**, the equation holds if and only if

*Rank*(

**A**)=1 holds.

**Δ**

_{ m0}| since the rank one condition stated in Lemma 1 can not be guaranteed here. The main purpose that we consider this lemma is to replace the determinant operations with the trace operations. Then, with the trace operations, we can overcome the semi-infiniteness caused by the channel uncertainties conveniently. Another effective method in dealing with the determinant operation has ever been proposed in [22], in which the Taylor series expansion was adopted and the global optimal solution was obtained at the convergence of the iterative algorithm. Replacing (22) into the constraint C1.2.1, we have the following relaxation for C1.2.1:

The proof of Proposition 1 is thus finished.

*Tr*(

**A**

^{ H }

*BCD*)=

*vec*(

**A**)

^{ H }(

**D**

^{ T }⊗

**B**)

*vec*(

**C**), based on Proposition 1, the constraint C1.2.1 can be equivalently rewritten as

*Δ*

**l**

_{ m }=

*vec*(

*Δ*

**L**

_{ m }), \({{\bar {\mathbf {e}}}}_{m} =vec\left ({{{\bar {\mathbf {E}}}}_{m}}\right)\),

*Δ*

**e**

_{ m }=

*vec*(

*Δ*

**E**

_{ m }), \(\mathbf {l}_{m} ={{\bar {\mathbf {l}}}}_{m} +\Delta \mathbf {l}_{m}\), \(\mathbf {e}_{m} ={{\bar {\mathbf {e}}}}_{m} +\Delta \mathbf {e}_{m}\), \(\mathbf {S}_{0} =\mathbf {I}\otimes \left ({\sum \limits _{k=1}^{K} {\mathbf {W}_{k0}} +\mathbf {V}_{0}} \right)\) and

**T**

_{0}=

**I**⊗Σ

_{0}. Since the uncertainties of

**L**

_{ m }and

**E**

_{ m }are taken into account separately, here, we first deal with

**L**

_{ m }with the aid of S-procedure, and (24) is equivalently re-expressed as

where \(a_{m} =\Delta \mathbf {e}_{m}^{H} \mathbf {T}_{0} \Delta {\mathbf {e}}_{m} +2\text {Re}\left \{{{{\bar {\mathbf {e}}}}_{m}^{H} \mathbf {T}_{0} \Delta \mathbf {e}_{m}} \right \}+{{\bar {\mathbf {e}}}}_{m}^{H} \mathbf {T}_{0} {{\bar {\mathbf {e}}}}_{m} +{{\bar {\mathbf {l}}}}_{m}^{H} \mathbf {S}_{0} {{\bar {\mathbf {l}}}}_{m} -\alpha _{3} +1\) and \(\mathbf {B}_{e, m}=\{{\mathbf {e}_{m} |\mathbf {e}_{m} ={{\bar {\mathbf {e}}}}_{m}+\Delta \mathbf {e}_{m}, \| {\mathbf {e}_{m}} \|_{2} \leq \varepsilon _{E, m}} \}\). Then, we resolve the semi-infiniteness caused by the imperfectness of channel **E**
_{
m
} via utilizing the extended S-procedure [24] which is summarized in the following lemma.

###
**Lemma 2**

*δ*

_{ E,m }≥0, (25) can be further reformulated as a single convex constraint given by

*β*

_{1}and

*β*

_{2}, we obtain

_{ k }and Ψ

_{ m,k }are what presented in above context. Next, for constraint C2.1 and C2.2, adopting one-order Taylor approximation, we have

_{ m }and Δ

_{ m0}are given above. Then, let us deal with the non-convexity caused by the channel uncertainties. By introducing auxiliary variables

*β*

_{3},

*β*

_{4}, and

*β*

_{5}, the constraint C2.1 in (34) can be recast as

**B**

_{ F,k }, and C2.1.1, C2.1.2 and C2.1.3 are equivalently transformed into

**T**=

**I**⊗Σ and \({\mathbf {U}}_{k} =\left ({{\boldsymbol {\Omega }}_{k0}^{-1}} \right)^{T}\otimes \left ({{\boldsymbol {\Sigma }} -{\boldsymbol {\Sigma }}_{0}} \right)\). After this, the constraint C2.1 is converted to the convex form w.r.t its variables, which is depicted as follows:

*β*

_{6}is the newly introduced auxiliary variable. Then, according to S-procedure and its extension Lemma 2, C2.2.1 can be reduced to a single convex constraint given by

where *α*={*α*
_{1},*α*
_{2},*α*
_{3},*α*
_{4},*α*
_{5},*α*
_{6}}, *β*={*β*
_{1},*β*
_{2},*β*
_{3},*β*
_{4},*β*
_{5},*β*
_{6}}, \(\delta _{k} =\{{\delta _{F, k}, {\delta } '_{F, k}, {\delta }^{\prime \prime }_{F, k}}\}\), and \(\delta _{m} =\{{\delta _{L, m}, {\delta } '_{L, m}, {\delta }^{\prime \prime }_{L, m},} {{\delta }^{\prime \prime \prime }_{L, m}, \delta _{E, m}, {\delta } '_{E, m}, {\delta }^{\prime \prime }_{E, m}} \}\). It is worthy to note that problem \(\left ({\widetilde {\mbox{{P}}3}} \right)\) can be solved efficiently by adopting the off-the-shelf convex optimization tools, such as SeDuMi (or CVX) [25]. Hence, the specific trade-off design scheme is obtained by choosing preferable weighted value *λ*
_{
j
}. On the other hand, the approximate optimal solution for each single-objective optimization problem is also obtained by solving the special case of problem \(\left ({\widetilde {\mbox{{P}}3}} \right)\). Finally, an iterative algorithm is derived on the basis of the above procedures and the details are summarized in Algorithm 1.

*Feasibility assurance about the initial point*\(\left \{ {\left \{ {{\mathbf {W}_{k0}}} \right \}_{k = 1}^{K},{\mathbf {V}_{0}},{\mathbf {\Sigma }_{0}}} \right \}\): The common way that preset \(\left \{ {\left \{ {{\mathbf {W}_{k0}}} \right \}_{k = 1}^{K},{\mathbf {V}_{0}},{\mathbf {\Sigma }_{0}}} \right \}\) is to initialize each one in it as zeros or the diagonal matrix with full transmission power uniformly distributed on each element. However, due to the fact that the initialization satisfy constraints C3, C4, and C5 in (12) may not be feasible to constraints C1 and C2, which will possibly result in a poor convergence performance of our proposed algorithm and better objective values compared to the optimal of the original problem. Therefore, to circumvent such a defect, the feasibility assurance procedure need to be injected in obtaining the feasible initial point. Particularly, we consider the following problem extracted from (

*P*1) in (12)

Given the initial point, problem (45) can be solved effectively through the methods mentioned above. Then, the resulting optimal point \(\left \{ {\left \{ {\mathbf {W}_{k0}^{*}} \right \}_{k = 1}^{K},\mathbf {V}_{0}^{*},\mathbf {\Sigma }_{0}^{*}} \right \}\) which leads to non-negative objective value of problem (45) can be selected as the feasible initial point.

## 5 Simulation results

In this section, simulation results are presented to assess the performance of our proposed multi-objective robust resource allocation scheme. The simulation settings for our simulation are as follows. It is assumed that there are *K*=3 DL users, *M*=2 eavesdroppers, *N*
_{
E
}=2, *N*
_{
U
}=3, *N*
_{
D
}=2, and *ς*=10^{−6}. The small scale fading of the UL channel, DL channels, CCI channels, and eavesdropping channels are modeled as independent and identically distributed Rayleigh fading. All the users and eavesdroppers are assumed to be located randomly and uniformly in the range between the distance of 10 and 100 m away from the transmitter. The SI channel is modeled as the Rician fading channel with Rician factor 5 dB. In regards to the channel uncertainties, we define the channel estimate error ratios as: \(\alpha _{L, m} =\frac {\varepsilon _{L, m}} {\sqrt {E\left \{{\left \| {{{\bar {\mathbf {L}}}}_{m}} \right \|_{F}^{2}} \right \}}}\), \(\alpha _{E, m} =\frac {\varepsilon _{E, m}} {\sqrt {E\left \{{\left \| {{{\bar {\mathbf {E}}}}_{m}} \right \|_{F}^{2}} \right \}}}, \forall m\), and \(\alpha _{F, m} =\frac {\varepsilon _{F, m}} {\sqrt {E\left \{{\left \| {{{\bar {\mathbf {F}}}}_{m}} \right \|_{F}^{2}} \right \}}}, \forall k\). All simulation results were achieved by an average of 1000 channel realizations. In our simulation, the feasibility of the given parameters can be ensured in this way. Taking problem P1 in (12) as an example, the secrecy rates \({\bar R^{UL - S}}\) in constraint C1 and \(\bar R_{k}^{DL - S}\) in constraint C2 will be given first. Then, after many channel realizations, the value of \(P_{\max }^{DL}\) can be determined by checking the feasibility of problem P1 without constraint C3. At the same time, the maximum allowable transmit power \(P_{\max }^{UL}\) can also be determined by the obtained maximum objective value of problem P1. The infeasible case will be picked and assigned to null once the cvx status is not “Solved” or cvx optval is “Inf.’. The infeasible case should not be occurred frequently among the 1000 channel realizations. If it happens, we need to increase the value of the maximum allowable transmit power until it occurs rarely.

*k*th DL user minimum required secrecy rate are \(\bar {{R}}^{\text {UL-S}}=\) 1.5 bps/Hz and \(\bar {{R}}^{\text {DL-S}}=\) 2.5 bps/Hz, respectively. The channel estimate error ratios are set as

*α*

_{ L,m }=

*α*

_{ E,m }=

*α*

_{ F,k }=0.05,∀

*m,k*. The boundary points of the trade-off region are obtained by solving problem (P3) under different weight values 0≤

*λ*

_{ j }≤1,

*j*=1,2 with fixed step size 0.02.

For the purpose of a comprehensive performance comparison, four scenarios where each of the users and eavesdroppers is equipped with multi-antenna and *N*
_{
B
}=10, where each of the users and eavesdroppers is equipped with multi-antenna and *N*
_{
B
}=12, where each of the users and eavesdroppers is equipped with single antenna and *N*
_{
B
}=10 and where each of the users and eavesdroppers is equipped with single antenna and *N*
_{
B
}=12 are considered in Fig. 1. From this figure, we can see that, under the case the same antenna equipped at the transmitter, an obvious savings in transmit power for UL user and DL transmitter can be achieved when the UL, DL users, and eavesdroppers have multiple antennas compared with the single-antenna cases. Particularly, the requirement of UL transmit power declined more significant than the DL transmit power. This is due to the fact that the change of the antenna number results in a direct influence on UL user while it is indirect on the transmitter. The direct and apparent impact which leads to obvious power saving on the transmitter can be achieved with the increase of the number *N*
_{
B
} while the antennas of the other nodes keep unchanged. An interesting phenomenon what we can learn from this figure is that, from the first and the last curves listed in the legend, the multi-antenna case with *N*
_{
B
}=10 consumes much more DL transmit power but less UL transmit power than the single-antenna case with *N*
_{
B
}=12. It further reveals the advantage of more antennas allocated for the communication nodes, especially for the users.

**V**

_{0}and Σ

_{0}are all set to be

**0**, the channel uncertainties and minimum required secrecy rates are the same as in Fig. 1, multi-antenna case is considered with

*N*

_{ B }=10. The black curves marked with x represent the DL transmit power (corresponding to problem P2) while the blue curves marked with circle represent UL transmit power (corresponding to problem P1). Ten random channel realizations are depicted in Fig. 2. From this figure, we can see that our proposed algorithm converges to a stable value after a finite number of iteration. This is due to the fact that the problem defined in \(\left ({\widetilde {{\mathrm {P}}3}} \right)\) is convex, the optimal transmit covariance matrix \(\mathbf {W}_{k}^{*}\),

**V**

^{∗}, and

**Σ**

^{∗}are obtained by solving problem \(\left ({\widetilde {{\mathrm {P}}3}} \right)\) for the given

**W**

_{ k0},

**V**

_{0}, and

**Σ**

_{0}. At each iteration,

**W**

_{ k0},

**V**

_{0}, and

**Σ**

_{0}will be updated from the optimal \(\mathbf {W}_{k}^{*}\),

**V**

^{∗}, and

**Σ**

^{∗}of the previous iteration. Hence,

**W**

_{ k0},

**V**

_{0}, and

**Σ**

_{0}are always the feasible solution of the next iteration, and the optimal solution \(\mathbf {W}_{k}^{*}\),

**V**

^{∗}, and Σ

^{∗}obtained for the given

**W**

_{ k0},

**V**

_{0}, and

**Σ**

_{0}will consume less than or equal to the transmission power of the previous iteration. Then, the required transmission power will monotonically non-increasing at each iteration. Moreover, since the transmission power is lower bounded below for a required secrecy rate, this algorithm will converge to a solution. Moreover, the convergence step of two problems appears to be consistent.

*N*

_{ B }=10. Three cases, non-robust, our proposed robust and the perfect CSI known at the DL transmitter, are depicted in Fig. 3. The information of channels

**L**

_{ m },

**E**

_{ m }, and

**F**

_{ k }known at the base station are actually imperfect. Physically, the non-robust case is that the researchers mistakenly believe that the CSIs known by the base station are perfect and do not take any additional actions to against the disadvantage caused by channel uncertainties. To reflect the actual situation, for the non-robust case, the channel estimate errors (each of them comes from the channel estimate error ratio multiplied by channel estimation) are added in the estimated channels. The optimization problem for the non-robust case is non-convex due to the difference between two logarithmic functions in constraints C1 and C2, which can be tackled by using the similar methods adopted in Section 3. From this figure, we can see that, to meet the QoS requirement of secrecy rates of UL and DL users, the transmitter power of both UL user and DL transmitter increases with the channel uncertainties for the non-robust and robust cases. For the perfect CSI case, the consumed power remains unchanged and lower than the other two cases. In regard to our proposed robust scheme, a significant power saving is fulfilled compared with the non-robust scheme.

*N*

_{ B }=12. The maximum allowable transmit power, the channel estimate error ratios and the step size are the same as that given in Fig. 1. From this figure, we can see that the transmit power of the UL user and the base station increase significantly with the required secrecy rates. Our proposed scheme consumes less power at the transmitters than the non-robust scheme under the same required secrecy rate pair. Moreover, by comparing the curve “Proposed, (2.5, 3.5)” in Fig. 4 with the curve “multi-antenna

*N*

_{ B }=10” in Fig. 1, we find that both of them achieve nearly the same UL and DL transmit power trade-off region. This means that the higher secrecy rate can be obtained by increasing the degrees of freedom with more transmit antennas instead of the transmit power.

## 6 Conclusions

In this paper, we have studied the robust resource allocation problem for the multi-user full-duplex (FD) multiple-input multiple-output (MIMO) communication systems. Considering the existence of passive eavesdroppers, the QoS requirement of secrecy communication for both UL and DL users were incorporated in our considered problem. A multi-objective optimization framework was proposed to minimize the UL and DL transmission power simultaneously. The weighted Tchebycheff coupled with the Taylor series expansion and the S-procedure approaches were proposed in handing the formulated non-convex optimization problem optimally. Simulation results not only demonstrated an interesting trade-off between the considered conflicting objectives, but also showed the efficiency of our proposed robust resource allocation designs.

## Declarations

### Acknowledgements

The work was partially supported by Swedish Research Links [No.348-2008-6212], the National Natural Science Foundation of China [61571241], Industry-university-research prospective joint project of Jiangsu Province [BY2014014], and Major projects of Jiangsu Province university natural science research [15KJA510002].

### Authors’ contributions

Both authors contributed extensively to the work presented in this paper. MZ designed the proposed algorithm, performed the experiments, and wrote and revised the paper. DZ supervised the design of the algorithm and the performance evaluation, and revised the paper. Both authors read and approved the final manuscript.

### Competing interests

The authors declare that they have no competing interests.

### Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

**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

- P Yeoh, M Elkashlan, N Yang, D da Costa, T Duong, Unified analysis of transmit antenna selection in MIMO multirelay networks. IEEE Trans. Veh. Technol.
**62**(2), 933–939 (2013).View ArticleGoogle Scholar - J Park, B Clerckx, Joint wireless information and energy transfer in a two-user MIMO interference channel. IEEE Trans. Wirel. Commun.
**12**(8), 4210–4221 (2013).View ArticleGoogle Scholar - X Chen, Z Zhang, H-H Chen, H Zhang, Enhancing wireless information and power transfer by exploiting multi-antenna techniques. IEEE Commun. Magazine.
**53**(4), 133–141 (2015).View ArticleGoogle Scholar - A Khisti, GW Wornell, Secure transmission with multiple antennas—Part II: the MIMOME wiretap Cchannel. IEEE Trans. Inf. Theory.
**56**(11), 5515–5532 (2010).View ArticleMATHGoogle Scholar - DWK Ng, ES Lo, R Schober, Dynamic resource allocation in MIMO-OFDMA systems with full-duplex and hybrid relaying. IEEE Trans. Commun.
**60**(5), 1291–1304 (2012).View ArticleGoogle Scholar - H Suraweera, I Krikidis, G Zheng, C Yuen, P Smith, Low-complexity end-to-end performance optimization in MIMO full-duplex relay systems. IEEE Trans. Wirel. Commun.
**13**(2), 913–927 (2014).View ArticleGoogle Scholar - D Nguyen, L-N Tran, P Pirinen, M Latva-aho, On the spectral efficiency of full-duplex small cell wireless systems. IEEE Trans. Wirel. Commun.
**13**(9), 4896–4910 (2014).View ArticleGoogle Scholar - HQ Ngo, H Suraweera, M Matthaiou, E Larsson, Multipair full-duplex relaying with massive arrays and linear processing. IEEE J. Select. Areas Commun.
**32**(9), 1721–1737 (2014).View ArticleGoogle Scholar - Y Sun, DWK Ng, J Zhu, R Schober, Multi-objective optimization for robust power efficient and secure full-duplex wireless communication systems. IEEE Trans. Wirel. Commun.
**15**(8), 5511–5526 (2016).View ArticleGoogle Scholar - S Leng, DWK Ng, N Zlatanov, R Schober, in
*2016 IEEE International Conference on Communications (ICC), Kuala Lumpur*. Multi-objective resource allocation in full-duplex SWIPT systems, (2016), pp. 1–7. http://ieeexplore.ieee.org/document/7510760/. - DWK Ng, ES Lo, R Schober, Multi-objective resource allocation for secure communication in cognitive radio networks with wireless information and power transfer. IEEE Trans. Veh. Technol.
**65**(5), 3166–3184 (2016).View ArticleGoogle Scholar - Y Zeng, R Zhang, Full-duplex wireless-powered relay with self-energy recycling. IEEE Wirel. Commun. Lett.
**4**(2), 201–204 (2015).View ArticleGoogle Scholar - B Day, A Margetts, D Bliss, P Schniter, Full-duplex MIMO relaying: achievable rates under limited dynamic range. IEEE J. Select. Areas Commun.
**30**(8), 1541–1553 (2012).View ArticleGoogle Scholar - Y Liang, G Kramer, HV Poor, S Shamai, in
*2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications, Cannes*. Recent results on compound wire-tap channels, (2008), pp. 1–5. http://ieeexplore.ieee.org/document/4699909/. - Z Chu, K Cumanan, Z Ding, M Johnston, SY 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 - W Wu, B Wang, Robust secrecy beamforming for wireless information and power transfer in multiuser MISO communication system. EURASIP J. Wirel. Commun. Netw. 2015(161) (2015).Google Scholar
- Z Chu, Z Zhu, M Johnston, SY Le Goff, Simultaneous wireless information power transfer for MISO secrecy channel. IEEE Trans. Veh. Technol.
**65**(9), 6913–6925 (2016).View ArticleGoogle Scholar - Z Chu, K Cumanan, Z Ding, M Johnston, S Le Goff, Robust outage secrecy rate optimizations for a MIMO secrecy channel. IEEE Wirel. Commun. Lett.
**4**(1), 86–89 (2015).View ArticleGoogle Scholar - RT Marler, JS Arora, Survey of multi-objective optimization methods for engineering. Struct. Multidiscip. Optim.
**26:**, 369–395 (2004).View ArticleMATHMathSciNetGoogle Scholar - W Wu, B Wang, Efficient Transmission solutions for MIMO wiretap channels with SWIPT. IEEE Commun. Lett.
**19**(9), 1548–1551 (2015).View ArticleGoogle Scholar - GH Golub, CF van Loan, Matrix computation, 2nd edn (John Hopkins University Press, 1989).Google Scholar
- K Cumanan, Z Ding, B Sharif, GY Tian, KK Leung, Secrecy rate optimizations for a MIMO secrecy channel with a multiple-antenna eavesdropper. IEEE Trans. Veh. Technol.
**63**(4), 1678–1690 (2014).View ArticleGoogle Scholar - S Boyd, L Vandenberghe, Convex optimization (Cambridge University Press, 2004).Google Scholar
- Z-Q Luo, JF Sturm, S Zhang, Multivariate nonnegative quadratic mappings. SIAM J. Optimiz.
**14:**, 1140–1162 (2004).View ArticleMATHMathSciNetGoogle Scholar - J Sturm, Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw.
**11:**, 625–653 (1999). (webpage and software). http://sedumi.ie.lehigh.edu/?page_id=58. SeDuMi 1.3 (2003).View ArticleMATHMathSciNetGoogle Scholar