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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.