论文标题
基于缓冲辅助继电器系统的保密利率最大化的机会性继电器和干扰
Study of Opportunistic Relaying and Jamming Based on Secrecy-Rate Maximization for Buffer-Aided Relay Systems
论文作者
论文摘要
在本文中，我们调查了机会性继电器和干扰技术，并开发了继电器选择算法，以最大程度地提高多源缓冲辅助接力网络的保密率。我们开发了一种方法来最大化无需窃听器的通道状态信息（CSI）的继电器系统的保密率。我们还设计继电器和干扰功能选择（RJFS）算法以选择多个继电器节点以及多个干扰节点以帮助传输。在提出的RJFS算法中，请考虑了RJFS Interay Interay干扰取消（IC）。首先执行IC以提高对合法用户的传输速率，然后将R-Relay IC应用于将干扰信号放大到EavesDroppers并提高保密率。使用缓冲辅助继电器，可以将干扰信号存储在继电器节点上，并提出一个缓冲辅助AD的RJFS（BF-RJFS）算法。然后开发贪婪的RJF和BF-RJFS算法以降低复杂性来进行继电器选择。仿真结果表明，即使在没有窃听者的CSI的情况下，提出的RJFS和BF-RJFS算法也可以比以前报道的技术获得更高的保密性能。
In this paper, we investigate opportunistic relaying and jamming techniques and develop relay selection algorithms that maximize the secrecy rate for multiuser buffer-aided relay networks. We develop an approach to maximize the secrecy rate of relay systems that does not require the channel state information (CSI) of the eavesdroppers. We also devise relaying and jamming function selection (RJFS) algorithms to select multiple relay nodes as well as multiple jamming nodes to assist the transmission. In the proposed RJFS algorithms inter-relay interference cancellation (IC) is taken into account. IC is first performed to improve the transmission rate to legitimate users and then inter-relay IC is applied to amplify the jamming signal to the eavesdroppers and enhance the secrecy rate. With the buffer-aided relays the jamming signal can be stored at the relay nodes and a buffer-aided RJFS (BF-RJFS) algorithm is proposed. Greedy RJFS and BF-RJFS algorithms are then developed for relay selection with reduced complexity. Simulation results show that the proposed RJFS and BF-RJFS algorithms can achieve a higher secrecy rate performance than previously reported techniques even in the absence of CSI of the eavesdroppers.
