论文标题
ISAC系统的强大且安全的资源分配:可变长度快照的新型优化框架
Robust and Secure Resource Allocation for ISAC Systems: A Novel Optimization Framework for Variable-Length Snapshots
论文作者
论文摘要
在本文中,我们研究了在集成传感和通信(ISAC)系统中的安全通信的强大资源分配设计。多端双功能雷达通信(DFRC)基站(BS)同时为靶标提供了多个单一武器的合法用户和感官,其中已经确定的目标被视为潜在的单端纳维德犬。 DFRC BS扫描具有一系列专用梁的扇区,而ISAC系统在每个光束的传输过程中都会拍摄环境的快照。根据感应信息,DFRC BS可以获取潜在窃听器的通道状态信息(CSI)。与单个快照的资源分配设计的现有作品不同,在本文中,我们提出了一个新颖的优化框架,该框架可以通过可调节持续时间的一系列快照,共同优化通信和传感资源。为此,我们共同优化了每个快照,波束形成向量的持续时间,以及AN的协方差矩阵,以最大化系统总和限制在一系列快照序列上,同时保证每个合法使用者的最小平均可实现速率和最大的平均可实现率和最大信息泄漏约束。资源分配算法设计被配制为非凸优化问题,在其中我们解释了合法用户和潜在的窃听器的不完善的CSI。为了使问题可解决,我们根据安全近似的潜在窃听者小规模褪色的不确定性区域的限制,这有助于基于块坐标下降的迭代迭代算法的发展,以获得有效的次优溶液。
In this paper, we investigate the robust resource allocation design for secure communication in an integrated sensing and communication (ISAC) system. A multi-antenna dual-functional radar-communication (DFRC) base station (BS) serves multiple single-antenna legitimate users and senses for targets simultaneously, where already identified targets are treated as potential single-antenna eavesdroppers. The DFRC BS scans a sector with a sequence of dedicated beams, and the ISAC system takes a snapshot of the environment during the transmission of each beam. Based on the sensing information, the DFRC BS can acquire the channel state information (CSI) of the potential eavesdroppers. Different from existing works that focused on the resource allocation design for a single snapshot, in this paper, we propose a novel optimization framework that jointly optimizes the communication and sensing resources over a sequence of snapshots with adjustable durations. To this end, we jointly optimize the duration of each snapshot, the beamforming vector, and the covariance matrix of the AN for maximization of the system sum secrecy rate over a sequence of snapshots while guaranteeing a minimum required average achievable rate and a maximum information leakage constraint for each legitimate user. The resource allocation algorithm design is formulated as a non-convex optimization problem, where we account for the imperfect CSI of both the legitimate users and the potential eavesdroppers. To make the problem tractable, we derive a bound for the uncertainty region of the potential eavesdroppers' small-scale fading based on a safe approximation, which facilitates the development of a block coordinate descent-based iterative algorithm for obtaining an efficient suboptimal solution.