Maximizing the minimum achievable secrecy rate of two-way relay networks using the null space beamforming method
Erfan khordad, Soroush Akhlaghi, Meysam Mirzaee

TL;DR
This paper proposes a null space beamforming method to maximize the minimum secrecy rate in two-way relay networks with an eavesdropper, using semi-definite relaxation to find near-optimal solutions and outperform existing methods.
Contribution
It introduces a novel null space beamforming approach combined with SDR to enhance secrecy rates in two-way relay networks, addressing non-convex optimization challenges.
Findings
Proposed method outperforms existing techniques in simulations.
Null space beamforming effectively enhances secrecy rate.
SDR provides a close-to-optimal solution for the non-convex problem.
Abstract
This paper concerns maximizing the minimum achievable secrecy rate of a two-way relay network in the presence of an eavesdropper, in which two nodes aim to exchange messages in two hops, using a multi-antenna relay. Throughout the first hop, the two nodes simultaneously transmit their messages to the relay. In the second hop, the relay broadcasts a combination of the received information to the users such that the transmitted signal lies in the null space of the eavesdropper's channel; this is called null space beamforming (NSBF). The best NSBF matrix for maximizing the minimum achievable secrecy rate is studied, showing that the problem is not convex in general. To address this issue, the problem is divided into three sub-problems: a close-to-optimal solution is derived by using the semi-definite relaxation (SDR) technique. Simulation results demonstrate the superiority of the proposed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
