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

Full-Duplex ISAC-Enabled D2D Underlaid Cellular Networks: Joint Transceiver Beamforming and Power Allocation

Tao Jiang, Ming Jin, Qinghua Guo, , Yinhong Liu, and Yaming Li This work was partially supported by Natural Science Foundation of China under Grant 61871246, and Zhejiang Provincial Natural Science Funds under Grant LR21F010001.T. Jiang, M. Jin, Y. Liu Y. Li are with the Faculty of Electrical Engineering and Computer Science, Ningbo University, Ningbo 315211, China (e-mail: [email protected]; [email protected]; [email protected]; [email protected]).Q. Guo is with the School of Electrical, Computer and Telecommunications Engineering, University of Wollongong, Wollongong, NSW 2522, Australia (e-mail: [email protected]).This work has been submitted to IEEE Transactions on Wireless Communications on 7 June.
Abstract

Integrating device-to-device (D2D) communication into cellular networks can significantly reduce the transmission burden on base stations (BSs). Besides, integrated sensing and communication (ISAC) is envisioned as a key feature in future wireless networks. In this work, we consider a full-duplex ISAC-based D2D underlaid system, and propose a joint beamforming and power allocation scheme to improve the performance of the coexisting ISAC and D2D networks. To enhance spectral efficiency, a sum rate maximization problem is formulated for the full-duplex ISAC-based D2D underlaid system, which is non-convex. To solve the non-convex optimization problem, we propose a successive convex approximation (SCA)-based iterative algorithm and prove its convergence. Numerical results are provided to validate the effectiveness of the proposed scheme with the iterative algorithm, demonstrating that the proposed scheme outperforms state-of-the-art ones in both communication and sensing performance.

Index Terms:
Integrated sensing and communication (ISAC), D2D underlaid cellular network, transmit/receive beamforming, power allocation.

I Introduction

WITH the explosive growth of the Internet of Things (IoT) devices, spectrum resource congestion is becoming increasingly prominent. Besides, many emerging applications in the sixth generation (6G), such as intelligent transportation and human-computer interaction, demand both high-quality communications and high-precision sensing simultaneously. These practical needs motivate the design of integrated sensing and communication (ISAC) systems, which has attracted extensive attention from both industry and academia [1]. Moreover, advancements in technologies such as multiple-input multiple-output (MIMO) [2], signal processing technologies for ISAC [3] and hardware design enable sensing and communication functionalities to be implemented using the same hardware and share same spectrum resource to achieve reliable communications and sensing, which could effectively improve spectral efficiency and energy efficiency.

In a MIMO ISAC system, beamforming plays a key role, where the spatial degrees of freedom (DoFs) provided by MIMO can be exploited to achieve substantial gains in both sensing and communications. Many existing works focus on the design of transmit beamforming [4, 5, 6, 7, 8, 9, 10], with optimization problems centered around two key metrics for sensing: 1) Beampattern gains at the direction of targets; 2) Beampattern template matching. Under the first metric, He et al in [4] optimized the transmit beampattern by formulating an energy efficiency maximization problem while ensuring the beampattern gains of targets and the SINR requirements of communication users. The transmit beampattern design was also considered in NOMA-ISAC systems [5], RIS-aided ISAC systems [6], and secure ISAC systems [7]. In [5], a weighted objective function, which involves the beampattern gain at a target and the SINR at communication users, is maximized. In [6], a reconfigurable intelligent surface (RIS) is employed to enhance the beampattern gain at the target direction by establishing an extra reflective link. In a secure ISAC system in [7], the beampattern gain at the target (eavesdropper) is maximized while guaranteeing the secret rate and communication rate of legitimate users. Under the second metric, in [8], the matching error between the designed and desired beampattern is minimized, incorporating the outage probability and power consumption constraints. Based on [8], in [9] and [10], the authors considered a weighted minimization problem of matching error and cross-correlation among beampatterns of multiple targets. However, these works focus on transmit beampatterns and ignore the reception of radar echo, which fails to capture the property of the receive signal at the BS.

In addition to transmit beamforming design, receive beamforming has been jointly used to filter the received signal and improve the signal to interference and noise ratio (SINR) for sensing at the base station (BS) [11, 13, 12, 14]. The sensing SNR/SINR maximization problems were formulated in [11], corresponding to the perfect clutter removal and imperfect clutter removal scenarios, respectively. In [12], the sensing SINR for target detection is used as a constraint in optimizing the power efficiency and spectral efficiency in a full-duplex ISAC system. To suppress self-interference (SI) in a full-duplex ISAC system, a joint ISAC transceiver beamforming design scheme was proposed for maximizing a weighted objective function containing communication rate, transmit gain and receive gain [13]. Consistent with [12], the minimal sensing SINR was utilized as a constraint for minimizing the maximum eavesdrop rate of eavesdroppers in a secure DFRC system [14].

Recently, device-to-device (D2D) communication has attracted much attention. It enables two nearby transceivers to establish a strong direct communication link without extra interventions of central agents, effectively reducing transmission delays, improving the spectral efficiency, and reducing power consumption simultaneously [15]. However, the interference among multiple D2D pairs are inevitable when they exploit the same spectral resource. Power allocation plays a key role in managing interference and ensuring the quality of service (QoS) in D2D networks. Weighted minimum mean squared error (WMMSE) is a classic iterative power allocation algorithm used for solving the weighted sum rate maximization problem in a centralized manner [16, 17]. However, WMMSE exhibits high complexity. To tackle this issue, machine learning (ML) methods were exploited to reduce the computational complexity [18, 19]. Combining the topology information, graph neural network (GNN) was adopted to implement power allocation among D2D pairs[18]. By modeling channel gains as the edge and node features, each D2D pair integrates neighbouring embeddings, and then update their own embedding in each GNN layer. The power allocation result is obtained by classifying embedding, however it still operates in a centralized manner. In [19], an improved GNN-based distributed power allocation scheme was proposed to reduce the CSI signalling overhead by broadcasting the pilot signal power and exploiting the temporal correlation of CSI. However, the works mentioned above [16, 17, 18, 19] only considered homogeneous D2D networks.

Actually, D2D pairs often communicate underlaying cellular networks, which effectively alleviates the transmission burden of the central base station (BS) [20, 21]. Thus, power allocation is crucial for ensuring QoS for both cellular users (CUs) and D2D pairs. Some studies, e.g., [22, 23, 24], consider a single-antenna BS and aim to maximize the energy efficiency [22] or spectral efficiency [23], and minimize the power consumption [24], while ensuring the minimum communication SINR requirements. Some works focus on multiple-antennas BS and leverage beamforming to enhance performance [25, 26]. In [25], a robust beamforming scheme was proposed with given power for the D2D transmitters (D2D-TX). In [26], the performance of transmit beamforming and power allocation were comprehensively analyzed in the coexistence of D2D and downlink CU communications. However, only a single D2D pair was considered. Multiple CU downlink and D2D communications was discussed in [27], where an iterative algorithm is employed to solve the spectral efficiency maximization problem. For the coexistence of multiple CU uplink and-D2D communications, a general communication and interference model was presented in [28] to improve energy efficiency. However, the works in [22, 23, 24, 25, 26, 27, 28] consider a half-duplex BS. In [29], a full-duplex BS is adopted in a D2D underlaid cellular network. However, it focuses on the issue of sub-channel allocation and does not consider the issue of power allocation.

I-A Motivations and Contributions

ISAC and D2D underlaid cellular networks have generally progressed along separate, parallel paths despite extensive individual studies. This work proposes integration of the full-duplex ISAC and the D2D underlaid cellular networks to improve the spectral efficiency, and investigates the joint optimization of the the transceiver beamformings of the ISAC BS and the transmit power allocation of both the BS and D2D-TXs. The main contributions of this paper are summarized as follows:

  • We propose a full-duplex ISAC and D2D underlaid cellular network, which involves a full-duplex BS, multiple D2D pairs and multiple CUs. To maintain the coexistence of the ISAC and D2D networks, we formulate a sum rate maximization problem while guaranteeing minimum sensing SINR for target detection, maximum transmit power of D2D-TXs and the full-duplex BS.

  • To deal with the non-convexity of the formulated problem, we employ the successive convex approximation (SCA) technology to covert the original problem into a convex problem. The convergence and the computational complexity of the SCA-based algorithm are analyzed.

  • Numerical results are provided to validate the effectiveness of the proposed scheme. Compared with the existing schemes, the propose scheme delivers the best performance in both communication and radar sensing.

The remainder of the paper is organized as follows. Section II\mathrm{II} presents the system models and provides the problem formulation under the criterion of the sum rate maximization. In Section III\mathrm{III}, an SCA-based optimization algorithm is proposed to solve the formulated problem, and the convergence and the computational complexity of the algorithm are analyzed. Numerical simulations are provided in Section IV\mathrm{IV} and conclusions are drawn in Section V\mathrm{V}.

Notation: Throughout the paper, boldface upper-case letters refer to matrices and boldface lower-case letters refer to vectors. ()H(\cdot)^{H}, ()T(\cdot)^{\mathrm{T}}, ()1(\cdot)^{-1}, Tr()\mathrm{Tr}(\cdot), 𝔼()\mathbb{E}(\cdot) represent the conjugate transpose, transpose, inverse, trace and expectation operator, respectively. For a square matrix 𝐃\mathbf{D}, 𝐃𝟎\mathbf{D}\succeq\mathbf{0} denotes that it is positive semidefinite, \|\cdot\| denotes the Euclidean norm of a complex vector and |||\cdot| denotes the Euclidean norm of a complex number. 𝒞𝒩(μ,σ2)\mathcal{CN}(\mu,\sigma^{2}) denotes a complex Gaussian distribution with mean μ\mu and variance σ2\sigma^{2}.

II System Model and Problem Formulation

Refer to caption

Figure 1: Illustration of an ISAC-empowered D2D underlaid cellular network.

We consider a joint system including full-duplex BS downlink communication, D2D communication, and radar sensing. Specifically, as shown in Fig. 1, we assume an ISAC BS equipped with NtN_{t} transmit antennas and NrN_{r} receive antennas. Suppose that KK single-antenna CUs are served by the BS, denoted by 𝒦={U1,,Uk,,UK}\mathcal{K}=\{\mathrm{U}_{1},\dots,\mathrm{U}_{k},\dots,\mathrm{U}_{K}\}, and there are MM single-antenna D2D communication pairs ={{D2D-TXm,D2D-RXm}m=1M}\mathcal{M}=\left\{\left\{\text{D2D-TX}_{m},\text{D2D-RX}_{m}\right\}_{m=1}^{M}\right\}, where D2D-TXm and D2D-RXm represent the transmitter and receiver of the mmth D2D pair, respectively. Additionally, a target is at the angle of θ0\theta_{0}, and II potential signal-dependent clutters are at the angles of {θi}i=1I,\left\{\theta_{i}\right\}_{i=1}^{I}, which reflect the signals from undesired directions and interfere with radar sensing.

