This work employs intelligent reflecting surface(IRS)to enhance secure and covert communication performance.We formulate an optimization problem to jointly design both the reflection beamformer at IRS and transmit pow...This work employs intelligent reflecting surface(IRS)to enhance secure and covert communication performance.We formulate an optimization problem to jointly design both the reflection beamformer at IRS and transmit power at transmitter Alice in order to optimize the achievable secrecy rate at Bob subject to a covertness constraint.We first develop a Dinkelbach-based algorithm to achieve an upper bound performance and a high-quality solution.For reducing the overhead and computational complexity of the Dinkelbach-based scheme,we further conceive a low-complexity algorithm in which analytical expression for the IRS reflection beamforming is derived at each iteration.Examination result shows that the devised low-complexity algorithm is able to achieve similar secrecy rate performance as the Dinkelbach-based algorithm.Our examination also shows that introducing an IRS into the considered system can significantly improve the secure and covert communication performance relative to the scheme without IRS.展开更多
基金supported in part by National Natural Science Foundation of China under Grant 62371004 and Grant 62301005in part by the University Synergy Innovation Program of Anhui Province under Grant GXXT-2022-055+1 种基金in part by the Natural Science Foundation of Anhui Province under Grant 2308085QF197in part by the Natural Science Research Project of Education Department of Anhui Province of China under Grant 2023AH051031。
文摘This work employs intelligent reflecting surface(IRS)to enhance secure and covert communication performance.We formulate an optimization problem to jointly design both the reflection beamformer at IRS and transmit power at transmitter Alice in order to optimize the achievable secrecy rate at Bob subject to a covertness constraint.We first develop a Dinkelbach-based algorithm to achieve an upper bound performance and a high-quality solution.For reducing the overhead and computational complexity of the Dinkelbach-based scheme,we further conceive a low-complexity algorithm in which analytical expression for the IRS reflection beamforming is derived at each iteration.Examination result shows that the devised low-complexity algorithm is able to achieve similar secrecy rate performance as the Dinkelbach-based algorithm.Our examination also shows that introducing an IRS into the considered system can significantly improve the secure and covert communication performance relative to the scheme without IRS.