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

AEU - International Journal of Electronics and Communications

Minimum secrecy rate maximization for multiple peer-to-peer communications in two-way relaying networks

Mehdi Cheraghi, Yousef Darmani

Published May 17, 2023• 2 citations
Publisher
DOI
10.1016/j.aeue.2023.154670

Related papers

Maximizing the minimum secrecy rate of two-way relay networks

Faezeh Sharifi, Soroush Akhlaghi

Computer Communications•Aug 19, 2021•6 citations

User power allocation and relay beamforming design for secrecy sum rate maximization in two-way relay networks

Mehdi Cheraghi, Yousef Darmani

AEU - International Journal of Electronics and Communications•Jan 22, 2022•4 citations

Secure communication design for multi‐user peer‐to‐peer wireless relay networks

Xiangwu Gong, Hang Long, Feihong Dong +1 more

In this study, physical layer security techniques are studied for multi‐user peer‐to‐peer relay networks using amplify‐and‐forward protocol in the presence of an eavesdropper. Two system designs are considered: the minimum achievable secrecy rate maximisation and the total transmit power minimisation. First, considering user fairness, the authors study the max–min achievable secrecy rate problem subject to a total transmit power constraint. Mathematically, the optimisation problem is non‐linear and non‐convex. They propose a polynomial time algorithm based on the bisection technique to solve it. Second, they study the total transmit power minimisation problem which aims at minimising the total transmit power at relays such that individual secrecy rate for each user is satisfied. The total power optimisation problem is also non‐convex, so they use the relaxation technique to transform it into a convex problem which can be efficiently solved by the gradient‐based algorithms. Numerical evaluation of the obtained secrecy rate and transmit power results shows that the proposed designs can significantly improve the performance of secure wireless communications.

IET Communications•Apr 15, 2016•4 citations

Secrecy Capacity and Optimal Power Allocation Scheme for Two-Way Untrusted Relay Networks

Xiaoya Li

Journal of Information and Computational Science•Sep 20, 2015•0 citations

Secure Transmission Schemes for Two-Way Relay Networks

Miao Luo, Xiaoping Li, Jianquan Wang +3 more

We investigate the physical-layer security problems of two-way relay networks in this paper. The whole network consists of two legitimate users and one eavesdropper, where the legal users need the help of some intermediate nodes to exchange information. We propose joint jamming and relaying mechanism, where a jamming node is selected from all intermediate nodes, to create interference upon eavesdropper, while other nodes are used to relay data for two users. All intermediate nodes are subjected to per-node power constraints. Based on null-space beamforming, we propose two different transmission schemes when the number of relay nodes is large enough. One scheme is designed to maximize the secrecy sum rate (MSSR) of the network, and the other is designed to maximize the minimum secrecy rate (MMSR) between two users. In the MMSR scheme, a series of semi-definite programming problems with a rank-1 constraint needs to be solved. We prove that this rank-1 constraint does not affect the solutions of original problems. In addition, we propose two modified secure transmission schemes when the number of relay nodes is less abundant. In short, no matter how many intermediate nodes in the communication networks, one can find suitable transmission schemes to ensure communication security.

IEEE Access•Jan 1, 2019•6 citations

Achievable Secrecy Rate Regions for Relay Networks

Amir Sonee, Mahmoud Salmasi zadeh

•Jan 1, 2010•0 citations
In this study, physical layer security techniques are studied for multi‐user peer‐to‐peer relay networks using amplify‐and‐forward protocol in the presence of an eavesdropper. Two system designs are considered: the minimum achievable secrecy rate maximisation and the total transmit power minimisation. First, considering user fairness, the authors study the max–min achievable secrecy rate problem subject to a total transmit power constraint. Mathematically, the optimisation problem is non‐linear and non‐convex. They propose a polynomial time algorithm based on the bisection technique to solve it. Second, they study the total transmit power minimisation problem which aims at minimising the total transmit power at relays such that individual secrecy rate for each user is satisfied. The total power optimisation problem is also non‐convex, so they use the relaxation technique to transform it into a convex problem which can be efficiently solved by the gradient‐based algorithms. Numerical evaluation of the obtained secrecy rate and transmit power results shows that the proposed designs can significantly improve the performance of secure wireless communications.
We investigate the physical-layer security problems of two-way relay networks in this paper. The whole network consists of two legitimate users and one eavesdropper, where the legal users need the help of some intermediate nodes to exchange information. We propose joint jamming and relaying mechanism, where a jamming node is selected from all intermediate nodes, to create interference upon eavesdropper, while other nodes are used to relay data for two users. All intermediate nodes are subjected to per-node power constraints. Based on null-space beamforming, we propose two different transmission schemes when the number of relay nodes is large enough. One scheme is designed to maximize the secrecy sum rate (MSSR) of the network, and the other is designed to maximize the minimum secrecy rate (MMSR) between two users. In the MMSR scheme, a series of semi-definite programming problems with a rank-1 constraint needs to be solved. We prove that this rank-1 constraint does not affect the solutions of original problems. In addition, we propose two modified secure transmission schemes when the number of relay nodes is less abundant. In short, no matter how many intermediate nodes in the communication networks, one can find suitable transmission schemes to ensure communication security.