II-A Communication Model

II-A1 Downlink communication model

The full-duplex BS transmits the ISAC signal 𝐱Nt×1\mathbf{x}\in\mathbb{C}^{N_{t}\times 1} for downlink communication and radar sensing simultaneously, and it is given by

𝐱=k=1K𝐰kskCU\mathbf{x}=\sum_{k=1}^{K}\mathbf{w}_{k}s_{k}^{\text{CU}} (1)

where skCUs_{k}^{\text{CU}} denotes the desired information symbol for the kkth CU and 𝐰kNt×1\mathbf{w}_{k}\in\mathbb{C}^{N_{t}\times 1} denotes the corresponding beamforming vector. Without loss of generality, it is assumed that information symbols are independent with each other and have unit power.

The received signal at the kkth CU can be written as

yk=𝐡BS,kH𝐰kskCUDesired communication signal+𝐡BS,kHkk𝐰kskCU+m=1Mpmhm,kTXsmD2D+nkInterference+Noise\begin{split}y_{k}&=\underbrace{\mathbf{h}_{\text{BS},k}^{H}\mathbf{w}_{k}s_{k}^{\text{CU}}}_{\text{Desired~{}communication~{}signal}}\\ &~{}~{}~{}~{}+\underbrace{\mathbf{h}_{\text{BS},k}^{H}\sum_{\begin{subarray}{c}\forall k^{\prime}\neq k\end{subarray}}\mathbf{w}_{k^{\prime}}s_{k^{\prime}}^{\text{CU}}+\sum_{m=1}^{M}\sqrt{p_{m}}h_{m,k}^{\text{TX}}s_{m}^{\text{D2D}}+n_{k}}_{\text{Interference+Noise}}\end{split} (2)

where 𝐡BS,kNt×1\mathbf{h}_{\text{BS},k}\in\mathbb{C}^{N_{t}\times 1} and hm,kTXh_{m,k}^{\text{TX}} represent the channel coefficients from the BS and D2D-TXm to Uk\mathrm{U}_{k}, respectively, smD2Ds_{m}^{\text{D2D}} and pmp_{m} denote the information symbol and the corresponding transmit power of D2D-TXm, and nkn_{k} denotes the additive circular symmetric complex white Gaussian noise with mean zero and variance σk2\sigma_{k}^{2}, i.e., nk𝒞𝒩(0,σk2)n_{k}\sim\mathcal{CN}(0,\sigma_{k}^{2}). The corresponding SINR at the kkth CU can be expressed as

SINRkCU=|𝐡BS,kH𝐰k|2kk|𝐡BS,kH𝐰k|2+m=1Mpm|hm,kTX|2+σk2.\begin{split}&\mathrm{SINR}_{k}^{\text{CU}}=\frac{\left|\mathbf{h}_{\text{BS},k}^{H}\mathbf{w}_{k}\right|^{2}}{\sum\limits_{\forall k^{\prime}\neq k}\left|\mathbf{h}_{\text{BS},k}^{H}\mathbf{w}_{k^{\prime}}\right|^{2}+\sum\limits_{m=1}^{M}p_{m}\left|h_{m,k}^{\mathrm{TX}}\right|^{2}+\sigma_{k}^{2}}.\end{split} (3)

Thus, its achievable communication rate is given by

CkCU=log2(1+SINRkCU).\begin{split}C_{k}^{\text{CU}}=\mathrm{log}_{2}\left(1+\mathrm{SINR}_{k}^{\text{CU}}\right).\end{split} (4)

II-A2 D2D communication model

The received signal at D2D-RXm contains the desired one from the corresponding transmitter D2D-TXm, and the unexpected interferences from other D2D transmitters and the BS. Therefore, the overall received signal at D2D-RXm can be written as

ym=pmhm,mTXsmD2DDesired  communication signal+mmpmhm,mTXsmD2D+𝐡BS,mHk=1K𝐰kskCU+nmInterference+Noise\begin{split}y_{m}&=\underbrace{\sqrt{p_{m}}h_{m,m}^{\text{TX}}s_{m}^{\text{D2D}}}_{\text{Desired~{} communication~{}signal}}\\ &~{}~{}+\underbrace{\sum_{\forall m^{\prime}\neq m}\sqrt{p_{m^{\prime}}}h_{m^{\prime},m}^{\text{TX}}s^{\text{D2D}}_{m^{\prime}}+\mathbf{h}_{\text{BS},m}^{H}\sum_{k=1}^{K}\mathbf{w}_{k}s_{k}^{\text{CU}}+n_{m}}_{\text{Interference+Noise}}\end{split} (5)

where hm,mTXh_{m^{\prime},m}^{\text{TX}} represents the channel coefficient from D2D-TXm{}_{m^{\prime}} to D2D-RXm, 𝐡BS,mNt×1\mathbf{h}_{\text{BS},m}\in\mathbb{C}^{N_{t}\times 1} denotes the channel coefficient between BS and D2D-RXm, and nm𝒞𝒩(0,σm2)n_{m}\sim\mathcal{CN}(0,\sigma_{m}^{2}) denotes the additive white Gaussian noise. Accordingly, the SINR at D2D-RXm is given by

SINRmD2D=pm|hm,mTX|2mmpm|hm,mTX|2+k=1K|𝐡BS,mH𝐰k|2+σm2.\begin{split}&\mathrm{SINR}_{m}^{\text{D2D}}=\frac{p_{m}\left|h_{m,m}^{\text{TX}}\right|^{2}}{\sum\limits_{\forall m^{\prime}\neq m}p_{m^{\prime}}\left|h_{m^{\prime},m}^{\text{TX}}\right|^{2}+\sum\limits_{k=1}^{K}\left|\mathbf{h}_{\text{BS},m}^{H}\mathbf{w}_{k}\right|^{2}+\sigma_{m}^{2}}.\end{split} (6)

Accordingly, the achievable communication rate of the mmth D2D pair is given by

CmD2D=log2(1+SINRmD2D).\begin{split}C_{m}^{\text{D2D}}=\log_{2}\left(1+\mathrm{SINR}_{m}^{\text{D2D}}\right).\end{split} (7)

II-B Radar Sensing Model

It is assumed that the transmit and receive antennas at the BS are uniform linear arrays (ULAs) with half-wavelength inter-element spacing [30]. The steering vector of transmit array 𝐚t(θ)\mathbf{a}_{t}(\theta) and receive array 𝐚r(θ)\mathbf{a}_{r}(\theta) are given by 𝐚t(θ)=1Nt[1,ejπsin(θ),,ejπ(Nt1)sin(θ)]TNt×1\mathbf{a}_{t}(\theta)=\frac{1}{\sqrt{N_{t}}}\left[1,e^{j\pi\sin(\theta)},\ldots,e^{j\pi(N_{t}-1)\sin(\theta)}\right]^{\mathrm{T}}\in\mathbb{C}^{N_{t}\times 1} and 𝐚r(θ)=1Nr[1,ejπsin(θ),,ejπ(Nr1)sin(θ)]TNr×1\mathbf{a}_{r}(\theta)=\frac{1}{\sqrt{N_{r}}}\left[1,e^{j\pi\sin(\theta)},\ldots,e^{j\pi(N_{r}-1)\sin(\theta)}\right]^{\mathrm{T}}\in\mathbb{C}^{N_{r}\times 1}, respectively. In addition, we assume that a line-of-sight (LOS) channel exists between the BS and the target. Thus, the reflected signal from the target at the angle of θ0\theta_{0} is given by α0𝐚r(θ0)𝐚tH(θ0)𝐱\alpha_{0}\mathbf{a}_{r}\left(\theta_{0}\right)\mathbf{a}_{t}^{H}\left(\theta_{0}\right)\mathbf{x}, where α0\alpha_{0} denotes the complex amplitude of the target. Similarly, the interference from clutters at angles {θi}i=1I\{\theta_{i}\}_{i=1}^{I} is given by i=1Iαi𝐚r(θi)𝐚tH(θi)𝐱\sum_{i=1}^{I}\alpha_{i}\mathbf{a}_{r}\left(\theta_{i}\right)\mathbf{a}_{t}^{H}\left(\theta_{i}\right)\mathbf{x}, where {αi}i=1I\{\alpha_{i}\}_{i=1}^{I} denote the complex amplitudes of the clutters. The residual SI is 𝐇SI𝐱\mathbf{H}_{\mathrm{SI}}\mathbf{x}, where 𝐇SINr×Nt\mathbf{H}_{\mathrm{SI}}\in\mathbb{C}^{N_{r}\times N_{t}} denotes the residual SI channel between the transmit and receive antennas at the BS. Integrating the interference from D2D-TXs, the received signal at the BS is given by

𝐲r=α0𝐚r(θ0)𝐚tH(θ0)𝐱Target  reflecting+i=1Iαi𝐚r(θi)𝐚tH(θi)𝐱Clutter  reflecting+m=1Mpm𝐡m,BSTXsmD2DInterference from D2D-TXs+𝐇SI𝐱SI+𝐧rNoise\begin{split}\mathbf{y}_{r}&=\underbrace{\alpha_{0}\mathbf{a}_{r}\left(\theta_{0}\right)\mathbf{a}_{t}^{H}\left(\theta_{0}\right)\mathbf{x}}_{\text{Target~{} reflecting}}+\underbrace{\sum_{i=1}^{I}\alpha_{i}\mathbf{a}_{r}\left(\theta_{i}\right)\mathbf{a}_{t}^{H}\left(\theta_{i}\right)\mathbf{x}}_{\text{Clutter~{} reflecting}}\\ &~{}~{}~{}~{}~{}~{}+\underbrace{\sum_{m=1}^{M}\sqrt{p_{m}}\mathbf{h}_{m,\text{BS}}^{\text{TX}}s_{m}^{\text{D2D}}}_{\text{Interference~{}from~{}D2D}\small{\text{-}}\mathrm{TXs}}+\underbrace{\mathbf{H}_{\mathrm{SI}}\mathbf{x}}_{\text{SI}}+\underbrace{\mathbf{n}_{r}}_{\text{Noise}}\end{split} (8)

