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

IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

Secrecy rate maximization in full-duplex multi-antenna decode-and-forward relay systems

Batu K. Chalise, Wing‐Kin Ma, Himal A. Suraweera, Qiang Li

Published Jul 1, 2017• 4 citations
Publisher

Abstract

This paper proposes optimum beamforming for a system consisting of a source, a full-duplex (FD) relay, an intended destination, and an eavesdropper. The source and destination are single-antenna nodes, whereas the FD relay is a multi-antenna node. Our objective is to find the optimum receive and transmit beamformers at the relay so that the secrecy rate is maximized. The joint optimization problem is equivalently expressed in terms of the transmit beamformer. The resulting optimization is non-convex. However, we equivalently reformulate it to a suitable form so that the optimum solution is obtained by solving semi-definite relaxation problem, in conjunction with a line search confined to a specific region. Computer simulations demonstrate significant increase in secrecy rate compared to the conventional secure half-duplex relay communications.

DOI
10.1109/spawc.2017.8227738

Related papers

Secure Cooperative Network With Multi-Antenna Full-Duplex Receiver

Fatemeh Jafarian, Zahra Mobini, Mohammadali Mohammadi

In this paper, the physical-layer security of a cooperative wireless system with multi-antenna full-duplex (FD) destination is examined. More specifically, we consider a cooperative transmission scenario in which a source communicates with a destination through a relay in the presence of an eavesdropper. In order to degrade the wiretap channel, the FD destination simultaneously transmits an interference signal towards the eavesdropper, while receiving information from the relay. A joint transmit and receive beamformer design is proposed to maximize the signal-to-interference-plus-noise ratio (SINR) at the destination, while guaranteeing that the SINR at the eavesdropper is below a certain threshold. We reformulate the optimization problem as a semidefinite relaxation problem in terms of a transmit beamforming matrix. To balance the performance and system complexity, we investigate suboptimum beamforming designs based on zero-forcing criterion. We derive exact closed-form expressions for the average secrecy rates of the proposed suboptimum designs. Our results reveal that optimum and suboptimum beamforming schemes along with friendly jamming significantly improve the secrecy performance. Moreover, simulation results demonstrate that the optimum scheme outperforms suboptimum schemes, especially in high transmit power regimes.

IEEE Systems Journal•Jan 9, 2019•14 citations

Secure Beamforming for Full-Duplex MIMO Two-Way Communication via Untrusted Relaying

Shuangrui Zhao, Jia Liu, Xiaochen Li +2 more

Full-duplex (FD) technique is very promising to support enormous data for 5G networks since it can greatly improve the spectrum efficiency. However, the secrecy performance of FD communication systems still remains largely unknown. As an initial step towards this end, this paper studies the physical layer security-based beamforming design in a FD two-way amplify-and-forward relay system, where two source nodes exchange messages with the assistance of an untrusted relay. The untrusted relay is willing to forward the messages and may also work as an eavesdropper to intercept the confidential messages. Our objective is to optimize the source and relay beamformers for maximizing the secrecy sum rate of the two-way communications with imperfect self-interference cancellation. For a specific system configuration, we first derive the expression of secrecy sum rate. By utilizing signal alignment technique and gradient method, we then propose two iterative algorithms to find the optimal source and relay beamforming matrices, respectively. Simulation results demonstrate that when the number of antennas at the relay is appropriate and the interference-to-noise ratio is in a low region the proposed FD scheme significantly improves the secrecy sum rate over conventional schemes.

IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2017•5 citations

MIMO decode-and-forward relay beamforming for secrecy with cooperative jamming

Sanjay Vishwakarma, A. Chockalingam

