Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Communications

MIMO AF relaying security: Robust transceiver design in the presence of multiple eavesdroppers

Jiaxin Yang, Benoît Champagne, Yulong Zou, Lajos Hanzo

Published Jun 1, 2015• 5 citations
Publisher

Abstract

This paper addresses the problem of secure amplify-and-forward (AF) relaying for multiple-input multiple output (MIMO) relaying networks in the presence of multiple eavesdroppers. Assuming practical imperfect eavesdroppers' channel state information (ECSI), we propose a robust approach to optimize the relay AF matrix, subject to power constraint, in order to maximize the received signal-to-interference-plus-noise ratio (SINR) at the destination while satisfying a set of secrecy constraints. The ECSI errors are assumed to fall within some predefined bounded sets. Since the resultant optimization problem is non-convex and semi-infinite, we transform it into a form constituted by the differences of convex functions (DC) using suitable matrix transformation techniques. Then an algorithmic solution with proven convergence is proposed by resorting to the penalty-DC algorithm (P-DCA). Experimental results show the security of the proposed transceiver design against eavesdropping and the robustness against the channel uncertainties.

DOI
10.1109/icc.2015.7249105

Related papers

Secure MIMO AF Relaying Design: An Intercept Probability Constrained Approach

Jiaxin Yang, Benoît Champagne, Qiang Li +1 more

Multiple-input multiple-output (MIMO) amplify-and- forward (AF) relaying is designed for secure communication between a source-destination pair in the presence of multiple eavesdroppers. Assuming statistical knowledge of the eavesdroppers' channel state information (ECSI) errors, we introduce a probabilistically robust design method, which aims to optimize the source transmission power and AF relaying matrix by maximizing the received signal-to- interference-plus-noise ratio (SINR) at the destination, while satisfying a set of intercept probability constraints. The resultant optimization problem becomes nonconvex, and hence we propose a conservative two-step solution, where the source transmission power and the relaying matrix are sequentially optimized. Our simulation results demonstrate the improved secrecy of the proposed relaying design against eavesdropping and its robustness against the channel uncertainties.

Globecom•Dec 1, 2014•4 citations

Intercept probability-constrained secure MIMO AF relaying with arbitrarily distributed ECSI errors

Jiaxin Yang, Qiang Li, Hao Li +1 more

In this paper, we study the problem of joint multiple-input multiple-output (MIMO) amplify-and-forward (AF) relaying and artificial noise (AN) optimization for secure communication between a source-destination pair in the presence of multiple eavesdroppers (eves). The eves' channel state information (ECSI) is subject to arbitrarily distributed random errors. Assuming that only the first and second moments of the ECSI errors are known, we introduce a probabilistically robust design method, which aims to maximize the received signal-to-interference-plus-noise ratio (SINR) at the destination while satisfying a set of robust intercept probability constraints. Since the resultant optimization problem is non-convex, we propose a solution approach by resorting to a duality-based method along with the semidefinite relaxation (SDR) technique, where a global optimal solution to our design problem can be found. Our simulation results demonstrate the improved secrecy of the proposed robust relaying design against eavesdropping and its robustness against the channel uncertainties.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2016•1 citation

Secure MIMO Relaying Network: An Artificial Noise Aided Robust Design Approach

Jiaxin Yang, Qiang Li, Benoît Champagne +2 more

Owing to the vulnerability of relay-assisted and device-to-device (D2D) communications, improving wireless security from a physical layer signal processing perspective is attracting increasing interest. Hence we address the problem of secure transmission in a relay-assisted network, where a pair of legitimate user equipments (UEs) communicate with the aid of a multiple-input multiple output (MIMO) relay in the presence of multiple eavesdroppers (eves). Assuming imperfect knowledge of the eves' channels, we jointly optimize the power of the source UE, the amplify-and-forward (AF) relaying matrix and the covariance of the artificial noise (AN) transmitted by the relay, in order to maximize the received signal-to-interference-plus-noise ratio (SINR) at the destination, while imposing a set of robust secrecy constraints. To tackle the resultant nonconvex optimization problem, a globally optimal solution based on a bi-level optimization framework is proposed, but with high complexity. Then a low-complexity sub-optimal method relying on a new penalized difference-of-convex (DC) algorithmic framework is proposed, which is specifically designed for non-convex semidefinite programs (SDPs). We show how this penalized DC framework can be invoked for solving our robust secure relaying problem with proven convergence. Our extensive simulation results show that both proposed solutions are capable of ensuring the secrecy of the relay-aided transmission and significantly improve the robustness towards the eves' channel uncertainties as compared to the non-robust counterparts. It is also demonstrated the penalized DC-based method advocated yields a performance close to the globally optimal solution.

arXiv:1606.07176•Jun 23, 2016•0 citations

Joint Transceiver Design for Secure Downlink Communications Over an Amplify-and-Forward MIMO Relay