where 𝐡m,BSTX\mathbf{h}_{m,\text{BS}}^{\text{TX}} denotes the channel coefficient between D2D-TXm and BS, 𝐧r𝒞𝒩(0,σr2𝐈Nr)\mathbf{n}_{r}\sim\mathcal{CN}(0,\sigma_{r}^{2}\mathbf{I}_{N_{r}}) denotes the additive white Gaussian noise, and 𝐈NrNr×Nr\mathbf{I}_{N_{r}}\in\mathbb{R}^{N_{r}\times N_{r}} is the identity matrix. With a receive beamformer 𝐮Nr×1\mathbf{u}\in\mathbb{C}^{N_{r}\times 1} at the BS, we have

yr=𝐮H𝐲r=α0𝐮H𝐚r(θ0)𝐚tH(θ0)𝐱+𝐮Hi=1Iαi𝐚r(θi)𝐚tH(θi)𝐱+𝐮Hm=1Mpm𝐡m,BSTXsm+𝐮H𝐇SI𝐱+𝐮H𝐧r.\begin{split}y_{r}&=\mathbf{u}^{H}\mathbf{y}_{r}\\ &=\alpha_{0}\mathbf{u}^{H}\mathbf{a}_{r}\left(\theta_{0}\right)\mathbf{a}_{t}^{H}\left(\theta_{0}\right)\mathbf{x}+\mathbf{u}^{H}\sum_{i=1}^{I}\alpha_{i}\mathbf{a}_{r}\left(\theta_{i}\right)\mathbf{a}_{t}^{H}\left(\theta_{i}\right)\mathbf{x}\\ &~{}~{}~{}~{}~{}~{}+\mathbf{u}^{H}\sum_{m=1}^{M}\sqrt{p_{m}}\mathbf{h}_{m,\text{BS}}^{\text{TX}}s_{m}+\mathbf{u}^{H}\mathbf{H}_{\text{SI}}\mathbf{x}+\mathbf{u}^{H}\mathbf{n}_{r}.\end{split} (9)

Denote αi𝐚r(θi)𝐚tH(θi)\alpha_{i}\mathbf{a}_{r}\left(\theta_{i}\right)\mathbf{a}_{t}^{H}\left(\theta_{i}\right) as 𝐀(αi;θi)\mathbf{A}(\alpha_{i};\theta_{i}), and let 𝐁=i=1I𝐀(αi;θi)+𝐇SI\mathbf{B}=\sum_{i=1}^{I}\mathbf{A}(\alpha_{i};\theta_{i})+\mathbf{H}_{\mathrm{SI}}. According to [12], the SINR of radar sensing is given by

SINRr=𝔼{|𝐮H𝐀(α0;θ0)𝐱|2}𝔼{|𝐮H𝐁𝐱|2}+m=1M𝔼{|pm𝐮H𝐡m,BSTXsm|2}+𝔼{|𝐮H𝐧r|2}.\begin{split}&\mathrm{SINR}_{r}\\ &=\frac{\mathbb{E}\{|\mathbf{u}^{H}\mathbf{A}(\alpha_{0};\theta_{0})\mathbf{x}|^{2}\}}{\mathbb{E}\{|\mathbf{u}^{H}\mathbf{B}\mathbf{x}|^{2}\}+\sum\limits_{m=1}^{M}\mathbb{E}\{|\sqrt{p_{m}}\mathbf{u}^{H}\mathbf{h}_{m,\text{BS}}^{\text{TX}}s_{m}|^{2}\}+\mathbb{E}\{|\mathbf{u}^{H}\mathbf{n}_{r}|^{2}\}}.\\ \end{split} (10)

By letting

𝐅=𝔼{𝐱𝐱H}=k=1K𝐰k𝐰kH,\mathbf{F}=\mathbb{E}\left\{\mathbf{xx}^{H}\right\}=\sum_{k=1}^{K}\mathbf{w}_{k}\mathbf{w}_{k}^{H}, (11)

SINRr\mathrm{SINR}_{r} can be rewritten as

SINRr=𝐮H𝐀(α0;θ0)𝐅𝐀H(α0;θ0)𝐮𝐮H(𝐁𝐅𝐁H+m=1Mpm𝐡m,BSTX(𝐡m,BSTX)H+σr2𝐈Nr)𝐮.\begin{split}\mathrm{SINR}_{r}=\frac{\mathbf{u}^{H}\mathbf{A}(\alpha_{0};\theta_{0})\mathbf{F}\mathbf{A}^{H}(\alpha_{0};\theta_{0})\mathbf{u}}{\mathbf{u}^{H}\left(\mathbf{B}\mathbf{F}\mathbf{B}^{H}+\sum\limits_{m=1}^{M}p_{m}\mathbf{h}_{m,\text{BS}}^{\text{TX}}(\mathbf{h}_{m,\text{BS}}^{\text{TX}})^{H}+\sigma_{r}^{2}\mathbf{I}_{N_{r}}\right)\mathbf{u}}.\end{split} (12)

II-C Problem Formulation

An optimization problem is formulated to maximize the sum rate of CU and D2D by jointly optimizing the transmit beamforming vectors {𝐰k}k=1K\{\mathbf{w}_{k}\}_{k=1}^{K} at the BS, the receive beamforming vector 𝐮\mathbf{u}, and the power of D2D-TXs {pm}m=1M\{p_{m}\}_{m=1}^{M}, considering the constrains on power consumption at the BS and D2D transmitters and the SINR requirement on target detection.

Use PBSP_{\mathrm{BS}} and PmP_{m} to denote the maximum transmit power of the BS and D2D-TXm, respectively. Accordingly, we can formulate the sum rate maximization problem as

max𝐰k,𝐮,pm\displaystyle\underset{\mathbf{w}_{k},\mathbf{u},p_{m}}{\text{max}} k=1KCkCU+m=1MCmD2D\displaystyle\sum_{k=1}^{K}C_{k}^{\text{CU}}+\sum_{m=1}^{M}C_{m}^{\text{D2D}} (13a)
s.t. SINRrγr\displaystyle~{}\mathrm{SINR}_{r}\geq\gamma_{r} (13b)
k=1K𝐰k2PBS\displaystyle\sum_{k=1}^{K}\|\mathbf{w}_{k}\|^{2}\leq P_{\mathrm{BS}} (13c)
0pmPm,m.\displaystyle 0\leq p_{m}\leq P_{m},\forall m. (13d)

The global optimal solution to (13) is intractable due to the following reasons: 1) The transmit beamformers {𝐰k}k=1K\{\mathbf{w}_{k}\}_{k=1}^{K}, the transmit power of D2D-TXm\text{D2D-TX}_{m}, i.e., {pm}m=1M\{p_{m}\}_{m=1}^{M}, and receive beamformer 𝐮\mathbf{u} are coupled in the constraint (13b); 2) The objective function (13a) is non-convex. Given this, solving (13) is a challenging issue.

III Proposed Method

III-A SCA-based Optimization

III-A1 Optimization of 𝐮\mathbf{u}

Through examining the problem (13), the receive beamforming vector 𝐮\mathbf{u} only exists in radar SINR constraint (13b). Therefore, it is reasonable to maximize the radar SINR concerning 𝐮\mathbf{u} to provide more freedom for optimizing other variables. The radar SINR maximization problem can be formulated as

max𝐮𝐮H𝐀(α0;θ0)𝐅𝐀H(α0;θ0)𝐮𝐮H𝐆𝐮\displaystyle\underset{\mathbf{u}}{\max}~{}~{}\frac{\mathbf{u}^{H}\mathbf{A}(\alpha_{0};\theta_{0})\mathbf{F}\mathbf{A}^{H}(\alpha_{0};\theta_{0})\mathbf{u}}{\mathbf{u}^{H}\mathbf{G}\mathbf{u}} (14)

where

𝐆=𝐁𝐅𝐁H+m=1Mpm𝐡m,BSTX(𝐡m,BSTX)H+σr2𝐈Nr.\mathbf{G}=\mathbf{B}\mathbf{F}\mathbf{B}^{H}+\sum_{m=1}^{M}p_{m}\mathbf{h}_{m,\text{BS}}^{\text{TX}}(\mathbf{h}_{m,\text{BS}}^{\text{TX}})^{H}+\sigma_{r}^{2}\mathbf{I}_{N_{r}}. (15)
Lemma 1

The close-form expression of the optimal 𝐮\mathbf{u} is given by

𝐮=𝐆1𝐚r(θ0)𝐚rH(θ0)𝐆1𝐚r(θ0).\displaystyle\mathbf{u}^{*}=\frac{\mathbf{G}^{-1}\mathbf{a}_{r}\left(\theta_{0}\right)}{\mathbf{a}_{r}^{H}\left(\theta_{0}\right)\mathbf{G}^{-1}\mathbf{a}_{r}\left(\theta_{0}\right)}. (16)
Proof 1

See Appendix A.

Substituting 𝐮\mathbf{u}^{*} into (13b) gives

SINRr=|α0|2𝐚tH(θ0)𝐅𝐚t(θ0)𝐚rH(θ0)𝐆1𝐚r(θ0).\displaystyle\mathrm{SINR}_{r}^{\ast}=|\alpha_{0}|^{2}\mathbf{a}_{t}^{H}\left(\theta_{0}\right)\mathbf{F}\mathbf{a}_{t}\left(\theta_{0}\right)\mathbf{a}_{r}^{H}\left(\theta_{0}\right)\mathbf{G}^{-1}\mathbf{a}_{r}\left(\theta_{0}\right). (17)

III-A2 Optimization of 𝐰k\mathbf{w}_{k} and pmp_{m}

Replacing (13b) with SINRrγr\mathrm{SINR}_{r}^{*}\geq\gamma_{r} and introducing an auxiliary variable

𝐖k=𝐰k𝐰kH,\mathbf{W}_{k}=\mathbf{w}_{k}\mathbf{w}_{k}^{H}, (18)

Problem (13) can be reformulated as

