Secure Transmission in Amplify and Forward Networks for Multiple Degraded Eavesdroppers
Secure Transmission in Amplify and Forward Networks for Multiple Degraded Eavesdroppers
复制标题
DOI：
--
复制
发表时间：
2014-05
期刊：
影响因子：
--
通讯作者：
S. Sarma;S. Agnihotri;J. Kuri
中科院分区：
文献类型：
--
作者：
S. Sarma;S. Agnihotri;J. Kuri
我们评估了具有多个窃听者的放大转发（AF）中继网络的最佳保密率。假设 i.i.d.针对目的地和窃听者的高斯噪声，我们设计了计算中继节点最佳缩放因子的技术，以便在总功率约束和个体功率约束下获得最佳保密率。最初，我们考虑了目的地和窃听者的特殊信道条件，这导致我们对问题进行了分析解决。相反，一般场景是非凸优化问题，不仅缺乏解析解，而且很难求解。因此，我们提出了一种可有效求解的二次规划（QP），它为原始问题提供了次优解。然后，我们设计了一种迭代方案，用于有效计算总功率和单独功率约束场景的最佳缩放因子。结果部分提供了必要的数据，以确认我们提出的解决方案的有效性。
We have evaluated the optimal secrecy rate for Amplify-and-Forward (AF) relay networks with multiple eavesdroppers. Assuming i.i.d. Gaussian noise at the destination and the eavesdroppers, we have devised technique to calculate optimal scaling factor for relay nodes to obtain optimal secrecy rate under both sum power constraint and individual power constraint. Initially, we have considered special channel conditions for both destination and eavesdroppers, which led us to analytical solution of the problem. Contrarily, the general scenario being a non-convex optimization problem, not only lacks an analytical solution, but also is hard to solve. Therefore, we have proposed an efficiently solvable quadratic program (QP) which provides a sub-optimal solution to the original problem. Then, we have devised an iterative scheme for calculating optimal scaling factor efficiently for both the sum power and individual power constraint scenario. Necessary figures are provided in result section to affirm the validity of our proposed solution.