Yunlong Cai, Qingjiang Shi, Benoît Champagne +1 more

This paper addresses joint transceiver design for secure downlink communications over a multiple-input multiple-output relay system in the presence of multiple legitimate users and malicious eavesdroppers. Specifically, we jointly optimize the base station (BS) beamforming matrix, the relay station (RS) amplify-and-forward transformation matrix, and the covariance matrix of artificial noise, so as to maximize the system worst-case secrecy rate in the presence of the colluding eavesdroppers under power constraints at the BS and the RS, as well as quality of service constraints for the legitimate users. This problem is very challenging due to the highly coupled design variables in the objective function and constraints. By adopting a series of transformation, we first derive an equivalent problem that is more tractable than the original one. Then, we propose and fully develop a novel algorithm based on the penalty concave-convex procedure (penalty-CCCP) to solve the equivalent problem, where the difficult coupled constraint is penalized into the objective and the resulting nonconvex problem is solved at each iteration by resorting to the CCCP method. It is shown that the proposed joint transceiver design algorithm converges to a stationary solution of the original problem. Finally, our simulation results reveal that the proposed algorithm achieves better performance than other recently proposed transceiver designs.

IEEE Transactions on Communications•May 25, 2017•31 citations

Robust Beamforming and Jamming for Secure AF Relay Networks with Multiple Eavesdroppers

Cong Zhang, Hui Gao, Haijing Liu +1 more

In this paper, we study the secrecy transmission in multi-antenna relay networks with multiple eavesdroppers. The relay employs the amplify-and-forward relaying protocol and simultaneously sends the artificial noise to interfere the eavesdroppers. It is assumed that only imperfect channel state information on the main and eavesdropping channels is available at the relay. We exploit the robust beam forming and jamming to maximize the worst-case secrecy rate under a total relay power budget. Because of the infinitely nonconvex constraints, the problem is difficult to solve. Therefore, we approximate the problem into several tractable semi definite programs by semi definite relaxation, S-procedure, and the successive convex approximation techniques. Simulation results show the effectiveness of the proposed scheme.

IEEE Military Communications Conference (MILCOM)•Oct 1, 2014•13 citations

Robust artificial noise assisted secure transceiver optimization in AF relay networks with multiple source-destination pairs

Liang Jin, Lijian Zhang, Kaizhi Huang +3 more

We consider an amplify-and-forward (AF) relay network with multiple source-destination pairs in the presence of an eavesdropper. This paper studies the robust artificial noise (AN) assisted joint transceiver optimization for secure communication with imperfect channel state information (CSI) of legitimate users and no CSI regarding the eavesdropper. The goal is to design the linear precoding matrix of the relay and the linear equalizer of each destination, such that the transmit power for the information-bearing signals and forwarded background noises at the relay can be minimized subject to the quality of service (QoS) constraints at the destinations. The remainder of the constrained total power is used to generate the AN for jamming the eavesdropper. Although such a power minimization problem is nonconvex, we recast it into two semidefinite programming (SDP) subproblems which can be solved using interior-point methods. Then this problem can be solved with the alternating iterative optimization algorithm. Simulations demonstrate that the proposed algorithm can significantly reduce the sensitivity to imperfect CSI, while degrading the eavesdropper's capability of intercepting.