min𝐖k,pmk=1Klog2(1+SINRkCU)m=1Mlog2(1+SINRmD2D)\displaystyle\underset{\mathbf{W}_{k},p_{m}}{\text{min}}-\sum_{k=1}^{K}\mathrm{log}_{2}\left(1+\mathrm{SINR}_{k}^{\text{CU}}\right)-\sum_{m=1}^{M}\log_{2}\left(1+\mathrm{SINR}_{m}^{\text{D2D}}\right) (19a)
s.t.|α0|2𝐚tH(θ0)𝐅𝐚t(θ0)𝐚rH(θ0)𝐆1𝐚r(θ0)γr\displaystyle~{}\text{s.t.}~{}~{}|\alpha_{0}|^{2}\mathbf{a}_{t}^{H}\left(\theta_{0}\right)\mathbf{F}\mathbf{a}_{t}\left(\theta_{0}\right)\mathbf{a}_{r}^{H}\left(\theta_{0}\right)\mathbf{G}^{-1}\mathbf{a}_{r}\left(\theta_{0}\right)\geq\gamma_{r} (19b)
k=1KTr(𝐖k)PBS\displaystyle~{}~{}~{}~{}~{}~{}~{}\sum_{k=1}^{K}\text{Tr}\left(\mathbf{W}_{k}\right)\leq P_{\mathrm{BS}} (19c)
0pmPm,m\displaystyle~{}~{}~{}~{}~{}~{}~{}0\leq p_{m}\leq P_{m},\forall m (19d)
𝐖k𝟎,k\displaystyle~{}~{}~{}~{}~{}~{}~{}\mathbf{W}_{k}\succeq\mathbf{0},\forall k (19e)
rank(𝐖k)=1,k.\displaystyle~{}~{}~{}~{}~{}~{}~{}\mathrm{rank}(\mathbf{W}_{k})=1,\forall k. (19f)

where 𝐅\mathbf{F}, SINRkCU\mathrm{SINR}_{k}^{\text{CU}} and SINRmD2D\mathrm{SINR}_{m}^{\text{D2D}} can be rewritten as the functions of 𝐖k\mathbf{W}_{k} rather than 𝐰k\mathbf{w}_{k}. In other words,

𝐅=k=1K𝐖k,\mathbf{F}=\sum_{k=1}^{K}\mathbf{W}_{k}, (20)
SINRkCU=𝐡BS,kH𝐖k𝐡BS,kkk𝐡BS,kH𝐖k𝐡BS,k+m=1Mpm|hm,kTX|2+σk2,\displaystyle\mathrm{SINR}_{k}^{\text{CU}}=\frac{\mathbf{h}_{\text{BS},k}^{H}\mathbf{W}_{k}\mathbf{h}_{\text{BS},k}}{\sum\limits_{\forall k^{\prime}\neq k}\mathbf{h}_{\text{BS},k}^{H}\mathbf{W}_{k^{\prime}}\mathbf{h}_{\text{BS},k}+\sum\limits_{m=1}^{M}p_{m}\left|h_{m,k}^{\text{TX}}\right|^{2}+\sigma_{k}^{2}}, (21)
SINRmD2D=pm|hm,mTX|2𝐡BS,mH𝐅𝐡BS,m+mmpm|hm,mTX|2+σm2.\displaystyle\mathrm{SINR}_{m}^{\text{D2D}}=\frac{p_{m}\left|h_{m,m}^{\text{TX}}\right|^{2}}{\mathbf{h}_{\text{BS},m}^{H}\mathbf{F}\mathbf{h}_{\text{BS},m}+\sum\limits_{\forall m^{\prime}\neq m}p_{m^{\prime}}\left|h_{m^{\prime},m}^{\text{TX}}\right|^{2}+\sigma_{m}^{2}}. (22)

Problem (19) is still a non-convex problem due to the object function, the constraint (19b), and the rank one constraint (19f).

We rewrite (19b) as

γr|α0|2(𝐚tH(θ0)𝐅𝐚t(θ0))1𝐚rH(θ0)𝐆1𝐚r(θ0)0.\displaystyle\frac{\gamma_{r}}{|\alpha_{0}|^{2}}\left(\mathbf{a}_{t}^{H}\left(\theta_{0}\right)\mathbf{F}\mathbf{a}_{t}\left(\theta_{0}\right)\right)^{-1}-\mathbf{a}_{r}^{H}\left(\theta_{0}\right)\mathbf{G}^{-1}\mathbf{a}_{r}\left(\theta_{0}\right)\leq 0. (23)

Let

φ=𝐚tH(θ0)𝐅𝐚t(θ0).\varphi=\mathbf{a}_{t}^{H}\left(\theta_{0}\right)\mathbf{F}\mathbf{a}_{t}\left(\theta_{0}\right). (24)

and we can obtain that φ0\varphi\geq 0 since 𝐅𝟎\mathbf{F}\succeq\mathbf{0}. Moreover, it can also be obtained that φ\varphi is a linear function concerning 𝐖k\mathbf{W}_{k}. Therefore, (𝐚tH(θ0)𝐅𝐚t(θ0))1\left(\mathbf{a}_{t}^{H}\left(\theta_{0}\right)\mathbf{F}\mathbf{a}_{t}\left(\theta_{0}\right)\right)^{-1} is convex with respect to 𝐖k\mathbf{W}_{k}. Similarly, we can also obtain that 𝐚rH(θ0)𝐆1𝐚r(θ0)\mathbf{a}_{r}^{H}\left(\theta_{0}\right)\mathbf{G}^{-1}\mathbf{a}_{r}\left(\theta_{0}\right) in (23) is a convex function with respect to 𝐖k\mathbf{W}_{k} and pmp_{m} [31]. Thus, (23) is a difference-of-convex (DC) constraint.

We employ SCA to convert the DC constraint (23) into a convex constraint. Let

f(𝐆)=𝐚rH(θ0)𝐆1𝐚r(θ0)f(\mathbf{G})=\mathbf{a}_{r}^{H}\left(\theta_{0}\right)\mathbf{G}^{-1}\mathbf{a}_{r}\left(\theta_{0}\right) (25)

and 𝐆(t1)\mathbf{G}^{(t-1)} be the solution at the (t1)(t-1)th iteration of the SCA. The first-order approximation of Taylor expansion about f(𝐆)f(\mathbf{G}) at around 𝐆(t1)\mathbf{G}^{(t-1)} is given by

f(𝐆)f~(𝐆)=𝐚rH(θ0)(𝐆(t1))1𝐚r(θ0)\displaystyle f(\mathbf{G})\approx\widetilde{f}(\mathbf{G})=\mathbf{a}_{r}^{H}\left(\theta_{0}\right)\left(\mathbf{G}^{{}^{(t-1)}}\right)^{-1}\mathbf{a}_{r}\left(\theta_{0}\right) (26)
𝐚rH(θ0)(𝐆(t1))1(𝐆𝐆(t1))(𝐆(t1))1𝐚r(θ0)\displaystyle-\mathbf{a}_{r}^{H}\left(\theta_{0}\right)\left(\mathbf{G}^{{}^{(t-1)}}\right)^{-1}\left(\mathbf{G}-\mathbf{G}^{(t-1)}\right)\left(\mathbf{G}^{{}^{(t-1)}}\right)^{-1}\mathbf{a}_{r}\left(\theta_{0}\right)

which is a linear function with respect to 𝐖k\mathbf{W}_{k} and pmp_{m}. Hence,

γr|α0|2(𝐚tH(θ0)𝐅𝐚t(θ0))1f~(𝐆)0\frac{\gamma_{r}}{|\alpha_{0}|^{2}}\left(\mathbf{a}_{t}^{H}\left(\theta_{0}\right)\mathbf{F}\mathbf{a}_{t}\left(\theta_{0}\right)\right)^{-1}-\widetilde{f}(\mathbf{G})\leq 0 (27)

is a convex constraint. Moreover, we can obtain that

f~(𝐆)f(𝐆).\displaystyle\widetilde{f}(\mathbf{G})\leq f(\mathbf{G}). (28)

Thus, the feasible domain of (27) is a subset of the feasible domain of (23).

Next, we deal with the objective function (19a). The expression of the communication rate of the kkth CU CkCUC_{k}^{\text{CU}} can be rewritten as

CkCU\displaystyle-C_{k}^{\text{CU}} =log2(1+SINRkCU)\displaystyle=-\mathrm{log}_{2}\left(1+\mathrm{SINR}_{k}^{\text{CU}}\right) (29)
=log2(𝐡BS,kH𝐅𝐡BS,k+m=1Mpm|hm,kTX|2+σk2)\displaystyle=-\mathrm{log}_{2}\left(\mathbf{h}_{\text{BS},k}^{H}\mathbf{F}\mathbf{h}_{\text{BS},k}+\sum_{m=1}^{M}p_{m}\left|h_{m,k}^{\text{TX}}\right|^{2}+\sigma^{2}_{k}\right)
+log2(kk𝐡BS,kH𝐖k𝐡BS,k+m=1Mpm|hm,kTX|2+σk2)EkCU.\displaystyle+\underbrace{\mathrm{log}_{2}\left(\sum_{\forall k^{\prime}\neq k}\mathbf{h}_{\text{BS},k}^{H}\mathbf{W}_{k^{\prime}}\mathbf{h}_{\text{BS},k}+\sum_{m=1}^{M}p_{m}\left|h_{m,k}^{\text{TX}}\right|^{2}+\sigma^{2}_{k}\right)}_{E_{k}^{\text{CU}}}.

The non-convexity of (29) lies in the second concave term EkCUE_{k}^{\text{CU}}. According to SCA, the first-order approximation of Taylor expansion about EkCUE_{k}^{\text{CU}}, i.e., E~kCU(t)\widetilde{E}_{k}^{\text{CU}}(t) at the ttth iteration is given in (30) at the bottom of the next page. It can be obtained that E~kCU(t)EkCU\widetilde{E}_{k}^{\text{CU}}(t)\geq E_{k}^{\text{CU}}.

Similarly, we can rewrite the expression of communication rate of the mmth D2D pair as

CmD2D\displaystyle-C_{m}^{\text{D2D}} =log2(1+SINRmD2D)\displaystyle=-\mathrm{log}_{2}(1+\mathrm{SINR}_{m}^{\text{D2D}}) (31)
=log2(𝐡BS,mH𝐅𝐡BS,m+m=1Mpm|hm,mTX|2+σm2)\displaystyle=-\log_{2}\left(\mathbf{h}_{\text{BS},m}^{H}\mathbf{F}\mathbf{h}_{\text{BS},m}+\sum_{m^{\prime}=1}^{M}p_{m^{\prime}}\left|h_{m^{\prime},m}^{\text{TX}}\right|^{2}+\sigma^{2}_{m}\right)
+log2(𝐡BS,mH𝐅𝐡BS,m+mmpm|hm,mTX|2+σm2)EmD2D\displaystyle+\underbrace{\log_{2}\left(\mathbf{h}_{\text{BS},m}^{H}\mathbf{F}\mathbf{h}_{\text{BS},m}+\sum_{m^{\prime}\neq m}p_{m^{\prime}}\left|h_{m^{\prime},m}^{\text{TX}}\right|^{2}+\sigma^{2}_{m}\right)}_{E_{m}^{\text{D2D}}}

