发表机构
Xi’an Jiaotong University; Stevens Institute of Technology; Southeast University; Tongji University; Beijing University of Posts and Telecommunications; Shanghai Jiao Tong University（西安交通大学; 史蒂文斯理工学院; 东南大学; 同济大学; 北京邮电大学; 上海交通大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本文针对RIS辅助MA安全ISAC系统，联合优化MA位置选择、基站有源波束成形和RIS无源波束成形以最大化总保密速率，提出基于BPSO、SCA和DC规划的交替优化框架，数值结果验证其安全性能优于基线算法。
AI 中文摘要
本文研究了一种可重构智能表面（RIS）辅助的可移动天线（MA）安全通感一体化（ISAC）系统。在该架构中，RIS建立间接传输链路，为多个合法用户提供通信服务，同时利用MA的高空间分集增益来增强系统安全性。随后，我们构建了一个优化问题，通过联合优化MA位置选择、基站的有源波束成形设计以及RIS的无源波束成形设计，以最大化系统的总保密速率。该问题还考虑了实际约束，包括发射功率预算、感知波束方向图均方误差（MSE）以及RIS单位模约束。然而，由于该问题的非凸性和优化变量的强耦合性，求解具有挑战性。因此，我们提出了一种交替优化（AO）框架，采用离散二进制粒子群优化（BPSO）、逐次凸逼近（SCA）和凸差（DC）规划等技术，将优化问题转化为凸子问题。基于上述解决方案，迭代求解凸子问题直至收敛。数值结果表明，所提算法在安全通信性能方面优于其他基线算法。
英文摘要
This paper investigates a reconfigurable intelligent surface (RIS)-assisted movable antenna (MA) secure integrated sensing and communication (ISAC) system. In this architecture, the RIS establishes indirect transmission links to provide communication services for multiple legitimate users, while the high spatial diversity gain of MA is leveraged to enhance system security. Then, we formulate an optimization problem to maximize the system total secrecy rate by jointly optimizing the MA position selection, active beamforming design for base station and passive beamforming design for RIS. The problem also accounts for practical constraints including transmit power budget, sensing beampattern mean square error (MSE), RIS unit-modulus constraint. However, it is challenging to solve this problem due to its non-convexity and strong coupling of the optimization variables. Consequently, we propose an alternating optimization (AO) framework, employing techniques including discrete binary particle swarm optimization (BPSO), successive convex approximation (SCA) and difference-of-convex (DC) programming to transform the optimization problem into convex subproblems. Based on the solution above, the convex sub-problems are solved iteratively until convergence is achieved. Numerical results demonstrate that the proposed algorithm outperforms other baseline algorithms in terms of secure communication performance.
