Physical Layer Security Optimization With Cramér–Rao Bound Metric in ISAC Systems Under Sensing-Specific Imperfect CSI Model

Physical Layer Security Optimization With Cramér–Rao Bound Metric in ISAC Systems Under Sensing-Specific Imperfect CSI Model
复制标题

特定于传感的不完美 CSI 模型下 ISAC 系统中使用 Cramér–Rao 约束度量的物理层安全优化

DOI:
10.1109/tvt.2023.3347527
复制
发表时间:
2024
影响因子:
6.8
通讯作者:
Lin Ma
Lin Ma
中科院分区:
计算机科学2区
文献类型:
--
作者:
Hanbo Jia;Xiaoshuai Li;Lin Ma

文献摘要

参考文献

相似文献

集成传感与通信(ISAC)技术为下一代无线网络的安全通信提供了新的范式。在满足容忍感知要求和每个合法用户的最小保密率的前提下,利用频谱和能量有效性的双功能雷达通信(DFRC)来增强窃听者信道状态信息(CSI)不确定性下的物理层安全性(PLS).具体而言,我们提出了PLS优化模型,采用克拉美罗界(CRB)作为传感度量,并表征PLS增强下的传感-通信权衡。在单个合法用户和窃听者的理想CSI的情况下,推导了由广义特征向量和功率预算组成的效率封闭解。考虑到一般情况下的多个用户,我们首先提出了新的感知特定的不完美CSI模型,构建感知容量和不完美CSI的范数界之间的内在整合。此外,无限的不确定性是由S-过程处理,我们提出了块坐标下降(BCD)迭代算法来解决PLS优化问题,包括半定松弛(SDR)和逐次凸逼近(SCA),以解决非凸性。仿真结果表明,该算法的性能增益和有效性的平均保密率比其他基线方案。
The integrated sensing and communication (ISAC) endows the next generation of wireless networks with the new paradigm to the security communication. In this paper, the dual-functional radar-communication (DFRC) with the property of spectral and energy efficiency is considered to strengthen the physical layer security (PLS) under the channel state information (CSI) uncertainty of the eavesdropper, where satisfies the tolerate sensing requirement and the minimum secrecy rate for each legitimate user. Specifically, we propose the PLS optimization model which employs the Cramér-Rao bound (CRB) as the sensing metric, and characterize the sensing-communication trade-off under the PLS enhancement. The efficiency closed-form solution composed of the generalized eigenvector and the power budge is derived for the case of single legitimate user with the perfect CSI of the eavesdropper. Considering the general case of multiple users, we first propose the novel sensing-specific imperfect CSI model to construct the inherent integration between the sensing capacity and the norm bound of the imperfect CSI. Further, the infinite uncertainty is handled by the S-procedure, and we propose the block coordinate descent (BCD) iterative algorithm to solve the PLS optimization problem comprising with the semidefinite relaxation (SDR) and the successive convex approximation (SCA) to address the non-convexity. Simulation results demonstrate the performance gain and the effectiveness of the proposed algorithm in the average secrecy rate over other baseline schemes.
DOI: 10.48550/arxiv.2207.10748
发表时间: 2022
期刊: --
影响因子: --
作者:
Wang Z
通讯作者: Wang Z