and the non-convex term EmD2DE_{m}^{\text{D2D}} at the ttth iteration is approximated with the first-order Taylor expansion as in (32), given at the bottom of the next page. It can also be obtained that E~mD2D(t)EmD2D\widetilde{E}_{m}^{\text{D2D}}(t)\geq E_{m}^{\text{D2D}}.

E~kCU(t)\displaystyle\widetilde{E}_{k}^{\text{CU}}(t) =log2(kk𝐡BS,kH𝐖k(t1)𝐡BS,k+m=1Mpm(t1)|hm,kTX|2+σ2)\displaystyle=\log_{2}\left(\sum_{k^{\prime}\neq k}\mathbf{h}_{\text{BS},k}^{H}\mathbf{W}_{k^{\prime}}^{(t-1)}\mathbf{h}_{\text{BS},k}+\sum_{m=1}^{M}p_{m}^{(t-1)}\left|h_{m,k}^{\text{TX}}\right|^{2}+\sigma^{2}\right) (30)
+kkTr(𝐡BS,k𝐡BS,kH(𝐖k𝐖k(t1)))+m=1M|hm,kTX|2(pmpm(t1))ln2(kk𝐡BS,kH𝐖k(t1)𝐡BS,k+m=1Mpm(t1)|hm,kTX|2+σ2)\displaystyle~{}~{}~{}~{}~{}~{}+\frac{\sum\limits_{k^{\prime}\neq k}\text{Tr}\Big{(}\mathbf{h}_{\text{BS},k}\mathbf{h}_{\text{BS},k}^{H}\Big{(}\mathbf{W}_{k^{\prime}}-\mathbf{W}_{k^{\prime}}^{(t-1)}\Big{)}\Big{)}+\sum\limits_{m=1}^{M}\left|{h}_{m,k}^{\text{TX}}\right|^{2}\left({p}_{m}-{p}_{m}^{(t-1)}\right)}{\ln 2\left(\sum\limits_{k^{\prime}\neq k}\mathbf{h}_{\text{BS},k}^{H}\mathbf{W}_{k^{\prime}}^{(t-1)}\mathbf{h}_{\text{BS},k}+\sum\limits_{m=1}^{M}p_{m}^{(t-1)}\left|h_{m,k}^{\text{TX}}\right|^{2}+\sigma^{2}\right)}
E~mD2D(t)\displaystyle\widetilde{E}_{m}^{\text{D2D}}(t) =log2(k=1K𝐡BS,mH𝐖k(t1)𝐡BS,m+mmpm(t1)|hm,mTX|2+σ2)\displaystyle=\log_{2}\left(\sum_{k=1}^{K}\mathbf{h}_{\text{BS},m}^{H}\mathbf{W}_{k}^{(t-1)}\mathbf{h}_{\text{BS},m}+\sum_{m^{\prime}\neq m}p_{m^{\prime}}^{(t-1)}\left|h_{m^{\prime},m}^{\text{TX}}\right|^{2}+\sigma^{2}\right) (32)
+k=1KTr(𝐡BS,m𝐡BS,mH(𝐖k𝐖k(t1)))+mm|hm,mTX|2(pmpm(t1))ln2(k=1K𝐡BS,mH𝐖k(t1)𝐡BS,m+mmpm(t1)|hm,mTX|2+σ2)\displaystyle~{}~{}~{}~{}~{}~{}+\frac{\sum\limits_{k=1}^{K}\text{Tr}\Big{(}\mathbf{h}_{\text{BS},m}\mathbf{h}_{\text{BS},m}^{H}\Big{(}\mathbf{W}_{k}-\mathbf{W}_{k}^{(t-1)}\Big{)}\Big{)}+\sum\limits_{m^{\prime}\neq m}\left|{h}_{m^{\prime},m}^{\text{TX}}\right|^{2}\left({p}_{m^{\prime}}-{p}_{m^{\prime}}^{(t-1)}\right)}{\ln 2\left(\sum\limits_{k=1}^{K}\mathbf{h}_{\text{BS},m}^{H}\mathbf{W}_{k}^{(t-1)}\mathbf{h}_{\text{BS},m}+\sum\limits_{m^{\prime}\neq m}p_{m^{\prime}}^{(t-1)}\left|h_{m^{\prime},m}^{\text{TX}}\right|^{2}+\sigma^{2}\right)}

Therefore, we have the upper bounds C~kCU(t)-\widetilde{C}_{k}^{\text{CU}}(t) and C~mD2D(t)-\widetilde{C}_{m}^{\text{D2D}}(t) for CkCU-C_{k}^{\text{CU}} and CmD2D-C_{m}^{\text{D2D}}, respectively, where

C~kCU(t)=\displaystyle-\widetilde{C}_{k}^{\text{CU}}(t)= log2(𝐡BS,kH𝐅𝐡BS,k+m=1Mpm|hm,kTX|2+σ2)\displaystyle-\mathrm{log}_{2}\left(\mathbf{h}_{\text{BS},k}^{H}\mathbf{F}\mathbf{h}_{\text{BS},k}+\sum_{m=1}^{M}p_{m}\left|h_{m,k}^{\text{TX}}\right|^{2}+\sigma^{2}\right) (33)
+E~kCU(t).\displaystyle~{}~{}~{}~{}+\widetilde{E}_{k}^{\text{CU}}(t).

and

C~mD2D(t)=\displaystyle-\widetilde{C}_{m}^{\text{D2D}}(t)= log2(𝐡BS,mH𝐅𝐡BS,m+m=1Mpm|hm,mTX|2+σ2)\displaystyle-\log_{2}\left(\mathbf{h}_{\text{BS},m}^{H}\mathbf{F}\mathbf{h}_{\text{BS},m}+\sum_{m^{\prime}=1}^{M}p_{m^{\prime}}\left|h_{m^{\prime},m}^{\text{TX}}\right|^{2}+\sigma^{2}\right) (34)
+E~mD2D(t).\displaystyle~{}~{}~{}~{}+\widetilde{E}_{m}^{\text{D2D}}(t).

After omitting the rank-one constraint (19f), we have the SCA-based optimization problem at the ttth iteration as

min𝐖k,pm\displaystyle\underset{\mathbf{W}_{k},p_{m}}{\text{min}} k=1KC~kCU(t)m=1MC~mD2D(t)\displaystyle-\sum_{k=1}^{K}\widetilde{C}_{k}^{\text{CU}}(t)-\sum_{m=1}^{M}\widetilde{C}_{m}^{\text{D2D}}(t) (35a)
s.t. γr|α0|2(𝐚tH(θ0)𝐅𝐚t(θ0))1f~(𝐆)0\displaystyle\frac{\gamma_{r}}{|\alpha_{0}|^{2}}\left(\mathbf{a}_{t}^{H}\left(\theta_{0}\right)\mathbf{F}\mathbf{a}_{t}\left(\theta_{0}\right)\right)^{-1}-\widetilde{f}(\mathbf{G})\leq 0 (35b)
k=1KTr(𝐖k)PBS\displaystyle\sum_{k=1}^{K}\text{Tr}\left(\mathbf{W}_{k}\right)\leq P_{\mathrm{BS}} (35c)
0pmPm,m.\displaystyle 0\leq p_{m}\leq P_{m},\forall m. (35d)
𝐖k𝟎,k\displaystyle\mathbf{W}_{k}\succeq\mathbf{0},\forall k (35e)

which is a convex problem, and can be solved with convex optimization tools such as CVX. The beamforming vector 𝐰k\mathbf{w}_{k} can be obtained through 𝐖k\mathbf{W}_{k} with eigenvalue decomposition (EVD) or the Gaussian randomization method [33].

III-B Analysis of Convergence and Complexity

Firstly, we analyze the convergence of the SCA-based optimization of (35). Denote the objective function of (35) at the ttth iteration by opt1(𝐖k(t),pm(t))opt_{1}\left(\mathbf{W}_{k}^{(t)},p_{m}^{(t)}\right), where {𝐖k(t),pm(t)}\left\{\mathbf{W}_{k}^{(t)},p_{m}^{(t)}\right\} denotes the optimal solution at the ttth iteration. In SCA, the optimal solution {𝐖k(t1),pm(t1)}\left\{\mathbf{W}_{k}^{(t-1)},p_{m}^{(t-1)}\right\} at the (t1)(t-1)th iteration is also a feasible solution at the ttth iteration [34]. Therefore, it can be obtained that opt1(𝐖k(t),pm(t))opt1(𝐖k(t1),pm(t1))opt_{1}\left(\mathbf{W}_{k}^{(t)},p_{m}^{(t)}\right)\leq opt_{1}\left(\mathbf{W}_{k}^{(t-1)},p_{m}^{(t-1)}\right). Moreover, the objective function of (35) has a lower bound, leading to the convergence of the SCA-based optimization.

Now we analyse the complexity. According to [35], the worst-case complexity for solving a mix semidefinite and second-order cone programming problem is

μ(li=1Nsoc(niSOC)2+l2i=1Nsd(nisd)2+li=1Nsd(nisd)3+l3)×ln1/ϵ\begin{split}\sqrt{\mu}\left(l\sum_{i=1}^{N_{\mathrm{soc}}}\left(n_{i}^{\mathrm{SOC}}\right)^{2}+l^{2}\sum_{i=1}^{N_{\mathrm{sd}}}\left(n_{i}^{\mathrm{sd}}\right)^{2}+l\sum_{i=1}^{N_{\mathrm{sd}}}\left(n_{i}^{\mathrm{sd}}\right)^{3}+l^{3}\right)\\ \times\ln{1/\epsilon}\end{split} (36)

where ll is the number of variables, NsocN_{\mathrm{soc}} and NsdN_{\mathrm{sd}} are the number of second-order cone and semidefinite constraints, and niSOCn_{i}^{\mathrm{SOC}} and nisdn_{i}^{\mathrm{sd}} are the dimensions of the iith second-order and semidefinite cones, μ=i=1Nsdnisd+2Nsoc\mu=\sum_{i=1}^{N_{\mathrm{sd}}}n_{i}^{\mathrm{sd}}+2N_{\mathrm{soc}} is the barrier parameter, and ϵ>0\epsilon>0 is the solution precision.

