This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

mmWave
milli-meter wave
MIMO
multiple-input, multiple-output
AWGN
additive white Gaussian noise
KPI
key performance indicator
KPIs
key performance indicators
D2D
device-to-device
ISAC
integrated sensing and communication
DFRC
dual-functional radar and communication
AoA
angle of arrival
AoAs
angles of arrival
ToA
time of arrival
EVM
error vector magnitude
CPI
coherent processing interval
eMBB
enhanced mobile broadband
URLLC
ultra-reliable low latency communications
mMTC
massive machine type communications
QCQP
quadratic constrained quadratic programming
BnB
branch and bound
SER
symbol error rate
LFM
linear frequency modulation
BS
base station
UE
user equipment
DL
downlink
UL
uplink
CS
compressed sensing
PR
passive radar
LMS
least mean squares
NLMS
normalized least mean squares
RIS
reconfigurable intelligent surface
UAV
unmanned aerial vehicle
STARS
simultaneously transmitting and reflecting surface
RISs
reconfigurable intelligent surfaces
IRS
intelligent reflecting surface
LISA
large intelligent surface/antennas
OFDM
orthogonal frequency-division multiplexing
EM
electromagnetic
MSE
mean squared error
XR
extended reality
SNR
signal-to-noise ratio
SRP
successful recovery probability
CDF
cumulative distribution function
ULA
uniform linear array
RSS
received signal strength
SNDR
signal-to-noise-and-distortion ratio
DPI
direct path interference
RPI
reflected path interference
DE
direct echo
RE
RIS-resulted echo
PI
path interference
ADC
analog-to-digital converter
RF
radio frequency
BCD
block coordinate descent
BCCD
block cyclic coordinate descent
RCG
Riemannian conjugate gradient
SDP
semi-definite program
EVD
eigenvalue decomposition
RCS
radar cross-section
STAR
simultaneous transmitting and reflecting
LNA
low noise amplifier
NOMA
non-orthogonal multiple access
FM
frequency modulation
SINR
signal to interference plus noise ratio
V2X
Vehicle-to-Everything
NLoS
non-line-of-sight
LoS
line-of-sight
AN
artificial noise
SI
self interference
MIMO
multiple-input, multiple-output
AWGN
additive white Gaussian noise
KPI
key performance indicator
KPIs
key performance indicators
D2D
device-to-device
ISAC
integrated sensing and communications
DFRC
dual-functional radar and communication
AoA
angle of arrival
AoAs
angles of arrival
MU-MIMO
multi-user, multiple-input, multiple-output
ToA
time of arrival
PCA
principle component analysis
EVM
error vector magnitude
CPI
coherent processing interval
eMBB
enhanced mobile broadband
URLLC
ultra-reliable low latency communications
mMTC
massive machine type communications
QCQP
quadratic constrained quadratic programming
BnB
branch and bound
SER
symbol error rate
LFM
linear frequency modulation
BS
base station
SLNR
signal-to-leakage-plus-noise ratio
UE
user equipment
DL
deep learning
CS
compressed sensing
PR
passive radar
LMS
least mean squares
NLMS
normalized least mean squares
ZF
zero forcing
RIS
reconfigurable intelligent surface
RISs
reconfigurable intelligent surfaces
IRS
intelligent reflecting surface
IRSs
intelligent reflecting surfaces
NOMA
non-orthogonal multiple access
TWRN
two-way relay networks
LISA
large intelligent surface/antennas
LISs
large intelligent surfaces
OFDM
orthogonal frequency-division multiplexing
EM
electromagnetic
ISMR
integrated sidelobe to mainlobe ratio
MSE
mean squared error
SNR
signal-to-noise ratio
IoT
internet of things
SRP
successful recovery probability
CDF
cumulative distribution function
ULA
uniform linear array
RSS
received signal strength
SU
single user
MU
multi-user
CSI
channel state information
OFDM
orthogonal frequency-division multiplexing
DL
downlink
i.i.d
independently and identically distributed
UL
uplink
DFT
discrete Fourier transform
HPA
high power amplifier
IBO
input power back-off
MIMO
multiple-input, multiple-output
PAPR
peak-to-average power ratio
AWGN
additive white Gaussian noise
KPI
key performance indicator
FD
full duplex
KPIs
key performance indicators
D2D
device-to-device
ISAC
integrated sensing and communications
DFRC
dual-functional radar and communication
AoA
angle of arrival
AoD
angle of departure
ToA
time of arrival
EVM
error vector magnitude
CPI
coherent processing interval
eMBB
enhanced mobile broadband
URLLC
ultra-reliable low latency communications
mMTC
massive machine type communications
QCQP
quadratic constrained quadratic programming
BnB
branch and bound
SER
symbol error rate
LFM
linear frequency modulation
ADMM
alternating direction method of multipliers
CCDF
complementary cumulative distribution function
MISO
multiple-input, single-output
CSI
channel state information
LDPC
low-density parity-check
BCC
binary convolutional coding
IEEE
Institute of Electrical and Electronics Engineers
ULA
uniform linear antenna
B5G
beyond 5G
MOOP
multi-objective optimization problem
ML
maximum likelihood
FML
fused maximum likelihood
RF
radio frequency
AM/AM
amplitude modulation/amplitude modulation
AM/PM
amplitude modulation/phase modulation
BS
base station
MM
majorization-minimization
LNCA
\ell-norm cyclic algorithm
OCDM
orthogonal chirp-division multiplexing
TR
tone reservation
COCS
consecutive ordered cyclic shifts
LS
least squares
CVE
coefficient of variation of envelopes
BSUM
block successive upper-bound minimization
ICE
iterative convex enhancement
SOA
sequential optimization algorithm
BCD
block coordinate descent
SINR
signal to interference plus noise ratio
MICF
modified iterative clipping and filtering
PSL
peak side-lobe level
SDR
semi-definite relaxation
KL
Kullback-Leibler
ADSRP
alternating direction sequential relaxation programming
MUSIC
MUltiple SIgnal Classification
EVD
eigenvalue decomposition
SVD
singular value decomposition
LDGM
low-density generator matrix
SAC
sensing and communication
HD
half duplex
DM
directional modulation
CDA
constellation decomposition array
IAB
integrated access and back-haul
PLS
physical layer security
THz
terahertz
CU
communication user
SID
study item description
3GPP
3rd Generation Partnership Project
CRB
Cramér-Rao Bound
ISABC
integrated sensing and backscatter communication
DoF
degrees-of-freedom
IJTB
iterative joint Taylor-BCCD

Sum Secrecy Rate Maximization for Full Duplex ISAC Systems

Aleksandar Boljević, Ahmad Bazzi and Marwa Chafii Aleksandar Boljević is with the NYU Tandon School of Engineering, Brooklyn, 11201, NY, US and the Engineering Division, New York University (NYU) Abu Dhabi, 129188, UAE (email: [email protected]). Ahmad Bazzi and Marwa Chafii are with the Engineering Division, New York University (NYU) Abu Dhabi, 129188, UAE and NYU WIRELESS, NYU Tandon School of Engineering, Brooklyn, 11201, NY, USA (email: [email protected], [email protected]). .Manuscript received xxx
Abstract

In integrated sensing and communication (ISAC) systems, the target of interest may intentionally disguise itself as an eavesdropper, enabling it to intercept and tap into the communication data embedded in the ISAC waveform. The following paper considers a full duplex (FD)-ISAC system, which involves multiple malicious targets attempting to intercept both uplink (UL) and downlink (DL) communications between the dual-functional radar and communication (DFRC) base station (BS) and legitimate UL/DL communication users (CUs). For this, we formulate an optimization framework that allows maximization of both UL and DL sum secrecy rates, under various power budget constraints for sensing and communications. As the proposed optimization problem is non-convex, we develop a method called Iterative Joint Taylor-Block cyclic coordinate descent (IJTB) by proving essential lemmas that transform the original problem into a more manageable form. In essence, IJTB alternates between two sub-problems: one yields UL beamformers in closed-form, while the other approximates the solution for UL power allocation, artificial noise covariance, and DL beamforming vectors. This is achieved through a series of Taylor approximations that effectively ”convexify” the problem, enabling efficient optimization. Simulation results demonstrate the effectiveness of the proposed solver when compared with benchmarking ones. Our findings reveal that the IJTB algorithm shows fast convergence, reaching stability within approximately 1010 iterations. In addition, all benchmarks reveal a substantial decline in the sum secrecy rate, approaching zero as the eavesdropper distance reaches 1717 meters, underscoring their vulnerability in comparison to IJTB. But even more, IJTB consistently adapts to varying eavesdropper distances, outperforming other methods, achieving a sum secrecy rate of 21.4bits/sec/Hz21.4\operatorname{bits/sec/Hz} compared to 18.86bits/sec/Hz18.86\operatorname{bits/sec/Hz} for the isotropic no-AN benchmark at a 5050 meter distance. From a sensing point of view, IJTB continues to achieve high sum secrecy rates, particularly as the integrated sidelobe to mainlobe constraint becomes less stringent.

Index Terms:
integrated sensing and communications, ISAC, JCAS, 6G, sum secrecy rate, full-duplex

I Introduction

Wireless communication and radar sensing, two of the most successful applications of electromagnetic radiation, have historically been developed separately over the past century, each with distinct performance metrics and frequency bands [1]. However, with the continuous expansion of the communication frequency spectrum and the increasing desire to bridge the cyber and physical worlds through ubiquitous sensing, the landscape is shifting. More precisely, beyond 55G/66G, wireless systems are intended to provide a variety of high-accuracy sensing services, including indoor localization for robot navigation, Wi-Fi sensing for smart homes, machine learning for sensing [2], hybrid radar fusion (HRF) [3], and radar scanning for autonomous cars [4]. In fact, sensing and communication (SAC) systems are often built separately and operate in various frequency bands [5]. Moreover, due to the widespread deployment of milli-meter wave (mmWave) technologies, communication signals in future wireless systems are expected to have high resolution in both the temporal and angle domains, allowing for high-accuracy sensing. As a result, simultaneous SAC design is a favorable approach so that both systems share the same frequency band and hardware [6], therefore improving spectrum efficiency and lowering hardware costs. This encourages the research into integrated sensing and communications (ISAC), as the aim is to efficiently utilize valuable radio resources and hardware for both SAC purposes. Even more, time-division duplexing may be inefficient especially for demanding sensing and communication applications [7], thus, researchers have to look for more advanced, yet challenging integration schemes.
Like any emerging field, ISAC and 66G in general are met with an extensive list of challenges, such as beyond a milli-second of latency [8]. The authors in [9] outline at least twelve of them, one of which is in part concerned with the role of security in ISAC. Security has consistently been a primary concern for ISAC systems [10]. The sensing process necessitates full interaction of the signal with its environment, which increases the risk of eavesdropping. More specifically, what makes ISAC especially vulnerable to security threats is that targets can use the ISAC signal to decode communication information. Assuming the targets are malicious eavesdroppers, a dilemma arises: while the waveform design should direct radar power towards the eavesdropper’s direction, it should reveal the lowest possible communication rate in its direction. Simultaneously, it must achieve an acceptable communication rate towards legitimate communication users. Furthermore, [11] outlines additional security challenges that are on the horizon, such as the tolerance for end-to-end latency, the large scale of massive machine type communications networks, extensive internet of things (IoT) deployments, the extended lifespan of these deployments, and the diverse range of heterogeneous radio frequency technologies, among others. It is worth noting that the 3rd Generation Partnership Project (3GPP) has initiated a study item description (SID) related to security aspects of ISAC [12]. In fact, security has already been identified as a standalone work task, deemed essential and of high priority for inclusion in the scope of release 19. But, inherent to ISAC, it is crucial to study security and privacy across various functional and procedural aspects, including the authorization of service initiation, and the protection of the sensing signal and data collected. This work concentrates on the security concerns of ISAC, with plans to address privacy concerns in future research.

I-A Existing work

The work in [13] utilizes a sequence of snapshots for robust and secure resource allocation in an ISAC system consisting of a multi-antenna DFRC BS serving multiple single-antenna legitimate users, while sensing potential single-antenna eavesdroppers. Similarly, the authors in [14] consider a downlink (DL) secure ISAC system with a multi-antenna BS transmitting confidential messages to single-antenna CUs while simultaneously sensing targets. Furthermore, [15] explores the sensing-aided secure ISAC system, where a dual-functioning base station (BS) emits omnidirectional waveform in search of potential eavesdroppers and simultaneously sends confidential messages to CUs. The work intends to maximize the secrecy rate, while minimizing the eavesdroppers’ Cramér-Rao Bound (CRB). Moreover, [16] aims at designing an ISAC beamformer that ensures secure communication rates, while generating a beampattern sufficiently close to the desired one, under the given transmit power budget constraint. Meanwhile, [17] investigates a secure cell-free ISAC system, where distributed access points collaboratively serve CUs and perform target sensing in the presence of multiple eavesdroppers. For that, the authors propose to jointly optimize the communication and sensing beamforming vectors, with the goal of maximizing both the secrecy rate for all CUs and the sensing signal-to-noise ratio (SNR) of the target. Also, the work in [18] studies outage beamforming strategies for dual-functional radar and communication (DFRC) ISAC systems, but does not touch upon the security vulnerabilities that are inherent to ISAC systems.

Recently, full duplex (FD) communications have emerged as a key enabler for ISAC applications, thanks to their ability to support simultaneous DL and uplink (UL) transmissions across the entire frequency band. One of the main challenges in establishing in-band monostatic FD communication is the detrimental effect of self interference (SI). It constitutes a significant part of the received signal, drains high unnecessary power (up to 100dB100\operatorname{dB} higher than those of the signals of interest [7] [19]), yet does not contain any useful information. There are three main components of SI: leakage SI, direct SI or spillover, and reflected SI [19]. The major portion of SI must be canceled in the analog domain, i.e. before it reaches analog to digital conversion, after which the residual SI is treated in the digital domain. From FD-ISAC perspective, the work in [20] proposes an FD waveform design for a monostatic ISAC setup, wherein a single ISAC node aims at simultaneously sensing a radar target while communicating with a communication receiver. The design can enhance the communication and the probability of target detection, assuming effective suppression of SI, by time-multiplexing the classic pulsed radar waveform with SAC signals. Furthermore, [21] considers an FD-ISAC system, in which the BS simultaneously executes target detection and communicates with multiple DL and UL users by reusing the same time and frequency resources, where the aim is to maximize the sum rate while minimizing power consumption. The authors in [22] consider the joint active and passive beamforming design problem in RIS-assisted FD UL communication systems. The study in [23] proposes that FD-ISAC can address the “echo-miss problem”, a phenomenon where radar returns are suppressed by strong residual self-interference (SI) from the transmitter in a monostatic ISAC receiver. The solution involves jointly designing the beamformers, UL transmit precoder, and DL receive combiner to maximize communication rates, enhancing radar beampattern power, and suppressing residual SI. The authors in [24] present a novel system termed integrated sensing and backscatter communication (ISABC), which consists of an FD BS that extracts environmental information from its transmitted signal, a backscatter tag that reflects the signal, and a user who receives the data. The authors discover that, while the power allocation at the BS plays a crucial role in influencing user and sensing rates, it does not affect the backscatter rate. The work in [25] emphasizes the design challenges in integrating communication and sensing/radar systems and investigates possible solutions, such as simultaneous transmission and reception, multibeam beamforming, and joint waveform optimization. In addition, [26] investigates an FD-ISAC system where the BS is tasked with target detection while sharing the same resources for simultaneous DL/UL communications, where the focus is on tackling the robust energy efficiency maximization problem for a sustainable FD-ISAC architecture. Also, [27] focuses on near-field FD-ISAC beamforming for multi-target detection. Our previous work in [10] addresses the problem of satisfying UL and DL secrecy rates, under integrated sidelobe to mainlobe ratio (ISMR) constraints, while minimizing the total power consumption of the FD system, in the presence of eavesdropping targets.