International Conference on Signal Processing and Communication Systems•Dec 1, 2014•2 citations
This paper addresses the problem of secure amplify-and-forward (AF) relaying for multiple-input multiple output (MIMO) relaying networks in the presence of multiple eavesdroppers. Assuming practical imperfect eavesdroppers' channel state information (ECSI), we propose a robust approach to optimize the relay AF matrix, subject to power constraint, in order to maximize the received signal-to-interference-plus-noise ratio (SINR) at the destination while satisfying a set of secrecy constraints. The ECSI errors are assumed to fall within some predefined bounded sets. Since the resultant optimization problem is non-convex and semi-infinite, we transform it into a form constituted by the differences of convex functions (DC) using suitable matrix transformation techniques. Then an algorithmic solution with proven convergence is proposed by resorting to the penalty-DC algorithm (P-DCA). Experimental results show the security of the proposed transceiver design against eavesdropping and the robustness against the channel uncertainties.
Multiple-input multiple-output (MIMO) amplify-and- forward (AF) relaying is designed for secure communication between a source-destination pair in the presence of multiple eavesdroppers. Assuming statistical knowledge of the eavesdroppers' channel state information (ECSI) errors, we introduce a probabilistically robust design method, which aims to optimize the source transmission power and AF relaying matrix by maximizing the received signal-to- interference-plus-noise ratio (SINR) at the destination, while satisfying a set of intercept probability constraints. The resultant optimization problem becomes nonconvex, and hence we propose a conservative two-step solution, where the source transmission power and the relaying matrix are sequentially optimized. Our simulation results demonstrate the improved secrecy of the proposed relaying design against eavesdropping and its robustness against the channel uncertainties.
In this paper, we study the problem of joint multiple-input multiple-output (MIMO) amplify-and-forward (AF) relaying and artificial noise (AN) optimization for secure communication between a source-destination pair in the presence of multiple eavesdroppers (eves). The eves' channel state information (ECSI) is subject to arbitrarily distributed random errors. Assuming that only the first and second moments of the ECSI errors are known, we introduce a probabilistically robust design method, which aims to maximize the received signal-to-interference-plus-noise ratio (SINR) at the destination while satisfying a set of robust intercept probability constraints. Since the resultant optimization problem is non-convex, we propose a solution approach by resorting to a duality-based method along with the semidefinite relaxation (SDR) technique, where a global optimal solution to our design problem can be found. Our simulation results demonstrate the improved secrecy of the proposed robust relaying design against eavesdropping and its robustness against the channel uncertainties.
Owing to the vulnerability of relay-assisted and device-to-device (D2D) communications, improving wireless security from a physical layer signal processing perspective is attracting increasing interest. Hence we address the problem of secure transmission in a relay-assisted network, where a pair of legitimate user equipments (UEs) communicate with the aid of a multiple-input multiple output (MIMO) relay in the presence of multiple eavesdroppers (eves). Assuming imperfect knowledge of the eves' channels, we jointly optimize the power of the source UE, the amplify-and-forward (AF) relaying matrix and the covariance of the artificial noise (AN) transmitted by the relay, in order to maximize the received signal-to-interference-plus-noise ratio (SINR) at the destination, while imposing a set of robust secrecy constraints. To tackle the resultant nonconvex optimization problem, a globally optimal solution based on a bi-level optimization framework is proposed, but with high complexity. Then a low-complexity sub-optimal method relying on a new penalized difference-of-convex (DC) algorithmic framework is proposed, which is specifically designed for non-convex semidefinite programs (SDPs). We show how this penalized DC framework can be invoked for solving our robust secure relaying problem with proven convergence. Our extensive simulation results show that both proposed solutions are capable of ensuring the secrecy of the relay-aided transmission and significantly improve the robustness towards the eves' channel uncertainties as compared to the non-robust counterparts. It is also demonstrated the penalized DC-based method advocated yields a performance close to the globally optimal solution.
This paper addresses joint transceiver design for secure downlink communications over a multiple-input multiple-output relay system in the presence of multiple legitimate users and malicious eavesdroppers. Specifically, we jointly optimize the base station (BS) beamforming matrix, the relay station (RS) amplify-and-forward transformation matrix, and the covariance matrix of artificial noise, so as to maximize the system worst-case secrecy rate in the presence of the colluding eavesdroppers under power constraints at the BS and the RS, as well as quality of service constraints for the legitimate users. This problem is very challenging due to the highly coupled design variables in the objective function and constraints. By adopting a series of transformation, we first derive an equivalent problem that is more tractable than the original one. Then, we propose and fully develop a novel algorithm based on the penalty concave-convex procedure (penalty-CCCP) to solve the equivalent problem, where the difficult coupled constraint is penalized into the objective and the resulting nonconvex problem is solved at each iteration by resorting to the CCCP method. It is shown that the proposed joint transceiver design algorithm converges to a stationary solution of the original problem. Finally, our simulation results reveal that the proposed algorithm achieves better performance than other recently proposed transceiver designs.
In this paper, we study the secrecy transmission in multi-antenna relay networks with multiple eavesdroppers. The relay employs the amplify-and-forward relaying protocol and simultaneously sends the artificial noise to interfere the eavesdroppers. It is assumed that only imperfect channel state information on the main and eavesdropping channels is available at the relay. We exploit the robust beam forming and jamming to maximize the worst-case secrecy rate under a total relay power budget. Because of the infinitely nonconvex constraints, the problem is difficult to solve. Therefore, we approximate the problem into several tractable semi definite programs by semi definite relaxation, S-procedure, and the successive convex approximation techniques. Simulation results show the effectiveness of the proposed scheme.
We consider an amplify-and-forward (AF) relay network with multiple source-destination pairs in the presence of an eavesdropper. This paper studies the robust artificial noise (AN) assisted joint transceiver optimization for secure communication with imperfect channel state information (CSI) of legitimate users and no CSI regarding the eavesdropper. The goal is to design the linear precoding matrix of the relay and the linear equalizer of each destination, such that the transmit power for the information-bearing signals and forwarded background noises at the relay can be minimized subject to the quality of service (QoS) constraints at the destinations. The remainder of the constrained total power is used to generate the AN for jamming the eavesdropper. Although such a power minimization problem is nonconvex, we recast it into two semidefinite programming (SDP) subproblems which can be solved using interior-point methods. Then this problem can be solved with the alternating iterative optimization algorithm. Simulations demonstrate that the proposed algorithm can significantly reduce the sensitivity to imperfect CSI, while degrading the eavesdropper's capability of intercepting.