The main complexity of each iteration lies in solving a semidefinite programming problem (35). For (35), there are total l=KNt2+Ml=KN_{t}^{2}+M variables, 2M+12M+1 semidefinite constraints of size 1, KK semidefinite constraints of size NtN_{t}, and 11 semidefinite constraint of size 2. Considering I0I_{0} iterations, the complexity of the SCA-based optimization for (35) is 𝒪(I0(2M+3+KNt)[(KNt2+M)2(5+2M+KNt2)+(KNt2+M)(9+2M+KNt3)+(KNt2+M)3])\mathcal{O}\bigg{(}I_{0}\sqrt{(2M+3+KN_{t})}\big{[}(KN_{t}^{2}+M)^{2}(5+2M+KN_{t}^{2})+(KN_{t}^{2}+M)(9+2M+KN_{t}^{3})+(KN_{t}^{2}+M)^{3}\big{]}\bigg{)} with I0I_{0} iterations.

IV Numerical Results

In this section, we provide extensive numerical results to validate the effectiveness of the proposed ISAC design in a D2D underlaid cellular network. In the simulations, the numbers of transmit antennas and receive antennas at the SB are set to Nt=Nr=32N_{t}=N_{r}=32. A target of interest is located at θ0=0\theta_{0}=0^{\circ}, and two clutters are located at θ1=50\theta_{1}=-50^{\circ} and θ2=40\theta_{2}=40^{\circ}. The noise power at CUs, D2D receivers, and the BS are set to σk2=σm2=σr2=90dBm\sigma_{k}^{2}=\sigma_{m}^{2}=\sigma_{r}^{2}=-90\mathrm{dBm} [7], and the channel power gains of target and clutters are set to |α0|2=10σr2|\alpha_{0}|^{2}=10\sigma_{r}^{2} and |α1|2=|α2|2=103σr2|\alpha_{1}|^{2}=|\alpha_{2}|^{2}=10^{3}\sigma_{r}^{2} [36], respectively. The (i,j)(i,j)th element in residual SI channel coefficient matrix (𝐇SI)i,j=βi,jexpj2πdi,j/λ(\mathbf{H}_{\mathrm{SI}})_{i,j}=\sqrt{\beta_{i,j}}\exp^{-j2\pi d_{i,j}/\lambda}, where βi,j\beta_{i,j} denotes the residual SI channel power, di,jd_{i,j} denotes the distance between the iith transmit antenna and the jjth receive antenna. We let βi,j=130dB\beta_{i,j}=-130\mathrm{dB}, and model the expj2πdi,j/λ\exp^{-j2\pi d_{i,j}/\lambda} as a random variable with unit power and random phase [37]. Additionally, we establish a two-dimensional Cartesian coordinates with the BS at the origin point, and we use a tuple (θ,d)(\theta,d) to represent the direction and distance information of CUs, D2D-TXs, and D2D-RXs, where θ\theta denotes the angle and dd denotes the distance between the users and the BS. Assume that the BS serves K=2K=2 CUs located at (75,50m)(-75^{\circ},50\text{m}) and (20,60m)(20^{\circ},60\text{m}). Let M=2M=2 pairs {{\big{\{}\{D2D-TXm,D2D-RX}m}m=1,2{}_{m}\}\big{\}}_{m=1,2} where D2D-RX1 is randomly deployed within the range of θ[40,30],d[70m,80m]\theta\in\left[-40^{\circ},-30^{\circ}\right],d\in[70\text{m},80\text{m}] and D2D-RX2 within θ[65,75],d[70m,80m]\theta\in\left[65^{\circ},75^{\circ}\right],d\in\left[70\text{m},80\text{m}\right]. The distance between D2D-RXm and D2D-TXm is 2020m. Fig. 2 shows the visualization of the system geometry.

According to [12] and [38], the channel coefficients are given as follows: 𝐡BS,k=ε0dBS,kνNt𝐚t(θk)\mathbf{h}_{\text{BS},k}=\sqrt{\varepsilon_{0}d_{\text{BS},k}^{-\nu}}\sqrt{N_{t}}\mathbf{a}_{t}(\theta_{k}), 𝐡BS,m=ε0dBS,mνNt𝐚t(θm)\mathbf{h}_{\text{BS},m}=\sqrt{\varepsilon_{0}d_{BS,m}^{-\nu}}\sqrt{N_{t}}\mathbf{a}_{t}(\theta_{m}), 𝐡m,BSTX=ε0dm,BSνNr𝐚r(θm)\mathbf{h}_{m,\text{BS}}^{\text{TX}}=\sqrt{\varepsilon_{0}d_{m,\text{BS}}^{-\nu}}\sqrt{N_{r}}\mathbf{a}_{r}(\theta_{m}), hm,mTX=ε0dm,mνh_{m,m}^{\text{TX}}=\sqrt{\varepsilon_{0}d_{m,m}^{-\nu}}, hm,mTX=ε0dm,mνh_{m^{\prime},m}^{\text{TX}}=\sqrt{\varepsilon_{0}d_{m^{\prime},m}^{-\nu}}, hm,kTX=ε0dm,kνh_{m,k}^{\text{TX}}=\sqrt{\varepsilon_{0}d_{m,k}^{-\nu}}, where dBS,kd_{\text{BS},k} denotes the distance between the BS and the kkth CU, dm,BSd_{m,\text{BS}} is the distance between D2D-TXm and the BS, dm,md_{m^{\prime},m} is the distance between {\{D2D-TX}mmm{}_{m^{\prime}}\}_{m^{\prime}\neq m} and D2D-RXm, dm,kd_{m,k} is the distance between the D2D-TXm and the kkth CU, ε0\varepsilon_{0} denotes the path loss at a reference distance of one meter and is set to ε0=30dB\varepsilon_{0}=-30\mathrm{dB}, and ν\nu denotes path loss exponent and set to ν=3\nu=3.

We compare the proposed ISAC scheme with four benchmark schemes: Communication-only scheme, sensing-only scheme, the maximal ratio transmission (MRT) scheme[39] and the zero forcing (ZF) scheme[40].

1) Communication-only scheme: This scheme concentrates on designing a communication-oriented system without taking radar sensing into consideration. Accordingly, a communication-oriented optimization problem is constructed for comparing the ISAC scheme. Specifically, the communication-only optimization problems is formulated by removing the radar SINR constraint while maintaining the same objective functions as those in (19). This benchmark scheme aids in evaluating the impact of integrating radar sensing functionality.

2) Sensing-only scheme: In contrast to the communication-only scheme, the sensing-only scheme emphasizes a sensing-oriented system design and disregards the communication functionality. For formulating the sensing-only optimization problem compared with (19), the radar SINR maximization problem is considered with constraints on the transmit power of the BS and D2D-TXs, which is given by

max𝐰k,𝐮,pm\displaystyle\underset{\mathbf{w}_{k},\mathbf{u},p_{m}}{\mathrm{max}} 𝐮H𝐀(θ0)𝐅𝐀H(θ0)𝐮𝐮H(𝐁𝐅𝐁H+σr2𝐈Nr)𝐮\displaystyle\frac{\mathbf{u}^{H}\mathbf{A}(\theta_{0})\mathbf{F}\mathbf{A}^{H}(\theta_{0})\mathbf{u}}{\mathbf{u}^{H}\left(\mathbf{B}\mathbf{F}\mathbf{B}^{H}+\sigma_{r}^{2}\mathbf{I}_{N_{r}}\right)\mathbf{u}} (37a)
s.t. k=1K𝐰k2PBS;\displaystyle\sum_{k=1}^{K}\|\mathbf{w}_{k}\|^{2}\leq P_{\mathrm{BS}}; (37b)
0pmPm,m;\displaystyle 0\leq p_{m}\leq P_{m},\forall m; (37c)

The corresponding solution can be referred to [41] or the fractional programming (FP) [42]. This benchmark scheme can help us evaluate the impact of integrating communication functionality.

3) MRT scheme: The MRT scheme aims to maximize the desired signal strength of the CUs, where the beamforming vector 𝐰k\mathbf{w}_{k} is given by

𝐰k=Pk𝐡BS,k𝐡BS,k2.\mathbf{w}_{k}=\sqrt{P_{k}}\dfrac{\mathbf{h}_{\text{BS},k}}{\|\mathbf{h}_{\text{BS},k}\|_{2}}. (38)

4) ZF scheme: In ZF scheme, the beamforming vector 𝐰k\mathbf{w}_{k} is forced to lie in the null space of channels {𝐡BS,m}m=1M\{\mathbf{h}_{\text{BS},m}\}_{m=1}^{M} and {𝐡BS,k}kk\{\mathbf{h}_{\text{BS},k}\}_{k^{\prime}\neq k}. The beamforming vector 𝐰k\mathbf{w}_{k} is given by

𝐰k=Pk𝒫𝐇k𝐡BS,k𝒫𝐇k𝐡BS,k2\mathbf{w}_{k}=\sqrt{P_{k}}\dfrac{\mathcal{P}_{\mathbf{H}_{k}}^{\perp}\mathbf{h}_{\text{BS},k}}{\|\mathcal{P}_{\mathbf{H}_{k}}^{\perp}\mathbf{h}_{\text{BS},k}\|_{2}} (39)

where 𝒫𝐇k=𝐈Nt𝐇k(𝐇kH𝐇k)1𝐇kH\mathcal{P}_{\mathbf{H}_{k}}^{\perp}=\mathbf{I}_{N_{t}}-\mathbf{H}_{k}(\mathbf{H}_{k}^{H}\mathbf{H}_{k})^{-1}\mathbf{H}_{k}^{H} denotes the orthogonal projector of 𝐇k\mathbf{H}_{k}, with 𝐇kNt×(M+K1)\mathbf{H}_{k}\in\mathbb{C}^{N_{t}\times(M+K-1)} containing the channel vectors {𝐡BS,m}m=1M\{\mathbf{h}_{\text{BS},m}\}_{m=1}^{M} and {𝐡BS,k}kk\{\mathbf{h}_{\text{BS},k}\}_{k^{\prime}\neq k} stacked in the columns.

Refer to caption

Figure 2: System geometry.
TABLE I: Ratio of Rank-one Solutions of 𝐖k\mathbf{W}_{k}, k=1,2k=1,2
𝐖1\mathbf{W}_{1} 𝐖2\mathbf{W}_{2}
Proposed scheme 99.2% 99.7%

