Secure resource allocation for green two‐way relay networks with mutually untrusted relay and mobile users. Issue 1 (1st January 2020)

• Record Type: Journal Article
• Authors: Wang, Fei; Qin, Changchun
• Is Part Of: IET networks. Volume 9:Issue 1(2020)
• Page Start: 1
• Page End: 6
• Publication Date: 2020-01-01
• Subjects: concave programming -- power control -- resource allocation -- relay networks (telecommunication) -- OFDM modulation -- energy harvesting -- telecommunication security -- frequency division multiple access -- telecommunication control -- telecommunication power management; secure resource allocation -- mutually untrusted relay -- mobile users -- energy harvesting relay -- power splitting technique -- radio frequency signals -- subcarrier allocation -- power splitting ratio selection -- green two‐way relay networks -- orthogonal frequency division multiple access two‐way relay network -- MU pair confidential information -- power control -- suboptimal algorithm -- nonconvex problem; Computer network architectures -- Periodicals; Computer network protocols -- Periodicals; Information networks -- Periodicals; Telecommunication systems -- Periodicals; 004.605
• DOI: 10.1049/iet-net.2019.0002
• Languages: English
• ISSNs: 2047-4954

Abstract

Abstract : The authors investigate secure resource allocation for an orthogonal frequency division multiple access two‐way relay network, which has several pairs of mobile users (MUs) and one energy harvesting (EH) relay. In this network, the relay is untrusted and each MU pair may also overhear the other MU pairs' confidential information. In particular, to forward information for each MU, the relay adopts power splitting technique to harvest energy from radio frequency signals emitted by each MU. For this scenario, which has hardly been considered, the joint problem of subcarrier allocation, power control, and power splitting ratio selection is formulated, with the aim to maximise the total secrecy rate of all MUs. A suboptimal algorithm with low complexity and satisfactory performance is proposed to solve the formulated non‐convex problem.