The works in [28], [29], [30], and [31] all investigate the application of reconfigurable intelligent surface (RIS) in physical layer security (PLS) of ISAC systems. The authors in [29] use high-power radar signal as the interference to disturb the eavesdropper’s interception and RIS is used to expand the coverage area. The work in [30] considers RIS-based backscatter systems, where an ISAC BS attempts to communicate with multiple IoT devices in the presence of an aerial eavesdropper. Finally, the work in [31] examines a RIS-based terahertz (THz) ISAC system with delay alignment modulation. Also, [32] utilizes RIS for secure transmissions within unmanned aerial vehicle (UAV) ISAC systems, whereby a methodology is proposed taking into account the velocity and positions of the UAV.

I-B Contributions and Insights

This work centers on a secure FD design, where the DFRC BS transmits ISAC signals optimized for SAC, with the goal of preventing multiple eavesdropping targets to decode these signals in FD-ISAC mode. To that purpose, we have summarized our contributions as follows.

  • Maximum Secrecy Optimization for Secure FD ISAC. We first introduce our FD-ISAC scenario that includes DL and UL CUs associated with a a DFRC BS in the presence of multiple eavesdropping targets, where the DFRC BS would like to sense these eavesdropping targets. The injected artificial noise (AN) signal is not only used for securing the signal, but also aids in the sensing tasks through proper ISMR regulations. We then formulate an optimization framework that aims at maximizing the FD sum secrecy rate, which includes both UL and DL sum secrecy rates. For sensing, we impose an ISMR constraint which also has the ability of revealing minimal communication information, while maximizing the radar backscattered signal for sensing purposes.

  • Solution via Taylor series approximations and block cyclic coordinate descent. As the proposed maximum FD secrecy optimization problem is non-convex and highly non-linear, we prove a series of lemmas, which are crucial as they allow us to transform the problem into a more tractable form. Subsequently, we derive a method termed iterative joint Taylor-BCCD (IJTB), which cycles between two sub-problems, one of which produces the UL beamformers in closed-form, while the other approximate problem, generates the UL power allocation vector, the AN covariance generator and the DL beamforming vectors, thanks to a series of Taylor approximations applied to ”convexify” the problem. The proposed IJTB algorithm for maximum-secrecy FD-ISAC iterates between the two problems and converges to a stable solution providing the optimal beamformers, artificial noise statistics, and power allocation vector for the UL CUs, in addition to the UL beamformers.

  • Extensive simulation results. We present extensive simulation results that highlight the superiority, as well as the potential of the proposed design and algorithm with respect to many benchmarks, in terms of UL and DL sum secrecy rate, achieved ISMR, in addition to algorithmic convergence.

Unlike our previous work [10], this work essentially focuses on the maximization of the sum secrecy rate of both UL and DL users, under sensing and various power budget constraints. In particular, we are interested in studying the maximum sum secrecy rates for both UL and DL, under sensing and power constraints, which serves a complementary study to our previous work in [10], that mainly focuses on power efficient ways to satisfy secure and ISAC constraints. Moreover, we unveil some important insights, i.e.

  • The IJTB method consistently outperforms all benchmarks in terms of uplink (UL) sum secrecy rate, regardless of the distance of the eavesdropper or the UL radial distance. More specifically, as the UL radial distance increases, the UL sum secrecy rate decreases for all methods. Meanwhile, IJTB can adapt to different eavesdropper distances, maintaining a higher UL sum secrecy rate even as the eavesdropper gets closer. For instance, all benchmarks show a significant drop in the UL sum secrecy rate, nearing zero when the eavesdropper distance reaches 17m17\operatorname{m}, highlighting their vulnerability when compared to IJTB.

  • Regarding AN exploitation, IJTB adapts well to varying eavesdropper distances, maintaining its performance consistently and outperforming all other methods. For example, when the UL CU is situated at 50m50\operatorname{m}, IJTB achieves a sum secrecy rate of about 21.4bits/sec/Hz21.4\operatorname{bits/sec/Hz}, compared to 18.86bits/sec/Hz18.86\operatorname{bits/sec/Hz} by the isotropic no-AN benchmark. This shows that IJTB can explore the extra degrees-of-freedom (DoF) offered by AN, even when performing sensing tasks, i.e. under ISMR constraints.

  • From sensing perspective for ISAC, when ISMR constraint is stringent, the sum secrecy rate of IJTB drops below that of isotropic benchmarks, due to power allocation strategies that focus on minimizing sidelobe power. Despite this ”drop”, IJTB still achieves competitive sum secrecy rates, especially as the ISMR constraint becomes less restrictive, reflecting a favorable increase for sensing performance. Putting things in context, when ISMR is tuned to 20dB-20\operatorname{dB} (i.e. suggesting very pointy radar beams), IJTB can still achieve a total sum secrecy rate of about 8.84bits/sec/Hz8.84\operatorname{bits/sec/Hz}, which is comparable with other benchmarks.

  • IJTB demonstrates rapid convergence, stabilizing in about 1010 iterations.

I-C Organization & Notation

The detailed structure of the following paper is given as follows: The full-duplex integrated sensing and communication system model along with its key performance indicators is presented in Section II. The formulation of the proposed optimization framework bespoke for the secure FD-ISAC design problem is outlined in Section III. Consequently, its solution in a form of an algorithm is described in Section IV, while Section V describes the simulation findings. Lastly, the conclusion of the paper can be found in Section VI.

Notation: A vector is denoted by a lower-case boldface letter, e.g. 𝒙\boldsymbol{x}, while its 2\ell_{2} norm is denoted as 𝒙\|\boldsymbol{x}\|. The zero-vector is denoted by 𝟎\boldsymbol{0}, while the all-ones vector of appropriate dimensions is denoted by 𝟏\boldsymbol{1}. A matrix is denoted by an upper-case boldface letter and its transpose, conjugate, and transpose-conjugate are denoted by (.)T(.)^{T}, (.)(.)^{*}, and (.)H(.)^{H}, respectively. A vector with all non-negative entries is denoted by 𝒙𝟎\boldsymbol{x}\succeq\boldsymbol{0}, while a positive semi-definite matrix is denoted by 𝑨𝟎\boldsymbol{A}\succeq\boldsymbol{0}. The N×NN\times N identity matrix is 𝑰N\boldsymbol{I}_{N}. When it comes to matrix indexing, [𝑨]i,j[\boldsymbol{A}]_{i,j} denotes the (i,j)th(i,j)^{th} entry of matrix 𝑨\boldsymbol{A} and [𝑨]:,j[\boldsymbol{A}]_{:,j} denotes its jthj^{th} column. The operator EVD\operatorname{EVD} stands for eigenvalue decomposition. The magnitude and the angle of any complex number zz\in\mathbb{C} are denoted by |z||z| and z\angle z, respectively. 𝔼{}\mathbb{E}\{\} denotes the statistical expectation.

II System Model

Refer to caption
Figure 1: The FD-ISAC system model which entails multiple malicious targets attempting to intercept UL and DL communications between the DFRC BS and the legitimate UL/DL CUs.

II-A Full Duplex Radar and Communication Model

We assume an FD-ISAC scenario, in which there is a threat of malicious eavesdroppers intercepting data, as depicted in Fig.1. The DFRC BS considered is equipped with NTN_{T} transmitting antennas and NRN_{R} receiving antennas displaced via a mono-static radar setting with no isolation between both arrays. The following NT×1N_{T}\times 1 secure ISAC baseband signal vector is transmitted by the DFRC BS \useshortskip

𝒙=𝑽𝒔+𝒘,\boldsymbol{x}=\boldsymbol{Vs}+\boldsymbol{w}, (1)

where 𝑽𝐂NT×L\boldsymbol{V}\in\mathbf{C}^{N_{T}\times L} is the DFRC beamforming matrix with its th\ell^{th} column loaded with the beamforming vector designated towards the th\ell^{th} CU; and LL denotes the total number of DL CUs. Also, 𝒔\boldsymbol{s} is a vector of transmit data symbols, whose th\ell^{th} entry is the data symbol intended to the th\ell^{th} DL CU. We assume independent symbols with unit variance, i.e 𝔼(𝒔𝒔H)=𝑰L\mathbb{E}(\boldsymbol{s}\boldsymbol{s}^{H})=\boldsymbol{I}_{L}. Moreover, a superimposed ISAC AN vector 𝒘\boldsymbol{w}, assumed to be independent from the signal 𝒔\boldsymbol{s}, is transmitted based on 𝒘𝒩(𝟎,𝑾)\boldsymbol{w}\sim\mathcal{N}(\boldsymbol{0},\boldsymbol{W}), where 𝑾𝟎\boldsymbol{W}\succeq\boldsymbol{0} stands for the spatial ISAC AN covariance matrix, which is unknown, and has to be optimized for. Likewise, 𝒘\boldsymbol{w} and 𝒔\boldsymbol{s} are assumed to be independent of one another, in which case, tr(𝑾)\operatorname{tr}(\boldsymbol{W}) would reflect the total transmit power invested on AN. The beamformer 𝑽\boldsymbol{V} is designed for DFRC ISAC beamforming to maintain good SAC properties. As a consequence, although the secure ISAC signal 𝒙\boldsymbol{x} is intended for the DL CUs, it is also designed to function as a radar signal through both 𝑽\boldsymbol{V} and 𝑾\boldsymbol{W}.

According to the ISAC design, this model does not distinctly separate SAC signals, treating them as a unified signal instead. Consequently, the single-antenna DL CUs receive the following signal: \useshortskip

yDL=𝒉r,H𝒗sdesired+k=1Kqk,vkULtoDLinterference+L𝒉r,H𝒗sMUinterference+𝒉r,H𝒘ANinterference+n,{y}^{\mathrm{DL}}_{\ell}=\underbrace{\boldsymbol{h}_{r,\ell}^{H}\boldsymbol{v}_{\ell}s_{\ell}}_{\rm{desired}}+\underbrace{\sum\limits_{k=1}^{K}q_{k,\ell}v_{k}}_{\begin{subarray}{c}\rm{UL-to-DL}\\ \rm{interference}\end{subarray}}+\underbrace{\sum\limits_{\begin{subarray}{c}\ell^{{}^{\prime}}\neq\ell\end{subarray}}^{L}\boldsymbol{h}_{r,\ell}^{H}\boldsymbol{v}_{\ell^{{}^{\prime}}}s_{\ell^{{}^{\prime}}}}_{\begin{subarray}{c}\rm{MU}\\ \rm{interference}\end{subarray}}+\underbrace{\boldsymbol{h}_{r,\ell}^{H}\boldsymbol{w}}_{\begin{subarray}{c}\rm{AN}\\ \rm{interference}\end{subarray}}+n_{\ell}, (2)

where the desired and interfering terms are elucidated, and the last term, i.e. nn_{\ell}, is zero-mean additive white Gaussian noise (AWGN) noise with variance σ2\sigma_{\ell}^{2}, i.e. n𝒩(0,σ2)n_{\ell}\sim\mathcal{N}(0,\sigma_{\ell}^{2}). Moreover, 𝒉r,\boldsymbol{h}_{r,\ell} denotes the mmWave channel between the th\ell^{th} DL CU and the DFRC BS modeled as [33] \useshortskip

𝒉r,=κκ+1𝒉r,LoS+1κ+1𝒉r,NLoSNT×1,\boldsymbol{h}_{r,\ell}=\sqrt{\frac{\kappa_{\ell}}{\kappa_{\ell}+1}}\boldsymbol{h}_{r,\ell}^{\mathrm{LoS}}+\sqrt{\frac{1}{\kappa_{\ell}+1}}\boldsymbol{h}_{r,\ell}^{\mathrm{NLoS}}\in\mathbb{C}^{N_{T}\times 1},

where κ\kappa_{\ell} is the Rician KK-factor of the th\ell^{th} user. Further, 𝒉r,LoS\boldsymbol{h}_{r,\ell}^{\mathrm{LoS}} is the LoS component between the th\ell^{th} user and the DFRC BS, and the non-line-of-sight (NLoS) component consists of NclN_{\mathrm{cl}} clusters as \useshortskip𝒉r,NLoS=1/q=1NclNqq=1Nclr=1Nquq,r𝒂NT(φq,r)\boldsymbol{h}_{r,\ell}^{\mathrm{NLoS}}=\sqrt{1\Big{/}\sum_{q=1}^{N_{\mathrm{cl}}}N_{q}}\cdot\sum_{q=1}^{N_{\mathrm{cl}}}\sum_{r=1}^{N_{q}}u_{q,r}\boldsymbol{a}_{N_{T}}(\varphi_{q,r}) [34], where NqN_{q} is the number of propagation paths within the qthq^{th} clusters. The steering vector departing from angle of departure (AoD) φ\varphi is denoted by 𝒂NT(φ)NT×1\boldsymbol{a}_{N_{T}}(\varphi)\in\mathbb{C}^{N_{T}\times 1}. Additionally, we define uq,ru_{q,r} as the path attenuation and φq,r\varphi_{q,r} as AoDs of the rthr^{th} propagation path within the qthq^{th} cluster. As the number of clusters grows, the path attenuation coefficients and angles between users and the DFRC BS become randomly distributed. Additionally, qk,q_{k,\ell} represents the channel coefficient between the kthk^{th} UL CU and the th\ell^{th} DL user, which captures the UL-to-DL interference, and can be harmful when UL and DL users are in close proximity to each other. Furthermore, the kthk^{th} UL symbol, formed by the kthk^{th} user and intended for the DFRC BS, is denoted as vkv_{k}\in\mathbb{C}, with power level 𝔼(|vk|2)=pk,k\mathbb{E}(|v_{k}|^{2})=p_{k},\forall k. Due to the presence of clutter, a portion of the DL signal scatters from the clutter towards the DL CUs, which is contained within the DL channels 𝒉r,\boldsymbol{h}_{r,\ell}. The eavesdroppers are also intercepting DL signals, so the signal at the pthp^{th} eavesdroppers is

ypEve=k=1Kgk,pvk+αp𝒂NTH(θp)𝒙+zp,y_{p}^{\mathrm{Eve}}=\sum\nolimits_{k=1}^{K}g_{k,p}v_{k}+\alpha_{p}\boldsymbol{a}_{N_{T}}^{H}(\theta_{p})\boldsymbol{x}+z_{p}, (3)

where gk,pg_{k,p} is the complex channel coefficient between the kthk^{th} UL CU and the pthp^{th} eavesdropper. The path-loss complex coefficient between the DFRC BS and the pthp^{th} eavesdropper is denoted by αp\alpha_{p}. The steering vector arriving at angle of arrival (AoA) θ\theta is denoted by 𝒂NR(θ)NR×1\boldsymbol{a}_{N_{R}}(\theta)\in\mathbb{C}^{N_{R}\times 1}. The angles of arrival (AoAs) for the eavesdroppers are denoted as θp\theta_{p}. The AWGN at the pthp^{th} eavesdropper is zpz_{p}, modeled as zero-mean with variance σp2\sigma_{p}^{2}, i.e., zp𝒩(0,σp2)z_{p}\sim\mathcal{N}(0,\sigma_{p}^{2}). We emphasize the relationship between the received signal at the th\ell^{th} legitimate DL user (as in (2)) and the signal at the eavesdropper (as in (3)). Both legitimate users and eavesdroppers receive the UL signals and the DFRC ISAC signal 𝒙\boldsymbol{x}. However, the channel models differ between DFRC-DL (i.e., 𝒉r,\boldsymbol{h}_{r,\ell}) and DFRC-eavesdropper (i.e., 𝒂(θp)\boldsymbol{a}(\theta_{p})). Eavesdroppers are considered radar targets with a strong dominant line-of-sight (LoS) component (a Rician channel with a large KK-factor) for localization and tracking applications. This model is particularly applicable in scenarios involving UAVs [35].

Specifically, the DFRC aims to infer additional sensing information about eavesdropping targets, such as delay and Doppler, without exposing the communication information embedded within the transmitted ISAC signal 𝒙\boldsymbol{x}. Meanwhile, a set of KK UL CUs associated with the DFRC base station (BS) coexist. It is important to note that while the DFRC BS transmits a secure signal vector 𝒙\boldsymbol{x}, it also collects the UL signals along with other components clarified in this section. Let 𝒉t,k\boldsymbol{h}_{t,k} be the UL channel vector between the kthk^{th} UL CU and the DFRC BS. For Rayleigh fading, the UL channels 𝒉t,k\boldsymbol{h}_{t,k} account for environmental clutter, where part of the signal propagates towards the clutter and back to the DFRC BS. Thus, the signal received by the DFRC BS from the single-antenna UL users is k=1K𝒉t,kvk\sum\nolimits_{k=1}^{K}\boldsymbol{h}_{t,k}v_{k}.