The rank one constraints on 𝐖k\mathbf{W}_{k} have been omitted in the SCA-based iterations, and we evaluate the ratio of rank-one solutions of 𝐖k\mathbf{W}_{k} in the iterations. In the simulations, the radar SINR takes value randomly in a range, i.e., γr[10,20]dB\gamma_{r}\in[10,20]\text{dB}, the maximum transmit power of D2D-TXs Pm[0.7,20]dBmP_{m}\in[0.7,20]\text{dBm}, and the maximum transmit power of the BS is also randomly selected, i.e., PBS[20,120]dBmP_{\text{BS}}\in[20,120]\text{dBm}. We regard 𝐖k\mathbf{W}_{k} as a rank one solution if its eigenvalues satisfy λlar/λsec>105\lambda_{\mathrm{lar}}/\lambda_{\mathrm{sec}}>10^{5}, where λlar\lambda_{\mathrm{lar}} and λsec\lambda_{\mathrm{sec}} denote the largest eigenvalue and the second largest eigenvalue of 𝐖k\mathbf{W}_{k}, respectively. We collect all 𝐖k\mathbf{W}_{k}s (k=1,2k=1,2) in the iterations with 2 CUs and 2 D2D pairs. Table I presents the ratios of rank-one solutions in the iterations in solving (35). It shows that the rank-one solution ratio of 𝐖k\mathbf{W}_{k} exceeds 99.2%99.2\%.

Refer to caption

Figure 3: Convergence performance of the proposed scheme.

Fig. 3 evaluates the convergence of the SCA-based algorithm for the proposed scheme with 2 CUs and 2 D2D pairs. Both 1616 (Nt=16N_{t}=16, Nr=16N_{r}=16) and 3232 (Nt=32N_{t}=32, Nr=32N_{r}=32) antennas at the BS are considered. It shows that the SCA-based algorithm converges after only 55 iterations.

Refer to caption

Figure 4: Sum rate at different SINR thresholds of radar sensing.

Next, we evaluate sum rate and the SINR of radar sensing for various schemes. Fig. 4 shows the sum rate at different radar SINR thresholds γr\gamma_{r} with γm=γk=15dB\gamma_{m}=\gamma_{k}=15\mathrm{dB}. It can be observed that integrating radar functionality into communication experiences slight performance loss compared with the communication-only scheme. Moreover, the proposed scheme significantly outperforms the communication oriented schemes MRT and ZF. Specifically, when γr=10\gamma_{r}=10dB, The proposed scheme achieves almost the same sum rate as the communication only scheme, and the sum rate of the proposed scheme is 3.653.65bps/Hz higher than ZF scheme when K=2K=2 and M=2M=2. It is mainly because neither of the MRT and ZF schemes has the mechanism of suppressing interferences and strengthening the desired signal simultaneously.

Refer to caption

Figure 5: Sum rate versus maximum power constraints of BS and D2D-TXs.

Refer to caption

Figure 6: SINR for radar sensing of various schemes.

Refer to caption

Figure 7: Radar SINR of various schemes at different SINR thresholds of D2D communication γm\gamma_{m} and CU communication γk\gamma_{k}.

Fig. 5 shows the sum rate at different maximum power constraints of the BS PBSP_{\mathrm{BS}} and D2D transmitters PmP_{m}. It can be observed that the sum rate increases with PBSP_{\mathrm{BS}} and PmP_{m}, and allocating more power to the BS leads to quicker increase of the sum rate than allocating power to D2D transmitters. It can also be seen that the proposed scheme outperforms the MRT and ZF schemes. The minimal gap between the proposed scheme and ZF is above 3.23.2bps/Hz, and the gaps between the proposed scheme and MRT are more pronounced. Moreover, the gap between the proposed scheme and the communication-only scheme is small, implying that radar sensing can be effectively integrated into the communication system with slight performance loss in sum rate.

Fig. 6 shows the SINR of radar sensing for different schemes. The radar SINR of the proposed scheme equals the required γr\gamma_{r}, while MRT and ZF have constant radar SINR at different γr\gamma_{r}. This is because MRT and ZF employ fixed power allocation strategy. It can be seen from Figs. 4 and 6 that our proposed scheme outperforms MRT and ZF in both sum rate (communication) and radar SINR (sensing). Fig. 7 shows the radar SINR at different maximum power constraints of the BS PBSP_{\mathrm{BS}} and D2D transmitters PmP_{m}. Again, we can see that our proposed scheme achieves higher radar SINR than MRT and ZF.

Refer to caption
Figure 8: Transmit beampattern p1(θ)p_{1}(\theta), receive beampattern p2(θ)p_{2}(\theta) and combined beampattern p3(θ)p_{3}(\theta) at the BS.

Finally, we evaluate the beampatterns at the BS when γr=15dB\gamma_{r}=15\mathrm{dB}, PBS=30P_{\text{BS}}=30mW, and Pm=10P_{m}=10mW. Fig. 8 shows the transmit beampattern p1(θ)p_{1}(\theta), the receive beampattern p2(θ)p_{2}(\theta), and the combined beampattern p3(θ)p_{3}(\theta) where

p1(θ)=𝔼(|𝐚tH(θ)𝐱|2),p_{1}(\theta)=\mathbb{E}\left(\left|\mathbf{a}_{t}^{H}(\theta)\mathbf{x}\right|^{2}\right), (40)
p2(θ)=|𝐮H𝐚r(θ)|2𝐮H𝐮,p_{2}(\theta)=\dfrac{\left|\mathbf{u}^{H}\mathbf{a}_{r}(\theta)\right|^{2}}{\mathbf{u}^{H}\mathbf{u}}, (41)
p3(θ)=𝔼(|𝐮H𝐚r(θ)𝐚tH(θ)𝐱|2)𝐮H𝐮.p_{3}(\theta)=\dfrac{\mathbb{E}\left(\left|\mathbf{u}^{H}\mathbf{a}_{r}(\theta)\mathbf{a}_{t}^{H}(\theta)\mathbf{x}\right|^{2}\right)}{\mathbf{u}^{H}\mathbf{u}}. (42)

It is observed from the transmit beampattern p1(θ)p_{1}(\theta) in Fig. 8 that the sensing-only scheme focuses the power on the target rather than the CUs, and the communication-only scheme focuses on only the CUs, while the proposed scheme focuses on both the target and CUs. Moreover, both the proposed scheme and the communication-only scheme have null steering beam at D2D-Rxs, reducing the interferences from the BS to the D2D communications. However, the sensing-only scheme may interfere D2D communications significantly. Next we examine the receive beampattern p2(θ)p_{2}(\theta) in Fig. 8 of the proposed and sensing-only schemes. Note that the communication-only scheme has no receive beampattern. It can be seen from the receive beampattern p2(θ)p_{2}(\theta) that the proposed scheme has better suppressing null beam from the angles of clusters and the D2D-Txs than the sensing-only scheme. The combined beampattern p3(θ)p_{3}(\theta) shows that the proposed scheme can effectively suppress the interferences between the BS and D2D users, clusters and focus the power of target and CUs.

V Conclusion

This work has investigated joint transceiver beamformer design and power allocation in an ISAC-enabled D2D underlaid cellular network, where the full-duplex BS performs the radar sensing and downlink CU communication, and D2D pairs engage in direct communication in the same time-frequency resource. A sum rate maximization problem is formulated to improve the spectral efficiency. Accordingly, an SCA-based algorithm is proposed to solve the optimization problem. Extensive numerical results demonstrate that the proposed scheme can achieve satisfactory performance for radar sensing, CU and D2D communications, compared with the state-of-art schemes.

-A Proof of Lemma 1

The numerator of (14) can be equivalently transformed into 𝐚tH𝐅𝐚t|𝐮H𝐚r|2\mathbf{a}_{t}^{H}\mathbf{F}\mathbf{a}_{t}|\mathbf{u}^{H}\mathbf{a}_{r}|^{2}, and (14) can be rewritten as

max𝐮|𝐮H𝐚r(θ0)|2𝐮H𝐆𝐮\displaystyle\underset{\mathbf{u}}{\mathrm{max}}~{}~{}\frac{|\mathbf{u}^{H}\mathbf{a}_{r}(\theta_{0})|^{2}}{\mathbf{u}^{H}\mathbf{G}\mathbf{u}} (43)

As scaling 𝐮\mathbf{u} with an arbitrary constant will not change the objective function value, we place a constraint 𝐮H𝐚r=1\mathbf{u}^{H}\mathbf{a}_{r}=1. Therefore, problem (43) can be recast as a minimum variance distortionless response (MVDR) problem as

min𝐮\displaystyle\underset{\mathbf{u}}{\mathrm{min}}{}{} 𝐮H𝐆𝐮,\displaystyle\mathbf{u}^{H}\mathbf{G}\mathbf{u}, (44)
s.t. 𝐮H𝐚r(θ0)=1.\displaystyle\mathbf{u}^{H}\mathbf{a}_{r}(\theta_{0})=1.

The Lagrangian function of problem (44) is given by

(𝐮;λ)=𝐮H𝐆𝐮+λ(𝐮H𝐚r(θ0)1)\displaystyle\mathcal{L}\left(\mathbf{u};\lambda\right)=\mathbf{u}^{H}\mathbf{G}\mathbf{u}+\lambda\left(\mathbf{u}^{H}\mathbf{a}_{r}(\theta_{0})-1\right) (45)

where λ\lambda denotes the lagrange multiplier. According to the Karush-Kuhn-Tucker (KKT) condition, the optimal solution should satisfy 𝐮=𝟎\frac{\partial\mathcal{L}}{\partial\mathbf{u}}=\mathbf{0} and 𝐮H𝐚r(θ0)=1\mathbf{u}^{H}\mathbf{a}_{r}(\theta_{0})=1. Thus, 𝐮\mathbf{u} is given by

𝐮=𝐆1𝐚r(θ0)𝐚rH(θ0)𝐆1𝐚r(θ0).\displaystyle\mathbf{u}=\frac{\mathbf{G}^{-1}\mathbf{a}_{r}(\theta_{0})}{\mathbf{a}_{r}^{H}(\theta_{0})\mathbf{G}^{-1}\mathbf{a}_{r}(\theta_{0})}. (46)