In this paper, we consider decode-and-forward (DF) relay beamforming for secrecy with cooperative jamming (CJ) in the presence of multiple eavesdroppers. The communication between a source-destination pair is aided by a multiple-input multiple-output (MIMO) relay. The source has one transmit antenna and the destination and eavesdroppers have one receive antenna each. The source and the MIMO relay are constrained with powers PSand PR, respectively. We relax the rank-1 constraint on the signal beamforming matrix and transform the secrecy rate max-min optimization problem to a single maximization problem, which is solved by semidefinite programming techniques. We obtain the optimum source power, signal relay weights, and jamming covariance matrix. We show that the solution of the rank-relaxed optimization problem has rank-1. Numerical results show that CJ can improve the secrecy rate.

National Conference on Communications•Feb 1, 2014•8 citations

Robust AN-aided Secure Beamforming for Full-Duplex Relay System with Multiple Eavesdroppers

Jiaxing Cui, Zhengmin Kong, Jing Song +2 more

In this paper, we investigate the physical layer security of a full-duplex decode-and-forward relay-aided system in the worst case, where all channel state informations are realistic imperfect. For the sake of confidentiality of signals transmitted from source to destination, a robust artificial noise (AN)-aided beamforming scheme is proposed. Explicitly, our objective function is that of maximizing the worst-case secrecy rate under the transmit power constraints, by jointly optimizing the beamforming matrix and AN at the source and the relay. To overcome the non-convexity of the robust AN-aided secure beamforming problem, we transform it into multi-block convex problems, where the semi-infinite linear matrix inequality is applied to eliminate the channel uncertainties. As a benefit, our proposed robust AN -aided secure beamforming scheme obtains substantial secrecy performance gains, which verifies the efficiency of the proposed scheme.

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)•Oct 1, 2021•0 citations

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

Bin Li, Zesong Fei

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.

EURASIP Journal on Wireless Communications and Networking•Mar 1, 2016•11 citations

Secrecy rate with friendly full-duplex relay

Saeedeh Parsaeefard, Tho Le‐Ngoc

This paper considers the use of a friendly full-duplex (FD) relay to increase the secrecy rate over a fading channel between the legitimate source and destination in the presence of a naive or informed eavesdropper. Naive eavesdropper can only decode the received signals either from the source or from the relay, while informed eavesdropper can overhear signals transmitted from both the source and relay. Accordingly, we compare the achievable secrecy rates of FD relay with traditional half-duplex (HD) relay in terms of the channel state information (CSI) between nodes, eavesdropper types, and the self-interference (SI) in FD-Relay. We consider the non-convex power allocation problems for the developed FD-relay to maximize the secrecy rate under the power constraints and develop an efficient iterative algorithm based on the difference-of-two-concave-functions (DC) programming. The analytical and simulation results confirm that FD relay offers significant improvements in the secrecy rate over the HD-Relay.