We summarize the system model in Fig. (reference), which illustrates a group of UL and DL legitimate CUs associated with a DFRC BS. Additionally, a group of eavesdroppers intercepts the UL and DL signal exchanges. Note that the DL signal is an ISAC signal, and the DFRC BS directs beams towards the eavesdroppers to acquire physical sensing information about them. Furthermore, due to full-duplex (FD) operation, the simultaneous transmission of the signal vector 𝒙\boldsymbol{x} ”leaks” into the receiving unit of the DFRC BS, resulting in loop interference. This phenomenon, known as SI, is a crucial component when targeting FD behavior, especially when the transmitting and receiving units of the DFRC BS are colocated without isolation. The receiving unit experiences an SI component of β𝑯SINR×NT\sqrt{\beta}\boldsymbol{H}_{\mathrm{SI}}\in\mathbb{C}^{N_{R}\times N_{T}}, where β\beta represents the residual SI power. Under the direct-coupling channel model for SI, the small-scale SI fading channel reads [𝑯SI]i,j=exp(j2πdi,jλ)[\boldsymbol{H}_{\mathrm{SI}}]_{i,j}=\exp\left(j2\pi\frac{d_{i,j}}{\lambda}\right), which contains the phases introduced between each pair of transmitting and receiving antennas. Also, λ\lambda is the wavelength and di,jd_{i,j} is the distance between the ii-th receive and jthj^{th} transmit antennas. Additionally, the DFRC BS aims to direct sensing power towards PP eavesdroppers so that the backscattered echo returns experience good sensing SNR. To this end, the echo-plus-clutter returns can be written as \useshortskip

𝒚e+c=p=1Pγp𝒂NR(θp)𝒂NTH(θp)𝒙+𝒄.\boldsymbol{y}_{\rm{e}+\rm{c}}=\sum\nolimits_{p=1}^{P}\gamma_{p}\boldsymbol{a}_{N_{R}}(\theta_{p})\boldsymbol{a}_{N_{T}}^{H}(\theta_{p})\boldsymbol{x}+\boldsymbol{c}. (4)
\useshortskip

In (4), we denote γp\gamma_{p} by the complex amplitude due to the pthp^{th} eavesdropper and 𝒄𝒩(𝟎,𝑹c)\boldsymbol{c}\sim\mathcal{N}(\boldsymbol{0},\boldsymbol{R}_{c}) is the clutter including the reflected signal from the UL/DL CUs. We assume the clutter covariance matrix 𝑹cNR×NR\boldsymbol{R}_{c}\in\mathbb{C}^{N_{R}\times N_{R}}, capturing all environmental clutter effects, to be constant and that the eavesdropper AoAs are known. Due to the collocated transmit and receiving units, the AoAs and AoDs in equation (4) are identical. Lastly, the received signal at the DFRC BS is

𝒚DFRC=k=1K𝒉t,kvk+𝒚e+c+β𝑯SI𝒙+𝒏.\boldsymbol{y}^{\mathrm{DFRC}}=\sum\nolimits_{k=1}^{K}\boldsymbol{h}_{t,k}v_{k}+\boldsymbol{y}_{\rm{e}+\rm{c}}+\sqrt{\beta}\boldsymbol{H}_{\mathrm{SI}}\boldsymbol{x}+\boldsymbol{n}. (5)

In summary, the first part in (5) is the signal due to the KK UL CUs. The second part is the sensing echo-plus-clutter returns. The third part is the SI, and the AWGN follows 𝒏𝒩(𝟎,σn2𝑰NR)\boldsymbol{n}\sim\mathcal{N}(\boldsymbol{0},\sigma_{n}^{2}\boldsymbol{I}_{N_{R}}).

II-B Secrecy and sensing metrics

Before tackling the secure FD-ISAC problem, it is important to define key performance indicators that will be critical for evaluating the system’s overall performance and for developing an appropriate optimization framework.

II-B1 Secrecy rates

First, we define the signal to interference plus noise ratio (SINR) of the th\ell^{th} DL CU. Based on (2), and under the assumption of independent symbols, the SINR for detecting the th\ell^{th} desired symbol, ss_{\ell}, can be verified to be \useshortskip

ΓDL=𝒉r,H𝑽𝒉r,k=1Kpk|qk,|2+L𝒉r,H𝑽𝒉r,+𝒉r,H𝑾𝒉r,+σ2,\Gamma_{\ell}^{\mathrm{DL}}=\frac{\boldsymbol{h}_{r,\ell}^{H}\boldsymbol{V}_{\ell}\boldsymbol{h}_{r,\ell}}{\sum\limits_{\begin{subarray}{c}k=1\end{subarray}}^{K}p_{k}|q_{k,\ell}|^{2}+\sum\limits_{\begin{subarray}{c}\ell^{{}^{\prime}}\neq\ell\end{subarray}}^{L}\boldsymbol{h}_{r,\ell}^{H}\boldsymbol{V}_{\ell^{{}^{\prime}}}\boldsymbol{h}_{r,\ell}+\boldsymbol{h}_{r,\ell}^{H}\boldsymbol{W}\boldsymbol{h}_{r,\ell}+\sigma_{\ell}^{2}}, (6)

where 𝑽=𝒗𝒗H\boldsymbol{V}_{\ell}=\boldsymbol{v}_{\ell}\boldsymbol{v}^{H}_{\ell}. Moreover, the achievable rate of transmission of the th\ell^{th} DL CU is \useshortskip

RDL=log2(1+ΓDL),=1LR_{\ell}^{\mathrm{DL}}=\log_{2}(1+\Gamma_{\ell}^{\mathrm{DL}}),\quad\forall\ell=1\ldots L (7)

To evaluate UL communication performance at the DFRC BS, we also define an UL SINR. Assuming the BS applies KK beamforming vectors 𝒖1𝒖K\boldsymbol{u}_{1}\ldots\boldsymbol{u}_{K} onto the receive signal in (5), we can then define a receive SINR quantifying the performance between the kthk^{th} UL CU and the DFRC BS intending to detect vkv_{k}, which can be shown to be \useshortskip

ΓkUL=pk𝒖kH𝒉t,k𝒉t,kH𝒖k𝒖kH𝚽k(𝑸,𝒑)𝒖k,\Gamma_{k}^{\mathrm{UL}}=\frac{p_{k}\boldsymbol{u}_{k}^{H}\boldsymbol{h}_{t,k}\boldsymbol{h}^{H}_{t,k}\boldsymbol{u}_{k}}{\boldsymbol{u}_{k}^{H}\boldsymbol{\Phi}_{k}(\boldsymbol{Q},\boldsymbol{p})\boldsymbol{u}_{k}}, (8)

where \useshortskip

𝚽k(𝑸,𝒑)=kkKpk𝒉t,k𝒉t,kH+𝑪𝑸𝑪H+𝑹c+σn2𝑰\boldsymbol{\Phi}_{k}(\boldsymbol{Q},\boldsymbol{p})=\sum\nolimits_{\begin{subarray}{c}k^{\prime}\neq k\end{subarray}}^{K}p_{k^{\prime}}\boldsymbol{h}_{t,k^{\prime}}\boldsymbol{h}^{H}_{t,k^{\prime}}+\boldsymbol{C}\boldsymbol{Q}\boldsymbol{C}^{H}+\boldsymbol{R}_{c}+\sigma_{n}^{2}\boldsymbol{I} (9)

and 𝑪=p=1Pγp𝒂NR(θp)𝒂NTH(θp)+β𝑯SI\boldsymbol{C}=\sum\nolimits_{p=1}^{P}\gamma_{p}\boldsymbol{a}_{N_{R}}(\theta_{p})\boldsymbol{a}_{N_{T}}^{H}(\theta_{p})+\sqrt{\beta}\boldsymbol{H}_{\mathrm{SI}}. Also, 𝑸=𝑽𝑽H+𝑾\boldsymbol{Q}=\boldsymbol{V}\boldsymbol{V}^{H}+\boldsymbol{W}. Similarly, we can define the achievable rate of transmission of the kthk^{th} UL CU as \useshortskip

RkUL=log2(1+ΓkUL),k=1KR_{k}^{\mathrm{UL}}=\log_{2}(1+\Gamma_{k}^{\mathrm{UL}}),\quad\forall k=1\ldots K (10)

Prior to expressing the UL and DL secrecy rates, it would be appropriate to define the sum-rates per eavesdropper. We start by defining a receive SINR between the pthp^{th} eavesdropper and the kthk^{th} UL CU, who aims at detecting vkv_{k}. After some operations, it can be proven that the corresponding SINR reads \useshortskip

Γp,kEve=pk|gk,p|2kkKpk|gk,p|2+|αp|2𝒂NTH(θp)𝑸𝒂NT(θp)+σp2.\Gamma_{p,k}^{\mathrm{Eve}}=\frac{p_{k}|g_{k,p}|^{2}}{\sum\limits_{\begin{subarray}{c}k^{\prime}\neq k\end{subarray}}^{K}p_{k^{\prime}}|g_{k^{\prime},p}|^{2}+|\alpha_{p}|^{2}\boldsymbol{a}_{N_{T}}^{H}(\theta_{p})\boldsymbol{Q}\boldsymbol{a}_{N_{T}}(\theta_{p})+\sigma_{p}^{2}}. (11)

Similarly, we can express the receive SINR between the pthp^{th} eavesdropper and the DFRC BS, \useshortskip

Γp,DFRCEve=|αp|2𝒂NTH(θp)𝑽𝑽H𝒂NT(θp)k=1Kpk|gk,p|2+|αp|2𝒂NTH(θp)𝑾𝒂NT(θp)+σp2,\Gamma_{p,\mathrm{DFRC}}^{\mathrm{Eve}}=\frac{|\alpha_{p}|^{2}\boldsymbol{a}_{N_{T}}^{H}(\theta_{p})\boldsymbol{VV}^{H}\boldsymbol{a}_{N_{T}}(\theta_{p})}{\sum\limits_{\begin{subarray}{c}k=1\end{subarray}}^{K}p_{k}|g_{k,p}|^{2}+|\alpha_{p}|^{2}\boldsymbol{a}_{N_{T}}^{H}(\theta_{p})\boldsymbol{W}\boldsymbol{a}_{N_{T}}(\theta_{p})+\sigma_{p}^{2}}, (12)

Having the DL and UL SINR expressions per eavesdropper defined, we will now define the DL sum secrecy rate following [36] as follows \useshortskip

SRDL=log2(1+ΓDL)plog2(1+Γp,DFRCEve)\operatorname{SR}_{\mathrm{DL}}=\sum\nolimits_{\ell}\log_{2}(1+\Gamma_{\ell}^{\mathrm{DL}})-\sum\nolimits_{p}\log_{2}(1+\Gamma_{p,\mathrm{DFRC}}^{\mathrm{Eve}}) (13)

Likewise, the UL sum secrecy rate reads \useshortskip

SRUL=klog2(1+ΓkUL)p,klog2(1+Γp,kEve).\operatorname{SR}_{\mathrm{UL}}=\sum\nolimits_{k}\log_{2}(1+\Gamma_{k}^{\mathrm{UL}})-\sum\nolimits_{p,k}\log_{2}(1+\Gamma_{p,k}^{\mathrm{Eve}}). (14)

II-B2 Sensing metrics

The DFRC BS seeks to manage beams using each of its transmit vectors, 𝒙\boldsymbol{x}, to ensure highly directional radar transmissions aimed at the PP eavesdroppers. This simultaneous targeting allows the DFRC BS to extract wireless environmental features, using the backscattered echoes, and analyze the physical attributes of each eavesdropper e.g. delay-Doppler profile. For this, we utilize the ISMR KPI to assess radar performance based on the transmit beampattern. This ratio quantifies the energy in the sidelobes relative to the mainlobe as given below \useshortskip

ISMR𝚯s𝒂NTH(θ)𝑹𝒙𝒙𝒂NT(θ)𝑑θ𝚯m𝒂NTH(θ)𝑹𝒙𝒙𝒂NT(θ)𝑑θ=tr(𝑹𝒙𝒙𝑨s)tr(𝑹𝒙𝒙𝑨m),\operatorname{ISMR}\triangleq\frac{\int\nolimits_{\boldsymbol{\Theta}_{s}}\boldsymbol{a}_{N_{T}}^{H}(\theta)\boldsymbol{R}_{\boldsymbol{xx}}\boldsymbol{a}_{N_{T}}(\theta)\ d\theta}{\int\nolimits_{\boldsymbol{\Theta}_{m}}\boldsymbol{a}_{N_{T}}^{H}(\theta)\boldsymbol{R}_{\boldsymbol{xx}}\boldsymbol{a}_{N_{T}}(\theta)\ d\theta}=\frac{\operatorname{tr}\big{(}\boldsymbol{R}_{\boldsymbol{xx}}\boldsymbol{A}_{s}\big{)}}{\operatorname{tr}\big{(}\boldsymbol{R}_{\boldsymbol{xx}}\boldsymbol{A}_{m}\big{)}}, (15)

where 𝚯s\boldsymbol{\Theta}_{s} and 𝚯m\boldsymbol{\Theta}_{m} are sets containing the directions toward the side-lobe and main-lobe components, respectively. Moreover, 𝑹𝒙𝒙\boldsymbol{R}_{\boldsymbol{xx}} represents the transmit covariance matrix, i.e, 𝑹𝒙𝒙=𝑽𝑽H+𝑾\boldsymbol{R}_{\boldsymbol{xx}}=\boldsymbol{V}\boldsymbol{V}^{H}+\boldsymbol{W}. The ISMR could be reformulated after integrating over directions as per (15), namely 𝑨s/m=𝚯s/m𝒂NT(θ)𝒂NTH(θ)𝑑θ\boldsymbol{A}_{s/m}=\int\nolimits_{\boldsymbol{\Theta}_{s/m}}\boldsymbol{a}_{N_{T}}(\theta)\boldsymbol{a}_{N_{T}}^{H}(\theta)\ d\theta. For this paper, PP mainlobes are chosen to be centered around θ1θP\theta_{1}\ldots\theta_{P}, respectively. As a consequence, the mainlobe is given as \useshortskip

Θm=p=1P{[θpθplow;θpθphigh]}.\Theta_{m}=\bigcup\nolimits_{p=1}^{P}\big{\{}[\theta_{p}-\theta_{p}^{\mathrm{low}};\theta_{p}-\theta_{p}^{\mathrm{high}}]\big{\}}. (16)

where θplow,θphigh\theta_{p}^{\mathrm{low}},\theta_{p}^{\mathrm{high}} define the lower and upper angular regions of the pthp^{th} mainlobe. The ISMR metric is designed to focus power in the mainlobe regions while minimizing power in the sidelobes to suppress unwanted echo bounces, such as clutter and signal-dependent interference. By optimizing the beams around the target AoAs and simultaneously attenuating clutter returns, the signal-clutter-noise ratio is improved. The ISMR metric is adaptable for target localization and tracking by integrating sophisticated tracking methods to steer mainlobes, while also allowing for sidelobe power reduction to minimize unwanted returns, such as clutter. Additionally, ISMR offers flexibility in managing uncertainties in eavesdropper locations, aligning the necessity for focused energy on eavesdroppers with minimal communication leakage through appropriate AN covariance and beamforming design.

III Secure FD-ISAC Sum Secrecy Rate Optimization

In this section, we propose a secure FD-ISAC sum secrecy rate maximization problem with the aim of maximizing the total sum secrecy rate of both UL and DL CUs given the power budget constraints for DL beamforming, UL power allocation, and AN generation. For this purpose, we formulate the following optimization problem \useshortskip

