IEEE Transactions on Wireless Communications

Secrecy Rate Optimizations for a MISO Secrecy Channel with Multiple Multiantenna Eavesdroppers

Zheng Chu, Hong Xing, Martin Johnston, Stephane Le Goff

Published Aug 24, 2015• 115 citations

Abstract

This paper investigates secrecy rate optimization problems for a multiple-input-single-output (MISO) secrecy channel in the presence of multiple multiantenna eavesdroppers. Specifically, we consider power minimization and secrecy rate maximization problems for this secrecy network. First, we formulate the power minimization problem based on the assumption that the legitimate transmitter has perfect channel state information (CSI) of the legitimate user and the eavesdroppers, where this problem can be reformulated into a second-order cone program (SOCP). In addition, we provide a closed-form solution of transmit beamforming for the scenario of an eavesdropper. Next, we consider robust secrecy rate optimization problems by incorporating two probabilistic channel uncertainties with CSI feedback. By exploiting the Bernstein-type inequality and S-Procedure to convert the probabilistic secrecy rate constraint into the determined constraint, we formulate this secrecy rate optimization problem into a convex optimization framework. Furthermore, we provide analyses to show the optimal transmit covariance matrix is rank-one for the proposed schemes. Numerical results are provided to validate the performance of these two conservative approximation methods, where it is shown that the Bernstein-type inequality-based approach outperforms the S-Procedure approach in terms of the achievable secrecy rates.

DOI: 10.1109/twc.2015.2472405

Related papers

Robust Outage Secrecy Rate Optimizations for a MIMO Secrecy Channel

Zheng Chu, Kanapathippillai Cumanan, Zhiguo Ding +2 more

This letter investigates robust secrecy rate optimization techniques for a multiple-input-multiple-output (MIMO) wiretap channel in the presence of a multiantenna eavesdropper. In particular, two robust secrecy rate optimization problems are studied: robust power minimization with an outage secrecy rate constraint and robust secrecy rate maximization subject to the outage secrecy rate and transmit power constraints. Here, it is assumed that the legitimate transmitter has perfect channel state information (CSI) of the legitimate receiver and imperfect CSI of the eavesdropper. Both robust problems are not convex in terms of transmit covariance matrix and the outage secrecy rate constraint. Hence, we propose a conservative approximation approach to reformulate this outage secrecy rate constraint by exploiting the Bernstein-type inequality to obtain a tractable solution for these two robust problems. Numerical results have been provided to validate the convergence and the performance of the proposed robust algorithms.

IEEE Wireless Communications LettersNov 26, 201465 citations

Secrecy Rate Optimizations for a MIMO Secrecy Channel with a Multiple-Antenna Eavesdropper

Kanapathippillai Cuma, Zhiguo Ding, B. S. Sharif +2 more

This paper studies different secrecy rate optimization problems for a multiple input multiple output (MIMO) secrecy channel. In particular, we consider a scenario where a communication through a MIMO channel is overheard by a multiple-antenna eavesdropper. In this secrecy network, we first investigate two secrecy rate optimization problems: a) power minimization, b) secrecy rate maximization. These optimization problems are not convex due to the non-convex secrecy rate constraint. However, by approximating this secrecy rate constraint based on Taylor series expansion, we propose iterative algorithms to solve these secrecy rate optimization problems. In addition, we provide the convergence analysis for the proposed algorithms. These iterative optimization approaches are developed under the assumption that the transmitter has the perfect channel state information. However, there are practical difficulties to have the perfect channel state information at the transmitter. Hence, robust secrecy rate optimization techniques based on the worstcase secrecy rate are considered by incorporating the channel uncertainties. By exploiting the S-Procedure, we show that these robust optimization problems can be formulated into semidefinite programming at low signal to noise ratios (SNRs). Simulation results have been provided to validate the convergence of the proposed algorithms. In addition, numerical results show that the proposed robust optimization techniques outperform the nonrobust schemes in terms of the worst-case secrecy rates and the achieved secrecy rates.

Oct 9, 20130 citations

Secrecy Rate Optimizations for a MIMO Secrecy Channel With a Cooperative Jammer

Zheng Chu, Kanapathippillai Cumanan, Zhiguo Ding +2 more

