Secure Relay Beamforming for SWIPT in Amplify-and-Forward Two-Way Relay Networks
Secure Relay Beamforming for SWIPT in Amplify-and-Forward Two-Way Relay Networks
复制标题
放大转发双向中继网络中 SWIPT 的安全中继波束成形
DOI：
10.1109/tvt.2016.2519339
复制
发表时间：
2016-11-01
影响因子：
6.8
通讯作者：
Qin, Jiayin
中科院分区：
文献类型：
--
作者：
Li, Quanzhong;Zhang, Qi;Qin, Jiayin
在本文中，我们研究了安全中继波束形成问题的同时无线信息和功率传输（SWIPT）放大转发（AF）双向中继网络。我们考虑的情况下，窃听者的信道状态信息（CSI）是和不可用。当窃听者的CSI可用时，我们的目标是在发射功率约束和能量收集约束下最大化可实现的保密和速率。由于优化问题是非凸的，我们推导出其性能上界，这需要2-D搜索，其中半定规划是在每一步解决。我们还采用高斯随机化方法提出了一种基于上限的一阶解决方案。为了降低计算复杂度，我们将优化问题转化为一个差分凸规划，并提出了一个基于序贯参数凸逼近（SPCA）的迭代算法来寻找局部最优解。此外，我们还提出了一种基于迫零（ZF）的次优解。仿真结果表明，基于上界的秩一解的性能几乎与具有高计算复杂度的上界相同。低复杂度的基于SPCA的局部最优解的性能接近上界。基于ZF的次优解在所提出的解中具有最低的计算复杂度。当窃听者的CSI不可用时，我们提出了一种人工噪声辅助的安全中继波束形成方案。
In this paper, we investigate the secure relay beamforming problem for simultaneous wireless information and power transfer (SWIPT) in an amplify-and-forward (AF) two-way relay network. We consider scenarios that the eavesdropper's channel state information (CSI) is and is not available. When the eavesdropper's CSI is available, our objective is to maximize the achievable secrecy sum rate under transmit power constraint and energy harvesting constraint. Since the optimization problem is nonconvex, we derive its performance upper bound, which requires 2-D search, where a semidefinite programming is solved in each step. We also propose an upper bound-based rank-one solution by employing the Gaussian randomization method. To reduce computational complexity, we transform the optimization problem into a difference-of-convex programming and propose a sequential parametric convex approximation (SPCA)-based iterative algorithm to find a locally optimal solution. Furthermore, we also propose a zero-forcing (ZF)-based suboptimal solution. Simulation results demonstrate that the upper bound-based rank-one solution archives the performance almost the same as the upper bound that has high computational complexity. The low-complexity SPCA-based locally optimal solution performs close to the upper bound. The ZF-based suboptimal solution has the lowest computational complexity among the proposed solutions. When the eavesdropper's CSI is not available, we propose an artificial noise-aided secure relay beamforming scheme.