(𝒫1):{max{𝒑,𝑾,𝑽,𝑼}SRDL+SRULs.t.tr(𝑽𝑽H)PDLV,tr(𝑾)PDLW,k=1KpkPUL,ISMRISMRmax,𝑾𝟎,𝒑𝟎.\displaystyle(\mathcal{P}_{1}):\begin{cases}\max\limits_{\{\begin{subarray}{c}\boldsymbol{p},\boldsymbol{W},\boldsymbol{V},\boldsymbol{U}\end{subarray}\}}&\operatorname{SR}_{\mathrm{DL}}+\operatorname{SR}_{\mathrm{UL}}\\ \textrm{s.t.}&\operatorname{tr}(\boldsymbol{VV}^{H})\leq P_{\rm{DL}}^{V},\ \operatorname{tr}(\boldsymbol{W})\leq P_{\rm{DL}}^{W},\\ &\sum\limits_{k=1}^{K}p_{k}\leq P_{\rm{UL}},\\ &\operatorname{ISMR}\leq\operatorname{ISMR}_{\rm{max}},\\ &\boldsymbol{W}\succeq\boldsymbol{0},\ \boldsymbol{p}\succeq\boldsymbol{0}.\\ \end{cases} (17)

The problem in (𝒫1)(\mathcal{P}_{1}) intends to maximize the overall UL and DL sum secrecy rates. The first set of constraint imposes a total power budget on DL communications. More specifically, PDLVP_{\rm{DL}}^{V} is the power budget for communication beamforming and PDLWP_{\rm{DL}}^{W} is the power budget for AN generation. Moreover, the second constraint imposes a power budget on the UL CUs, whereby the overall UL power budget is PULP_{\rm{UL}}. The third constraint imposes the maximum ISMR level, through ISMRmax\operatorname{ISMR}_{\rm{max}} and the last constraint imposes positive semi-definite constraint on the covariance matrix 𝑾\boldsymbol{W} and entry-wise positivity on the UL power allocation vector. It is worth pointing out that vector 𝒘\boldsymbol{w} is not only being employed for AN purposes but also to enhance the DoF of the transmitted signal, hence improving sensing performance. In particular, the optimization process incorporates not only the beamformer 𝑽\boldsymbol{V}, but also the associated AN covariance matrix 𝑾\boldsymbol{W}, to achieve the desired ISMR. This positively impacts target detection and localization performance. To this end, the problem in (17) can be equivalently re-written as follows \useshortskip

(𝒫1.1):{max{𝒑,𝑾,{𝑽}=1L,𝑼}SRDL+SRULs.t.=1Ltr(𝑽)PDLV,tr(𝑾)PDLW,k=1KpkPUL,ISMRISMRmax,𝑾𝟎,𝒑𝟎,𝑽𝟎,,rank(𝑽)=1,.\displaystyle(\mathcal{P}_{1.1}):\begin{cases}\max\limits_{\{\begin{subarray}{c}\boldsymbol{p},\boldsymbol{W},\{\boldsymbol{V}_{\ell}\}_{\ell=1}^{L},\boldsymbol{U}\end{subarray}\}}&\operatorname{SR}_{\mathrm{DL}}+\operatorname{SR}_{\mathrm{UL}}\\ \textrm{s.t.}&\sum\limits_{\ell=1}^{L}\operatorname{tr}(\boldsymbol{V}_{\ell})\leq P_{\rm{DL}}^{V},\ \operatorname{tr}(\boldsymbol{W})\leq P_{\rm{DL}}^{W},\\ &\sum\limits_{k=1}^{K}p_{k}\leq P_{\rm{UL}},\\ &\operatorname{ISMR}\leq\operatorname{ISMR}_{\rm{max}},\\ &\boldsymbol{W}\succeq\boldsymbol{0},\ \boldsymbol{p}\succeq\boldsymbol{0},\boldsymbol{V}_{\ell}\succeq\boldsymbol{0},\forall\ell,\\ &\operatorname{rank}(\boldsymbol{V}_{\ell})=1,\forall\ell.\end{cases} (18)

The equivalent problem is non-convex due to the rank1\operatorname{rank}-1 constraint. Hence, we propose to drop this constraint to arrive at \useshortskip

(𝒫1.2):{max{𝒑,𝑾,{𝑽}=1L,𝑼}SRDL+SRULs.t.=1Ltr(𝑽)PDLV,tr(𝑾)PDLW,k=1KpkPUL,ISMRISMRmax,𝑾𝟎,𝒑𝟎,𝑽𝟎,.\displaystyle(\mathcal{P}_{1.2}):\begin{cases}\max\limits_{\{\begin{subarray}{c}\boldsymbol{p},\boldsymbol{W},\{\boldsymbol{V}_{\ell}\}_{\ell=1}^{L},\boldsymbol{U}\end{subarray}\}}&\operatorname{SR}_{\mathrm{DL}}+\operatorname{SR}_{\mathrm{UL}}\\ \textrm{s.t.}&\sum\limits_{\ell=1}^{L}\operatorname{tr}(\boldsymbol{V}_{\ell})\leq P_{\rm{DL}}^{V},\ \operatorname{tr}(\boldsymbol{W})\leq P_{\rm{DL}}^{W},\\ &\sum\limits_{k=1}^{K}p_{k}\leq P_{\rm{UL}},\\ &\operatorname{ISMR}\leq\operatorname{ISMR}_{\rm{max}},\\ &\boldsymbol{W}\succeq\boldsymbol{0},\ \boldsymbol{p}\succeq\boldsymbol{0},\boldsymbol{V}_{\ell}\succeq\boldsymbol{0},\forall\ell.\end{cases} (19)

Fortunately, all the constraints in the above problem are convex, however the problem is still non-convex due to the sum secrecy rate objective function. In the subsequent section, we address the challenge of non-convexity by introducing an algorithm designed to efficiently solve the FD-ISAC sum secrecy rate maximization problem.

IV Iterative Joint Taylor-BCCD type method

In this section, we propose IJTB, i.e. iterative joint Taylor-BCCD, as a potential algorithm that efficiently solves the FD-ISAC sum secrecy rate maximization problem formulated via (𝒫1)(\mathcal{P}_{1}) (17) through its relaxed version (𝒫1.2)(\mathcal{P}_{1.2}). In order to design IJTB, it is crucial to convexify the problem (𝒫1.2)(\mathcal{P}_{1.2}) so as to successfully iterate between the underlying parameters. For the sake of compact representation, we define the interference received by the th\ell^{\rm{th}} DL CU, and the interference at the pthp^{\rm{th}} eavesdropper, respectively, as follows, \useshortskip

IDL\displaystyle{\rm{I}}_{\ell}^{\mathrm{DL}} =kpk|qk,|2+tr(𝑽𝑯r,)+tr(𝑾𝑯r,),\displaystyle=\sum_{\begin{subarray}{c}k\end{subarray}}p_{k}|q_{k,\ell}|^{2}+\sum_{\begin{subarray}{c}\ell^{\prime}\neq\ell\end{subarray}}\operatorname{tr}\left(\boldsymbol{V}_{\ell^{\prime}}\boldsymbol{H}_{r,\ell}\right)+\operatorname{tr}\left(\boldsymbol{W}\boldsymbol{H}_{r,\ell}\right), (20)
Ip,DFRCEve\displaystyle{\rm{I}}_{p,\mathrm{DFRC}}^{\mathrm{Eve}} =kpk|gk,p|2+|αp|2tr(𝑾𝑨(θp)).\displaystyle=\sum_{\begin{subarray}{c}k\end{subarray}}p_{k}|g_{k,p}|^{2}+|\alpha_{p}|^{2}\operatorname{tr}\left(\boldsymbol{W}\boldsymbol{A}(\theta_{p})\right). (21)

The corresponding useful signal components of the th\ell^{\rm{th}} DL CU and the pthp^{\rm{th}} eavesdropper are then SDL=tr(𝑽𝑯r,){\rm{S}}_{\ell}^{\mathrm{DL}}=\operatorname{tr}(\boldsymbol{V}_{\ell}\boldsymbol{H}_{r,\ell}) and Sp,DFRCEve=tr(|αp|2𝑽𝑨(θp)){\rm{S}}_{p,\mathrm{DFRC}}^{\mathrm{Eve}}=\sum_{\ell}\operatorname{tr}\left(|\alpha_{p}|^{2}\boldsymbol{V}_{\ell}\boldsymbol{A}(\theta_{p})\right), respectively. Therefore, the DL sum secrecy rate can now be arranged as \useshortskip

SRDL\displaystyle\operatorname{SR}_{\mathrm{DL}} =log2(SDL+IDL+σ2)\displaystyle=\sum_{\ell}\log_{2}\left({\rm{S}}_{\ell}^{\mathrm{DL}}+{\rm{I}}_{\ell}^{\mathrm{DL}}+\sigma_{\ell}^{2}\right) (22)
+plog2(Ip,DFRCEve+σp2)\displaystyle+\sum_{p}\log_{2}\left({\rm{I}}_{p,\mathrm{DFRC}}^{\mathrm{Eve}}+\sigma_{p}^{2}\right)
log2(IDL+σ2)ϕ1\displaystyle-\underbrace{\sum_{\ell}\log_{2}\left({\rm{I}}_{\ell}^{\mathrm{DL}}+\sigma_{\ell}^{2}\right)}_{\phi_{1}}
plog2(Sp,DFRCEve+Ip,DFRCEve+σp2)ϕ2\displaystyle-\underbrace{\sum_{p}\log_{2}\left({\rm{S}}_{p,\mathrm{DFRC}}^{\mathrm{Eve}}+{\rm{I}}_{p,\mathrm{DFRC}}^{\mathrm{Eve}}+\sigma_{p}^{2}\right)}_{\phi_{2}}

In this form, the DL sum secrecy rate is not concave due to convexity of ϕ1-\phi_{1} and ϕ2-\phi_{2} terms. Therefore, we introduce the following lemmas with the intent of ”convexifying” the problem.

Lemma 1: The term ϕ1\phi_{1} can be approximated to an affine function by applying Taylor expansion around (𝒑~,{𝑽~l}l=1L,𝑾~)(\widetilde{\boldsymbol{p}},\{\widetilde{\boldsymbol{V}}_{l}\}_{l=1}^{L},\widetilde{\boldsymbol{W}}) \useshortskip

ϕ1\displaystyle\phi_{1} 1ln2{ln|I~DL+σ2|\displaystyle\approx\frac{1}{\ln 2}\sum_{\ell}\Bigg{\{}\ln\left|\widetilde{{\rm{I}}}_{\ell}^{\mathrm{DL}}+\sigma_{\ell}^{2}\right| (23)
+k|qk,|2Δpk+tr(𝑯r,[s𝚫𝑽s+𝚫𝑾])I~DL+σ2},\displaystyle+\dfrac{\sum_{k}|q_{k,\ell}|^{2}{\Delta}_{p_{k}}+\operatorname{tr}\left(\boldsymbol{H}_{r,\ell}\left[\sum_{s\neq\ell}\boldsymbol{\Delta}_{\boldsymbol{V}_{s}}+\boldsymbol{\Delta}_{\boldsymbol{W}}\right]\right)}{\widetilde{{\rm{I}}}_{\ell}^{\mathrm{DL}}+\sigma_{\ell}^{2}}\Bigg{\}},

where Δpk=pkp~k\Delta_{p_{k}}=p_{k}-\widetilde{p}_{k}, Δ𝑽s=𝑽s𝑽~s\Delta_{\boldsymbol{V}_{s}}=\boldsymbol{V}_{s}-\widetilde{\boldsymbol{V}}_{s}, and Δ𝑾=𝑾𝑾~\Delta_{\boldsymbol{W}}=\boldsymbol{W}-\widetilde{\boldsymbol{W}}. In addition, \useshortskip

I~DL\displaystyle\widetilde{\rm{I}}_{\ell}^{\mathrm{DL}} =kp~k|qk,|2+tr(𝑽~𝑯r,)+tr(𝑾~𝑯r,).\displaystyle=\sum_{\begin{subarray}{c}k\end{subarray}}\widetilde{p}_{k}|q_{k,\ell}|^{2}+\sum_{\begin{subarray}{c}\ell^{\prime}\neq\ell\end{subarray}}\operatorname{tr}\left(\widetilde{\boldsymbol{V}}_{\ell^{\prime}}\boldsymbol{H}_{r,\ell}\right)+\operatorname{tr}\left(\widetilde{\boldsymbol{W}}\boldsymbol{H}_{r,\ell}\right).

Proof: See Appendix A.

Moreover, the function ϕ2\phi_{2} can also be approximated in a similar manner as ϕ1\phi_{1}, which is detailed in the following lemma.

Lemma 2: Similarly to Lemma 1, ϕ2\phi_{2} can also be approximated to an affine function by applying Taylor expansion around (𝒑~,{𝑽~l}l=1L,𝑾~)(\widetilde{\boldsymbol{p}},\{\widetilde{\boldsymbol{V}}_{l}\}_{l=1}^{L},\widetilde{\boldsymbol{W}}):

\useshortskip
ϕ2\displaystyle\phi_{2} 1ln2p{ln|S~p,DFRCEve+I~p,DFRCEve+σp2|\displaystyle\approx\frac{1}{\ln 2}\sum_{p}\Bigg{\{}\ln|\widetilde{{\rm{S}}}_{p,\mathrm{DFRC}}^{\mathrm{Eve}}+\widetilde{{\rm{I}}}_{p,\mathrm{DFRC}}^{\mathrm{Eve}}+\sigma_{p}^{2}| (24)
+k|gk,p|2Δpk+|αp|2tr(𝑨(θp)[s𝚫𝑽s+𝚫𝑾])S~p,DFRCEve+I~p,DFRCEve+σp2},\displaystyle+\dfrac{\sum_{k}|g_{k,p}|^{2}{\Delta}_{p_{k}}+|\alpha_{p}|^{2}\operatorname{tr}\left(\boldsymbol{A}(\theta_{p})\left[\sum_{s}\boldsymbol{\Delta}_{\boldsymbol{V}_{s}}+\boldsymbol{\Delta}_{\boldsymbol{W}}\right]\right)}{\widetilde{{\rm{S}}}_{p,\mathrm{DFRC}}^{\mathrm{Eve}}+\widetilde{{\rm{I}}}_{p,\mathrm{DFRC}}^{\mathrm{Eve}}+\sigma_{p}^{2}}\Bigg{\}},

where \useshortskip

I~p,DFRCEve\displaystyle\widetilde{\rm{I}}_{p,\mathrm{DFRC}}^{\mathrm{Eve}} =kp~k|gk,p|2+|αp|2tr(𝑾~𝑨(θp)),\displaystyle=\sum_{\begin{subarray}{c}k\end{subarray}}\widetilde{p}_{k}|g_{k,p}|^{2}+|\alpha_{p}|^{2}\operatorname{tr}\left(\widetilde{\boldsymbol{W}}\boldsymbol{A}(\theta_{p})\right), (25)
S~p,DFRCEve\displaystyle\widetilde{\rm{S}}_{p,\mathrm{DFRC}}^{\mathrm{Eve}} =tr(|αp|2𝑽~𝑨(θp)).\displaystyle=\sum_{\ell}\operatorname{tr}\left(|\alpha_{p}|^{2}\widetilde{\boldsymbol{V}}_{\ell}\boldsymbol{A}(\theta_{p})\right). (26)

Proof: The proof follows similar steps as that of Lemma 1. Finally, the complete approximate expression for the DL sum secrecy rate is given at the bottom of the page in equation (27), which is readily verified to be concave in (𝒑,{𝑽l}l=1L,𝑾)({\boldsymbol{p}},\{{\boldsymbol{V}}_{l}\}_{l=1}^{L},{\boldsymbol{W}}). \useshortskip

\wideparenSRDL\displaystyle\wideparen{\operatorname{SR}}_{\mathrm{DL}} =1ln2{{ln(SDL+IDL+σ2)ln|I~DL+σ2|k|qk,|2Δpk+tr(𝑯r,[s𝚫𝑽s+𝚫𝑾])I~DL+σ2}\displaystyle=\frac{1}{\ln 2}\Bigg{\{}\sum_{\ell}\Bigg{\{}\ln\left({\rm{S}}_{\ell}^{\mathrm{DL}}+{\rm{I}}_{\ell}^{\mathrm{DL}}+\sigma_{\ell}^{2}\right)-\ln\left|\widetilde{{\rm{I}}}_{\ell}^{\mathrm{DL}}+\sigma_{\ell}^{2}\right|-\dfrac{\sum_{k}|q_{k,\ell}|^{2}{\Delta}_{p_{k}}+\operatorname{tr}\left(\boldsymbol{H}_{r,\ell}\left[\sum_{s\neq\ell}\boldsymbol{\Delta}_{\boldsymbol{V}_{s}}+\boldsymbol{\Delta}_{\boldsymbol{W}}\right]\right)}{\widetilde{{\rm{I}}}_{\ell}^{\mathrm{DL}}+\sigma_{\ell}^{2}}\Bigg{\}} (27)
+p{ln(Ip,DFRCEve+σp2)ln|S~p,DFRCEve+I~p,DFRCEve+σp2|k|gk,p|2Δpk+|αp|2tr(𝑨(θp)[s𝚫𝑽s+𝚫𝑾])S~p,DFRCEve+I~p,DFRCEve+σp2}}\displaystyle+\sum_{p}\left.\left\{\ln\left({\rm{I}}_{p,\mathrm{DFRC}}^{\mathrm{Eve}}+\sigma_{p}^{2}\right)-\ln|\widetilde{{\rm{S}}}_{p,\mathrm{DFRC}}^{\mathrm{Eve}}+\widetilde{{\rm{I}}}_{p,\mathrm{DFRC}}^{\mathrm{Eve}}+\sigma_{p}^{2}|-\dfrac{\sum_{k}|g_{k,p}|^{2}{\Delta}_{p_{k}}+|\alpha_{p}|^{2}\operatorname{tr}\left(\boldsymbol{A}(\theta_{p})\left[\sum_{s}\boldsymbol{\Delta}_{\boldsymbol{V}_{s}}+\boldsymbol{\Delta}_{\boldsymbol{W}}\right]\right)}{\widetilde{{\rm{S}}}_{p,\mathrm{DFRC}}^{\mathrm{Eve}}+\widetilde{{\rm{I}}}_{p,\mathrm{DFRC}}^{\mathrm{Eve}}+\sigma_{p}^{2}}\right\}\right\}

Next, we proceed to the UL sum secrecy rate given in equation (30).

Note that ΓkUL\Gamma_{k}^{\mathrm{UL}} forms a generalized Rayleigh quotient in 𝒖k\boldsymbol{u}_{k} as given in its form in (8). Also note that ΓkUL\Gamma_{k}^{\mathrm{UL}} is the only quantity that depends on 𝒖k\boldsymbol{u}_{k}. Based on this observation, the maximum of ΓkUL\Gamma_{k}^{\mathrm{UL}} is attained by setting \useshortskip

𝒖^k=𝚽k1(𝑸,𝒑)𝒉t,k,k,\widehat{\boldsymbol{u}}_{k}=\boldsymbol{\Phi}_{k}^{-1}(\boldsymbol{Q},\boldsymbol{p})\boldsymbol{h}_{t,k},\quad\forall k, (28)

Using (28) in (8), we get \useshortskip

Γ^kUL=pk𝒉t,kH𝚽k1(𝑸,𝒑)𝒉t,k.\widehat{\Gamma}_{k}^{\mathrm{UL}}=p_{k}\boldsymbol{h}^{H}_{t,k}\boldsymbol{\Phi}_{k}^{-1}(\boldsymbol{Q},\boldsymbol{p})\boldsymbol{h}_{t,k}. (29)

Now that the UL beamforming vectors have maximized the UL SINRs, the maximization of the UL sum secrecy rate can be performed based on the remaining variables, namely (𝒑,{𝑽l}l=1L,𝑾)({\boldsymbol{p}},\{{\boldsymbol{V}}_{l}\}_{l=1}^{L},{\boldsymbol{W}}), as the UL sum secrecy rate at this point is \useshortskip

SR^UL=klog2(1+Γ^kUL)p,klog2(1+Γp,kEve),\widehat{\operatorname{SR}}_{\mathrm{UL}}=\sum\nolimits_{k}\log_{2}(1+\widehat{\Gamma}_{k}^{\mathrm{UL}})-\sum\nolimits_{p,k}\log_{2}(1+\Gamma_{p,k}^{\mathrm{Eve}}), (30)

which is basically the UL sum secrecy rate after UL beamforming at the DFRC BS. On one hand, we have less variables to maximize the UL sum secrecy rate, but on the other hand, this rate is still highly non-convex. To ”convexify” it, we first lower-bound the first term as \useshortskip

klog2(1+ϖk)klog2(1+Γ^kUL),\sum\nolimits_{k}\log_{2}(1+\varpi_{k})\leq\sum\nolimits_{k}\log_{2}(1+\widehat{\Gamma}_{k}^{\mathrm{UL}}), (31)

where we introduced kk slack variables satisfying 0ϖkΓ^kUL0\leq\varpi_{k}\leq\widehat{\Gamma}_{k}^{\mathrm{UL}} for all kk. Next, a Taylor series expansion around 𝚽~k\widetilde{\boldsymbol{\Phi}}_{k} can be conducted, hence giving us a more suitable bound \useshortskip

ϖkpk𝒉t,kH𝚽~k1𝒉t,k𝒉t,kH𝚽~k1(𝚽k𝚽~k)𝚽~k1𝒉t,k,k.\frac{\varpi_{k}}{p_{k}}\leq\boldsymbol{h}_{t,k}^{H}\widetilde{\boldsymbol{\Phi}}_{k}^{-1}\boldsymbol{h}_{t,k}-\boldsymbol{h}_{t,k}^{H}\widetilde{\boldsymbol{\Phi}}_{k}^{-1}\left(\boldsymbol{\Phi}_{k}-\widetilde{\boldsymbol{\Phi}}_{k}\right)\widetilde{\boldsymbol{\Phi}}_{k}^{-1}\boldsymbol{h}_{t,k},\forall k. (32)

However, this constraint is still non-convex due to it’s fractional nature, i.e. ϖkpk\frac{\varpi_{k}}{p_{k}} is not a convex function in its underlying variables. Therefore, we apply the following transformation through injecting slack variables ϑ1ϑK\vartheta_{1}\ldots\vartheta_{K} appearing in quadratic structure, viz. \useshortskip

{ϑk2pk𝒉t,kH𝚽~k1𝒉t,k𝒉t,kH𝚽~k1(𝚽k𝚽~k)𝚽~k1𝒉t,k,k.ϖkϑk2,\left\{\begin{array}[]{l}\frac{\vartheta_{k}^{2}}{p_{k}}\leq\boldsymbol{h}_{t,k}^{H}\widetilde{\boldsymbol{\Phi}}_{k}^{-1}\boldsymbol{h}_{t,k}-\boldsymbol{h}_{t,k}^{H}\widetilde{\boldsymbol{\Phi}}_{k}^{-1}\left(\boldsymbol{\Phi}_{k}-\widetilde{\boldsymbol{\Phi}}_{k}\right)\widetilde{\boldsymbol{\Phi}}_{k}^{-1}\boldsymbol{h}_{t,k},\quad\forall k.\\ \varpi_{k}\leq\vartheta_{k}^{2},\end{array}\right. (33)

The first constraint is easily verified to be convex, however the second constraint is non-convex (concave less than zero), but can be remedied through a first-order approximation around ϑ~1ϑ~K\widetilde{\vartheta}_{1}\ldots\widetilde{\vartheta}_{K} as follows \useshortskip

{ϑk2pk𝒉t,kH𝚽~k1𝒉t,k𝒉t,kH𝚽~k1(𝚽k𝚽~k)𝚽~k1𝒉t,kϖkϑ~k2+2ϑ~k(ϑkϑ~k),k\left\{\begin{array}[]{l}\frac{\vartheta_{k}^{2}}{p_{k}}\leq\boldsymbol{h}_{t,k}^{H}\widetilde{\boldsymbol{\Phi}}_{k}^{-1}\boldsymbol{h}_{t,k}-\boldsymbol{h}_{t,k}^{H}\widetilde{\boldsymbol{\Phi}}_{k}^{-1}\left(\boldsymbol{\Phi}_{k}-\widetilde{\boldsymbol{\Phi}}_{k}\right)\widetilde{\boldsymbol{\Phi}}_{k}^{-1}\boldsymbol{h}_{t,k}\\ \varpi_{k}\leq\widetilde{\vartheta}_{k}^{2}+2\widetilde{\vartheta}_{k}\left(\vartheta_{k}-\widetilde{\vartheta}_{k}\right),\end{array}\forall k\right. (34)

This is equivalent to lower bounding the UL sum secrecy rate under the set of constraints in (34)

klog2(1+ϖk)p,klog2(1+Γp,kEve)SR^UL\sum\nolimits_{k}\log_{2}(1+\varpi_{k})-\sum\nolimits_{p,k}\log_{2}(1+\Gamma_{p,k}^{\mathrm{Eve}})\leq\widehat{\operatorname{SR}}_{\mathrm{UL}} (35)

Next, we proceed in convexifying the second term appearing in the lower bound of (35). Indeed, we have that \useshortskip

klog2(1+ϖk)p,klog2(Sp,kEve+Ip,kEve+σp2)Kϕ3+p,klog2(Ip,kEve+σp2)SR^UL\begin{split}\sum\limits_{k}\log_{2}(1+\varpi_{k})&-\overbrace{\sum\limits_{p,k}\log_{2}({\rm{S}}_{p,k}^{\mathrm{Eve}}+{\rm{I}}_{p,k}^{\mathrm{Eve}}+\sigma_{p}^{2})}^{K\phi_{3}}\\ &+\sum\limits_{p,k}\log_{2}({\rm{I}}_{p,k}^{\mathrm{Eve}}+\sigma_{p}^{2})\leq\widehat{\operatorname{SR}}_{\mathrm{UL}}\end{split} (36)

where Sp,kEve=pk|gk,p|2{\rm{S}}_{p,k}^{\mathrm{Eve}}=p_{k}|g_{k,p}|^{2} highlights the useful part of the received at the pthp^{\rm{th}} eavesdropper and Ip,kEve=kkKpk|gk,p|2+|αp|2𝒂NTH(θp)𝑸𝒂NT(θp){\rm{I}}_{p,k}^{\mathrm{Eve}}=\sum_{\begin{subarray}{c}k^{\prime}\neq k\end{subarray}}^{K}p_{k^{\prime}}|g_{k^{\prime},p}|^{2}+|\alpha_{p}|^{2}\boldsymbol{a}_{N_{T}}^{H}(\theta_{p})\boldsymbol{Q}\boldsymbol{a}_{N_{T}}(\theta_{p}) contains the interference the pthp^{th} eavesdropper sees. Note that although Sp,kEve{\rm{S}}_{p,k}^{\mathrm{Eve}} and Ip,kEve{\rm{I}}_{p,k}^{\mathrm{Eve}} each depend on kk, their sum is independent of kk. Thus, we will denote it by ΨpEve\Psi_{p}^{\mathrm{Eve}}, i.e. ΨpEve=kSp,kEve+kIp,kEve\Psi_{p}^{\mathrm{Eve}}=\sum\nolimits_{k}{\rm{S}}_{p,k}^{\mathrm{Eve}}+\sum\nolimits_{k}{\rm{I}}_{p,k}^{\mathrm{Eve}}. Next, due to convexity of the ϕ3-\phi_{3} term, the UL sum secrecy rate is not necessarily concave. Thus, we apply the following lemma.

Lemma 3: The term ϕ3\phi_{3} can be approximated to an affine function by applying Taylor expansion around (𝒑~,{𝑽~l}l=1L,𝑾~)(\widetilde{\boldsymbol{p}},\{\widetilde{\boldsymbol{V}}_{l}\}_{l=1}^{L},\widetilde{\boldsymbol{W}}) \useshortskip

ϕ3\displaystyle\phi_{3} 1ln2p{ln|Ψ~pEve+σp2|\displaystyle\approx\frac{1}{\ln 2}\sum_{p}\Big{\{}\ln|\widetilde{\Psi}_{p}^{\mathrm{Eve}}+\sigma_{p}^{2}| (37)
+k|gk,p|2Δpk+|αp|2tr(𝑨(θp)[s𝚫𝑽s+𝚫𝑾])Ψ~pEve+σp2}.\displaystyle+\dfrac{\sum_{k}|g_{k,p}|^{2}{\Delta}_{p_{k}}+|\alpha_{p}|^{2}\operatorname{tr}\left(\boldsymbol{A}(\theta_{p})\left[\sum_{s}\boldsymbol{\Delta}_{\boldsymbol{V}_{s}}+\boldsymbol{\Delta}_{\boldsymbol{W}}\right]\right)}{\widetilde{\Psi}_{p}^{\mathrm{Eve}}+\sigma_{p}^{2}}\Big{\}}.

where Ψ~pEve=kS~p,kEve+kI~p,kEve\widetilde{\Psi}_{p}^{\mathrm{Eve}}=\sum\nolimits_{k}\widetilde{\rm{S}}_{p,k}^{\mathrm{Eve}}+\sum\nolimits_{k}\widetilde{\rm{I}}_{p,k}^{\mathrm{Eve}} and \useshortskip

S~p,kEve\displaystyle\widetilde{\rm{S}}_{p,k}^{\mathrm{Eve}} =p~k|gk,p|2,\displaystyle=\widetilde{p}_{k}|g_{k,p}|^{2}, (38)
I~p,kEve\displaystyle\widetilde{\rm{I}}_{p,k}^{\mathrm{Eve}} =kkKp~k|gk,p|2+|αp|2𝒂NTH(θp)𝑸~𝒂NT(θp)\displaystyle=\sum_{\begin{subarray}{c}k^{\prime}\neq k\end{subarray}}^{K}\widetilde{p}_{k^{\prime}}|g_{k^{\prime},p}|^{2}+|\alpha_{p}|^{2}\boldsymbol{a}_{N_{T}}^{H}(\theta_{p})\widetilde{\boldsymbol{Q}}\boldsymbol{a}_{N_{T}}(\theta_{p}) (39)
\useshortskip

and 𝑸~=𝑽~+𝑾~\widetilde{\boldsymbol{Q}}=\sum_{\ell}\widetilde{\boldsymbol{V}}_{\ell}+\widetilde{\boldsymbol{W}}.
Proof: The proof follows similar steps as that of Lemma 1.

Therefore, the approximated lower bound concave UL sum secrecy rate can be written as \useshortskip

\wideparenSRULLB=klog2(1+ϖk)+p,klog2(Ip,kEve+σp2)\displaystyle\wideparen{\operatorname{SR}}_{\mathrm{UL}}^{\mathrm{LB}}=\sum\limits_{k}\log_{2}(1+\varpi_{k})+\sum\limits_{p,k}\log_{2}({\rm{I}}_{p,k}^{\mathrm{Eve}}+\sigma_{p}^{2}) (40)
Kln2p{ln|Ψ~pEve+σp2|\displaystyle-\frac{K}{\ln 2}\sum_{p}\Big{\{}\ln|\widetilde{\Psi}_{p}^{\mathrm{Eve}}+\sigma_{p}^{2}|
+k|gk,p|2Δpk+|αp|2tr(𝑨(θp)[s𝚫𝑽s+𝚫𝑾])Ψ~pEve+σp2}.\displaystyle+\dfrac{\sum_{k}|g_{k,p}|^{2}{\Delta}_{p_{k}}+|\alpha_{p}|^{2}\operatorname{tr}\left(\boldsymbol{A}(\theta_{p})\left[\sum_{s}\boldsymbol{\Delta}_{\boldsymbol{V}_{s}}+\boldsymbol{\Delta}_{\boldsymbol{W}}\right]\right)}{\widetilde{\Psi}_{p}^{\mathrm{Eve}}+\sigma_{p}^{2}}\Big{\}}.

Now that the lower-bound of the UL sum secrecy rate, i.e. \wideparenSRULLB\wideparen{\operatorname{SR}}_{\mathrm{UL}}^{\mathrm{LB}}, is concave, we can now formulate an efficient convex optimization problem that can be solved in the neighborhood of (𝒑~,{𝑽~l}l=1L,𝑾~)(\widetilde{\boldsymbol{p}},\{\widetilde{\boldsymbol{V}}_{l}\}_{l=1}^{L},\widetilde{\boldsymbol{W}}). Indeed, combining the constraints in (34) with problem (𝒫1.2)(\mathcal{P}_{1.2}) in (19), and utilizing the concave DL and UL sum secrecy rates in (27) and (40), we arrive at the following convex optimization problem

\useshortskip
(𝒫1.3):{max{{𝑽},𝑾,𝒑,{ϖk}k,{ϑk}k}\wideparenSRDL+\wideparenSRULLBs.t.=1Ltr(𝑽)PDLV,tr(𝑾)PDLW,k=1KpkPUL,tr((=1L𝑽+𝑾)𝑨s)tr((=1L𝑽+𝑾)𝑨m)ISMRmax,ϑk2pk𝒉t,kH𝚽k1𝒉t,k𝒉t,kH𝚽~k1(𝚽k𝚽~k)𝚽~k1𝒉t,kk,ϖkϑ~k2+2ϑ~k(ϑkϑ~k),k,𝑾𝟎,𝒑𝟎,𝑽𝟎,,ϖk0,ϑk0,k.\displaystyle(\mathcal{P}_{1.3}):\begin{cases}\max\limits_{\{\begin{subarray}{c}\{\boldsymbol{V}_{\ell}\}_{\ell},\boldsymbol{W},\boldsymbol{p},\{\varpi_{k}\}_{k},\{\vartheta_{k}\}_{k}\end{subarray}\}}\wideparen{\operatorname{SR}}_{\mathrm{DL}}+\wideparen{\operatorname{SR}}_{\mathrm{UL}}^{\rm{LB}}&\\ \textrm{s.t.}\hskip 27.03003pt\sum_{\ell=1}^{L}\operatorname{tr}(\boldsymbol{V}_{\ell})\leq P_{\rm{DL}}^{V},\ \operatorname{tr}(\boldsymbol{W})\leq P_{\rm{DL}}^{W},&\\ \quad\hskip 31.2982pt\sum\nolimits_{k=1}^{K}p_{k}\leq P_{\rm{UL}},&\\ \quad\hskip 31.2982pt\frac{\operatorname{tr}\left(\left(\sum_{\ell=1}^{L}\boldsymbol{V}_{\ell}+\boldsymbol{W}\right)\boldsymbol{A}_{s}\right)}{\operatorname{tr}\left(\left(\sum_{\ell=1}^{L}\boldsymbol{V}_{\ell}+\boldsymbol{W}\right)\boldsymbol{A}_{m}\right)}\leq\operatorname{ISMR}_{\max},&\\ \quad\hskip 31.2982pt\frac{\vartheta_{k}^{2}}{p_{k}}\leq\boldsymbol{h}_{t,k}^{H}{\boldsymbol{\Phi}}_{k}^{-1}\boldsymbol{h}_{t,k}&\\ \quad\hskip 42.67912pt-\boldsymbol{h}_{t,k}^{H}\widetilde{\boldsymbol{\Phi}}_{k}^{-1}\left(\boldsymbol{\Phi}_{k}-\widetilde{\boldsymbol{\Phi}}_{k}\right)\widetilde{\boldsymbol{\Phi}}_{k}^{-1}\boldsymbol{h}_{t,k}\quad\forall k,&\\ \quad\hskip 31.2982pt\varpi_{k}\leq\widetilde{\vartheta}_{k}^{2}+2\widetilde{\vartheta}_{k}\left(\vartheta_{k}-\widetilde{\vartheta}_{k}\right),\quad\forall k,&\\ \quad\hskip 31.2982pt\boldsymbol{W}\succeq\boldsymbol{0},\ \boldsymbol{p}\succeq\boldsymbol{0},\boldsymbol{V}_{\ell}\succeq\boldsymbol{0},\quad\forall\ell,&\\ \quad\hskip 31.2982pt\varpi_{k}\geq 0,\vartheta_{k}\geq 0,\quad\forall k.&\end{cases} (41)

As the problem solves in the neighborhood of (𝒑~,{𝑽~l}l=1L,𝑾~)(\widetilde{\boldsymbol{p}},\{\widetilde{\boldsymbol{V}}_{l}\}_{l=1}^{L},\widetilde{\boldsymbol{W}}), we should be able to quantify a good neighborhood to solve the problem at. For this, we design IJTB, which leverages a block cyclic coordinate descent (BCCD) type method applied directly on (𝒫1.3)(\mathcal{P}_{1.3}) given a previous solution of (𝒑~,{𝑽~l}l=1L,𝑾~)(\widetilde{\boldsymbol{p}},\{\widetilde{\boldsymbol{V}}_{l}\}_{l=1}^{L},\widetilde{\boldsymbol{W}}), as well as the UL beamforming vectors, and iterates between both the set of parameters (𝒑~,{𝑽~l}l=1L,𝑾~)(\widetilde{\boldsymbol{p}},\{\widetilde{\boldsymbol{V}}_{l}\}_{l=1}^{L},\widetilde{\boldsymbol{W}}) and 𝑼\boldsymbol{U}. The IJTB method is summarized in Algorithm 1.

Algorithm 1 IJTB for FD-ISAC sum secrecy UL/DL rate maximization
  
  Input: {𝒉r,,σ}=1L\{\boldsymbol{h}_{r,\ell},\sigma_{\ell}\}_{\ell=1}^{L}, {𝒉t,k}k=1K\{\boldsymbol{h}_{t,k}\}_{k=1}^{K}, {γp,θp,σp,αp}p=1P\{\gamma_{p},\theta_{p},\sigma_{p},\alpha_{p}\}_{p=1}^{P}, {gk,p}p,k=1P,K\{g_{k,p}\}_{p,k=1}^{P,K}, ISMRmax\operatorname{ISMR}_{\mathrm{max}}, β\beta, 𝑯SI\boldsymbol{H}_{\mathrm{SI}}, 𝑨s\boldsymbol{A}_{s}, 𝑨m\boldsymbol{A}_{m}.
  Initialize:
        Set m=0m=0, 𝑽(0)=𝟎\boldsymbol{V}_{\ell}^{(0)}=\boldsymbol{0}, 𝑾(0)=𝟎\boldsymbol{W}^{(0)}=\boldsymbol{0}, 𝒑(0)=𝟎\boldsymbol{p}^{(0)}=\boldsymbol{0}.
  while m<Miterm<M_{iter}
        Update 𝑸~\widetilde{\boldsymbol{Q}} as 𝑸~==1L𝑽~+𝑾~\widetilde{\boldsymbol{Q}}=\sum\nolimits_{\ell=1}^{L}\widetilde{\boldsymbol{V}_{\ell}}+\widetilde{\boldsymbol{W}}.
        for k=1Kk=1\ldots K
            Update 𝚽k(m)\boldsymbol{\Phi}_{k}^{(m)} via (9) given 𝑸~\widetilde{\boldsymbol{Q}} and 𝒑~\widetilde{\boldsymbol{p}}.
            Update 𝒖k(m+1)\boldsymbol{u}_{k}^{(m+1)} as 𝒖k(m+1)=(𝚽k(m))1𝒉t,k\boldsymbol{u}_{k}^{(m+1)}=\left(\boldsymbol{\Phi}_{k}^{(m)}\right)^{-1}\boldsymbol{h}_{t,k}.
            Normalize 𝒖k(m+1)\boldsymbol{u}_{k}^{(m+1)} as 𝒖k(m+1)𝒖k(m+1)/|𝒖k(m+1)|\boldsymbol{u}_{k}^{(m+1)}\leftarrow\boldsymbol{u}_{k}^{(m+1)}/\left|\boldsymbol{u}_{k}^{(m+1)}\right|.
        Solve (𝒫1.3(m))(\mathcal{P}_{1.3}^{(m)}) in (19) to get 𝑽(m+1),𝑾(m+1),𝒑(m+1)\boldsymbol{V}_{\ell}^{(m+1)},\boldsymbol{W}^{(m+1)},\boldsymbol{p}^{(m+1)}.
  set 𝑾~=𝑾(m)\widetilde{\boldsymbol{W}}=\boldsymbol{W}^{(m)}, 𝒑~=𝒑(m)\widetilde{\boldsymbol{p}}=\boldsymbol{p}^{(m)}, {𝑽~=𝑽(m)}=1L\{\widetilde{\boldsymbol{V}}_{\ell}={\boldsymbol{V}}_{\ell}^{(m)}\}_{\ell=1}^{L}, {ϑ~k=ϑk(m)}k=1K\{\widetilde{\vartheta}_{k}={\vartheta}_{k}^{(m)}\}_{k=1}^{K}.
  return {𝒖k}k=1K\{\boldsymbol{u}_{k}\}_{k=1}^{K}, 𝑾\boldsymbol{W}, 𝒑\boldsymbol{p}, 𝑽\boldsymbol{V}.

V Simulation Results

In this section, we present our simulation results. Before we discuss and analyze and our findings, we mention the simulation parameters and benchmarks used in simulations.

V-A Parameter Setup

We have 11 cell, with cell radius of 500m500\operatorname{m} [37]. The DFRC BS is situated at the center of the cell (origin) of the cell, with transmit power budget of 40dBm40\operatorname{dBm} [38]. The transmit/receive array geometries at the DFRC BS follow a uniform linear antenna (ULA) structure with antenna spacing of λ2\frac{\lambda}{2}, where λ\lambda is wavelength corresponding to a carrier frequency of 28GHz28\operatorname{GHz}. The transmit antenna gain power of the DFRC is set to 25dBi25\operatorname{dBi} [38]. Moreover, the receive antenna gain of the DFRC has a gain of 25dBi25\operatorname{dBi} [38]. On the other hand, the DL users are equipped with a single-antenna of 12dBi12\operatorname{dBi} antenna gain [38] and the UL users are also single-antenna users with 17dBi17\operatorname{dBi} [38] antenna gain. For fairness, we treat the evesdropper meaning that they are also single-antenna users with an antenna gain of 12dBi12\operatorname{dBi}. The residual SI is set to 110dB-110\operatorname{dB}, which can be achieved over radio frequency (RF) and digital domains of the transceiver [39], [40]. The power budget of the proposed optimization method in the UL and the AN DL are set to PUL=PDLW=0dBP_{\rm{UL}}=P_{\rm{DL}}^{W}=0\operatorname{dB}. The thermal noise is set to 174dBm/Hz-174\operatorname{dBm/Hz}. Also, we utilize Rician [38] and Rayleigh [41] distributions in order to simulate various channel conditions, with log-normal shadowing of 20dB20\operatorname{dB}.

TABLE I: Simulation Parameters
Parameter Value
Number of cells 11
Cell radius 500m500\operatorname{m} [37]
Transmit power 40dBm40\operatorname{dBm} [38]
Residual SI 110dB-110\operatorname{dB} [39, 40]
Antenna geometry ULA
Antenna spacing λ2\frac{\lambda}{2}
Channel conditions Rayleigh (kdB=dBk_{\rm{dB}}=-\infty\operatorname{dB}) [41], Rician (kdB=15dBk_{\rm{dB}}=15\operatorname{dB}) [38]
DFRC transmit antenna gain 25dBi25\operatorname{dBi} [38]
UL user antenna gain 17dBi17\operatorname{dBi} [38]
DFRC receive antenna gain 25dBi25\operatorname{dBi} [38]
DL receive antenna gain 12dBi12\operatorname{dBi} [38]
Eavesdropper receive antenna gain 12dBi12\operatorname{dBi} [38]
Carrier frequency 28GHz28\operatorname{GHz}
Thermal noise 174dBm/Hz-174\operatorname{dBm/Hz}
Shadowing log-normal of 20dB20\operatorname{dB}
Pathloss exponent 22 (free space)
no. of DFRC transmit antennas NTN_{T} {6,12}\{6,12\} antennas
no. of DFRC receive antennas NRN_{R} {6,9,12}\{6,9,12\} antennas

V-B Benchmark Schemes

Throughout simulations, we compare our the IJTB method with the following schemes:

  • Benchmark 1: In this benchmark, partial transmit power is allocated to emit the AN to interfere with the eavesdroppers. In fact, the AN is isotropically distributed on the orthogonal complement subspace of the DL users [42] This benchmark is denoted by Iso AN. In other words, the power is distributed equally between the AN, the DL beamforming and the uplink users.

  • Benchmark 2: This benchmark assumes on AN and thus the total power budget is distributed equally amongst the DL beamforming and the UL users. This benchmark is denoted by Iso No-AN.

  • Benchmark 3: This benchmark is denoted by Feasible This is a random baseline scheme utilizing all the available power budgets available with equality. More precisely, the beamforming vectors, in conjunction with the power vectors and artificial noise statistics, are randomly generated. Such a scheme is included to show how a random and simple scheme can perform in a secure FD-ISAC system. We emphasize on term feasible, as it is a random solution satisfying the optimization problem. Random benchmark was adopted in several works like [43, 44].

V-C Simulation Results

Refer to caption
Figure 2: The convergence behavior of the IJTB algorithm for different PP and ISMRmax\operatorname{ISMR}_{\rm{max}} levels (denoted as ISMR\operatorname{ISMR} for short). We set NT=12N_{T}=12, NR=6N_{R}=6, K=2K=2, L=1L=1, σn2=σ2=70dB\sigma_{n}^{2}=\sigma_{\ell}^{2}=-70\operatorname{dB}, σp2=65dB\sigma_{p}^{2}=-65\operatorname{dB}, PDLV=0dBP_{\rm{DL}}^{V}=0\operatorname{dB}, rDL=20mr_{\rm{DL}}=20\operatorname{m}, rUL=15mr_{\rm{UL}}=15\operatorname{m}, and rEve=17mr_{\rm{Eve}}=17\operatorname{m}.

In Fig. 2, we set NT=12N_{T}=12 antennas, NR=6N_{R}=6 antennas, K=2K=2 users, L=1L=1 users, σn2=70dB\sigma_{n}^{2}=-70\operatorname{dB}, σ2=70dB\sigma_{\ell}^{2}=-70\operatorname{dB}, σp2=65dB\sigma_{p}^{2}=-65\operatorname{dB}, PDLV=0dBP_{\rm{DL}}^{V}=0\operatorname{dB}, rDL=20mr_{\rm{DL}}=20\operatorname{m}, rUL=15mr_{\rm{UL}}=15\operatorname{m}, and rEve=17mr_{\rm{Eve}}=17\operatorname{m}. We plot the sum secrecy rate as a function of iteration number, with the intent of studying convergence with different channel conditions, ISMRmax\operatorname{ISMR}_{\rm{max}} levels, and number of target eavesdroppers involved in the FD-ISAC setup. On the other hand, generally speaking, at NLoS conditions, the sum secrecy rate is better than the line-of-sight (LoS) ones. For instance, at NLoS conditions (kdB=k_{\rm{dB}}=-\infty), when P=3P=3 and ISMR=20dB\operatorname{ISMR}=20\operatorname{dB}, the sum secrecy rate converges to 25.88bits/sec/Hz25.88\operatorname{bits/sec/Hz} whereas at strong LoS (kdB=15dBk_{\rm{dB}}=15\operatorname{dB}), we see that for the same conditions, the sum secrecy rate settles at about 15.52bits/sec/Hz15.52\operatorname{bits/sec/Hz}. Also, when we configure a less stringent ISMR constraint onto the proposed IJTB method, we notice that the sum secrecy rate improves and takes lesser iterations to convergence to its maximum value. For example, at NLoS and for P=1P=1 eavesdroppers and at ISMR=20dB\operatorname{ISMR}=20\operatorname{dB}, the algorithm converges to an overall sum secrecy rate of about 26.27bits/sec/Hz26.27\operatorname{bits/sec/Hz}, and by lowering the ISMR to 10dB-10\operatorname{dB}, the sum secrecy rate slightly decreases to 25.08bits/sec/Hz25.08\operatorname{bits/sec/Hz}. Now, when ISMR is set to a stringent level of 20dB-20\operatorname{dB}, we observe that the sum secrecy rate dramatically drops to 8.67bits/sec/Hz8.67\operatorname{bits/sec/Hz}. This is because more emphasis is being imposed on the sensing counterpart of the ISAC system, hence more sensing priority can impact the sum secrecy rate performance. It is also worth noting that at NLoS conditions and at a less stringer ISMR, the sum secrecy rate of both P=1P=1 and P=3P=3 are almost the same. We observe that more eavesdroppers impact the sum secrecy rate in a negative way. In particular, more eavesdroppers lower the sum secrecy rate at convergence. For instance, at kdB=15dBk_{\rm{dB}}=15\operatorname{dB}, and ISMR=20dB\operatorname{ISMR}=20\operatorname{dB}, with P=1P=1 the sum secrecy rate converges to 20.15bits/sec/Hz20.15\operatorname{bits/sec/Hz} whereas for P=3P=3, the sum secrecy rate drops to 15.52bits/sec/Hz15.52\operatorname{bits/sec/Hz}. This is because of a fixed power budget overall the scenarios. In any case, we can observe algorithmic convergence in about 101410-14 iterations at most.

Refer to caption
Figure 3: DL sum secrecy rate convergence of the IJTB method for different PP, power budget PDLVP_{\rm{DL}}^{V} and DL user distances, rDLr_{\rm{DL}}. We set the same parameters as Fig. 2 except kdB=15dBk_{\rm{dB}}=15\operatorname{dB}, ISMRmax=20dB\operatorname{ISMR}_{\rm{max}}=20\operatorname{dB}, and rEve=175mr_{\rm{Eve}}=175\operatorname{m}.

In Fig. 3, we set the same parameters as those of Fig. 2 with the exception of kdB=15dBk_{\rm{dB}}=15\operatorname{dB}, ISMRmax=20dB\operatorname{ISMR}_{\rm{max}}=20\operatorname{dB}, and rEve=175mr_{\rm{Eve}}=175\operatorname{m}. We study the impact of DL power budget and rDLr_{\rm{DL}} on the DL sum secrecy rate as a function of iteration number. We notice that as the distance between the DL user and the DFRC BS decreases, the algorithm tends to converge to a higher DL sum secrecy rate. For example, when P=1P=1, and only PDLV=30dBP_{\rm{DL}}^{V}=-30\operatorname{dB} is utilized for power budget, the IJTB algorithm converges to 1.07bits/sec/Hz1.07\operatorname{bits/sec/Hz} at a high distance of rDL=200mr_{\rm{DL}}=200\operatorname{m}. Meanwhile, when the same distance is lowered to 140m140\operatorname{m}, the DL sum secrecy rate tends to 1.7bits/sec/Hz1.7\operatorname{bits/sec/Hz}. Moreover, this sum secrecy rate increases to 3bits/sec/Hz3\operatorname{bits/sec/Hz} at rDL=80mr_{\rm{DL}}=80\operatorname{m}, and 6.8bits/sec/Hz6.8\operatorname{bits/sec/Hz} at rDL=mr_{\rm{DL}}=\operatorname{m}. This is because of the increases pathloss effect at higher distances at a limited power budget. Moreover, the impact of PDLVP_{\rm{DL}}^{V} also translates to a boost in DL sum secrecy rate. Generally speaking, we can see that an increase of 30dB30\operatorname{dB} in DL power budget translates to a DL sum secrecy rate improvement of roughly 10bits/sec/Hz10\operatorname{bits/sec/Hz}. This is because allocating more power within the system at a constant level of ISMRmax\operatorname{ISMR}_{\rm{max}} level can only improve the secrecy. In addition, we see that at fixed power budget and ISMRmax\operatorname{ISMR}_{\rm{max}} level, more target eavesdroppers in the system deteriorates the DL sum secrecy rate. At PDLV=0dBP_{\rm{DL}}^{V}=0\operatorname{dB}, we observe that tripling the number of eavesdroppers leads to a decreases of DL sum secrecy rate of roughly 0.52bits/sec/Hz0.52\operatorname{bits/sec/Hz}. However, for a low power budget (i.e. PDLV=30dBP_{\rm{DL}}^{V}=-30\operatorname{dB}), we notice that the algorithm converges to the same DL sum secrecy rate for both P=1P=1 and P=3P=3 cases. This is because the ISAC system is at higher risk of potential eavesdropping from a subset of eavesdroppers, who experience better channel conditions. In this case, we see that the algorithm needs no more than 33 iterations to converge.

Refer to caption
Figure 4: The DL sum secrecy rate convergence behavior of the IJTB algorithm for different noise DL noise variances, i.e. σl2\sigma_{l}^{2}. We fix the same parameters as Fig. 2 except for P=1P=1, kdB=dBk_{\rm{dB}}=-\infty\operatorname{dB}, and ISMRmax=20dB\operatorname{ISMR}_{\rm{max}}=20\operatorname{dB}.

In Fig. 4, we set the same simulation parameters as Fig. 2 except for P=1P=1, kdB=dBk_{\rm{dB}}=-\infty\operatorname{dB}, and ISMRmax=20dB\operatorname{ISMR}_{\rm{max}}=20\operatorname{dB}. We study the impact of σl2\sigma_{l}^{2} on the DL sum secrecy rate with increasing iteration number. The more noisy a DL user, the less of a DL sum secrecy rate the algorithm settles at. For instance, for a σl2=70dBm\sigma_{l}^{2}=-70\operatorname{dBm}, the DL sum secrecy rate converges to 17.27bits/sec/Hz17.27\operatorname{bits/sec/Hz} as opposed to 8.88bits/sec/Hz8.88\operatorname{bits/sec/Hz} at σl2=45dBm\sigma_{l}^{2}=-45\operatorname{dBm}. When the noise variance exceeds 5dBm5\operatorname{dBm}, which is already too high, the DL sum secrecy rate is near-zero. This is because at a fixed power budget and ISMR level, the DL noise variance can only decrease the DL sum secrecy rate, which is an intuitive observation. We also observe, as in Fig. 2 and Fig. 3, that the algorithm converges in all cases.

Refer to caption
Figure 5: UL sum secrecy rate convergence of the IJTB method for different number of receive antennas NRN_{R} and noise variance at the DFRC BS. We fix the same parameters as Fig. 4 except for NT=6N_{T}=6 and σ2=100dB\sigma_{\ell}^{2}=-100\operatorname{dB}.

In Fig. 5, we set the same simulation parameters as Fig. 4 except for NT=6N_{T}=6 antennas and σ2=100dB\sigma_{\ell}^{2}=-100\operatorname{dB}. We study the impact of both number of DFRC BS receive antennas, i.e. NRN_{R}, and the noise variance at DFRC BS, i.e. σn2\sigma_{n}^{2}, on the convergence behavior of the UL sum secrecy rate. For any σn2\sigma_{n}^{2}, we see that increasing the number of receive antennas can improve the DL sum secrecy rate for fixed power budget, and fixed ISMR levels. For instance, at fixed σn2=50dBm\sigma_{n}^{2}=-50\operatorname{dBm}, we see that with NR=6N_{R}=6 antennas, the IJTB algorithm converges to an UL sum secrecy rate of about 14.71bits/sec/Hz14.71\operatorname{bits/sec/Hz}, as compared to 16.44bits/sec/Hz16.44\operatorname{bits/sec/Hz} for NR=9N_{R}=9 antennas, and 17.32bits/sec/Hz17.32\operatorname{bits/sec/Hz} for NR=12N_{R}=12 antennas. This is because DFRC receive antennas can also allow room for enhanced degrees-of-freedom which enables better UL sum secrecy rate for the algorithm to converge towards. We observe that the algorithm needs about 88 iterations to converge to a stable point.

Refer to caption
Figure 6: UL sum secrecy rate performance for different target eavesdropper distances, i.e. rEver_{\rm{Eve}}, as a function of UL user distances, i.e. rULr_{\rm{UL}}. We fix the same parameters as Fig. 2 except for NR=12N_{R}=12, K=1K=1, P=1P=1, kdB=dBk_{\rm{dB}}=-\infty\operatorname{dB}, σ2=100dB\sigma_{\ell}^{2}=-100\operatorname{dB}, and ISMRmax=20dB\operatorname{ISMR}_{\rm{max}}=20\operatorname{dB}.

In Fig. 6, we set the same simulation parameters as Fig. 2 except for the following: NR=12N_{R}=12 antennas, K=1K=1 user, P=1P=1 evesdroppers, kdB=dBk_{\rm{dB}}=-\infty\operatorname{dB}, σ2=100dB\sigma_{\ell}^{2}=-100\operatorname{dB}, and ISMRmax=20dB\operatorname{ISMR}_{\rm{max}}=20\operatorname{dB}. We study the performance of the IJTB method from an UL sum secrecy rate sense with increasing UL radial distance and for different eavesdropper distances. It is evident that with increasing rULr_{\rm{UL}}, the UL decreases regardless of the method. However, it is worthwhile noting that the IJTB method dominates all other benchmarks regardless of rULr_{\rm{UL}} and rEver_{\rm{Eve}}. Even more, the IJTB method can adapt to different rEver_{\rm{Eve}}, which is not a common feature with the other benchmark. For instance, the UL sum secrecy rate of all benchmarks drops to a low near-zero rate when the eavesdropper reaches a distance of rEve=17mr_{\rm{Eve}}=17\operatorname{m}.

Refer to caption
Figure 7: Overall sum secrecy rate performance for different target eavesdropper distances, i.e. rEver_{\rm{Eve}}, and for various UL user distances. We fix the same simulation parameters as Fig. 6.

In Fig. 7, we fix the same simulation parameters as that of Fig. 6. Furthermore, we analyze the efficacy of the IJTB approach in terms of overall sum secrecy rate as the UL user distance increases, considering various distances of potential eavesdroppers. We observe that the sum secrecy rate decreases with UL sum secrecy rate for all methods. In addition, a far eavesdropper would normally contribute to an increase in sum secrecy rate. This is because of increased pathloss. What’s interesting to observe is that for a close eavesdropper (i.e. rEve=17mr_{\rm{Eve}}=17\operatorname{m}), the impact of AN is more effective, which is seen by the two isotropic benchmarks (isotropic and non-isotropic benchmarks), where there is about 0.84bits/sec/Hz0.84\operatorname{bits/sec/Hz} gap in favor of the isotropic AN benchmark. However, when the eavesdropper distance becomes high (i.e. rEve=170mr_{\rm{Eve}}=170\operatorname{m}), the impact of AN is no longer effective. It is also interesting to observe that any random solution of power vector, beamformers and AN beamforming on average keeps the sum secrecy rate at zero. On the other hand, the IJTB method can adapt to eavesdropper distance changes as can be seen because both curves corresponding to the IJTB method at the two different eavesdropper distances coincide. Even more, the IJTB method outperforms all other methods in terms of sum secrecy rate over all the evaluated UL user distances. For instance, when rUL=50mr_{\rm{UL}}=50\operatorname{m}, the IJTB method achieves a sum secrecy rate of about 21.4bits/sec/Hz21.4\operatorname{bits/sec/Hz} as opposed 18.86bits/sec/Hz18.86\operatorname{bits/sec/Hz} achieved by the isotropic no-AN benchmark.

Refer to caption
Figure 8: The sum secrecy rate-ISMR trade-off for Rayleigh and strong LoS channels. We set the same parameters as Fig. 2 except for P=1P=1, rDL=200mr_{\rm{DL}}=200\operatorname{m}, and rEve=175mr_{\rm{Eve}}=175\operatorname{m}.

In Fig. 8, we fix the same simulation parameters as Fig. 2 except for P=1P=1 eavesdropper, rDL=200mr_{\rm{DL}}=200\operatorname{m}, and rEve=175mr_{\rm{Eve}}=175\operatorname{m}. We study the sum secrecy rate vs. ISMR ISAC trade-off for different channel conditions. When the ISMR constraint imposes a stringent restriction through a tight (low) ISMRmax\rm{ISMR}_{\rm{max}} the sum secrecy rate of the IJTB method drops lower than the isotropic benchmarking methods. This is because the IJTB method is basically dedicating an optimized chunk of power towards the eavesdropper through the mainlobes, while restricting power onto the sidelobes. However, it is interesting to see that the IJTB method is still able to achieve high sum secrecy rates, which are, in some channel conditions, comparable with the benchmarks. For example, in Rayleigh channel conditions (kdB=k_{\rm{dB}}=-\infty) and at a tight ISMR corresponding to ISMRmax=20dB\rm{ISMR}_{\rm{max}}=-20\operatorname{dB}, the sum secrecy rate is about 8.84bits/sec/Hz8.84\operatorname{bits/sec/Hz} and as the ISMR constraint becomes less and less stringent (i.e. increasing ISMRmax\rm{ISMR}_{\rm{max}}), the sum secrecy rate of the IJTB method gradually increases to increase the maximum possible sum secrecy rate the ISAC system can achieve. For example, the sum secrecy rate reaches 19.76bits/sec/Hz19.76\operatorname{bits/sec/Hz} and 13.53bits/sec/Hz13.53\operatorname{bits/sec/Hz} at high ISMRmax\rm{ISMR}_{\rm{max}} for Rayleigh and strong LoS channel conditions, respectively. This is because the channel conditions hold significant amount of information regarding the sum secrecy rate of the IJTB system. Clearly, the sum secrecy rates of all other benchmarks do not depend on the ISMRmax\rm{ISMR}_{\rm{max}} because they are not optimized for good ISMR performance.

Refer to caption
Figure 9: The achieved ISMR as a function of ISMRmax\operatorname{ISMR}_{\rm{max}} for different number of eavesdroppers, PP. We set the same parameters as Fig. 2 except for kdB=dBk_{\rm{dB}}=-\infty\operatorname{dB} and rEve=175mr_{\rm{Eve}}=175\operatorname{m}.

In Fig. 9, we set the same simulation parameters as Fig. 2 except for kdB=dBk_{\rm{dB}}=-\infty\operatorname{dB} and rEve=175mr_{\rm{Eve}}=175\operatorname{m}. Moreover, we analyze the impact of the ISMRmax\operatorname{ISMR}_{\rm{max}} on the achieved ISMR of the IJTB method. We can see a clear trend between the obtained ISMR and the tuned one via ISMRmax\operatorname{ISMR}_{\rm{max}}. Notice that the evaluated ISMR is always upper bounded by the given ISMRmax\operatorname{ISMR}_{\rm{max}}, which tells us that this constraint is always active. Interestingly, as PP increases, the ISMR tries to hold on to a tighter value. For example, for P=1P=1 eavesdroppers, when we set an ISMRmax\operatorname{ISMR}_{\rm{max}} of 10dB10\operatorname{dB}, the achieved ISMR is 8.69dB8.69\operatorname{dB}, as opposed to 7dB7\operatorname{dB} for P=3P=3 eavesdroppers and 5.55dB5.55\operatorname{dB} for P=6P=6 eavesdroppers. Also, when ISMRmax>10dB\operatorname{ISMR}_{\rm{max}}>10\operatorname{dB}, we see that the case of P=6P=6 eavesdroppers saturates at about 5.55dB5.55\operatorname{dB}. This is because more energy has to be contained within the mainlobes, as compared to the sidelobes, towards the different target eavesdroppers.

VI Conclusion

This paper examines an FD-ISAC system with multiple malicious targets aiming to intercept UL and DL communications and provides an ISAC optimization framework for optimizing the UL and DL sum secrecy rate under sensing and power budget constraints. This enables one quantifying the maximum achievable FD secrecy rates, under ISAC constraints. Furthermore, we introduced IJBT, a method well-suited for the proposed FD-ISAC sum secrecy rate maximization problem at hand, which alternates between sub-problems to efficiently solve for beamformers and power allocations. Our results support the effectiveness of the method, as compared to benchmarking techniques. In conclusion, our findings demonstrate that the IJTB algorithm not only exhibits rapid convergence, but also consistently outperforms other methods by maintaining higher sum secrecy rates, even as the eavesdropper distance increases. Furthermore, IJTB maintains strong performance, particularly as the ISMR constraint becomes less stringent, highlighting its robustness in securing SAC applications.

Appendix A Proof of Lemma 1

The Taylor series expansion of ϕ1\phi_{1} around 𝒮(𝒑~,{𝑽~}=1L,𝑾~)\mathscr{S}\triangleq\left(\widetilde{\boldsymbol{p}},\{\widetilde{\boldsymbol{V}}_{\ell}\}_{\ell=1}^{L},\widetilde{\boldsymbol{W}}\right) can be expressed as \useshortskip

ϕ1(𝒑,{𝑽}=1L,𝑾)\displaystyle\phi_{1}\left(\boldsymbol{p},\{\boldsymbol{V}_{\ell}\}_{\ell=1}^{L},\boldsymbol{W}\right) (42)
=ϕ1(𝒑~,{𝑽~}=1L,𝑾~)+{kϕ1pk|𝒮(pkp~k)\displaystyle=\phi_{1}\left(\widetilde{\boldsymbol{p}},\{\widetilde{\boldsymbol{V}}_{\ell}\}_{\ell=1}^{L},\widetilde{\boldsymbol{W}}\right)+\sum_{\ell}\left\{\sum_{k}\left.\frac{\partial\phi_{1}}{\partial p_{k}}\right|_{\mathscr{S}}(p_{k}-\widetilde{p}_{k})\right.
+s[ϕ1Re[𝑽s]|𝒮,ϕ1Im[𝑽s]|𝒮][Re(𝑽s𝑽~s)Im(𝑽s𝑽~s)]\displaystyle+\sum_{s}\left[\left.\frac{\partial\phi_{1}}{\partial\operatorname{Re}\left[\boldsymbol{V}_{s}\right]}\right|_{\mathscr{S}},\left.\frac{\partial\phi_{1}}{\partial\operatorname{Im}\left[\boldsymbol{V}_{s}\right]}\right|_{\mathscr{S}}\right]\left[\begin{array}[]{c}\operatorname{Re}\left(\boldsymbol{V}_{s}-\widetilde{\boldsymbol{V}}_{s}\right)\\ \operatorname{Im}\left(\boldsymbol{V}_{s}-\widetilde{\boldsymbol{V}}_{s}\right)\end{array}\right]
+[ϕ1Re[𝑾]|𝒮,ϕ1Im[𝑾]|𝒮][Re(𝑾𝑾~)Im(𝑾𝑾~)]}.\displaystyle+\left[\left.\frac{\partial\phi_{1}}{\partial\operatorname{Re}[\boldsymbol{W}]}\right|_{\mathscr{S}},\left.\frac{\partial\phi_{1}}{\partial\operatorname{Im}[\boldsymbol{W}]}\right|_{\mathscr{S}}\right]\left[\begin{array}[]{c}\operatorname{Re}\left(\boldsymbol{W}-\widetilde{\boldsymbol{W}}\right)\\ \operatorname{Im}\left(\boldsymbol{W}-\widetilde{\boldsymbol{W}}\right)\end{array}\right]\Bigg{\}}.

The partial derivatives are trivial to calculate since every term appearing in ϕ1\phi_{1} is linear. This can be easily rearranged as follows \useshortskip

ϕ1(𝒑,{𝑽}=1L,𝑾)\displaystyle\phi_{1}\left(\boldsymbol{p},\{\boldsymbol{V}_{\ell}\}_{\ell=1}^{L},\boldsymbol{W}\right) (43)
=log2|IDL|+1ln21IDL{k|qk,|2Δpk\displaystyle=\sum_{\ell}\log_{2}\left|{\textrm{I}}_{\ell}^{\mathrm{DL}}\right|+\sum_{\ell}\frac{1}{\ln 2}\frac{1}{{\textrm{I}}_{\ell}^{\mathrm{DL}}}\left\{\sum_{k}|q_{k,\ell}|^{2}\Delta_{p_{k}}\right.
+s{tr[𝑯r,Re(Δ𝑽s)+j𝑯r,Im(Δ𝑽s)]}\displaystyle+\sum_{s\neq\ell}\left\{\operatorname{tr}\left[\boldsymbol{H}_{r,\ell}\operatorname{Re}\left(\Delta_{\boldsymbol{V}_{s}}\right)+j\boldsymbol{H}_{r,\ell}\operatorname{Im}\left(\Delta_{\boldsymbol{V}_{s}}\right)\right]\right\}
+tr[𝑯r,Re(Δ𝑾)+j𝑯r,Im(Δ𝑾)]}\displaystyle+\operatorname{tr}\left[\boldsymbol{H}_{r,\ell}\operatorname{Re}\left(\Delta_{\boldsymbol{W}}\right)+j\boldsymbol{H}_{r,\ell}\operatorname{Im}\left(\Delta_{\boldsymbol{W}}\right)\right]\Bigg{\}}

leading to equation (23).

Appendix B Acknowledgment

This work has been supported by Tamkeen and the Center for Cybersecurity under the NYU Abu Dhabi Research Institute Award G1104.

References

  • [1] M. A. Richards, J. Scheer, W. A. Holm, and W. L. Melvin, “Principles of modern radar,” 2010.
  • [2] S. Naoumi, A. Bazzi, R. Bomfin, and M. Chafii, “Complex Neural Network based Joint AoA and AoD Estimation for Bistatic ISAC,” IEEE Journal of Selected Topics in Signal Processing, pp. 1–15, 2024.
  • [3] A. Chowdary, A. Bazzi, and M. Chafii, “On Hybrid Radar Fusion for Integrated Sensing and Communication,” IEEE Transactions on Wireless Communications, vol. 23, no. 8, pp. 8984–9000, 2024.
  • [4] A. Liu, Z. Huang, M. Li, Y. Wan, W. Li, T. X. Han, C. Liu, R. Du, D. K. P. Tan, J. Lu, Y. Shen, F. Colone, and K. Chetty, “A Survey on Fundamental Limits of Integrated Sensing and Communication,” IEEE Communications Surveys & Tutorials, vol. 24, no. 2, pp. 994–1034, 2022.
  • [5] Z. Behdad, O. T. Demir, K. W. Sung, E. Björnson, and C. Cavdar, “Multi-Static Target Detection and Power Allocation for Integrated Sensing and Communication in Cell-Free Massive MIMO,” IEEE Transactions on Wireless Communications, pp. 1–1, 2024.
  • [6] N. Xue, X. Mu, Y. Liu, and Y. Chen, “NOMA Assisted Full Space STAR-RIS-ISAC,” IEEE Transactions on Wireless Communications, pp. 1–1, 2024.
  • [7] B. Smida, R. Wichman, K. E. Kolodziej, H. A. Suraweera, T. Riihonen, and A. Sabharwal, “In-band full-duplex: The physical layer,” Proceedings of the IEEE, pp. 1–30, 2024.
  • [8] A. Bazzi and M. Chafii, “On Integrated Sensing and Communication Waveforms With Tunable PAPR,” IEEE Transactions on Wireless Communications, vol. 22, no. 11, pp. 7345–7360, 2023.
  • [9] M. Chafii, L. Bariah, S. Muhaidat, and M. Debbah, “Twelve scientific challenges for 6g: Rethinking the foundations of communications theory,” IEEE Communications Surveys & Tutorials, vol. 25, no. 2, pp. 868–904, 2023.
  • [10] A. Bazzi and M. Chafii, “Secure Full Duplex Integrated Sensing and Communications,” IEEE Transactions on Information Forensics and Security, vol. 19, pp. 2082–2097, 2024.
  • [11] A. Chorti, A. N. Barreto, S. Köpsell, M. Zoli, M. Chafii, P. Sehier, G. Fettweis, and H. V. Poor, “Context-aware security for 6g wireless: The role of physical layer security,” IEEE Communications Standards Magazine, vol. 6, no. 1, pp. 102–108, 2022.
  • [12] “New SID on Security Aspects of Integrated Sensing and Communication,” 3GPPSA3-e(AH) for Rel-19 SID/WID workshop, S3-23xxxx, eMeeting, 27-28 September 2023. Revision of S3ah-230038+230055+230068, 2023, document for Approval, Agenda Item: 4. [Online]. Available: http://www.3gpp.org/Work-Items
  • [13] D. Xu, X. Yu, D. W. K. Ng, A. Schmeink, and R. Schober, “Robust and secure resource allocation for isac systems: A novel optimization framework for variable-length snapshots,” IEEE Transactions on Communications, vol. 70, no. 12, pp. 8196–8214, 2022.
  • [14] Z. Ren, L. Qiu, J. Xu, and D. W. K. Ng, “Robust transmit beamforming for secure integrated sensing and communication,” IEEE Transactions on Communications, vol. 71, no. 9, pp. 5549–5564, 2023.
  • [15] N. Su, F. Liu, and C. Masouros, “Sensing-assisted eavesdropper estimation: An isac breakthrough in physical layer security,” IEEE Transactions on Wireless Communications, vol. 23, no. 4, pp. 3162–3174, 2024.
  • [16] P. Liu, Z. Fei, X. Wang, B. Li, Y. Huang, and Z. Zhang, “Outage constrained robust secure beamforming in integrated sensing and communication systems,” IEEE Wireless Communications Letters, vol. 11, no. 11, pp. 2260–2264, 2022.
  • [17] A. A. Nasir, “Joint Users’ Secrecy Rate and Target’s Sensing SNR Maximization for a Secure Cell-Free ISAC System,” IEEE Communications Letters, vol. 28, no. 7, pp. 1549–1553, 2024.
  • [18] A. Bazzi and M. Chafii, “On Outage-Based Beamforming Design for Dual-Functional Radar-Communication 6G Systems,” IEEE Transactions on Wireless Communications, vol. 22, no. 8, pp. 5598–5612, 2023.
  • [19] M. Mohammadi, Z. Mobini, D. Galappaththige, and C. Tellambura, “A comprehensive survey on full-duplex communication: Current solutions, future trends, and open issues,” IEEE Communications Surveys & Tutorials, vol. 25, no. 4, pp. 2190–2244, 2023.
  • [20] Z. Xiao and Y. Zeng, “Waveform design and performance analysis for full-duplex integrated sensing and communication,” IEEE Journal on Selected Areas in Communications, vol. 40, no. 6, pp. 1823–1837, 2022.
  • [21] Z. He, W. Xu, H. Shen, D. W. K. Ng, Y. C. Eldar, and X. You, “Full-duplex communication for isac: Joint beamforming and power optimization,” IEEE Journal on Selected Areas in Communications, vol. 41, no. 9, pp. 2920–2936, 2023.
  • [22] Y. Guo, Y. Liu, Q. Wu, X. Li, and Q. Shi, “Joint beamforming and power allocation for ris aided full-duplex integrated sensing and uplink communication system,” IEEE Transactions on Wireless Communications, vol. 23, no. 5, pp. 4627–4642, 2024.
  • [23] Z. Liu, S. Aditya, H. Li, and B. Clerckx, “Joint transmit and receive beamforming design in full-duplex integrated sensing and communications,” IEEE Journal on Selected Areas in Communications, vol. 41, no. 9, pp. 2907–2919, 2023.
  • [24] D. Galappaththige, C. Tellambura, and A. Maaref, “Integrated sensing and backscatter communication,” IEEE Wireless Communications Letters, vol. 12, no. 12, pp. 2043–2047, 2023.
  • [25] C. B. Barneto, S. D. Liyanaarachchi, M. Heino, T. Riihonen, and M. Valkama, “Full duplex radio/radar technology: The enabler for advanced joint communication and sensing,” IEEE Wireless Communications, vol. 28, no. 1, pp. 82–88, 2021.
  • [26] R. Allu, M. Katwe, K. Singh, T. Q. Duong, and C.-P. Li, “Robust Energy Efficient Beamforming Design for ISAC Full-Duplex Communication Systems,” IEEE Wireless Communications Letters, pp. 1–1, 2024.
  • [27] D. Galappaththige, S. Zargari, C. Tellambura, and G. Y. Li, “Near-Field ISAC: Beamforming for Multi-Target Detection,” IEEE Wireless Communications Letters, pp. 1–1, 2024.
  • [28] C. Jiang, C. Zhang, C. Huang, J. Ge, J. He, and C. Yuen, “Secure beamforming design for ris-assisted integrated sensing and communication systems,” IEEE Wireless Communications Letters, vol. 13, no. 2, pp. 520–524, 2024.
  • [29] H. Zhao, F. Wu, W. Xia, Y. Zhang, Y. Ni, and H. Zhu, “Joint beamforming design for ris-aided secure integrated sensing and communication systems,” IEEE Communications Letters, vol. 27, no. 11, pp. 2943–2947, 2023.
  • [30] F. Xia, Z. Fei, X. Wang, P. Liu, J. Guo, and Q. Wu, “Joint Waveform and Reflection Design for Sensing-Assisted Secure RIS-Based Backscatter Communication,” IEEE Wireless Communications Letters, vol. 13, no. 5, pp. 1523–1527, 2024.
  • [31] G. Sun, H. Shi, B. Shang, and W. Hao, “Secure transmission for active ris-assisted thz isac systems with delay alignment modulation,” IEEE Communications Letters, vol. 28, no. 5, pp. 1019–1023, 2024.
  • [32] J. Zhang, J. Xu, W. Lu, N. Zhao, X. Wang, and D. Niyato, “Secure Transmission for IRS-Aided UAV-ISAC Networks,” IEEE Transactions on Wireless Communications, pp. 1–1, 2024.
  • [33] Y. Liu, I. Al-Nahhal, O. A. Dobre, F. Wang, and H. Shin, “Extreme Learning Machine-Based Channel Estimation in IRS-Assisted Multi-User ISAC System,” IEEE Transactions on Communications, vol. 71, no. 12, pp. 6993–7007, 2023.
  • [34] R. W. Heath, N. González-Prelcic, S. Rangan, W. Roh, and A. M. Sayeed, “An Overview of Signal Processing Techniques for Millimeter Wave MIMO Systems,” IEEE Journal of Selected Topics in Signal Processing, vol. 10, no. 3, pp. 436–453, 2016.
  • [35] F. Liu, Y. Cui, C. Masouros, J. Xu, T. X. Han, Y. C. Eldar, and S. Buzzi, “Integrated Sensing and Communications: Toward Dual-Functional Wireless Networks for 6G and Beyond,” IEEE Journal on Selected Areas in Communications, vol. 40, no. 6, pp. 1728–1767, 2022.
  • [36] P. Zhao, M. Zhang, H. Yu, H. Luo, and W. Chen, “Robust Beamforming Design for Sum Secrecy Rate Optimization in MU-MISO Networks,” IEEE Transactions on Information Forensics and Security, vol. 10, no. 9, pp. 1812–1823, 2015.
  • [37] B. Ma, H. Shah-Mansouri, and V. W. S. Wong, “Full-Duplex Relaying for D2D Communication in Millimeter Wave-based 5G Networks,” IEEE Transactions on Wireless Communications, vol. 17, no. 7, pp. 4417–4431, 2018.
  • [38] I. A. Hemadeh, K. Satyanarayana, M. El-Hajjar, and L. Hanzo, “Millimeter-Wave Communications: Physical Channel Models, Design Considerations, Antenna Constructions, and Link-Budget,” IEEE Communications Surveys & Tutorials, vol. 20, no. 2, pp. 870–913, 2018.
  • [39] A. Sabharwal, P. Schniter, D. Guo, D. W. Bliss, S. Rangarajan, and R. Wichman, “In-Band Full-Duplex Wireless: Challenges and Opportunities,” IEEE Journal on Selected Areas in Communications, vol. 32, no. 9, pp. 1637–1652, 2014.
  • [40] A. T. Le, X. Huang, and Y. J. Guo, “A Two-Stage Analog Self-Interference Cancelation Structure for High Transmit Power In-Band Full-Duplex Radios,” IEEE Wireless Communications Letters, vol. 11, no. 11, pp. 2425–2429, 2022.
  • [41] Y. Zhang, J. Mu, and J. Xiaojun, “Performance of Multi-Cell mmWave NOMA Networks With Base Station Cooperation,” IEEE Communications Letters, vol. 25, no. 2, pp. 442–445, 2021.
  • [42] B. Hassibi and T. Marzetta, “Multiple-antennas and isotropically random unitary inputs: the received signal density in closed form,” IEEE Transactions on Information Theory, vol. 48, no. 6, pp. 1473–1484, 2002.
  • [43] A. Waraiet, K. Cumanan, Z. Ding, and O. A. Dobre, “Deep Reinforcement Learning-Based Robust Design for an IRS-Assisted MISO-NOMA System,” IEEE Transactions on Machine Learning in Communications and Networking, vol. 2, pp. 424–441, 2024.
  • [44] Y. Ju, Y. Chen, Z. Cao, L. Liu, Q. Pei, M. Xiao, K. Ota, M. Dong, and V. C. M. Leung, “Joint Secure Offloading and Resource Allocation for Vehicular Edge Computing Network: A Multi-Agent Deep Reinforcement Learning Approach,” IEEE Transactions on Intelligent Transportation Systems, vol. 24, no. 5, pp. 5555–5569, 2023.