References

  • [1] F. Liu et al., “Integrated sensing and communications: Toward dual-functional wireless networks for 6G and beyond,” IEEE J. Sel. Areas Commun., vol. 40, no. 6, pp. 1728–1767, June 2022.
  • [2] X. Fang, W. Feng, Y. Chen, N. Ge and Y. Zhang, “Joint communication and sensing toward 6G: Models and potential of using MIMO,” IEEE Internet Things J., vol. 10, no. 5, pp. 4093–4116, 1 Mar., 2023.
  • [3] J. A. Zhang et al., “An overview of signal processing techniques for joint communication and radar sensing,” IEEE J. Sel. Topics Signal Process., vol. 15, no. 6, pp. 1295–1315, Nov. 2021.
  • [4] Z. He, W. Xu, H. Shen, Y. Huang and H. Xiao, “Energy efficient beamforming optimization for integrated sensing and communication,” IEEE Wireless Commun. Lett., vol. 11, no. 7, pp. 1374–1378, July 2022.
  • [5] Z. Wang, Y. Liu, X. Mu, Z. Ding and O. A. Dobre, “NOMA empowered integrated sensing and communication,” IEEE Commun. Lett., vol. 26, no. 3, pp. 677–681, Mar. 2022.
  • [6] J. Li, G. Zhou, T. Gong and N. Liu, “Beamforming design for active IRS-aided MIMO integrated sensing and communication systems,” IEEE Wireless Commun. Lett., vol. 12, no. 10, pp. 1786–1790, Oct. 2023.
  • [7] M. Hua, Q. Wu, W. Chen, O. A. Dobre and A. Lee Swindlehurst, “Secure intelligent reflecting surface aided integrated sensing and communication,” IEEE Trans. Wireless Commun., vol. 23, no. 1, pp. 575–591, Jan. 2024.
  • [8] 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 Commun. Lett., vol. 11, no. 11, pp. 2260–2264, Nov. 2022.
  • [9] X. Liu, T. Huang, N. Shlezinger, Y. Liu, J. Zhou and Y. C. Eldar, ”Joint transmit beamforming for multiuser MIMO communications and MIMO radar,” IEEE Trans. Signal Process., vol. 68, pp. 3929–3944, 2020.
  • [10] Z. Ren, L. Qiu, J. Xu and D. W. K. Ng, “Robust transmit beamforming for secure integrated sensing and communication,” IEEE Trans. Commun., vol. 71, no. 9, pp. 5549–5564, Sept. 2023.
  • [11] M. Ashraf, B. Tan, D. Moltchanov, J. S. Thompson and M. Valkama, “Joint optimization of radar and communications performance in 6G cellular systems,” IEEE Trans. Green Commun. Netw., vol. 7, no. 1, pp. 522–536, March 2023.
  • [12] 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 J. Sel. Areas Commun., vol. 41, no. 9, pp. 2920–2936, Sept. 2023.
  • [13] Z. Liu, S. Aditya, H. Li and B. Clerckx, “Joint transmit and receive beamforming design in full-duplex integrated sensing and communications,” IEEE J. Sel. Areas Commun., vol. 41, no. 9, pp. 2907–2919, Sept. 2023.
  • [14] J. Chu, R. Liu, M. Li, Y. Liu and Q. Liu, “Joint secure transmit beamforming designs for integrated sensing and communication systems,” IEEE Trans. Veh. Technol., vol. 72, no. 4, pp. 4778–4791, Apr. 2023.
  • [15] M. Lee, G. Yu and G. Y. Li, “Graph embedding based wireless link scheduling with few training samples”, IEEE Trans. Wireless Commun., vol. 20, no. 4, pp. 2282–2294, Apr. 2021.
  • [16] S. S. Christensen, R. Agarwal, E. De Carvalho, and J. M. Cioffi, “Weighted sum-rate maximization using weighted MMSE for MIMO–BC beamforming design,” IEEE Trans. Wireless Commun., vol. 7, no. 12, pp. 4792–4799, Dec. 2008.
  • [17] Q. Shi, M. Razaviyayn, Z. -Q. Luo and C. He, “An iteratively weighted MMSE approach to distributed sum-utility maximization for a MIMO interfering broadcast channel,” IEEE Trans. Signal Process., vol. 59, no. 9, pp. 4331–4340, Sept. 2011.
  • [18] T. Chen, X. Zhang, M. You, G. Zheng and S. Lambotharan, “A GNN-based supervised learning framework for resource allocation in wireless IoT networks,” IEEE Internet Things J., vol. 9, no. 3, pp. 1712–1724, Feb. 2022.
  • [19] Y. Gu, C. She, Z. Quan, C. Qiu and X. Xu, “Graph neural networks for distributed power allocation in wireless networks: Aggregation over-the-air,” IEEE Trans. Wireless Commun., vol. 22, no. 11, pp. 7551–7564, Nov. 2023.
  • [20] X. Li, J. Zhang and X. Liu, “Mode selection and resource allocation for D2D communications with tradeoff of throughput and user satisfaction,” IEEE Trans. Commun., vol. 71, no. 9, pp. 5607–5620, Sept. 2023.
  • [21] V. Vishnoi, I. Budhiraja, S. Gupta and N. Kumar, “A deep reinforcement learning scheme for sum rate and fairness maximization among D2D pairs underlaying cellular network with NOMA,” IEEE Trans. Veh. Technol., vol. 72, no. 10, pp. 13506–13522, Oct. 2023.
  • [22] H. Xiao, D. Zhu and A. T. Chronopoulos, “Power allocation with energy efficiency optimization in cellular D2D-based V2X communication network,” IEEE Trans. Intell. Transp. Syst., vol. 21, no. 12, pp. 4947–4957, Dec. 2020.
  • [23] Z. Yang, N. Huang, H. Xu, Y. Pan, Y. Li and M. Chen, “Downlink resource allocation and power control for device-to-device communication underlaying cellular networks,” IEEE Commun. Lett., vol. 20, no. 7, pp. 1449–1452, Jul. 2016.
  • [24] N. Du, C. Zhou, H. Shen, C. Chakraborty, J. Yang and K. Yu, ”A novel power allocation algorithm for minimizing energy consumption in D2D communication systems,” IEEE Syst. J., vol. 17, no. 3, pp. 4969–4977, Sept. 2023.
  • [25] J. Cheng, C. Shen, Z. Chen and N. Pappas, “Robust beamforming design for IRS-aided URLLC in D2D networks,” IEEE Trans. Commun., vol. 70, no. 9, pp. 6035–6049, Sept. 2022.
  • [26] M. Lin, J. Ouyang and W. -P. Zhu, “Joint beamforming and power control for device-to-device communications underlaying cellular networks,” IEEE J. Sel. Areas Commun., vol. 34, no. 1, pp. 138–150, Jan. 2016.
  • [27] W. Wang, L. Yang, A. Meng, Y. Zhan and D. W. K. Ng, “Resource allocation for IRS-aided JP-CoMP downlink cellular networks with underlaying D2D communications,” IEEE Trans. Wireless Commun., vol. 21, no. 6, pp. 4295–4309, June 2022.
  • [28] B. O¨\ddot{\text{O}}ezbek, M. Pischella and D. Le Ruyet, “Energy efficient resource allocation for underlaying multi-D2D enabled multiple-antennas communications,” IEEE Trans. Veh. Technol., vol. 69, no. 6, pp. 6189–6199, June 2020.
  • [29] Y. Chen et al., “Sub-channel allocation for full-duplex access and device-to-device links underlaying heterogeneous cellular networks using coalition formation games,” IEEE Trans. Veh. Technol., vol. 69, no. 9, pp. 9736–9749, Sept. 2020.
  • [30] C. Wen, Y. Huang and T. N. Davidson, ”Efficient transceiver design for MIMO dual-function radar-communication systems,” IEEE Trans. Signal Process., vol. 71, pp. 1786–1801, 2023.
  • [31] S. Boyd and L. Vandenberghe, Convex optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
  • [32] M. Grant and S. Boyd, “CVX: MATLAB software for disciplined convex programming”, Version 2.1. Accessed: Dec. 2018. [Online]. Available: http://cvxr.com/cvx
  • [33] Z.-Q. Luo, W.-K. Ma, A. M.-C. So, Y. Ye and S. Zhang, “Semidefinite relaxation of quadratic optimization problems,” IEEE Signal Process. Mag., vol. 27, no. 3, pp. 20–34, May 2010.
  • [34] A. Beck, A. Ben-Tal, and L. Tetruashvili, “A sequential parametric convex approximation method with applications to nonconvex truss topology design problems,” J. Global Optim., vol. 47, no. 1, pp. 29–51, May 2010.
  • [35] Q. Qi, Y. Li and Q. Guo, “A bias-reduced solution for multistatic localization using differential delays and doppler shifts,” IEEE Trans. Aerosp. Electron. Syst., vol. 59, no. 5, pp. 5120–5133, Oct. 2023.
  • [36] C. G. Tsinos, A. Arora, S. Chatzinotas and B. Ottersten, “Joint transmit waveform and receive filter design for dual-function radar-communication systems,” IEEE J. Sel. Topics Signal Process., vol. 15, no. 6, pp. 1378–1392, Nov. 2021.
  • [37] M. Temiz, E. Alsusa and M. W. Baidas, “A dual-function massive MIMO uplink OFDM communication and radar architecture,” IEEE Trans. Cogn. Commun. Netw., vol. 8, no. 2, pp. 750–762, June 2022.
  • [38] S.-H. Park and X. Jin, “Joint secure design of downlink and D2D cooperation strategies for multi-user systems,” IEEE Signal Process. Lett., vol. 28, pp. 917–921, 2021.
  • [39] Q. Wu and R. Zhang, “Intelligent reflecting surface enhanced wireless network via joint active and passive beamforming,” IEEE Trans. Wireless Commun., vol. 18, no. 11, pp. 5394–5409, Nov. 2019.
  • [40] Z. Lin et al., “Pain without gain: Destructive beamforming from a malicious RIS perspective in IoT networks,” IEEE Internet Things J., vol. 11, no. 5, pp. 7619–7629, Mar. 2024.
  • [41] L. Wu, P. Babu and D. P. Palomar, “Transmit waveform/receive filter design for MIMO radar with multiple waveform constraints,” IEEE Trans. Signal Process., vol. 66, no. 6, pp. 1526–1540, Mar. 2018.
  • [42] N. Su, F. Liu, Z. Wei, Y. -F. Liu and C. Masouros, ”Secure dual-functional radar-communication transmission: Exploiting interference for resilience against target eavesdropping,” IEEE Trans. Wireless Commun., vol. 21, no. 9, pp. 7238–7252, Sept. 2022.