IEEE Wireless Communications and Networking Conference•Mar 1, 2015•4 citations
This paper proposes optimum beamforming for a system consisting of a source, a full-duplex (FD) relay, an intended destination, and an eavesdropper. The source and destination are single-antenna nodes, whereas the FD relay is a multi-antenna node. Our objective is to find the optimum receive and transmit beamformers at the relay so that the secrecy rate is maximized. The joint optimization problem is equivalently expressed in terms of the transmit beamformer. The resulting optimization is non-convex. However, we equivalently reformulate it to a suitable form so that the optimum solution is obtained by solving semi-definite relaxation problem, in conjunction with a line search confined to a specific region. Computer simulations demonstrate significant increase in secrecy rate compared to the conventional secure half-duplex relay communications.
In this paper, the physical-layer security of a cooperative wireless system with multi-antenna full-duplex (FD) destination is examined. More specifically, we consider a cooperative transmission scenario in which a source communicates with a destination through a relay in the presence of an eavesdropper. In order to degrade the wiretap channel, the FD destination simultaneously transmits an interference signal towards the eavesdropper, while receiving information from the relay. A joint transmit and receive beamformer design is proposed to maximize the signal-to-interference-plus-noise ratio (SINR) at the destination, while guaranteeing that the SINR at the eavesdropper is below a certain threshold. We reformulate the optimization problem as a semidefinite relaxation problem in terms of a transmit beamforming matrix. To balance the performance and system complexity, we investigate suboptimum beamforming designs based on zero-forcing criterion. We derive exact closed-form expressions for the average secrecy rates of the proposed suboptimum designs. Our results reveal that optimum and suboptimum beamforming schemes along with friendly jamming significantly improve the secrecy performance. Moreover, simulation results demonstrate that the optimum scheme outperforms suboptimum schemes, especially in high transmit power regimes.
Full-duplex (FD) technique is very promising to support enormous data for 5G networks since it can greatly improve the spectrum efficiency. However, the secrecy performance of FD communication systems still remains largely unknown. As an initial step towards this end, this paper studies the physical layer security-based beamforming design in a FD two-way amplify-and-forward relay system, where two source nodes exchange messages with the assistance of an untrusted relay. The untrusted relay is willing to forward the messages and may also work as an eavesdropper to intercept the confidential messages. Our objective is to optimize the source and relay beamformers for maximizing the secrecy sum rate of the two-way communications with imperfect self-interference cancellation. For a specific system configuration, we first derive the expression of secrecy sum rate. By utilizing signal alignment technique and gradient method, we then propose two iterative algorithms to find the optimal source and relay beamforming matrices, respectively. Simulation results demonstrate that when the number of antennas at the relay is appropriate and the interference-to-noise ratio is in a low region the proposed FD scheme significantly improves the secrecy sum rate over conventional schemes.
In this paper, we consider decode-and-forward (DF) relay beamforming for secrecy with cooperative jamming (CJ) in the presence of multiple eavesdroppers. The communication between a source-destination pair is aided by a multiple-input multiple-output (MIMO) relay. The source has one transmit antenna and the destination and eavesdroppers have one receive antenna each. The source and the MIMO relay are constrained with powers PSand PR, respectively. We relax the rank-1 constraint on the signal beamforming matrix and transform the secrecy rate max-min optimization problem to a single maximization problem, which is solved by semidefinite programming techniques. We obtain the optimum source power, signal relay weights, and jamming covariance matrix. We show that the solution of the rank-relaxed optimization problem has rank-1. Numerical results show that CJ can improve the secrecy rate.
In this paper, we investigate the physical layer security of a full-duplex decode-and-forward relay-aided system in the worst case, where all channel state informations are realistic imperfect. For the sake of confidentiality of signals transmitted from source to destination, a robust artificial noise (AN)-aided beamforming scheme is proposed. Explicitly, our objective function is that of maximizing the worst-case secrecy rate under the transmit power constraints, by jointly optimizing the beamforming matrix and AN at the source and the relay. To overcome the non-convexity of the robust AN-aided secure beamforming problem, we transform it into multi-block convex problems, where the semi-infinite linear matrix inequality is applied to eliminate the channel uncertainties. As a benefit, our proposed robust AN -aided secure beamforming scheme obtains substantial secrecy performance gains, which verifies the efficiency of the proposed scheme.
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.
This paper considers the use of a friendly full-duplex (FD) relay to increase the secrecy rate over a fading channel between the legitimate source and destination in the presence of a naive or informed eavesdropper. Naive eavesdropper can only decode the received signals either from the source or from the relay, while informed eavesdropper can overhear signals transmitted from both the source and relay. Accordingly, we compare the achievable secrecy rates of FD relay with traditional half-duplex (HD) relay in terms of the channel state information (CSI) between nodes, eavesdropper types, and the self-interference (SI) in FD-Relay. We consider the non-convex power allocation problems for the developed FD-relay to maximize the secrecy rate under the power constraints and develop an efficient iterative algorithm based on the difference-of-two-concave-functions (DC) programming. The analytical and simulation results confirm that FD relay offers significant improvements in the secrecy rate over the HD-Relay.