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 of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

Secrecy Sum Rate for Two-Way Untrusted Relay in SCMA Networks

Yiteng Arden Huang, Shuai Han, Shizeng Guo, Ming Li, Zhiqiang Li

Published Jan 1, 2019• 1 citation
Publisher
DOI
10.1007/978-3-030-32388-2_7

Related papers

Secrecy Rate of Two-Hop AF Relaying Networks with an Untrusted Relay

Nanrun Zhou, Xun Chen, Chisheng Li +1 more

Wireless Personal Communications•Aug 13, 2013•13 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

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

Secrecy outage probability of a two-way cooperative network with an energy harvesting untrusted AF relay

Shashibhushan Sharma, Anurag Kumar, Sanjay Dhar Roy +1 more

CSI Transactions on ICT•Jun 1, 2018•1 citation

Maximizing the minimum secrecy rate of two-way relay networks

Faezeh Sharifi, Soroush Akhlaghi

Computer Communications•Aug 19, 2021•6 citations

Selective cooperation with untrusted relays for physical‐layer security in wireless multipair two‐way relaying networks

Tantan Zhao, Guobing Li, Gangming Lyu +1 more

Abstract In this paper, the selective cooperation with untrusted relays is studied for wireless multipair two‐way relay networks. We first investigate the feasibility of secure transmission in the presence of cooperative but untrusted relays and then formulate a general optimization problem of secrecy sum‐rate maximization under the constraints of relay selection. By decomposing the original problem into solvable subproblems, we develop a low‐complexity greedy algorithm for selective cooperation, in which the untrusted relays are selected as cooperators or the potential eavesdroppers according to the overall contributions to the secrecy sum rate. Simulation results reveal that the proposed greedy algorithm for selective cooperation with untrusted relays achieves performance gain both in instantaneous and average secrecy sum rate and that the algorithm can converge quickly with the iterations.

Transactions on Emerging Telecommunications Technologies•Apr 19, 2018•5 citations
Abstract In this paper, the selective cooperation with untrusted relays is studied for wireless multipair two‐way relay networks. We first investigate the feasibility of secure transmission in the presence of cooperative but untrusted relays and then formulate a general optimization problem of secrecy sum‐rate maximization under the constraints of relay selection. By decomposing the original problem into solvable subproblems, we develop a low‐complexity greedy algorithm for selective cooperation, in which the untrusted relays are selected as cooperators or the potential eavesdroppers according to the overall contributions to the secrecy sum rate. Simulation results reveal that the proposed greedy algorithm for selective cooperation with untrusted relays achieves performance gain both in instantaneous and average secrecy sum rate and that the algorithm can converge quickly with the iterations.