arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2101.02749eess.SP
收藏

基于深度学习的硬件受损不可信中继网络的安全速率最大化

Secrecy Rate Maximization for Hardware Impaired Untrusted Relaying Network with Deep Learning

Hamed Bastami, Majid Moradikia, Hamid Behroozi, Rodrigo C. de Lamare, Ahmed Abdelhadi, Zhigou Ding

摘要:

研究了源节点与多天线窃听者(Eve)共存的不可信中继网络的物理层安全设计问题。虽然通信依赖于不可信的中继节点,以提高可靠性,我们的目标是保护信息的机密性,防止联合窃听攻击的不可信的中继节点和夏娃。考虑到系统的硬件损伤和功率预算约束,提出了一种以最大化平均保密率(ASR)为目标的中继波束形成器和发射功率联合优化方法。所得到的优化问题是非凸的,并通过序贯参数凸逼近(SPCA)方法获得一个次优解。为了防止任何失败,由于不可行的,我们提出了一个迭代初始化算法来寻找可行的初始点的原问题。为了满足作为超5G(B5G)通信所需的主要关键性能指标(KPI)之一的低延迟,开发了一种计算高效的数据驱动方法,该方法利用深度学习模型来提高ASR,同时显著降低计算负担。仿真结果评估了不同系统参数对ASR性能的影响,以及所提出的深度学习解决方案在大规模情况下的有效性。

英文摘要:

This paper investigates the physical layer security design of an untrusted relaying network where the source node coexists with a multi-antenna eavesdropper (Eve). While the communication relies on untrustworthy relay nodes to increase reliability, we aim to protect the confidentiality of information against combined eavesdropping attacks performed by both untrusted relay nodes and Eve. Taking into account the hardware impairments, and power budget constraints, this paper presents a novel approach to jointly optimize relay beamformer and transmit powers aimed at maximizing average secrecy rate (ASR). The resultant optimization problem is non-convex, and a suboptimal solution is obtained through the sequential parametric convex approximation (SPCA) method. In order to prevent any failure due to infeasibility, we propose an iterative initialization algorithm to find the feasible initial point of the original problem. To satisfy low-latency as one of the main key performance indicators (KPI) required in beyond 5G (B5G) communications, a computationally efficient data-driven approach is developed exploiting a deep learning model to improve the ASR while the computational burden is significantly reduced. Simulation results assess the effect of different system parameters on the ASR performance as well as the effectiveness of the proposed deep learning solution in large-scale cases.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