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

Study of Power Optimization Algorithms for Secure Communication with Untrusted AF Relays

P M Shemi, M. K. Sabu

Published Jan 1, 2024• 0 citations
Publisher
DOI
10.1007/978-981-99-8346-9_6

Related papers

Power Optimized Source-Based-Jamming for Secure Transmission through Untrusted AF Relays

P M Shemi, M G Jibukumar, Munsif Ali

Lecture notes in networks and systems•Jan 1, 2021•1 citation

Secure Transmit Beamforming in the RF Powered Untrusted Relay networks

Xiaochen Liu, Yuanyuan Gao, Nan Sha +1 more

This paper investigates secure transmission in the radio-frequency (RF) powered untrusted relay networks. The relay conducts amplify-and-forward (AF) protocol and may intercept information passively. Based on the physical-layer security technique, a two-phase communication protocol is proposed for transmit security. We aim to minimize the average total transmit power by jointly designing the transmit parameters of the networks under the security quality of service (QoS). The power minimization problem is non-convex, hence an alternative optimization (AO) based algorithm is proposed. The simulation results show that the proposed transmit scheme can significantly increase the power efficiency.

Computing, Communications and IoT Applications (ComComAp)•Oct 1, 2019•0 citations

Secure beamforming for MIMO two-way transmission with an untrusted relay

Jianhua Mo, Meixia Tao, Yuan Liu +2 more

From security perspective, a friendly relay may help to keep the confidential messages from being eavesdropped, while an untrusted relay may intentionally eavesdrop the messages when relaying. This paper studies the secure beamforming for multiple-input multiple-output (MIMO) two-way communications, where two source nodes exchange information with the help of an untrusted relay node. The relay adopts amplify-and-forward (AF) strategy and acts as both an essential helper and a potential eavesdropper. Our goal is to maximize the secrecy sum rate of the bidirectional links by jointly optimizing the source and relay beamformers. For the two-phase two-way relay scheme, we first derive the optimal structure of the relay beamformer and then propose an iterative algorithm to jointly optimize the source and relay beamformers. Then, a comprehensive study on the asymptotical performance is conducted by letting the source and relay powers approach zero or infinity. In particular, we show that when all powers approach infinity, the two-way relay scheme achieves the maximum secrecy rate if the transceiver beamformers are designed such that the received signals at the relay can be aligned to be parallel.

IEEE Wireless Communications and Networking Conference•Apr 1, 2013•16 citations

Secure communication in untrusted relay selection networks with wireless energy harvesting

Van Phu Tuan, Hyung Yun Kong

Wireless Networks•Oct 31, 2017•5 citations

Analysis and optimization of wireless powered untrusted relay system with multiple destinations

Daliang Ouyang, Rui Zhao, Yuanjian Li

Physical Communication•Jul 13, 2020•1 citation

Power Optimization Algorithms for Secure Communication via Cooperative Jamming Schemes: A Comparative Study

Shemi Panayappilly Mohammed, Masina Venkata Rajesh, Vishnu Vasudev

The ultimate objective of cooperative communication is to secure data transmitted from source to destination against eavesdropper attacks. The paper compares different power optimization algorithms for cooperative jamming schemes to improve the secrecy performance of a four-node Amplify and Forward (AF) relay network. The main focus of the work is on the investigation of Optimal Power Allocation (OPA) for maximizing the secrecy rate subject to a total power constraint using two cooperative jamming schemes, Source and Relay Based Jamming (SRBJ) and Source Based Jamming (SBJ). The secrecy performance of SBJ is evaluated for trusted and untrusted relaying scenarios. In the untrusted case, the situation in which an external eavesdropper and untrusted relay exist simultaneously is analyzed. The iterative algorithms such as the Nelder-Mead technique (N-M), the Broyden - Fletcher – Goldfarb - Shanno (BFGS) algorithm and the Conjugate-Gradient (CG) methods are used for power optimization and, consequently, for secrecy rate maximization. Both symmetric and asymmetric relay positions are subjected to the secrecy analysis. A comparison is conducted using the equal power Allocation (EPA) approach and the Exhaustive Search (ES) algorithm. The paper also studies the complexity of different algorithms and jamming methods based on the average number of iterations required for system convergence. It was found that the iterative algorithms provide better secrecy than the conventional methods. Experimental results reveal a trade-off between the iterative algorithms' convergence and complexity. The gradient-based BFGS and CG algorithms are less complex than the gradient-free N-M method. When assessing all jamming schemes, the N-M method is a good choice for convergence, whereas the BFGS is the best choice for lesser complexity.

International Journal of Electronics and Communication Engineering•Dec 31, 2024•0 citations
This paper investigates secure transmission in the radio-frequency (RF) powered untrusted relay networks. The relay conducts amplify-and-forward (AF) protocol and may intercept information passively. Based on the physical-layer security technique, a two-phase communication protocol is proposed for transmit security. We aim to minimize the average total transmit power by jointly designing the transmit parameters of the networks under the security quality of service (QoS). The power minimization problem is non-convex, hence an alternative optimization (AO) based algorithm is proposed. The simulation results show that the proposed transmit scheme can significantly increase the power efficiency.
From security perspective, a friendly relay may help to keep the confidential messages from being eavesdropped, while an untrusted relay may intentionally eavesdrop the messages when relaying. This paper studies the secure beamforming for multiple-input multiple-output (MIMO) two-way communications, where two source nodes exchange information with the help of an untrusted relay node. The relay adopts amplify-and-forward (AF) strategy and acts as both an essential helper and a potential eavesdropper. Our goal is to maximize the secrecy sum rate of the bidirectional links by jointly optimizing the source and relay beamformers. For the two-phase two-way relay scheme, we first derive the optimal structure of the relay beamformer and then propose an iterative algorithm to jointly optimize the source and relay beamformers. Then, a comprehensive study on the asymptotical performance is conducted by letting the source and relay powers approach zero or infinity. In particular, we show that when all powers approach infinity, the two-way relay scheme achieves the maximum secrecy rate if the transceiver beamformers are designed such that the received signals at the relay can be aligned to be parallel.
The ultimate objective of cooperative communication is to secure data transmitted from source to destination against eavesdropper attacks. The paper compares different power optimization algorithms for cooperative jamming schemes to improve the secrecy performance of a four-node Amplify and Forward (AF) relay network. The main focus of the work is on the investigation of Optimal Power Allocation (OPA) for maximizing the secrecy rate subject to a total power constraint using two cooperative jamming schemes, Source and Relay Based Jamming (SRBJ) and Source Based Jamming (SBJ). The secrecy performance of SBJ is evaluated for trusted and untrusted relaying scenarios. In the untrusted case, the situation in which an external eavesdropper and untrusted relay exist simultaneously is analyzed. The iterative algorithms such as the Nelder-Mead technique (N-M), the Broyden - Fletcher – Goldfarb - Shanno (BFGS) algorithm and the Conjugate-Gradient (CG) methods are used for power optimization and, consequently, for secrecy rate maximization. Both symmetric and asymmetric relay positions are subjected to the secrecy analysis. A comparison is conducted using the equal power Allocation (EPA) approach and the Exhaustive Search (ES) algorithm. The paper also studies the complexity of different algorithms and jamming methods based on the average number of iterations required for system convergence. It was found that the iterative algorithms provide better secrecy than the conventional methods. Experimental results reveal a trade-off between the iterative algorithms' convergence and complexity. The gradient-based BFGS and CG algorithms are less complex than the gradient-free N-M method. When assessing all jamming schemes, the N-M method is a good choice for convergence, whereas the BFGS is the best choice for lesser complexity.