Energy Efficiency Optimization for Robust Covert ISAC Systems
Energy efficiency is of paramount importance for covert integrated sensing and communication (ISAC) networks to ensure sustained operation. In light of the imperfect channel state information (CSI) encountered in practical scenarios, we investigate the energy efficiency of these networks. Taking into account a variety of CSI estimation errors, our algorithm optimizes both sensing and information beamforming design while ensuring a low detection probability by multiple untrusted wardens. The energy-efficient beamforming design is formulated as a non-convex fractional programming problem. First, we establish that the covariance matrices of communication beamforming vectors are rank-one. Subsequently, we exploit this property to transform the original problem into a semi-definite relaxed version. For Gaussian CSI estimation errors, we adopt Bernstein-type inequalities to handle the probability constraints of interception and exploit Dinkelbach’s algorithm to address the nonlinear fractional objective function. For bounded CSI estimation errors, we employ an S-procedure to tackle the non-convex constraints associated with covert communications, followed by a successive convex optimization algorithm to provide an effective solution to the original problem. Extensive simulations confirm the superiority of our proposed algorithms, demonstrating a remarkable performance gain compared with baseline schemes adopting existing approaches. Specifically, deploying a larger number of antenna elements can enhance the energy efficiency of covert ISAC networks, while simultaneously reducing the system’s total power consumption. Furthermore, the sensing beam power threshold and the outage probability of covertness serve as important trade-off parameters in covert ISAC networks.
Authors
- Arumugam Nallanathan (ORCID: https://orcid.org/0000-0001-8337-5884)
- Dan Deng (ORCID: https://orcid.org/0000-0001-7760-5663)
- Derrick Wing Kwan Ng (ORCID: https://orcid.org/0000-0001-6400-712X)
- Shuping Dang (ORCID: https://orcid.org/0000-0002-0018-815X)
- Xingwang Li (ORCID: https://orcid.org/0000-0002-0907-6517)
- Dusit Niyato (ORCID: https://orcid.org/0000-0002-7442-7416)
Institutions
- Queen Mary University of London (GB)
- Nanyang Technological University (SG)
- UNSW Sydney (AU)
- University of Bristol (GB)
- Guangdong Polytechnic Normal University (CN)
- Henan Polytechnic University (CN)
Publication Details
- Journal
- IEEE Journal on Selected Areas in Communications
- Published
- 2025-09-16
- DOI
- https://doi.org/10.1109/jsac.2025.3610566
- Citations
- 1
- Primary Topic
- Scheduling and Optimization Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 1.24