Maolin Li, Feng Shu, Tingting Yang, Qinghe Zheng, Fuhui Zhou, Yiwen Wu
Pinching antennas are a promising technology for enhancing the performance of future indoor communication systems by leveraging spatial degrees of freedom. This paper pioneers the application of pinching antenna arrays in integrated sensing and communication (ISAC) systems and investigates dynamic array partitioning strategies. To maximize the secrecy sum rate (SSR), a partitioned array optimization problem under binary constraints is formulated, while satisfying sensing performance requirements and transmit power limitations. Specifically, the antenna partitioning constraints are modeled as minimum and maximum numbers of transmit antennas, along with binary constraints determining whether each antenna element functions in transmit or receive mode. To solve the non-convex optimization problem, a beamforming algorithm integrating semidefinite relaxation, generalized Rayleigh quotient, and minimum mean square error is proposed. Then, an element-wise iterative optimization method and a deep Q-network (DQN)-based partitioning approach are respectively developed to optimize the array configuration, thereby enhancing security performance under guaranteed sensing constraints. Simulation results demonstrate that the DQN-based approach outperforms the conventional iterative optimization method. In terms of security performance, the pinching antenna array can achieve a 69.70% reduction in the number of antennas and a 30.16% saving in transmit power compared to conventional fixed-position antenna (FPA) systems. Moreover, the pinching antenna system attains a 35.72% improvement in SSR performance, surpassing traditional FPA configurations.