In this paper, we study different secrecy rate optimization techniques for a multiple-input–multiple-output (MIMO) secrecy channel, where a multiantenna cooperative jammer is employed to improve secret communication in the presence of a multiantenna eavesdropper. Specifically, we consider two optimization problems, namely, power minimization and secrecy rate maximization. These problems are not jointly convex in terms of the transmit covariance matrices of the legitimate transmitter and the cooperative jammer. To circumvent these nonconvexity issues, we alternatively design the transmit covariance matrix of the legitimate transmitter and the cooperative jammer. For a given transmit covariance matrix at the cooperative jammer, we solve the power minimization and secrecy rate maximization problems based on a Taylor series expansion. Then, we propose two iterative algorithms to solve these approximated problems. In addition, we develop a robust scheme by incorporating channel uncertainties associated with the eavesdropper. By exploitingS-Procedure, we show that these robust optimization problems can be formulated into semidefinite programming. Moreover, we consider the secrecy rate maximization problem based on game theory, where the jammer introduces charges for its jamming service based on the amount of the interference caused to the eavesdropper. This secrecy rate maximization problem is formulated into aStackelberggame where the jammer and the transmitter are the leader and the follower of the game, respectively. For the proposed game,Stackelbergequilibrium is analytically derived. Simulation results have been provided to validate the convergence and performance of the proposed algorithms. In addition, it is shown that the proposed robust scheme outperforms the nonrobust scheme in terms of the achieved secrecy rate and the worst-case secrecy rate. Finally, theStackelbergequilibrium solution has been validated through numerical results.

IEEE Transactions on Vehicular TechnologyOct 6, 2014205 citations

The achievable secrecy rate of MISO wiretap channels

Zhang Haiyang, Baoyun Wang

In this paper, we study the achievable secrecy rate of the multiple input single output (MISO) wiretap channel, which consists of a transmitter, a legitimate receiver and multiple eavesdroppers. The transmitter is equipped with multiple antennas, while the receiver and all the eavesdroppers each have a single antenna. We assume that the transmitter has perfect channel state information (CSI) for their links to legitimate receiver, but it has only imperfect CSI for their channels to eavesdroppers. Optimal transmit covariance matrix is obtained based on worst-case secrecy rate maximization, under power constraints. The maximum secrecy rate computation can be formulated as a non-convex optimal problem, which cannot be solved directly. In this paper, we transform non-convex optimal problem into a quasi-convex optimal problem which can be efficiently solved with the bisection method. The simulation result and analysis demonstrate the effectiveness of our methods.

International Conference on Wireless Communications and Signal Processing (WCSP)Nov 1, 20113 citations

Secrecy Rate Optimizations for a MIMO Secrecy Channel With a Multiple-Antenna Eavesdropper

Kanapathippillai Cumanan, Zhiguo Ding, Bayan S. Sharif +2 more

This paper studies different secrecy rate optimization problems for a multiple-input–multiple-output (MIMO) secrecy channel. In particular, we consider a scenario where a communication through a MIMO channel is overheard by a multiple-antenna eavesdropper. In this secrecy network, we first investigate two secrecy rate optimization problems: 1) power minimization and 2) secrecy rate maximization. These optimization problems are not convex due to the nonconvex secrecy rate constraint. However, by approximating this secrecy rate constraint based on Taylor series expansion, we propose iterative algorithms to solve these secrecy rate optimization problems. In addition, we provide the convergence analysis for the proposed algorithms. These iterative optimization approaches are developed under the assumption that the transmitter has perfect channel state information. However, there are practical difficulties in having perfect channel state information at the transmitter. Hence, robust secrecy rate optimization techniques based on the worst-case secrecy rate are considered by incorporating channel uncertainties. By exploiting theS-Procedure, we show that these robust optimization problems can be formulated into semidefinite programming at low signal-to-noise ratios (SNRs). Simulation results have been provided to validate the convergence of the proposed algorithms. In addition, numerical results show that the proposed robust optimization techniques outperform the nonrobust schemes in terms of the worst-case secrecy rates and the achieved secrecy rates.

IEEE Transactions on Vehicular TechnologyOct 10, 2013166 citations

Robust Beamforming Design for Secure Multiuser MISO Interference Channel

Hongbo Xu, Bingru Zhu, Jun Liu +1 more

In this letter, we investigate the secure beamforming design for multiuser multiple-input single-output interference channel with an eavesdropper. The robust secrecy rate optimization problem is studied with the imperfect channel state information. We consider the beamforming design to maximize the minimum worst case secrecy rate subject to the transmit power constraints with norm-bounded channel uncertainty. The problem is non-convex and hard to solve. We propose an effective method to reformulate this non-convex problem as a series of tractable convex program problems with linear matrix inequality and second-order cone constraints by exploiting the conservative approximation and the sequential convex approximation methods. The simulation results demonstrate the effectiveness of the proposed algorithm.

IEEE Communications LettersJan 2, 201711 citations