PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
October 19, 20250 citationsOpen Access

Robust Beamforming Design for Secure Near-Field ISAC Systems

View Full Paper
ZCZhijian ChenFWFeng WangGHGuojun Han

Key Points

  • The proposed beamforming design significantly enhances security and robustness for near-field ISAC systems.
  • Minimizing interference while maximizing detection involves managing SINR constraints for users and eavesdroppers.
  • The approach utilizes linear matrix inequalities to address channel uncertainty constraints effectively.
  • Results indicate that the proposed ISAC scheme outperforms existing methods like semidefinite relaxation.

Abstract

This letter investigates the robust beamforming design for a near-field secure integrated sensing and communication (ISAC) system with multiple communication users (CUs) and targets, as well as multiple eavesdroppers. Taking into account the channel uncertainty constraints, we maximize the minimum sensing beampattern gain for targets, subject to the minimum signal-to-interference-plus-noise ratio (SINR) constraint for each CU and the maximum SINR constraint for each eavesdropper, as well as the ISAC transmit power constraint. The formulated design problem is non-convex. As a low-complexity suboptimal solution, we first apply the S-Procedure to convert semi-infinite channel uncertainty constraints into linear matrix inequalities (LMIs) and then use the state-of-the-art sequential rank-one constraint relaxation (SROCR) method to address the rank-one constraints. The numerical results show that the proposed ISAC beamforming design scheme outperforms the existing semidefinite relaxation (SDR) and other baseline schemes, and it significantly enhances security and robustness for near-field ISAC systems.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Chen et al. (2025) studied this question.

synapsesocial.com/papers/68f4b10d3d9d770bbc697089https://doi.org/10.48550/arxiv.2507.12881
Ask AI
Helpful
Bookmark
Share
View Full Paper