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

Lecture notes in networks and systems

DC Programming and DCA for Secrecy Rate Maximization via Null Space AF Relay Beamforming in a Wireless Network with Multiple Eavesdroppers

Hoai An Le Thi, Thi Thuy Tran, Nhu Tuan Nguyen

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.1007/978-3-032-08381-4_4

Related papers

DC Programming and DCA for Enhancing Physical Layer Security in Amplify-and-Forward Relay Beamforming Networks Based on the SNR Approach

Nguyen Nhu Tuan, Dang Vu Son

Advances in intelligent systems and computing•Jun 27, 2017•4 citations

DC programming and DCA for Secure Guarantee with Null Space Beamforming in Two-Way Relay Networks

Nguyen The Duy, Thi Thuy Tran, Luong Thuy Chung +2 more

In this paper, we consider a two-way relay network system which contains multiple cooperative relays transmitting information between two sources with attendance of an eavesdropper. A null space beamforming scheme is applied to ensure the secrecy in system. Our goal is achieving maximal secrecy sum rate with a certain level power transmit. In [1], authors propose an approach to solve Secrecy Sum Rate Maximization (SSRM) problem, whereas we use another approach based on Different of Convex Functions Algorithm (DCA).

International Conference on Software and Computer Applications (ICSCA)•Feb 19, 2019•1 citation

Distributed Secrecy Beamforming and Precoding in Multi-Antenna Wireless Relay Systems

Y.-W. Peter Hong, Pang-Chang Lan, C.‐C. Jay Kuo

Springer briefs in electrical and computer engineering•Sep 26, 2013•0 citations

DC Programming and DCA for Secrecy Rate Maximization in a Wireless Network with Multiple Eavesdroppers

Hoai An Le Thi, Thi Thuy Tran, Tao Pham Dinh

In this paper, we consider a wireless network where a source tries to send messages to a destination while keeping them secret from multiple eavesdroppers. To enhance secrecy, the transmission is performed with a cooperation of friendly jammers which make artificial noise to confound eavesdroppers and beamforming technique to direct jamming signal to intended targets. The purpose is to determine beamforming coefficients in order to maximize secrecy rate under the total jammer power constraint. The existing method solved this problem in a special case in which the beamforming coefficients were designed to completely eliminate jamming signal at the destination and a heuristic approach was applied to obtain a suboptimal solution for this case. We address this problem via a new approach based on DC (Difference of Convex functions) programming and DCA (DC Algorithm). We first reformulate this problems as a general DC program, i.e. minimizing a DC function under some DC constraints, and develop a DCA based algorithm for solving it. The experimental results show that the secrecy rate obtained by the proposed algorithm is better than those achieved by the existing one.

WSEAS TRANSACTIONS on COMMUNICATIONS archive•Jan 1, 2017•0 citations

DC programming and DCA for enhancing physical layer security via relay beamforming strategies

Thi Thuy Tran, Hoai An Le Thi, Tao Pham Dinh +1 more

Optimization Letters•Jan 8, 2021•0 citations

Cooperative Secure Beamforming for AF Relay Networks With Multiple Eavesdroppers

Ye Yang, Qiang Li, Wing‐Kin Ma +2 more

This letter studies cooperative secure beamforming for amplify-and-forward (AF) relay networks in the presence of multiple eavesdroppers. Under both total and individual relay power constraints, we propose two schemes, namely secrecy rate maximization (SRM) beamforming and null-space beamforming. In the first scheme, our design problem is based on SRM. Using a suboptimal, but convex, technique-semidefinite relaxation (SDR), we show that this problem can be handled by performing a one-dimensional search which involves solving a sequence of semidefinite programs (SDPs). To reduce the complexity, in the second scheme, we instead maximize the information rate at the destination while completely eliminating the information leakage to all eavesdroppers. We prove that this problem can be exactly solved by SDR with one SDP only. Simulation results demonstrate the performance gains of the two proposed designs.

IEEE Signal Processing Letters•Nov 20, 2012•174 citations
In this paper, we consider a two-way relay network system which contains multiple cooperative relays transmitting information between two sources with attendance of an eavesdropper. A null space beamforming scheme is applied to ensure the secrecy in system. Our goal is achieving maximal secrecy sum rate with a certain level power transmit. In [1], authors propose an approach to solve Secrecy Sum Rate Maximization (SSRM) problem, whereas we use another approach based on Different of Convex Functions Algorithm (DCA).
In this paper, we consider a wireless network where a source tries to send messages to a destination while keeping them secret from multiple eavesdroppers. To enhance secrecy, the transmission is performed with a cooperation of friendly jammers which make artificial noise to confound eavesdroppers and beamforming technique to direct jamming signal to intended targets. The purpose is to determine beamforming coefficients in order to maximize secrecy rate under the total jammer power constraint. The existing method solved this problem in a special case in which the beamforming coefficients were designed to completely eliminate jamming signal at the destination and a heuristic approach was applied to obtain a suboptimal solution for this case. We address this problem via a new approach based on DC (Difference of Convex functions) programming and DCA (DC Algorithm). We first reformulate this problems as a general DC program, i.e. minimizing a DC function under some DC constraints, and develop a DCA based algorithm for solving it. The experimental results show that the secrecy rate obtained by the proposed algorithm is better than those achieved by the existing one.
This letter studies cooperative secure beamforming for amplify-and-forward (AF) relay networks in the presence of multiple eavesdroppers. Under both total and individual relay power constraints, we propose two schemes, namely secrecy rate maximization (SRM) beamforming and null-space beamforming. In the first scheme, our design problem is based on SRM. Using a suboptimal, but convex, technique-semidefinite relaxation (SDR), we show that this problem can be handled by performing a one-dimensional search which involves solving a sequence of semidefinite programs (SDPs). To reduce the complexity, in the second scheme, we instead maximize the information rate at the destination while completely eliminating the information leakage to all eavesdroppers. We prove that this problem can be exactly solved by SDR with one SDP only. Simulation results demonstrate the performance gains of the two proposed designs.