{"title":"MA-Aided Integrated Sensing and Covert Communication Systems","authors":"Hanyu Yang;Shiqi Gong;Heng Liu;Tao Yu;Chengwen Xing","doi":"10.1109/JSAC.2026.3669141","DOIUrl":null,"url":null,"abstract":"In contrast to conventional fixed-position antennas (FPAs), movable antennas (MAs) are capable of actively exploiting the spatial channel variations to enhance the performance of wireless systems. In this paper, we investigate a movable antenna (MA) aided integrated sensing and covert communication (ISACC) system, where the MA movable regions are quantized into practical discrete positions. We aim to maximize the covert sum rate by jointly optimizing the BS transmit beamformers, the positions of both BS- and user-side MAs, and the radar receive equalizer, subject to constraints on radar echo signal-to-clutter-plus-noise ratio (SCNR) and covertness. To effectively tackle this problem, an efficient successive convex approximation (SCA) based alternating optimization (AO) algorithm is proposed, where the complicated log-fractional objective function is handled by fractional programming (FP) technique, and the discrete MA position variables are optimized by employing the penalty strategy. To obtain useful insights, we then focus on a simple single-user single-target (SUST) scenario, and demonstrate that the optimal Tx MA positions aim to de-correlate the BS-target and BS-Willie channels, whereas the optimal Tx MA positions can be flexibly chosen. Furthermore, we extend our work into the practical imperfect CSI scenario, in which a conservative approximation of the covertness constraint is derived, based on which the proposed AO algorithm is still applicable after some slight modifications. Numerical results demonstrate the superior performance of our proposed algorithms under both perfect CSI and imperfect CSI.","PeriodicalId":73294,"journal":{"name":"IEEE journal on selected areas in communications : a publication of the IEEE Communications Society","volume":"44 ","pages":"3690-3704"},"PeriodicalIF":17.2000,"publicationDate":"2026-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE journal on selected areas in communications : a publication of the IEEE Communications Society","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/11417854/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In contrast to conventional fixed-position antennas (FPAs), movable antennas (MAs) are capable of actively exploiting the spatial channel variations to enhance the performance of wireless systems. In this paper, we investigate a movable antenna (MA) aided integrated sensing and covert communication (ISACC) system, where the MA movable regions are quantized into practical discrete positions. We aim to maximize the covert sum rate by jointly optimizing the BS transmit beamformers, the positions of both BS- and user-side MAs, and the radar receive equalizer, subject to constraints on radar echo signal-to-clutter-plus-noise ratio (SCNR) and covertness. To effectively tackle this problem, an efficient successive convex approximation (SCA) based alternating optimization (AO) algorithm is proposed, where the complicated log-fractional objective function is handled by fractional programming (FP) technique, and the discrete MA position variables are optimized by employing the penalty strategy. To obtain useful insights, we then focus on a simple single-user single-target (SUST) scenario, and demonstrate that the optimal Tx MA positions aim to de-correlate the BS-target and BS-Willie channels, whereas the optimal Tx MA positions can be flexibly chosen. Furthermore, we extend our work into the practical imperfect CSI scenario, in which a conservative approximation of the covertness constraint is derived, based on which the proposed AO algorithm is still applicable after some slight modifications. Numerical results demonstrate the superior performance of our proposed algorithms under both perfect CSI and imperfect CSI.