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

Multi-Functional Reconfigurable Intelligent Surface: System Modeling and Performance Optimization

Wen Wang, Wanli Ni,  Hui Tian, 
Yonina C. Eldar,  and Rui Zhang
The work of Hui Tian was supported by the National Key R&D Program of China under Grant No. 2020YFB1807800. The work of Wen Wang was supported by the Beijing University of Posts and Telecommunications (BUPT) Excellent Ph.D. Students Foundation under Grant CX2022103, and the China Scholarship Council. This work was presented in part at the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Rhodes Island, Greece, 2023, pp. 1-5, doi: 10.1109/ICASSP49357.2023.10096886. (Corresponding author: Hui Tian.)W. Wang, W. Ni, and H. Tian are with the State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China (e-mail:{wen.wang, charleswall, tianhui}@bupt.edu.cn). Y. C. Eldar is with the Math and CS Faculty, Weizmann Institute of Science, Rehovot 7610001, Israel (e-mail: [email protected]).R. Zhang is with School of Science and Engineering, Shenzhen Research Institute of Big Data, The Chinese University of Hong Kong, Shenzhen, Guangdong 518172, China (e-mail: [email protected]). He is also with the Department of Electrical and Computer Engineering, National University of Singapore, Singapore 117583 (e-mail: [email protected]).
Abstract

In this paper, we propose and study a multi-functional reconfigurable intelligent surface (MF-RIS) architecture. In contrast to conventional single-functional RIS (SF-RIS) that only reflects signals, the proposed MF-RIS simultaneously supports multiple functions with one surface, including reflection, refraction, amplification, and energy harvesting of wireless signals. As such, the proposed MF-RIS is capable of significantly enhancing RIS signal coverage by amplifying the signal reflected/refracted by the RIS with the energy harvested. We present the signal model of the proposed MF-RIS, and formulate an optimization problem to maximize the sum-rate of multiple users in an MF-RIS-aided non-orthogonal multiple access network. We jointly optimize the transmit beamforming, power allocations as well as the operating modes and parameters for different elements of the MF-RIS and its deployment location, via an efficient iterative algorithm. Simulation results are provided which show significant performance gains of the MF-RIS over SF-RISs with only some of its functions available. Moreover, we demonstrate that there exists a fundamental trade-off between sum-rate maximization and harvested energy maximization. In contrast to SF-RISs which can be deployed near either the transmitter or receiver, the proposed MF-RIS should be deployed closer to the transmitter for maximizing its communication throughput with more energy harvested.

Index Terms:
Multi-functional RIS, non-orthogonal multiple access, throughput maximization, energy harvesting, RIS deployment.

I Introduction

Reconfigurable intelligent surfaces (RISs) or intelligent reflecting surfaces (IRSs) have emerged as a promising paradigm for future communication networks, due to their merits in improving energy-efficiency and spectrum-efficiency in a low-cost manner[1, 2]. Through modifying the phase shift and/or amplitude of incident signals, RISs are able to establish a tunable communication environment for achieving various objectives, such as throughput maximization [4, 3], security enhancement [5, 6], energy reduction [7], and improved performance fairness [8]. However, due to hardware constraints, conventional single-functional RIS (SF-RIS) only supports signal reflection or refraction/transmission, and thus can only serve users located on one side of a RIS[4, 3]. The half-space coverage issue faced by SF-RIS greatly restricts the flexibility and effectiveness when deploying SF-RISs in wireless networks with randomly distributed users.

To overcome this limitation, the authors of [9, 11, 10] proposed the simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) and intelligent omni-surface (IOS), by supporting signal reflection and refraction with one surface at the same time. Compared to SF-RIS [4, 3, 5, 7, 8, 6], such dual-functional RIS (DF-RIS) [10, 9, 11] is able to create a ubiquitous smart radio environment by providing full-space signal coverage. Moreover, the works [12] and [13] studied the benefits of DF-RIS-aided multi-user communication networks in terms of coverage extension and security enhancement, respectively. However, due to the fact that the signal reflected/refracted by the RIS is attenuated twice, the signal path loss can be severe for both SF- and DF-RISs.

With the aim of combating the double attenuation faced by existing passive RISs, recent works such as [14] and [15] proposed an active RIS architecture by embedding power amplifiers into conventional SF-RISs. The theoretical and simulation results in [16] and [17] show that by properly designing the phase shift and amplification factors, active RISs yield significant spectrum efficiency gains compared to passive RISs. In addition, the authors of [18] proposed dynamic metasurface antennas (DMAs), which enable different levels of amplification and phase shift on incident signals. However, both active RISs and DMAs require additional energy consumption to maintain the operation of active components, which makes their performance highly dependent on the availability of external power supply. In practice, the aforementioned RIS architectures are powered by battery or the grid[1, 2]. For battery-powered RISs, embedded batteries only provide limited lifetime and cannot support long-term operation. Replacing the battery of RISs manually may be costly and impractical[19]. The deployment locations of grid-powered RISs are limited because not all places are reachable with power line networks[21, 20]. Therefore, it is important to develop RIS architectures that are capable of self-sustainability while maintaining the performance advantages of state-of-the-art RISs.

TABLE I: Comparison of the proposed MF-RIS with SF- and DF-RIS
[Uncaptioned image]

In this paper, we propose a new multi-functional RIS (MF-RIS) architecture aiming to overcome the aforementioned drawbacks faced by existing RISs, such as half-space coverage, double attenuation, and reliance on battery/grid. Specifically, the proposed MF-RIS utilizes the energy harvested from radio-frequency (RF) signals to support the simultaneous reflection, refraction/transmission, and amplification of incident signals. In Table I, we compare existing SF- and DF-RIS with the proposed MF-RIS in terms of signal propagation model and design metrics. It can be seen that the DF-RISs only partially address the challenges that limit the flexibility and effectiveness of SF-RISs. In contrast, the proposed MF-RIS is able to achieve full-space coverage and path loss mitigation in a self-sustainable manner, thereby providing efficient and uninterrupted communication services to users in the whole space. By allowing all the elements to flexibly switch between different operating modes, MF-RIS offers more degrees of freedom (DoFs) for signal manipulation.

To validate the throughput performance improvement when applying MF-RIS in wireless networks, we investigate a sum-rate maximization problem in an MF-RIS-aided non-orthogonal multiple access (NOMA) network. The combination of NOMA and MF-RIS is envisioned as a practically appealing strategy. NOMA enables flexible and efficient resource allocation for MF-RIS assisted multi-user networks by serving multiple users within the same resource block. Meanwhile, MF-RIS facilitates the implementation of NOMA by constructing favorable channels for NOMA. The main contributions of this paper are summarized as follows:

  • We propose an MF-RIS architecture with multiple functions such as signal reflection, refraction, amplification, and energy harvesting.

  • We formulate an optimization problem to maximize the sum-rate of multiple users in an MF-RIS-aided NOMA network by jointly optimizing the transmit beamforming, power allocations as well as the operating modes and parameters for different elements of the MF-RIS and its deployment location. This problem is a mixed-integer non-linear programming (MINLP) problem. We propose an alternating optimization (AO)-based algorithm to find a suboptimal solution efficiently.

  • Extensive simulation results are provided which show that: 1) compared to the conventional passive RIS and self-sustainable RIS, the proposed MF-RIS attains 23.423.4% and 98.898.8% sum-rate gains under the same total power budget, respectively; 2) due to the limited number of RIS elements, there exists a fundamental trade-off between sum-rate maximization and energy harvesting performance for the MF-RIS; 3) the proposed MF-RIS should be deployed closer to the transmitter for maximizing its communication throughput with more energy harvested.

The rest of this paper is organized as follows. Section II provides the operation design and signal model of MF-RIS. Section III presents the system model and problem formulation of an MF-RIS-aided NOMA network. The resulting MINLP problem is solved in Section IV. Numerical results are presented in Section V, followed by conclusions in Section VI.

II Operation Design and Signal Model of MF-RIS

In this section, we first introduce the operation mechanism of the proposed MF-RIS. Then, we present the signal model of MF-RIS-aided wireless communications.

Refer to caption
Figure 1: A schematic diagram of the proposed MF-RIS.

II-A Operation Design

As shown in Fig. 1, each element of the MF-RIS can operate in two modes: energy harvesting mode (H mode) and signal relay mode (S mode). By flexibly adjusting the circuit connection, each element can switch between the H mode and S mode. The elements operating in H mode harvest RF energy from the incident signal, and convert it to direct current (DC) power for supporting the operation of the MF-RIS. The energy harvesting circuit contains the following components[22, 23]:

  • An impedance matching network consisting of a factor resonator is invoked to guarantee maximum power transmission from the element to the rectifier block.

  • An RF-DC conversion circuit rectifies the available RF power into DC voltage.

  • Capacitors are used to deliver the current to the energy storage device, or as a short-term reserve when RF energy is unavailable.

  • A power management block decides whether to store the converted electricity energy or use it immediately for signal reflection, refraction, and amplification.

  • Energy storage devices (e.g., rechargeable batteries and super capacitors) are used to store energy. Whenever the harvested energy exceeds consumption, any excess is stored for future use, thus achieving self-sustainability.

For other elements operating in S mode, the incident signals are divided into two parts by manipulating the electric and magnetic currents. One part is reflected to the reflection half-space and the other is refracted to the other refraction half-space. With the aid of a microcontroller unit, these elements leverage the harvested energy to sustain the operation of phase-shifting and amplifier circuits. Therefore, the proposed MF-RIS does not need any external power supply in principle. The schematic diagrams of the reflection and refraction amplifiers are also shown in Fig. 1, where the operational amplifier-based current-inverting converters are used to generate the reflected and refracted signals with desired amplification. Regarding practical implementation of MF-RIS, there have been many research contributions on the prototype design of signal reflection[24], refraction[25, 26], amplification[15, 27], and wireless power transfer[28, 29, 30, 31]. These existing prototypes can be used to implement the proposed MF-RIS.

II-B Signal Model

To characterize the signal model of MF-RIS, we consider an MF-RIS with MM elements, indexed by ={1,2,,M}\mathcal{M}=\{1,2,\cdots,M\}. Let sms_{m} denote the signal received by the mm-th element. Each element cannot simultaneously work in both H and S modes. The signals harvested, reflected, and refracted by the mm-th element are modeled as ymh=(1αm)smy_{m}^{h}=(1-\alpha_{m})s_{m}, ymr=αmβmrejθmrsmy_{m}^{r}=\alpha_{m}\sqrt{\beta_{m}^{r}}e^{j\theta_{m}^{r}}s_{m}, and ymt=αmβmtejθmtsmy_{m}^{t}=\alpha_{m}\sqrt{\beta_{m}^{t}}e^{j\theta_{m}^{t}}s_{m}, respectively, where αm{0,1}\alpha_{m}\in\{0,1\}, θmr,θmt[0,2π)\theta_{m}^{r},\theta_{m}^{t}\in[0,2\pi), and βmr,βmt[0,βmax]\beta_{m}^{r},\beta_{m}^{t}\in\left[0,\beta_{\max}\right] denote the energy harvesting coefficient, the reflective and refractive phase shifts, and the reflective and refractive amplitude coefficients, respectively. Here, αm=1\alpha_{m}=1 implies that the mm-th element operates in S mode, while αm=0\alpha_{m}=0 implies that it works in H mode, and βmax1\beta_{\rm max}\geq 1 denotes the amplification factor. The energy consumed by the amplifier should not exceed the maximum available energy that can be applied by the MF-RIS, i.e., βmr+βmtβmax\beta_{m}^{r}+\beta_{m}^{t}\leq\beta_{\rm max}. The reflective and refractive coefficients are modeled as 𝚯r=diag(α1β1rejθ1r,α2β2rejθ2r,,αMβMrejθMr)\boldsymbol{\Theta}_{r}={\rm{diag}}(\alpha_{1}\sqrt{\beta_{1}^{r}}e^{j\theta_{1}^{r}},\alpha_{2}\sqrt{\beta_{2}^{r}}e^{j\theta_{2}^{r}},\cdots,\alpha_{M}\sqrt{\beta_{M}^{r}}e^{j\theta_{M}^{r}}) and 𝚯t=diag(α1β1tejθ1t,α2β2tejθ2t,,αMβMtejθMt)\boldsymbol{\Theta}_{t}={\rm{diag}}(\alpha_{1}\sqrt{\beta_{1}^{t}}e^{j\theta_{1}^{t}},\alpha_{2}\sqrt{\beta_{2}^{t}}e^{j\theta_{2}^{t}},\cdots,\alpha_{M}\sqrt{\beta_{M}^{t}}e^{j\theta_{M}^{t}}), respectively, where αm{0,1}\alpha_{m}\in\{0,1\}, βmr,βmt[0,βmax]\beta_{m}^{r},\beta_{m}^{t}\in[0,\beta_{\rm max}], βmr+βmtβmax\beta_{m}^{r}+\beta_{m}^{t}\leq\beta_{\rm max}, and θmr,θmt[0,2π)\theta_{m}^{r},\theta_{m}^{t}\in[0,2\pi).

The design variables and constraints for SF-, DF-, and MF-RIS are summarized in Table II. We observe that, SF- and DF-RIS can be regarded as special cases of the proposed MF-RIS. For example, when αm=1\alpha_{m}\!=\!1 and βmax=1\beta_{\rm max}\!=\!1, MF-RIS reduces to the STAR-RIS in [9]; when αm=1\alpha_{m}=1, βmax=1\beta_{\rm max}\!=\!1, βmt=0\beta_{m}^{t}\!=\!0, and θmt=0\theta_{m}^{t}\!=\!0, MF-RIS reduces to the reflecting-only RIS in [1].

TABLE II: Comparison of SF-, DF-, and MF-RIS in terms of design variables
RIS architecture Design variable
Energy harvesting Amplitude coefficient Phase shift
SF-RIS Reflecting-only RIS[1] αm=1\alpha_{m}=1 βmr[0,1]\beta_{m}^{r}\in[0,1] θmr[0,2π)\theta_{m}^{r}\in[0,2\pi)
Transmitting-only RIS[3] αm=1\alpha_{m}=1 βmt[0,1]\beta_{m}^{t}\in[0,1] θmt[0,2π)\theta_{m}^{t}\in[0,2\pi)
DF-RIS STAR-RIS/IOS[9] αm=1\alpha_{m}=1 βmr,βmt[0,1]\beta_{m}^{r},\beta_{m}^{t}\in[0,1] θmr,θmt[0,2π)\theta_{m}^{r},\theta_{m}^{t}\in[0,2\pi)
Active RIS [14] αm=1\alpha_{m}=1 βmr[0,βmax]\beta_{m}^{r}\in[0,\beta_{\rm max}] θmr[0,2π)\theta_{m}^{r}\in[0,2\pi)
Self-sustainable RIS[19] αm{0,1}\alpha_{m}\in\{0,1\} βmr[0,1]\beta_{m}^{r}\in[0,1] θmr[0,2π)\theta_{m}^{r}\in[0,2\pi)
MF-RIS (This work) αm{0,1}\alpha_{m}\in\{0,1\} βmr,βmt[0,βmax]\beta_{m}^{r},\beta_{m}^{t}\in[0,\beta_{\rm max}], βmr+βmtβmax\beta_{m}^{r}+\beta_{m}^{t}\leq\beta_{\rm max} θmr,θmt[0,2π)\theta_{m}^{r},\theta_{m}^{t}\in[0,2\pi)

III System Model and Problem Formulation

III-A Network Model

We consider an MF-RIS assisted downlink NOMA network, where an NN-antenna BS serves JJ single-antenna users with the aid of an MF-RIS consisting of MM elements. We denote the reflection (refraction) spatial direction as rr (tt). The spatial direction set and the user set are denoted by 𝒦={r,t}\mathcal{K}\!=\!\{r,t\} and 𝒥={1,2,,J}\mathcal{J}\!=\!\{1,2,\cdots,J\}, respectively. We denote 𝒥k={1,2,,Jk}\mathcal{J}_{k}\!=\!\{1,2,\cdots,J_{k}\} as the set of users located in direction kk and 𝒥r𝒥t=𝒥\mathcal{J}_{r}\cup\mathcal{J}_{t}\!=\!\mathcal{J}. For notation simplicity, we index user jj in direction kk by UkjU_{kj}. Furthermore, we consider a three-dimensional (3D) Cartesian coordinate system with the locations of the BS, MF-RIS, and user UkjU_{kj} being 𝐰b=[xb,yb,zb]T\mathbf{w}_{b}\!=\![x_{b},y_{b},z_{b}]^{\rm T}, 𝐰=[x,y,z]T\mathbf{w}\!=\![x,y,z]^{\rm T}, and 𝐰kj=[xkj,ykj,0]T\mathbf{w}_{kj}\!=\![x_{kj},y_{kj},0]^{\rm T}, respectively. In practice, due to the limited coverage of MF-RIS, its deployable region is also limited. Denote by 𝒫\mathcal{P} the predefined region for MF-RIS deployment. Then the following constraint should be satisfied:

𝐰𝒫\displaystyle\mathbf{w}\in\mathcal{P} ={[x,y,z]T|xminxxmax,yminyymax,\displaystyle\!\!\!\!\!=\big{\{}\left[x,y,z\right]^{\rm T}|x_{\rm min}\leq x\leq x_{\rm max},y_{\rm min}\leq y\leq y_{\rm max}, (1)
zminzzmax},\displaystyle\!\!\!\!\!\!\!\!\!\!\!\!z_{\rm min}\leq z\leq z_{\rm max}\big{\}},

where [xmin,xmax]\left[x_{\rm min},x_{\rm max}\right], [ymin,ymax]\left[y_{\rm min},y_{\rm max}\right], and [zmin,zmax]\left[z_{\rm min},z_{\rm max}\right] denote the candidate ranges along the XX-, YY- and ZZ-axes, respectively.

To characterize the performance upper bound that can be achieved by MF-RIS, we assume that perfect channel state information of all channels is available. Since the BS and the MF-RIS are usually deployed at relatively high locations, the line-of-sight (LoS) links can be exploited for them. Therefore, similar to existing RIS works[7, 8], we adopt Rician fading for all channels. For instance, the channel matrix 𝐇M×N\mathbf{H}\in\mathbb{C}^{M\times N} between the BS and the MF-RIS is given by

𝐇=h0dbsκ0Lbs(β0β0+1𝐇LoS+1β0+1𝐇NLoS)𝐇^,\displaystyle\mathbf{H}=\underbrace{\sqrt{h_{0}d_{bs}^{-\kappa_{0}}}}_{L_{bs}}\underbrace{\left(\sqrt{\frac{\beta_{0}}{\beta_{0}+1}}\mathbf{H}^{\rm{LoS}}+\sqrt{\frac{1}{\beta_{0}+1}}\mathbf{H}^{\rm{NLoS}}\right)}_{\hat{\mathbf{H}}}, (2)

where LbsL_{bs} is the distance-dependent path loss, and 𝐇^\hat{\mathbf{H}} is composed of the array response and small-scale fading. Specifically, h0h_{0} is the path loss at the reference distance of 1 meter (m), dbsd_{bs} is the link distance between the BS and the MF-RIS, and κ0\kappa_{0} is the corresponding path loss exponent. As for the small-scale fading, β0\beta_{0} is the Rician factor, and 𝐇NLoS\mathbf{H}^{\rm NLoS} is the non-LoS component that follows independent and identically distributed (i.i.d.) Rayleigh fading. Assuming that the MF-RIS is placed parallel to the YZY\!-\!Z plane and its MM elements form an My×Mz=MM_{y}\times M_{z}\!=\!M uniform rectangular array, the LoS component 𝐇LoS\mathbf{H}^{\rm{LoS}} is expressed as[32]

𝐇LoS\displaystyle\mathbf{H}^{\rm{LoS}} =[1,ej2πλdsinφrsinϑr,,ej2πλ(Mz1)dsinφrsinϑr]T\displaystyle\!\!=\!\!\big{[}1,e^{-j\frac{2\pi}{\lambda}d\sin\varphi_{r}\sin\vartheta_{r}},\cdots,e^{-j\frac{2\pi}{\lambda}(M_{z}-1)d\sin\varphi_{r}\sin\vartheta_{r}}\big{]}^{\rm T}
[1,ej2πλdsinφrcosϑr,,ej2πλ(My1)dsinφrcosϑr]T\displaystyle\!\!\otimes\!\!\big{[}1,e^{-j\frac{2\pi}{\lambda}d\sin\varphi_{r}\cos\vartheta_{r}},\cdots,e^{-j\frac{2\pi}{\lambda}(M_{y}-1)d\sin\varphi_{r}\cos\vartheta_{r}}\big{]}^{\rm T}
[1,ej2πλdsinφtcosϑt,,ej2πλ(N1)dsinφtcosϑt],\displaystyle\!\!\otimes\!\!\big{[}1,e^{-j\frac{2\pi}{\lambda}d\sin\varphi_{t}\cos\vartheta_{t}},\cdots,e^{-j\frac{2\pi}{\lambda}(N-1)d\sin\varphi_{t}\cos\vartheta_{t}}\big{]}, (3)

where \otimes denotes the Kronecker product, λ\lambda is the carrier wavelength, and dd is the antenna separation. Here, φr\varphi_{r}, ϑr\vartheta_{r}, φt\varphi_{t}, and ϑt\vartheta_{t} represent the vertical and horizontal angle-of-arrivals, and the vertical and horizontal angle-of-departures of this LoS link, respectively.

The channel vectors from the BS to user UkjU_{kj} and from the MF-RIS to user UkjU_{kj}, denoted by 𝐡kjH1×N\mathbf{h}_{kj}^{\mathrm{H}}\in\mathbb{C}^{1\times N} and 𝐠kjH1×M\mathbf{g}_{kj}^{\mathrm{H}}\in\mathbb{C}^{1\times M}, are generated by a process similar to obtaining 𝐇\mathbf{H}, and are given by

𝐡kj\displaystyle\!\!\!\mathbf{h}_{kj} =h0dbkjκ1Lbkj(β1β1+1𝐡kjLoS+1β1+1𝐡kjNLoS)𝐡^kj,\displaystyle=\underbrace{\sqrt{h_{0}d_{bkj}^{-\kappa_{1}}}}_{L_{bkj}}\underbrace{\left(\sqrt{\frac{\beta_{1}}{\beta_{1}+1}}\mathbf{h}_{kj}^{\rm{LoS}}+\sqrt{\frac{1}{\beta_{1}+1}}\mathbf{h}_{kj}^{\rm{NLoS}}\right)}_{\hat{\mathbf{h}}_{kj}}, (4a)
𝐠kj\displaystyle\!\!\!\mathbf{g}_{kj} =h0dskjκ2Lskj(β2β2+1𝐠kjLoS+1β2+1𝐠kjNLoS)𝐠^kj.\displaystyle=\underbrace{\sqrt{h_{0}d_{skj}^{-\kappa_{2}}}}_{L_{skj}}\underbrace{\left(\sqrt{\frac{\beta_{2}}{\beta_{2}+1}}\mathbf{g}_{kj}^{\rm{LoS}}+\sqrt{\frac{1}{\beta_{2}+1}}\mathbf{g}_{kj}^{\rm{NLoS}}\right)}_{\hat{\mathbf{g}}_{kj}}. (4b)

III-B MF-RIS-Aided Downlink NOMA

Using the NOMA protocol, the BS transmits the superimposed signal by exploiting multiple beamforming vectors, i.e., 𝐬=k𝒦𝐟kj𝒥kpkjskj\mathbf{s}=\sum_{k\in\mathcal{K}}\mathbf{f}_{k}\sum_{j\in\mathcal{J}_{k}}\sqrt{p_{kj}}s_{kj}. Here, 𝐟k\mathbf{f}_{k} is the transmit beamforming vector for direction kk, satisfying k𝒦𝐟k2PBSmax\sum\nolimits_{k\in\mathcal{K}}\lVert\mathbf{f}_{k}\lVert^{2}\leq P_{\rm BS}^{\max}, where PBSmaxP_{\rm BS}^{\max} denotes the maximum transmit power of the BS. Moreover, pkjp_{kj} is the power allocation factor of user UkjU_{kj} with j𝒥kpkj=1\sum_{j\in\mathcal{J}_{k}}p_{kj}=1, and skj𝒞𝒩(0,1)s_{kj}\!\sim\!\mathcal{CN}(0,1) denotes the modulated data symbol, which is independent over kk. Therefore, the signal received at user UkjU_{kj} is given by[33]

ykj=\displaystyle y_{kj}= 𝐡¯kj𝐟kpkjskjdesiredsignal+𝐡¯kj𝐟ki{𝒥k/j}pkiskiintraspaceinterference\displaystyle\underbrace{\bar{\mathbf{h}}_{kj}\mathbf{f}_{k}\sqrt{p_{kj}}s_{kj}}_{\rm desired\ signal}+\underbrace{\bar{\mathbf{h}}_{kj}\mathbf{f}_{k}\sum\nolimits_{i\in\{\mathcal{J}_{k}/j\}}\sqrt{p_{ki}}s_{ki}}_{\rm intra-space\ interference}
+𝐡¯kj𝐟k¯i𝒥k¯pk¯isk¯iinterspaceinterference+𝐠kjH𝚯k𝐧sRISnoise+nkj,\displaystyle+\underbrace{\bar{\mathbf{h}}_{kj}\mathbf{f}_{\bar{k}}\sum\nolimits_{i\in\mathcal{J}_{\bar{k}}}\sqrt{p_{\bar{k}i}}s_{\bar{k}i}}_{\rm inter-space\ interference}+\underbrace{\mathbf{g}_{kj}^{\mathrm{H}}\boldsymbol{\Theta}_{k}\mathbf{n}_{s}}_{\rm RIS\ noise}+n_{kj}, (5)

where k¯=r\bar{k}=r, if k=tk=t; and k¯=t\bar{k}=t, if k=rk=r, 𝐧s𝒞𝒩(𝟎,σs2𝐈M)\mathbf{n}_{s}\sim\mathcal{C}\mathcal{N}(\mathbf{0},\sigma_{s}^{2}\mathbf{I}_{M}) denotes the amplification noise introduced at the MF-RIS with per-element noise power σs2\sigma_{s}^{2}, and nkj𝒞𝒩(0,σu2)n_{kj}\sim\mathcal{C}\mathcal{N}(0,\sigma_{u}^{2}) denotes additive white Gaussian noise (AWGN) at user UkjU_{kj} with power σu2\sigma_{u}^{2}. In addition, 𝐡¯kj=𝐡kjH+𝐠kjH𝚯k𝐇\bar{\mathbf{h}}_{kj}=\mathbf{h}_{kj}^{\rm H}+\mathbf{g}_{kj}^{\rm H}\boldsymbol{\Theta}_{k}\mathbf{H} represents the combined channel vector from the BS to user UkjU_{kj}. For conventional passive RISs, the term 𝐠kjH𝚯k𝐧s\mathbf{g}_{kj}^{\mathrm{H}}\boldsymbol{\Theta}_{k}\mathbf{n}_{s} is negligibly small compared to the AWGN at user UkjU_{kj} and thus usually omitted. However, such noise is amplified by the amplification unit in our considered MF-RIS and thus can no longer be ignored.

Following the NOMA protocol, all users employ successive interference cancellation (SIC) to detect the signal and remove interference[4]. We assume that the users in direction kk are ranked in an ascending order according to the equivalent combined channel gains, expressed as

|𝐡¯kj𝐟k|2pkj|𝐡¯kj𝐟k|2Pkj+|𝐡¯kj𝐟k¯|2+σs2𝐠kjH𝚯k2+σu2\displaystyle\frac{|\bar{\mathbf{h}}_{kj}\mathbf{f}_{k}|^{2}p_{kj}}{|\bar{\mathbf{h}}_{kj}\mathbf{f}_{k}|^{2}P_{kj}+|\bar{\mathbf{h}}_{kj}\mathbf{f}_{\bar{k}}|^{2}+\sigma_{s}^{2}\lVert\mathbf{g}_{kj}^{\mathrm{H}}\boldsymbol{\Theta}_{k}\lVert^{2}+\sigma_{u}^{2}}
|𝐡¯kl𝐟k|2pkj|𝐡¯kl𝐟k|2Pkj+|𝐡¯kl𝐟k¯|2+σs2𝐠klH𝚯k2+σu2,\displaystyle\leq\frac{|\bar{\mathbf{h}}_{kl}\mathbf{f}_{k}|^{2}p_{kj}}{|\bar{\mathbf{h}}_{kl}\mathbf{f}_{k}|^{2}P_{kj}+|\bar{\mathbf{h}}_{kl}\mathbf{f}_{\bar{k}}|^{2}+\sigma_{s}^{2}\lVert\mathbf{g}_{kl}^{\mathrm{H}}\boldsymbol{\Theta}_{k}\lVert^{2}+\sigma_{u}^{2}}, (6)

where k𝒦k\in\mathcal{K}, j𝒥kj\in\mathcal{J}_{k}, lk={j,j+1,,Jk}l\in\mathcal{L}_{k}\!=\!\{j,j+1,\cdots,J_{k}\}, and Pkj=i=j+1JkpkiP_{kj}\!=\!\sum_{i=j+1}^{J_{k}}p_{ki}. The SIC condition in (6) can be equivalently transformed into the following inequality:

|𝐡¯kj𝐟k|2pkj(|𝐡¯kl𝐟k|2Pkj+|𝐡¯kl𝐟k¯|2+σs2𝐠klH𝚯k2+σu2)\displaystyle\!\!\!\!|\bar{\mathbf{h}}_{kj}\mathbf{f}_{k}|^{2}p_{kj}(|\bar{\mathbf{h}}_{kl}\mathbf{f}_{k}|^{2}P_{kj}+|\bar{\mathbf{h}}_{kl}\mathbf{f}_{\bar{k}}|^{2}+\sigma_{s}^{2}\lVert\mathbf{g}_{kl}^{\mathrm{H}}\boldsymbol{\Theta}_{k}\lVert^{2}+\sigma_{u}^{2})
|𝐡¯kl𝐟k|2pkj(|𝐡¯kj𝐟k|2Pkj+|𝐡¯kj𝐟k¯|2+σs2𝐠kjH𝚯k2+σu2).\displaystyle\!\!\!\!\leq\!|\bar{\mathbf{h}}_{kl}\mathbf{f}_{k}|^{2}p_{kj}(|\bar{\mathbf{h}}_{kj}\mathbf{f}_{k}|^{2}P_{kj}\!+\!|\bar{\mathbf{h}}_{kj}\mathbf{f}_{\bar{k}}|^{2}\!+\!\sigma_{s}^{2}\lVert\mathbf{g}_{kj}^{\mathrm{H}}\boldsymbol{\Theta}_{k}\lVert^{2}\!+\!\sigma_{u}^{2}).\!\!\!\! (7)

By subtracting the term pkj|𝐡¯kj𝐟k|2|𝐡¯kl𝐟k|2Pkjp_{kj}|\bar{\mathbf{h}}_{kj}\mathbf{f}_{k}|^{2}|\bar{\mathbf{h}}_{kl}\mathbf{f}_{k}|^{2}P_{kj} from both sides of (7) and dividing by pkjp_{kj}, we obtain the following inequality for all k,j,lk,j,l:

|𝐡¯kj𝐟k|2|𝐡¯kj𝐟k¯|2+σs2𝐠kjH𝚯k2+σu2|𝐡¯kl𝐟k|2|𝐡¯kl𝐟k¯|2+σs2𝐠klH𝚯k2+σu2.\displaystyle\frac{|\bar{\mathbf{h}}_{kj}\mathbf{f}_{k}|^{2}}{|\bar{\mathbf{h}}_{kj}\mathbf{f}_{\bar{k}}|^{2}+\sigma_{s}^{2}\lVert\mathbf{g}_{kj}^{\mathrm{H}}\boldsymbol{\Theta}_{k}\lVert^{2}+\sigma_{u}^{2}}\leq\frac{|\bar{\mathbf{h}}_{kl}\mathbf{f}_{k}|^{2}}{|\bar{\mathbf{h}}_{kl}\mathbf{f}_{\bar{k}}|^{2}+\sigma_{s}^{2}\lVert\mathbf{g}_{kl}^{\mathrm{H}}\boldsymbol{\Theta}_{k}\lVert^{2}+\sigma_{u}^{2}}. (8)

We observe from (8) that the SIC condition is independent of the power allocation coefficients {pkj}\{p_{kj}\}.

Based on (8), for any users UkjU_{kj} and UklU_{kl} satisfying jlj\leq l, the achievable rate for user UklU_{kl} to decode the intended signal of user UkjU_{kj} is given by

Rljk=log2(1+|𝐡¯kl𝐟k|2pkj|𝐡¯kl𝐟k|2Pkj+|𝐡¯kl𝐟k¯|2+σs2𝐠klH𝚯k2+σu2).\displaystyle R_{l\to j}^{k}\!\!=\!\!\log_{2}\left(1\!+\!\frac{|\bar{\mathbf{h}}_{kl}\mathbf{f}_{k}|^{2}p_{kj}}{|\bar{\mathbf{h}}_{kl}\mathbf{f}_{k}|^{2}P_{kj}\!+\!|\bar{\mathbf{h}}_{kl}\mathbf{f}_{\bar{k}}|^{2}\!+\!\sigma_{s}^{2}\lVert\mathbf{g}_{kl}^{\mathrm{H}}\boldsymbol{\Theta}_{k}\lVert^{2}+\sigma_{u}^{2}}\right). (9)

To guarantee the success of SIC, the achievable signal-to-interference-plus-noise ratio (SINR) at user UklU_{kl} to decode the signal of user UkjU_{kj} for all jlj\leq l should be no less than the SINR at user UkjU_{kj} to decode its own signal. Thus, we have the following SIC decoding rate constraint:

RljkRjjk,k𝒦,j𝒥k,lk.\displaystyle R_{l\to j}^{k}\geq R_{j\to j}^{k},~{}\forall k\in\mathcal{K},\forall j\in\mathcal{J}_{k},\forall l\in\mathcal{L}_{k}. (10)

III-C Power Dissipation Model

Define the energy harvesting coefficient matrix of the mm-th element as

𝐓m=diag([0,,1tom11αm,,0m+1toM]).\displaystyle\mathbf{T}_{m}={\rm diag}([\underbrace{0,\cdots,}_{1\ \text{to}\ m-1}1-\alpha_{m}\underbrace{,\cdots,0}_{m+1\ \text{to}\ M}]). (11)

Then, the RF power received at the mm-th element is given by

PmRF=𝔼(𝐓m(𝐇𝐬+𝐧s)2),\displaystyle P_{m}^{\rm{RF}}=\mathbb{E}\left(\left\|\mathbf{T}_{m}\left(\mathbf{H}\mathbf{s}+\mathbf{n}_{s}\right)\right\|^{2}\right), (12)

where the expectation operator 𝔼()\mathbb{E}(\cdot) is over 𝐬\mathbf{s} and 𝐧s\mathbf{n}_{s}.

In order to capture the dynamics of the RF energy conversion efficiency for different input power levels, a non-linear energy harvesting model is adopted[34]. Accordingly, the total power harvested at the mm-th element is given by

PmA=ΥmZΩ1Ω,Υm=Z1+ea(PmRFq),Ω=11+eaq,\displaystyle P_{m}^{\mathrm{A}}\!=\!\frac{\Upsilon_{m}\!-\!Z\Omega}{1\!-\!\Omega},~{}\Upsilon_{m}\!=\!\frac{Z}{1+e^{-a(P_{m}^{\rm RF}-q)}},~{}\Omega\!=\!\frac{1}{1+e^{aq}}, (13)

where Υm\Upsilon_{m} is a logistic function with respect to (w.r.t.) the received RF power PmRFP_{m}^{\rm RF}, and Z0Z\geq 0 is a constant determining the maximum harvested power. Constant Ω\Omega is introduced to ensure a zero-input/zero-output response for H mode, with constants a>0a>0 and q>0q>0 capturing the joint effects of circuit sensitivity limitations and current leakage.

To ensure energy self-sustainability, the power consumed by the proposed MF-RIS should not exceed the power harvested. The power consumption of the proposed MF-RIS is mainly caused by the operation of phase shifters, amplifiers, power conversion circuits, and the output power. Other sources of power consumption, such as powering the impedance matching and mode switching circuits, are negligible in comparison[20, 21, 19]. Given that the MF-RIS has 2mαm2\sum\nolimits_{m\in\mathcal{M}}\alpha_{m} phase shifters, 2mαm2\sum\nolimits_{m\in\mathcal{M}}\alpha_{m} amplifiers, and MmαmM-\sum\nolimits_{m\in\mathcal{M}}\alpha_{m} power conversion circuits in operation, we have the following energy self-sustainability constraint:

2(Pb+PDC)mαm+(Mmαm)PC\displaystyle 2\left(P_{b}+P_{\rm DC}\right)\sum\nolimits_{m\in\mathcal{M}}\alpha_{m}+(M-\sum\nolimits_{m\in\mathcal{M}}\alpha_{m})P_{\rm C}
+ξPOmPmA,\displaystyle+\xi P_{\rm O}\leq\sum\nolimits_{m\in\mathcal{M}}P_{m}^{\mathrm{A}}, (14)

where PbP_{b}, PDCP_{\rm DC}, and PCP_{\rm C} denote the power consumed by each phase shifter, the DC biasing power consumed by the amplifier, and the power consumed by the RF-to-DC power conversion circuit, respectively. Here, ξ\xi is the inverse of the amplifier efficiency, and PO=k𝒦(k𝒦𝚯k𝐇𝐟k2P_{\rm O}=\sum_{k\in\mathcal{K}}\big{(}\sum_{k^{\prime}\in\mathcal{K}}\lVert\boldsymbol{\Theta}_{k}\mathbf{H}\mathbf{f}_{k^{\prime}}\lVert^{2} +σs2𝚯kF2)+\sigma_{s}^{2}\lVert\boldsymbol{\Theta}_{k}\lVert_{F}^{2}\big{)} represents the output power of the MF-RIS.

III-D Problem Formulation

Our goal is to maximize the sum-rate of all users while maintaining self-sustainability of the MF-RIS by jointly optimizing the power allocation, transmit beamforming at the BS, and the coefficient matrix and 3D location of the MF-RIS. The optimization problem is formulated as

maxpkj,𝐟k,𝚯k,𝐰\displaystyle\underset{p_{kj},\mathbf{f}_{k},\boldsymbol{\Theta}_{k},\mathbf{w}}{\max} k𝒦j𝒥kRjjk\displaystyle\sum\nolimits_{k\in\mathcal{K}}\sum\nolimits_{j\in\mathcal{J}_{k}}R_{j\to j}^{k} (15a)
s.t.\displaystyle\operatorname{s.t.} j𝒥kpkj=1,k𝒦,\displaystyle\sum\nolimits_{j\in\mathcal{J}_{k}}p_{kj}=1,~{}\forall k\in\mathcal{K}, (15f)
k𝒦𝐟k2PBSmax,\displaystyle\sum\nolimits_{k\in\mathcal{K}}\lVert\mathbf{f}_{k}\lVert^{2}\leq P_{\rm BS}^{\max},
RjjkRkjmin,k𝒦,j𝒥k,\displaystyle R_{j\to j}^{k}\geq R_{kj}^{\rm min},~{}\forall k\in\mathcal{K},\forall j\in\mathcal{J}_{k},
𝚯kMF,k𝒦,\displaystyle\boldsymbol{\Theta}_{k}\in\mathcal{R}_{\rm MF},~{}\forall k\in\mathcal{K},
(1),(8),(10),(14),\displaystyle{\rm(\ref{MF-RIS region}),(\ref{decoding_order}),(\ref{rate-SIC}),(\ref{C_energy})},

where MF\mathcal{R}_{\rm MF} is the feasible set for MF-RIS coefficients, with MF={αm,βmk,θmk|αm{0,1},βmk[0,βmax],k𝒦βmk\mathcal{R}_{\rm MF}\!=\!\{\alpha_{m},\beta_{m}^{k},\theta_{m}^{k}|\alpha_{m}\in\{0,1\},\beta_{m}^{k}\in[0,\beta_{\max}],\sum\nolimits_{k\in\mathcal{K}}\beta_{m}^{k} βmax,θmk[0,2π),m,k}\leq\beta_{\rm max},\theta_{m}^{k}\in[0,2\pi),\forall m,k\}. Constraint (15f) represents the power allocation restriction, (15f) ensures that the total transmit power at the BS cannot exceed the power budget PBSmaxP_{\rm BS}^{\max}, and (15f) guarantees that the achievable data rate of user UkjU_{kj} is above the quality-of-service (QoS) requirement RkjminR_{kj}^{\rm min}. Constraints (15f) and (1) specify the allowable ranges of MF-RIS coefficients and locations, respectively, and (8) determines the SIC decoding order of NOMA users. In addition, constraint (10) ensures successful SIC decoding, and (14) guarantees the energy self-sustainability of the MF-RIS.

Refer to caption
Figure 2: A roadmap for problem decomposition and algorithm design.

The sum-rate maximization problems studied in existing works on self-sustainable RIS[20] and STAR-RIS[33] can be regarded as special cases of problem (15). However, their results are not applicable to solving (15) due to the following new challenges introduced by MF-RIS: 1) the objective function (15a) and constraints (8), (10), (14), and (15f) involve closely coupled variables; 2) the adopted non-linear energy harvesting model makes constraint (14) intractable, compared to the linear model in [20]; 3) due to the signal amplification, additional RIS noise needs to be considered in the objective function (15a) and constraints (8), (10), (14), and (15f), which complicates the resource allocation problem; 4) the binary energy harvesting coefficients result in combinatorial constraints (8), (10), (14), (15f), and (15f), which makes (15) an MINLP problem. Therefore, the formulated problem (15) for the MF-RIS is more challenging to solve as compared to those for existing RISs in [20] and [33].

IV Proposed Solution for Active Beamforming and MF-RIS Deployment

To solve (15) efficiently, we propose an AO-based algorithm. As shown in Fig. 2, the original problem (15) is decomposed into four subproblems. Specifically, the power allocation strategy is obtained in closed form based on successive cancellation. The transmit beamforming optimization is then solved using the sequential rank-one constraint relaxation (SROCR) method. Next, the MF-RIS coefficient is designed by applying the penalty function. Finally, the MF-RIS location is determined by adopting local region optimization.

IV-A Problem Transformation

Before solving (15), we transform it into a more tractable form. First, we observe that constraint (10) is a necessary condition for inequality (8), as (8) is equivalent to (6). This observation shows that under the proposed decoding order, the SIC condition is guaranteed, which is consistent with the conclusions obtained in existing NOMA works such as [33] and [35]. As a result, removing constraint (10) does not affect the optimality of (15) when (8) is satisfied. Hence, (10) is removed from (15) in the following.

Next, to deal with the non-convex constraint (8), we introduce slack variables as Akj=|𝐡¯kj𝐟k|2A_{kj}=|\bar{\mathbf{h}}_{kj}\mathbf{f}_{k}|^{-2}, Bkj=|𝐡¯kj𝐟k¯|2+σs2𝐠kjH𝚯k2+σu2B_{kj}=|\bar{\mathbf{h}}_{kj}\mathbf{f}_{\bar{k}}|^{2}+\sigma_{s}^{2}\lVert\mathbf{g}_{kj}^{\mathrm{H}}\boldsymbol{\Theta}_{k}\lVert^{2}+\sigma_{u}^{2}, and Γkj=Akj1Bkj1\Gamma_{kj}=A_{kj}^{-1}B_{kj}^{-1}. Then, (8) is equivalently transformed into

Akj1|𝐡¯kj𝐟k|2,k𝒦,j𝒥k,\displaystyle\!\!\!\!\!\!A_{kj}^{-1}\leq|\bar{\mathbf{h}}_{kj}\mathbf{f}_{k}|^{2},~{}\forall k\in\mathcal{K},\forall j\in\mathcal{J}_{k},\!\!\!\!\!\! (16a)
Bkj|𝐡¯kj𝐟k¯|2+σs2𝐠kjH𝚯k2+σu2,k𝒦,j𝒥k,\displaystyle\!\!\!\!\!\!B_{kj}\geq|\bar{\mathbf{h}}_{kj}\mathbf{f}_{\bar{k}}|^{2}+\sigma_{s}^{2}\lVert\mathbf{g}_{kj}^{\mathrm{H}}\boldsymbol{\Theta}_{k}\lVert^{2}+\sigma_{u}^{2},~{}\forall k\in\mathcal{K},\forall j\in\mathcal{J}_{k},\!\!\!\!\!\! (16b)
ΓkjAkj1Bkj1,k𝒦,j𝒥k,\displaystyle\!\!\!\!\!\!\Gamma_{kj}\geq A_{kj}^{-1}B_{kj}^{-1},~{}\forall k\in\mathcal{K},\forall j\in\mathcal{J}_{k},\!\!\!\!\!\! (16c)
ΓkjAkl1Bkl1,k𝒦,j𝒥k,lk.\displaystyle\!\!\!\!\!\!\Gamma_{kj}\leq A_{kl}^{-1}B_{kl}^{-1},~{}\forall k\in\mathcal{K},\forall j\in\mathcal{J}_{k},\forall l\in\mathcal{L}_{k}.\!\!\!\!\!\! (16d)

As for the energy self-sustainability constraint (14), it is difficult to directly observe and handle due to the non-linear energy harvesting model based on the logistic function. Therefore, we first substitute the terms in (13) into (14), and equivalently rewrite (14) in the following form:

(𝒲+ξPO)(1Ω)Z1+MΩ\displaystyle(\mathcal{W}+\xi P_{\rm O})(1-\Omega)Z^{-1}+M\Omega
m(1+exp(a(PmRFq)))1,\displaystyle\leq\sum\nolimits_{m\in\mathcal{M}}\big{(}1+\exp(-a(P_{m}^{\rm{RF}}-q))\big{)}^{-1}, (17)

where 𝒲=2(Pb+PDC)mαm+(Mmαm)PC\mathcal{W}\!=\!2(P_{b}+P_{\rm DC})\sum\nolimits_{m\in\mathcal{M}}\alpha_{m}\!+\!(M-\sum\nolimits_{m\in\mathcal{M}}\alpha_{m})P_{\rm C}. The complex right-hand-side (RHS) of (17) and the non-convex expression in (12) make (17) difficult to deal with. By introducing slack variables ζm=PmRF\zeta_{m}\!=\!P_{m}^{\rm{RF}} and 𝒞m=1+exp(a(ζmq))\mathcal{C}_{m}\!=\!1+\exp(-a(\zeta_{m}-q)), we further recast (17) as

(𝒲+ξPO)(1Ω)Z1+MΩm𝒞m1,\displaystyle(\mathcal{W}+\xi P_{\rm O})(1-\Omega)Z^{-1}\!+\!M\Omega\leq\sum\nolimits_{m\in\mathcal{M}}\mathcal{C}_{m}^{-1}, (18a)
ζmPmRF,𝒞m1+exp(a(ζmq)),m.\displaystyle\zeta_{m}\leq P_{m}^{\rm{RF}},~{}~{}\mathcal{C}_{m}\geq 1+\exp\big{(}-a(\zeta_{m}-q)\big{)},~{}\forall m. (18b)

Constraints (16d) and (18a) are non-convex due to their RHSs. Here, we exploit the successive convex approximation (SCA) technique to tackle them. Specifically, the lower bounds of their RHSs at the feasible point {Akl(),Bkl(),𝒞m()}\{A_{kl}^{(\ell)},B_{kl}^{(\ell)},\mathcal{C}_{m}^{(\ell)}\} in the \ell-th iteration are, respectively, given by

Γkllb=1Akl()Bkl()AklAkl()(Akl())2Bkl()BklBkl()(Bkl())2Akl(),\displaystyle\Gamma_{kl}^{\rm lb}=\frac{1}{A_{kl}^{(\ell)}B_{kl}^{(\ell)}}-\frac{A_{kl}-A_{kl}^{(\ell)}}{(A_{kl}^{(\ell)})^{2}B_{kl}^{(\ell)}}-\frac{B_{kl}-B_{kl}^{(\ell)}}{(B_{kl}^{(\ell)})^{2}A_{kl}^{(\ell)}}, (19a)
𝒞lb=m(2𝒞m()𝒞m(𝒞m())2).\displaystyle\mathcal{C}^{\rm lb}=\sum\nolimits_{m\in\mathcal{M}}\left(\frac{2}{\mathcal{C}_{m}^{(\ell)}}-\frac{\mathcal{C}_{m}}{(\mathcal{C}_{m}^{(\ell)})^{2}}\right). (19b)

As a result, by defining W¯=(𝒞lbMΩ)Z(1Ω)ξ𝒲ξ\bar{W}=\frac{(\mathcal{C}^{\rm lb}-M\Omega)Z}{(1-\Omega)\xi}-\frac{\mathcal{W}}{\xi} and Δ0={Akj,Bkj,Γkj,𝒞m,ζm}\Delta_{0}=\{A_{kj},B_{kj},\Gamma_{kj},\mathcal{C}_{m},\zeta_{m}\}, problem (15) is equivalently transformed into the following one:

maxpkj,𝐟k,𝚯k,𝐰,Δ0\displaystyle\underset{p_{kj},\mathbf{f}_{k},\boldsymbol{\Theta}_{k},\mathbf{w},\Delta_{0}}{\max} kj𝒥kRjjk\displaystyle\sum\nolimits_{k}\sum\nolimits_{j\in\mathcal{J}_{k}}R_{j\to j}^{k} (20a)
s.t.\displaystyle\operatorname{s.t.}~{}~{}~{} ΓkjΓkllb,k𝒦,j𝒥k,lk,\displaystyle\Gamma_{kj}\leq\Gamma_{kl}^{\rm lb},~{}\forall k\in\mathcal{K},\forall j\in\mathcal{J}_{k},\forall l\in\mathcal{L}_{k}, (20b)
W¯PO,\displaystyle\bar{W}\geq P_{\rm O}, (20c)
(1),(15f)-(15f),(16a)-(16c),(18b).\displaystyle{\rm(\ref{MF-RIS region}),(\ref{C_power allocation}){\text{-}}(\ref{C-MF-RIS}),(\ref{P_trans_AB_1}){\text{-}}(\ref{P_trans_AB_3}),(\ref{P_trans_C-Energy-2})}. (20d)

IV-B Power Allocation

To start with, we focus on the optimization of {pkj}\{p_{kj}\} with given {𝐟k,𝚯k,𝐰}\{\mathbf{f}_{k},\boldsymbol{\Theta}_{k},\mathbf{w}\}. Since the inter-cluster interference is independent of {pkj}\{p_{kj}\}, the power allocation problem can be decomposed into two subproblems[35]. For direction kk, the optimization problem is formulated as

maxpkj\displaystyle\underset{p_{kj}}{\max} j𝒥kRjjk\displaystyle\sum\nolimits_{j\in\mathcal{J}_{k}}R_{j\to j}^{k} (21a)
s.t.\displaystyle\operatorname{s.t.} (15f),(15f).\displaystyle{\rm(\ref{C_power allocation}),(\ref{C_Rmin}).} (21b)

We divide the power allocation coefficient pkjp_{kj} into two parts, p¯kj\bar{p}_{kj} and pkj\triangle p_{kj}, where pkj=p¯kj+pkjp_{kj}=\bar{p}_{kj}+\triangle p_{kj}, with p¯kj\bar{p}_{kj} denoting the minimum power allocation coefficient for user UkjU_{kj} to satisfy the QoS constraint (15f) and pkj\triangle p_{kj} denoting the power increment allocated to user UkjU_{kj}. Then, based on SIC decoding, the optimal power allocation coefficients can be obtained by the following lemma and proposition.

Lemma 1

Problem (21) is feasible if the following inequality holds:

j𝒥kp¯kj=j𝒥k(i=1j1(rkimin+1))rkjminγkj1,\displaystyle\!\!\sum\nolimits_{j\in\mathcal{J}_{k}}\bar{p}_{kj}=\sum\nolimits_{j\in\mathcal{J}_{k}}\left(\prod\nolimits_{i=1}^{j-1}(r_{ki}^{\min}+1)\right)\frac{r_{kj}^{\min}}{\gamma_{kj}}\leq 1, (22)

where

rkjmin=2Rkjmin1,i=10(rkjmin+1)=1,\displaystyle r_{kj}^{\min}=2^{R_{kj}^{\rm min}}-1,~{}\prod\nolimits_{i=1}^{0}(r_{kj}^{\min}+1)=1, (23a)
andγkj=|𝐡¯kj𝐟k|2|𝐡¯kj𝐟k¯|2+σs2𝐠kjH𝚯k2+σu2.\displaystyle{and}~{}\gamma_{kj}=\frac{|\bar{\mathbf{h}}_{kj}\mathbf{f}_{k}|^{2}}{|\bar{\mathbf{h}}_{kj}\mathbf{f}_{\bar{k}}|^{2}+\sigma_{s}^{2}\lVert\mathbf{g}_{kj}^{\mathrm{H}}\boldsymbol{\Theta}_{k}\lVert^{2}+\sigma_{u}^{2}}. (23b)
Proof:

See Appendix A. ∎

Proposition 1

If Lemma 1 is satisfied, then the optimal power allocation coefficients are given by

pkj={rkjminγkj+rkjmini=j+1Jkp¯kip¯kj+rkjmini=j+1Jkpkipkj,j=1,2,,Jk1,rkjminγkjp¯kj+1i𝒥kp¯kii=1Jk1(1+rkimin)pkj,j=Jk,\displaystyle\!\!\!\!\!\!\!\!\!p_{kj}^{\star}\!=\!\left\{\begin{array}[]{l}\!\!\!\underbrace{\frac{r_{kj}^{\min}}{\gamma_{kj}}+r_{kj}^{\min}\sum\nolimits_{i=j+1}^{J_{k}}\bar{p}_{ki}^{\star}}_{\bar{p}_{kj}^{\star}}+\underbrace{r_{kj}^{\min}\sum\nolimits_{i=j+1}^{J_{k}}\triangle{p}_{ki}^{\star}}_{\triangle p_{kj}^{\star}},\\ ~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}j=1,2,\cdots,J_{k}-1,\\ \!\!\!\underbrace{\frac{r_{kj}^{\min}}{\gamma_{kj}}}_{\bar{p}_{kj}^{\star}}+\underbrace{\frac{1-\sum\nolimits_{i\in\mathcal{J}_{k}}\bar{p}_{ki}^{\star}}{\prod_{i=1}^{J_{k}-1}(1+r_{ki}^{\min})}}_{\triangle p_{kj}^{\star}},~{}j=J_{k},\end{array}\right.\!\!\!\!\!\!\!\!\! (27)

and the optimal objective value of (21) is given by

j𝒥klog2(1+p¯kj+rkjmini=j+1Jkpkii=j+1Jkpki+1γkj)\displaystyle\sum\nolimits_{j\in\mathcal{J}_{k}}\log_{2}\left(1+\frac{\bar{p}_{kj}^{\star}+r_{kj}^{\min}\sum\nolimits_{i=j+1}^{J_{k}}\triangle p_{ki}^{\star}}{\sum\nolimits_{i=j+1}^{J_{k}}{p}_{ki}^{\star}+\frac{1}{\gamma_{kj}}}\right)
+log2(1+(1j𝒥kp¯kj)γkJki=1Jk(1+rkimin)).\displaystyle+\log_{2}\left(1+\frac{(1-\sum\nolimits_{j\in\mathcal{J}_{k}}\bar{p}_{kj}^{\star})\gamma_{kJ_{k}}}{\prod_{i=1}^{J_{k}}(1+r_{ki}^{\min})}\right). (28)
Proof:

See Appendix B. ∎

Proposition 1 shows that the optimal power allocation coefficient, pkjp_{kj}^{\star}, can be divided into two parts, p¯kj\bar{p}_{kj}^{\star} and pkj\triangle p_{kj}^{\star}, where pkj=p¯kj+pkjp_{kj}^{\star}=\bar{p}_{kj}^{\star}+\triangle p_{kj}^{\star}. Specifically, p¯kj\bar{p}_{kj}^{\star} maintains the QoS constraint of user UkjU_{kj}, pkJk\triangle p_{kJ_{k}}^{\star} maximizes the data rate of user UkJkU_{kJ_{k}}, while for other users, pkj\triangle p_{kj}^{\star} compensates for the SINR loss caused by the SIC interference. This is due to the fact that: 1) the users are ordered according to their equivalent channel gains; 2) at the optimum, improving the rate of one user comes at the cost of decreasing the rate of other users.

IV-C Transmit Beamforming Optimization

With given {pkj,𝚯k,𝐰}\{p_{kj},\boldsymbol{\Theta}_{k},\mathbf{w}\}, we aim to solve the transmit beamforming vector 𝐟k\mathbf{f}_{k}. Problem (20) is still difficult to solve directly due to the non-concave objective function (20a) and the non-convex constraint (15f). To this end, we introduce auxiliary variables QkjQ_{kj} and CkjC_{kj}, satisfying Qkj=RjjkQ_{kj}=R_{j\to j}^{k} and Ckj=|𝐡¯kj𝐟k|2Pkj+BkjC_{kj}=|\bar{\mathbf{h}}_{kj}\mathbf{f}_{k}|^{2}P_{kj}+B_{kj}. The objective function (15a) is then transformed into

k𝒦j𝒥kRjjk=k𝒦j𝒥kQkj.\displaystyle\sum\nolimits_{k\in\mathcal{K}}\sum\nolimits_{j\in\mathcal{J}_{k}}R_{j\to j}^{k}=\sum\nolimits_{k\in\mathcal{K}}\sum\nolimits_{j\in\mathcal{J}_{k}}Q_{kj}. (29)

In addition, we obtain the following new constraints:

Ckj|𝐡kj𝐟k|2Pkj+Bkj,\displaystyle C_{kj}\geq|\mathbf{h}_{kj}\mathbf{f}_{k}|^{2}P_{kj}+B_{kj}, (30a)
Qkjlog2(1+pkjAkj1Ckj1),QkjRkjmin.\displaystyle Q_{kj}\leq\log_{2}\big{(}1+p_{kj}A_{kj}^{-1}C_{kj}^{-1}\big{)},~{}Q_{kj}\geq R_{kj}^{\rm min}. (30b)

The SCA technique is employed to handle the non-convex constraint Qkjlog2(1+pkjAkj1Ckj1)Q_{kj}\leq\log_{2}\big{(}1+p_{kj}A_{kj}^{-1}C_{kj}^{-1}\big{)}. Specifically, a lower bound of its RHS in the \ell-th iteration is expressed as

Rkjlb=\displaystyle R_{kj}^{\rm lb}= log2(1+pkjAkj()Ckj())pkj(log2e)(AkjAkj())pkjAkj()+(Akj())2Ckj()\displaystyle\log_{2}\Big{(}1+\frac{p_{kj}}{A_{kj}^{(\ell)}C_{kj}^{(\ell)}}\Big{)}-\frac{p_{kj}(\log_{2}e)(A_{kj}-A_{kj}^{(\ell)})}{p_{kj}A_{kj}^{(\ell)}+(A_{kj}^{(\ell)})^{2}C_{kj}^{(\ell)}}
pkj(log2e)(CkjCkj())pkjCkj()+(Ckj())2Akj().\displaystyle-\frac{p_{kj}(\log_{2}e)(C_{kj}-C_{kj}^{(\ell)})}{p_{kj}C_{kj}^{(\ell)}+(C_{kj}^{(\ell)})^{2}A_{kj}^{(\ell)}}. (31)

Substituting (29)-(31) into (20), the transmit beamforming optimization problem is written as

max𝐟k,Δ1\displaystyle\!\!\!\underset{\mathbf{f}_{k},\Delta_{1}}{\max}~{} kj𝒥kQkj\displaystyle\sum\nolimits_{k}\sum\nolimits_{j\in\mathcal{J}_{k}}Q_{kj} (32a)
s.t.\displaystyle\operatorname{s.t.}~{} Akj1|𝐡¯kj𝐟k|2,k𝒦,j𝒥k,\displaystyle A_{kj}^{-1}\leq|\bar{\mathbf{h}}_{kj}\mathbf{f}_{k}|^{2},~{}\forall k\in\mathcal{K},\forall j\in\mathcal{J}_{k}, (32b)
Bkj|𝐡¯kj𝐟k¯|2+σs2𝐠kjH𝚯k2\displaystyle B_{kj}\geq|\bar{\mathbf{h}}_{kj}\mathbf{f}_{\bar{k}}|^{2}+\sigma_{s}^{2}\lVert\mathbf{g}_{kj}^{\mathrm{H}}\boldsymbol{\Theta}_{k}\lVert^{2}
+σu2,k𝒦,j𝒥k,\displaystyle~{}~{}~{}~{}~{}~{}~{}~{}+\sigma_{u}^{2},~{}\forall k\in\mathcal{K},\forall j\in\mathcal{J}_{k}, (32c)
Ckj|𝐡kj𝐟k|2Pkj+Bkj,k𝒦,j𝒥k,\displaystyle C_{kj}\geq|\mathbf{h}_{kj}\mathbf{f}_{k}|^{2}P_{kj}+B_{kj},~{}\forall k\in\mathcal{K},\forall j\in\mathcal{J}_{k}, (32d)
ΓkjAkj1Bkj1,ΓkjΓkllb,\displaystyle\Gamma_{kj}\geq A_{kj}^{-1}B_{kj}^{-1},~{}\Gamma_{kj}\leq\Gamma_{kl}^{\rm lb},
k𝒦,j𝒥k,lk,\displaystyle\forall k\in\mathcal{K},\forall j\in\mathcal{J}_{k},\forall l\in\mathcal{L}_{k}, (32e)
QkjRkjlb,QkjRkjmin,k𝒦,j𝒥k,lk,\displaystyle Q_{kj}\!\leq\!R_{kj}^{\rm lb},Q_{kj}\!\geq\!R_{kj}^{\min},~{}\forall k\!\in\!\mathcal{K},\forall j\!\in\!\mathcal{J}_{k},\forall l\!\in\!\mathcal{L}_{k},\!\!\!\! (32f)
𝒞m1+exp(a(ζmq)),m,\displaystyle\mathcal{C}_{m}\geq 1+\exp\left(-a\left(\zeta_{m}-q\right)\right),~{}\forall m, (32g)
W¯PO,ζmPmRF,m,(15f),\displaystyle\bar{W}\geq P_{\rm O},~{}\zeta_{m}\leq P_{m}^{\rm RF},~{}\forall m,~{}{\rm(\ref{C_transmit beamforming})}, (32h)

where Δ1={Akj,Bkj,Ckj,Qkj,Γkj,𝒞m,ζm}\Delta_{1}=\{A_{kj},B_{kj},C_{kj},Q_{kj},\Gamma_{kj},\mathcal{C}_{m},\zeta_{m}\}. We define 𝐇¯kj=𝐡¯kjH𝐡¯kj\bar{\mathbf{H}}_{kj}\!=\!\bar{\mathbf{h}}_{kj}^{\rm H}\bar{\mathbf{h}}_{kj} and 𝐅k=𝐟k𝐟kH\mathbf{F}_{k}\!=\!\mathbf{f}_{k}\mathbf{f}_{k}^{\rm H}, satisfying 𝐅k𝟎\mathbf{F}_{k}\succeq\mathbf{0} and rank(𝐅k)=1{\rm rank}(\mathbf{F}_{k})\!=\!1. Then, problem (32) is transformed into

max𝐅k,Δ1\displaystyle\!\!\!\!\underset{\mathbf{F}_{k},\Delta_{1}}{\max}~{} k𝒦j𝒥kQkj\displaystyle\sum\nolimits_{k\in\mathcal{K}}\sum\nolimits_{j\in\mathcal{J}_{k}}Q_{kj} (33a)
s.t.\displaystyle\operatorname{s.t.}~{} Akj1Tr(𝐇¯kj𝐅k),k𝒦,j𝒥k,\displaystyle{A_{kj}^{-1}}\leq{\rm Tr}\left(\bar{\mathbf{H}}_{kj}\mathbf{F}_{k}\right),~{}\forall k\in\mathcal{K},\forall j\in\mathcal{J}_{k}, (33b)
BkjTr(𝐇¯kj𝐅k¯)+σs2𝐠kjH𝚯k2\displaystyle B_{kj}\geq{\rm Tr}\left(\bar{\mathbf{H}}_{kj}\mathbf{F}_{\bar{k}}\right)+\sigma_{s}^{2}\lVert\mathbf{g}_{kj}^{\mathrm{H}}\boldsymbol{\Theta}_{k}\lVert^{2}
+σu2,k𝒦,j𝒥k,\displaystyle~{}~{}~{}~{}~{}~{}~{}~{}+\sigma_{u}^{2},~{}\forall k\in\mathcal{K},\forall j\in\mathcal{J}_{k}, (33c)
CkjTr(𝐇¯kj𝐅k)Pkj+Bkj,k𝒦,j𝒥k,\displaystyle C_{kj}\geq{\rm Tr}\left(\bar{\mathbf{H}}_{kj}\mathbf{F}_{k}\right)P_{kj}\!+\!B_{kj},~{}\forall k\!\in\!\mathcal{K},\forall j\in\mathcal{J}_{k},\!\!\!\! (33d)
W¯k𝒦(k𝒦Tr(𝚯k𝐇𝐅k𝐇H𝚯kH)\displaystyle\bar{W}\geq\sum\nolimits_{k\in\mathcal{K}}\Big{(}\sum\nolimits_{k^{\prime}\in\mathcal{K}}\operatorname{Tr}\left(\boldsymbol{\Theta}_{k}\mathbf{H}\mathbf{F}_{k^{\prime}}\mathbf{H}^{\rm H}\boldsymbol{\Theta}_{k}^{\rm H}\right)
+σs2𝚯kF2),\displaystyle~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}+\sigma_{s}^{2}\lVert\boldsymbol{\Theta}_{k}\lVert_{F}^{2}\Big{)}, (33e)
ζmk𝒦Tr(𝐓¯m𝐇𝐅k𝐇H𝐓¯mH)(1αm)\displaystyle\zeta_{m}\leq\sum\nolimits_{k\in\mathcal{K}}\operatorname{Tr}\left(\bar{\mathbf{T}}_{m}\mathbf{H}\mathbf{F}_{k}\mathbf{H}^{\rm H}\bar{\mathbf{T}}_{m}^{\rm H}\right)\left(1-\alpha_{m}\right)
+σs2(1αm),m,\displaystyle~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}+\sigma_{s}^{2}\left(1-\alpha_{m}\right),~{}\forall m, (33f)
rank(𝐅k)=1,k,\displaystyle{\rm rank}(\mathbf{F}_{k})=1,~{}\forall k, (33g)
k𝒦Tr(𝐅k)PBSmax,𝐅k0,k,(32e)-(32g),\displaystyle\sum\nolimits_{k\in\mathcal{K}}\!\!{\rm Tr}\left(\mathbf{F}_{k}\right)\!\leq\!P_{\rm BS}^{\max},\mathbf{F}_{k}\!\succeq\!0,\forall k,{\rm(\ref{C_f_Gamma-1}){\text{-}}(\ref{C_f_mathcalC})},\!\!\! (33h)

where 𝐓¯m=diag([0,,1tom11,,0m+1toM])\bar{\mathbf{T}}_{m}={\rm diag}([\underbrace{0,\cdots,}_{1\ \text{to}\ m-1}1\underbrace{,\cdots,0}_{m+1\ \text{to}\ M}]).

Algorithm 1 The SROCR-Based Algorithm for Solving (33)
1:  Initialize feasible points {𝐅k(0),wk(0)}\{\mathbf{F}_{k}^{(0)},w_{k}^{(0)}\} and the step size δ1(0)\delta_{1}^{(0)}. Set the iteration index 1=0\ell_{1}=0.
2:  repeat
3:     if problem (35) is solvable then
4:        Update 𝐅k(1+1)\mathbf{F}_{k}^{(\ell_{1}+1)} by solving problem (35);
5:        Update δ1(1+1)=δ1(1)\delta_{1}^{(\ell_{1}+1)}=\delta_{1}^{(\ell_{1})};
6:     else
7:        Update δ1(1+1)=δ1(1)2\delta_{1}^{(\ell_{1}+1)}=\frac{\delta_{1}^{(\ell_{1})}}{2};
8:     end if
9:     Update wk(1+1)=min(1,λmax(𝐅k(1+1))Tr(𝐅k(1+1))+δ1(1+1))w_{k}^{(\ell_{1}+1)}=\min\Big{(}1,\frac{\lambda_{\rm max}(\mathbf{F}_{k}^{(\ell_{1}+1)})}{{\rm{Tr}}(\mathbf{F}_{k}^{(\ell_{1}+1)})}+\delta_{1}^{(\ell_{1}+1)}\Big{)}; Update 1=1+1\ell_{1}=\ell_{1}+1;
10:  until the stopping criterion is met.

Next, we adopt the SROCR method to handle the rank-one constraint (33g). Different from the conventional semidefinite relaxation (SDR) method that drops the rank-one constraint directly[36], the basic idea of SROCR is to relax the rank-one constraint gradually[37]. Specifically, we define wk(1)[0,1]w_{k}^{(\ell-1)}\in[0,1] as the trace ratio parameter of 𝐅k\mathbf{F}_{k} in the (1)(\ell\!-\!1)-th iteration. Then, (33g) in the \ell-th iteration is replaced by:

(𝐟ke,(1))H𝐅k()𝐟ke,(1)wk(1)Tr(𝐅k()),k,\displaystyle\big{(}\mathbf{f}_{k}^{{\rm e},(\ell-1)}\big{)}^{\rm H}\mathbf{F}_{k}^{(\ell)}\mathbf{f}_{k}^{{\rm e},(\ell-1)}\geq w_{k}^{(\ell-1)}{\rm Tr}(\mathbf{F}_{k}^{(\ell)}),~{}\forall k, (34)

where 𝐟ke,(1)\mathbf{f}_{k}^{{\rm e},(\ell-1)} is the eigenvector corresponding to the largest eigenvalue of 𝐅k(1)\mathbf{F}_{k}^{(\ell-1)}, and 𝐅k(1)\mathbf{F}_{k}^{(\ell-1)} is the solution obatined in the (1)(\ell-1)-th iteration with given wk(1)w_{k}^{(\ell-1)}. Then, (33) is reformulated as

max𝐅k,Δ1\displaystyle\underset{\mathbf{F}_{k},\Delta_{1}}{\max} k𝒦j𝒥kQkj\displaystyle\sum\nolimits_{k\in\mathcal{K}}\sum\nolimits_{j\in\mathcal{J}_{k}}Q_{kj} (35a)
s.t.\displaystyle\operatorname{s.t.} (33b)-(33f),(33h),(34).\displaystyle{\rm(\ref{C_f_AB-1}){\text{-}}(\ref{C_f_P_RF}),(\ref{C_f_Tr_F}),(\ref{SROCR-linear-f})}. (35b)

Problem (35) is a convex semi-definite programming (SDP) problem, which can be solved efficiently via CVX[38]. By increasing wk(1)w_{k}^{(\ell-1)} from 0 to 11 over iterations, we approach a rank-one solution gradually. The algorithm for solving (33) is given in Algorithm 1. After solving (33), the solution of 𝐟k\mathbf{f}_{k} is obtained by Cholesky decomposition of 𝐅k\mathbf{F}_{k}, e.g., 𝐅k=𝐟k𝐟kH\mathbf{F}_{k}=\mathbf{f}_{k}\mathbf{f}_{k}^{\rm H}.

IV-D MF-RIS Coefficient Deign

For any given {pkj,𝐟k,𝐰}\{p_{kj},\mathbf{f}_{k},\mathbf{w}\}, we define 𝐔k=𝐮k𝐮kH\mathbf{U}_{k}\!=\!\mathbf{u}_{k}\mathbf{u}_{k}^{\rm H} and 𝐮k=[α1β1kejθ1k;;αMβMkejθMk;1]\mathbf{u}_{k}\!=\![\alpha_{1}\sqrt{\beta_{1}^{k}}e^{-j\theta_{1}^{k}};\!\cdots\!;\alpha_{M}\sqrt{\beta_{M}^{k}}e^{-j\theta_{M}^{k}};1\big{]}, satisfying 𝐔k𝟎\mathbf{U}_{k}\!\succeq\!\mathbf{0}, rank(𝐔k)=1{\rm rank}(\mathbf{U}_{k})\!=\!1, [𝐔k]m,m=αm2βmk[\mathbf{U}_{k}]_{m,m}\!=\!\alpha_{m}^{2}\beta_{m}^{k}, and [𝐔k]M+1,M+1=1[\mathbf{U}_{k}]_{M+1,M+1}\!=\!1. Then, we have

|𝐡¯kj𝐟kj|2=Tr(𝐇~kj𝐅k𝐇~kjH𝐔k),\displaystyle|\bar{\mathbf{h}}_{kj}\mathbf{f}_{kj}|^{2}=\operatorname{Tr}\big{(}\widetilde{\mathbf{H}}_{kj}\mathbf{F}_{k}\widetilde{\mathbf{H}}_{kj}^{\rm H}\mathbf{U}_{k}\big{)}, (36a)
𝐠kjH𝚯k2=Tr(𝐆~kj𝐔k),PO=k𝒦Tr(𝐇~𝐔k),\displaystyle\lVert\mathbf{g}_{kj}^{\mathrm{H}}\boldsymbol{\Theta}_{k}\lVert^{2}=\operatorname{Tr}(\widetilde{\mathbf{G}}_{kj}\mathbf{U}_{k}),~{}P_{\rm O}=\sum\nolimits_{k\in\mathcal{K}}\operatorname{Tr}(\widetilde{\mathbf{H}}\mathbf{U}_{k}), (36b)

where

𝐇~kj=[diag(𝐠kjH)𝐇;𝐡kjH],\displaystyle\widetilde{\mathbf{H}}_{kj}=\big{[}{\rm diag}(\mathbf{g}_{kj}^{\rm H})\mathbf{H};\mathbf{h}_{kj}^{\rm H}],
𝐆~kj=[diag(𝐠kjH);𝟎1×M][diag(𝐠kjH);𝟎1×M]H,\displaystyle\widetilde{\mathbf{G}}_{kj}=[{\rm diag}(\mathbf{g}_{kj}^{\rm H});\mathbf{0}_{1\times M}][{\rm diag}(\mathbf{g}_{kj}^{\rm H});\mathbf{0}_{1\times M}]^{\rm H},
𝐇~=k𝒦[𝐇𝐟k;0][𝐇𝐟k;0]H+σs2[𝐈M;𝟎1×M][𝐈M;𝟎1×M]H.\displaystyle\widetilde{\mathbf{H}}=\!\!\sum\nolimits_{k^{\prime}\in\mathcal{K}}[\mathbf{H}\mathbf{f}_{k^{\prime}};0][\mathbf{H}\mathbf{f}_{k^{\prime}};0]^{\rm H}\!+\!\sigma_{s}^{2}[\mathbf{I}_{M};\mathbf{0}_{1\times M}][\mathbf{I}_{M};\mathbf{0}_{1\times M}]^{\rm H}.

Constraints (33b)-(33e) are then, respectively, rewritten as

Akj1Tr(𝐇~kj𝐅k𝐇~kjH𝐔k),\displaystyle{A_{kj}^{-1}}\leq{\rm Tr}(\widetilde{\mathbf{H}}_{kj}\mathbf{F}_{k}\widetilde{\mathbf{H}}_{kj}^{\rm H}\mathbf{U}_{k}), (37a)
BkjTr((𝐇~kj𝐅k¯𝐇~kjH+σs2𝐆~kj)𝐔k)+σu2,\displaystyle B_{kj}\geq{\rm Tr}\big{(}(\widetilde{\mathbf{H}}_{kj}\mathbf{F}_{\bar{k}}\widetilde{\mathbf{H}}_{kj}^{\rm H}+\sigma_{s}^{2}\widetilde{\mathbf{G}}_{kj})\mathbf{U}_{k}\big{)}+\sigma_{u}^{2}, (37b)
CkjTr(𝐇~kj𝐅k𝐇~kjH𝐔k)Pkj+Bkj,\displaystyle C_{kj}\geq{\rm Tr}\big{(}\widetilde{\mathbf{H}}_{kj}\mathbf{F}_{k}\widetilde{\mathbf{H}}_{kj}^{\rm H}\mathbf{U}_{k}\big{)}P_{kj}+B_{kj}, (37c)
𝒲¯k𝒦Tr(𝐇~𝐔k).\displaystyle\bar{\mathcal{W}}\geq\sum\nolimits_{k\in\mathcal{K}}\operatorname{Tr}(\widetilde{\mathbf{H}}\mathbf{U}_{k}). (37d)

Accordingly, the MF-RIS coefficient design problem is formulated as

max𝐔k,Δ1\displaystyle\!\!\!\!\!\!\!\!\!\!\!\!\underset{\mathbf{U}_{k},\Delta_{1}}{\max} k𝒦j𝒥kQkj\displaystyle\sum\nolimits_{k\in\mathcal{K}}\sum\nolimits_{j\in\mathcal{J}_{k}}Q_{kj} (38a)
s.t.\displaystyle\!\!\!\!\!\!\!\!\!\!\!\operatorname{s.t.} 𝐔k0,[𝐔k]M+1,M+1=1,k,\displaystyle\mathbf{U}_{k}\succeq 0,~{}\left[\mathbf{U}_{k}\right]_{M+1,M+1}=1,~{}\forall k, (38g)
[𝐔k]m,m=αm2βmk,m,k,\displaystyle\left[\mathbf{U}_{k}\right]_{m,m}=\alpha_{m}^{2}\beta_{m}^{k},~{}\forall m,k,
rank(𝐔k)=1,k,\displaystyle{\rm rank}(\mathbf{U}_{k})=1,~{}\forall k,
αm{0,1},m,\displaystyle\alpha_{m}\in\{0,1\},~{}\forall m,
βmk[0,βmax],k𝒦βmkβmax,m,k,\displaystyle\beta_{m}^{k}\in\left[0,\beta_{\max}\right],~{}\sum\nolimits_{k\in\mathcal{K}}\beta_{m}^{k}\leq\beta_{\max},~{}\forall m,k,
(32e)-(32g),(33f),(37).\displaystyle{\rm(\ref{C_f_Gamma-1}){\text{-}}(\ref{C_f_mathcalC}),(\ref{C_f_P_RF}),(\ref{C_theta_ABCP})}.

The non-convexity of problem (38) arises from the non-convex constraint (38g), the rank-one constraint (38g), and the binary constraint (38g). In Section IV-C, we showed how to handle the rank-one constraint using SROCR. Similarly, by defining vk(1)v_{k}^{(\ell-1)}, 𝐮ke,(1)\mathbf{u}_{k}^{{\rm e},(\ell-1)}, and 𝐔k()\mathbf{U}_{k}^{(\ell)} to correspond to wk(1)w_{k}^{(\ell-1)}, 𝐟ke,(1)\mathbf{f}_{k}^{{\rm e},(\ell-1)}, and 𝐅k()\mathbf{F}_{k}^{(\ell)} in (34), constraint (38g) is approximated by

(𝐮ke,(1))H𝐔k()𝐮ke,(1)vk(1)Tr(𝐔k()),k.\displaystyle\big{(}\mathbf{u}_{k}^{{\rm e},(\ell-1)}\big{)}^{\rm H}\mathbf{U}_{k}^{(\ell)}\mathbf{u}_{k}^{{\rm e},(\ell-1)}\geq v_{k}^{(\ell-1)}{\rm Tr}(\mathbf{U}_{k}^{(\ell)}),~{}\forall k. (39)

The binary constraint (38g) can be equivalently transformed into two continuous ones: αmαm20\alpha_{m}-\alpha_{m}^{2}\leq 0 and 0αm10\leq\alpha_{m}\leq 1. However, αmαm20\alpha_{m}-\alpha_{m}^{2}\leq 0 is still non-convex due to the non-convex term αm2-\alpha_{m}^{2}. The SCA technique is employed to address it. Specifically, for a given point {αm()}\{\alpha_{m}^{(\ell)}\} in the \ell-th iteration, an upper bound is obtained as (αm2)ub=2αm()αm+(αm())2\left(-\alpha_{m}^{2}\right)^{\rm ub}\!=\!-2\alpha_{m}^{(\ell)}\alpha_{m}\!+\!(\alpha_{m}^{(\ell)})^{2}.

Algorithm 2 The Penalty-Based Algorithm for Solving (38)
1:  Initialize feasible points {𝐔k(0),vk(0)}\{\mathbf{U}_{k}^{(0)},v_{k}^{(0)}\}, ε>1\varepsilon>1, and the step size δ2(0)\delta_{2}^{(0)}. Set the iteration index 2=0\ell_{2}=0 and the maximum value of the penalty factor ρmax\rho_{\max}.
2:  repeat
3:     if 22max\ell_{2}\leq\ell_{2}^{\max} then
4:        if problem (41) is solvable then
5:           Update 𝐔k(2+1)\mathbf{U}_{k}^{(\ell_{2}+1)} by solving problem (41);
6:           Update δ2(2+1)=δ2(2)\delta_{2}^{(\ell_{2}+1)}=\delta_{2}^{(\ell_{2})};
7:        else
8:           Update δ2(2+1)=δ2(2)2\delta_{2}^{(\ell_{2}+1)}=\frac{\delta_{2}^{(\ell_{2})}}{2};
9:        end if
10:        Update vk(2+1)=min(1,λmax(𝐔k(2+1))Tr(𝐔k(2+1))+δ2(2+1)){v}_{k}^{(\ell_{2}+1)}=\min\Big{(}1,\frac{\lambda_{\rm max}(\mathbf{U}_{k}^{(\ell_{2}+1)})}{{\rm{Tr}}(\mathbf{U}_{k}^{(\ell_{2}+1)})}+\delta_{2}^{(\ell_{2}+1)}\Big{)};
11:        Update ρ(2+1)=min{ερ(2),ρmax}\rho^{(\ell_{2}+1)}={\min}\{\varepsilon\rho^{(\ell_{2})},\rho_{\max}\};
12:        Update 2=2+1\ell_{2}=\ell_{2}+1;
13:     else
14:        Reinitialize with a new 𝐔k(0)\mathbf{U}_{k}^{(0)}, set ε>1\varepsilon>1 and 2=0\ell_{2}=0.
15:     end if
16:  until the stopping criterion is met.

To address the highly-coupled constraint (38g), the auxiliary variable ηmk=αm2βmk\eta_{m}^{k}=\alpha_{m}^{2}\beta_{m}^{k} is introduced so that we can obtain the equivalent form of (38g) as

[𝐔k]m,m=ηmk,ηmk=αm2βmk.\displaystyle\left[\mathbf{U}_{k}\right]_{m,m}=\eta_{m}^{k},~{}~{}\eta_{m}^{k}=\alpha_{m}^{2}\beta_{m}^{k}. (40)

The non-convex constraint ηmk=αm2βmk\eta_{m}^{k}=\alpha_{m}^{2}\beta_{m}^{k} can be further transformed into the convex penalty term G(αm,βmk,ηmk)G(\alpha_{m},\beta_{m}^{k},\eta_{m}^{k}) =k𝒦m(cmk2αm4+(βmk)22cmkηmk)=\sum\nolimits_{k\in\mathcal{K}}\sum\nolimits_{m\in\mathcal{M}}(\frac{c_{m}^{k}}{2}\alpha_{m}^{4}+\frac{(\beta_{m}^{k})^{2}}{2c_{m}^{k}}-\eta_{m}^{k}) by using the penalty-based method and convex upper bound (CUB) method, where the fixed point {cmk}\{c_{m}^{k}\} in the \ell-th iteration is updated by (cmk)()=(βmk)(1)(αm(1))2(c_{m}^{k})^{(\ell)}=\frac{(\beta_{m}^{k})^{(\ell-1)}}{(\alpha_{m}^{(\ell-1)})^{2}}; see Appendix C for the derivation details. Finally, problem (38) is recast as

max𝐔k,Δ1,ηmk\displaystyle\underset{\mathbf{U}_{k},\Delta_{1},\eta_{m}^{k}}{\max}~{} k𝒦j𝒥kQkjρG(αm,βmk,ηmk)\displaystyle\sum\nolimits_{k\in\mathcal{K}}\sum\nolimits_{j\in\mathcal{J}_{k}}Q_{kj}-\rho G(\alpha_{m},\beta_{m}^{k},\eta_{m}^{k}) (41a)
s.t.\displaystyle\operatorname{s.t.}~{} 0αm1,αm+(αm2)ub0,m,\displaystyle 0\leq\alpha_{m}\leq 1,~{}\alpha_{m}+\left(-\alpha_{m}^{2}\right)^{\rm ub}\leq 0,~{}\forall m, (41b)
[𝐔k]m,m=ηmk,m,k,\displaystyle\left[\mathbf{U}_{k}\right]_{m,m}=\eta_{m}^{k},~{}\forall m,k, (41c)
(38g),(38g),(38g),(39),\displaystyle{\rm(\ref{C_passive_rank_1}),(\ref{C-passive-beta-1}),(\ref{C-passive-beta-2}),(\ref{SROCR-linear-theta})}, (41d)

where the penalty factor ρ>0\rho>0 penalizes the objective function (41a) if G(αm,βmk,ηmk)0G(\alpha_{m},\beta_{m}^{k},\eta_{m}^{k})\neq 0. It can be verified that, if ρ\rho\to\infty, the solution obtained from (41) satisfies G(αm,βmk,ηmk)=0G(\alpha_{m},\beta_{m}^{k},\eta_{m}^{k})=0. Problem (41) is a convex SDP problem, which can be solved efficiently via CVX[38]. The details of the proposed penalty-based algorithm are given in Algorithm 2.

Refer to caption
Figure 3: A flowchart of the proposed AO algorithm.
Algorithm 3 The Local Region-Based Algorithm for Solving Problem (44)
1:  Initialize feasible points {x(0),y(0),z(0),t(0),tkj(0),v¯(0)}\{x^{(0)},y^{(0)},z^{(0)},t^{(0)},t_{kj}^{(0)},\bar{v}^{(0)}\}. Set the iteration index 3=0\ell_{3}=0.
2:  repeat
3:     Update {x(3+1),y(3+1),z(3+1),t(3+1),tkj(3+1),v¯(3+1)}\{x^{(\ell_{3}\!+\!1)},y^{(\ell_{3}\!+\!1)},z^{(\ell_{3}\!+\!1)},t^{(\ell_{3}\!+\!1)},t_{kj}^{(\ell_{3}\!+\!1)},\bar{v}^{(\ell_{3}\!+\!1)}\} by solving problem (45);
4:     Update 3=3+1\ell_{3}=\ell_{3}+1;
5:  until the stopping criterion is met.

IV-E MF-RIS Location Optimization

Finally, we focus on the location optimization of the MF-RIS. Equations (2), (3), and (4b) show that both the distance-dependent path loss, LbsL_{bs} and LskjL_{skj}, and the LoS components, 𝐇LoS\mathbf{H}^{\rm LoS} and 𝐠kjLoS\mathbf{g}_{kj}^{\rm LoS}, are relevant to the MF-RIS location, 𝐰\mathbf{w}. In addition, (3) shows that these LoS components are non-linear w.r.t. 𝐰\mathbf{w}, which are difficult to deal with directly. Here, we invoke the local region optimization method to tackle this issue[8]. Denote 𝐰(i1)\mathbf{w}^{(i-1)} as the feasible location obtained in the (i1)(i-1)-th iteration, then the location variables should satisfy the following constraint:

𝐰𝐰(i1)ϵ,\displaystyle\big{\|}\mathbf{w}-\mathbf{w}^{(i-1)}\big{\|}\leq\epsilon, (42)

where the constant ϵ\epsilon is relatively small such that 𝐰(i1)\mathbf{w}^{(i-1)} can be used to approximately obtain 𝐇LoS\mathbf{H}^{\rm LoS} and 𝐠kjLoS\mathbf{g}_{kj}^{\rm LoS} in the ii-th iteration. Assuming that 𝐇^(i1)\hat{\mathbf{H}}^{(i-1)} and 𝐠^kj(i1)\hat{\mathbf{g}}_{kj}^{(i-1)} are the small-scale fading obtained in the (i1)(i-1)-th iteration, constraints (33b)-(33f) are, respectively, rewritten as

Akj1𝐝kjT𝐃kj𝐝kj,Bkj𝐝kjT𝐃¯kj𝐝kj+dskjκ2𝒲1+σu2,\displaystyle\!\!A_{kj}^{-1}\!\leq\!\mathbf{d}_{kj}^{\rm T}\mathbf{D}_{kj}\mathbf{d}_{kj},~{}B_{kj}\!\geq\!\mathbf{d}_{kj}^{\rm T}\bar{\mathbf{D}}_{kj}\mathbf{d}_{kj}\!+\!d_{skj}^{-\kappa_{2}}\mathcal{W}_{1}\!+\!\sigma_{u}^{2},\!\! (43a)
Ckj𝐝kjT𝐃kj𝐝kjPkj+Bkj,dbsκ0𝒲2,dbsκ0𝒲3,\displaystyle\!\!C_{kj}\!\geq\!\mathbf{d}_{kj}^{\rm T}\mathbf{D}_{kj}\mathbf{d}_{kj}P_{kj}\!+\!B_{kj},~{}d_{bs}^{-\kappa_{0}}\!\leq\!\mathcal{W}_{2},~{}d_{bs}^{-\kappa_{0}}\!\geq\!\mathcal{W}_{3},\!\! (43b)

where 𝐝kj=[1,dbsκ02dskjκ22]T\mathbf{d}_{kj}=\big{[}1,d_{bs}^{-\frac{\kappa_{0}}{2}}d_{skj}^{-\frac{\kappa_{2}}{2}}\big{]}^{\rm T}. Here, 𝐃kj\mathbf{D}_{kj}, 𝐃¯kj\bar{\mathbf{D}}_{kj}, 𝒲1\mathcal{W}_{1}, 𝒲2\mathcal{W}_{2}, and 𝒲3\mathcal{W}_{3} are terms unrelated to the optimization variable 𝐰\mathbf{w} in the ii-th iteration, which are given by (54) in Appendix D. Accordingly, given {pkj,𝐟k,𝚯k}\{p_{kj},\mathbf{f}_{k},\boldsymbol{\Theta}_{k}\}, problem (20) is reduced to

max𝐰,Δ1\displaystyle\underset{\mathbf{w},\Delta_{1}}{\max}~{} k𝒦j𝒥kQkj\displaystyle\sum\nolimits_{k\in\mathcal{K}}\sum\nolimits_{j\in\mathcal{J}_{k}}Q_{kj} (44a)
s.t.\displaystyle\operatorname{s.t.}~{} (1),(32e)-(32g),(42),(43a),(43b).\displaystyle{\rm(\ref{MF-RIS region}),(\ref{C_f_Gamma-1}){\text{-}}(\ref{C_f_mathcalC}),(\ref{C_local region}),(\ref{C_AB_w}),(\ref{C_C_w})}. (44b)

Constraints (43a) and (43b) are still non-convex w.r.t. 𝐰\mathbf{w}. To tackle this issue, we first introduce auxiliary variables to replace their complex terms, and then approximate the non-convex parts by using SCA. Specifically, by introducing a slack variable set Δ2={t,tkj,t¯kj,ekj,v,v¯,rkj,r¯kj,skj}\Delta_{2}\!=\!\{t,t_{kj},\bar{t}_{kj},e_{kj},v,\bar{v},r_{kj},\bar{r}_{kj},s_{kj}\} and defining 𝐝¯kj=[1,t¯kj]T\bar{\mathbf{d}}_{kj}=[1,\bar{t}_{kj}]^{\rm T}, these constraints are linearly approximated by (56c)-(56e), (57), and (59) in Appendix E.

Next, reformulating problem (44) by replacing constraints (43a) and (43b) with convex ones yields the following optimization problem:

max𝐰,Δ1,Δ2\displaystyle\!\!\!\!\!\!\!\!\!\!\!\!\!\!\underset{\mathbf{w},\Delta_{1},\Delta_{2}}{\max} k𝒦j𝒥kQkj\displaystyle\!\!\!\!\sum\nolimits_{k\in\mathcal{K}}\sum\nolimits_{j\in\mathcal{J}_{k}}Q_{kj} (45a)
s.t.\displaystyle\!\!\!\!\!\!\!\!\!\!\!\!\!\!\operatorname{s.t.} (1),(32e)-(32g),(42),(56c)-(56e),(57),(59).\displaystyle\!\!\!\!{\rm(\ref{MF-RIS region}),(\ref{C_f_Gamma-1}){\text{-}}(\ref{C_f_mathcalC}),(\ref{C_local region}),(\ref{Appendix-D-1}){\text{-}}(\ref{Appendix-D-2}),(\ref{Appendix-D-3}),(\ref{P_w-C-SCA-appendix}).} (45b)

Problem (45) is convex, which can be solved efficiently via CVX[38]. The details of the proposed local region-based algorithm are given in Algorithm 3.

Based on the above solutions, a flowchart of the overall AO algorithm for solving problem (15) is given in Fig. 3. Since the optimal power allocation is obtained in closed form in Proposition 1, the complexity of Step 1 is 𝒪(1)\mathcal{O}(1). The complexity of the SDP problems in Steps 2 and 3 is 𝒪𝐅=𝒪(I𝐅max(2N,3J+M)42N)\mathcal{O}_{\mathbf{F}}=\mathcal{O}\big{(}I_{\mathbf{F}}\max(2N,3J+M)^{4}\sqrt{2N}\big{)} and 𝒪𝚯=𝒪(I𝚯max(2(M+1),3J)42(M+1))\mathcal{O}_{\boldsymbol{\Theta}}=\mathcal{O}\big{(}I_{\boldsymbol{\Theta}}\max(2(M+1),3J)^{4}\sqrt{2(M+1)}\big{)}, respectively, while the complexity of Step 4 using the interior-point method is 𝒪𝐰=𝒪(I𝐰(6+2M+11J)3.5)\mathcal{O}_{\mathbf{w}}=\mathcal{O}\big{(}I_{\mathbf{w}}(6+2M+11J)^{3.5}\big{)}. Here, I𝐅I_{\mathbf{F}}, I𝚯I_{\boldsymbol{\Theta}}, and I𝐰I_{\mathbf{w}} represent the respective number of iterations[36]. Since each sub-algorithm converges to a local optimum, the objective value of problem (15) is non-decreasing after each iteration. Moreover, the maximum transmit power constraint (15f) indicates that the objective value has an upper bound. Hence, the AO algorithm is guaranteed to converge.

V Numerical Results

In this section, numerical results are provided to validate the effectiveness of the proposed algorithm and the superiority of the considered MF-RIS assisted NOMA system over existing SF- and DF-RIS assisted systems. As shown in Fig. 4, we consider a scenario with Jr=Jt=2J_{r}=J_{t}=2 users, where the BS is located at 𝐰b=[0,0,5]T\mathbf{w}_{b}=[0,0,5]^{\rm T} m and the MF-RIS deployable region is set as 𝒫={[5,y,10]T|10y45}\mathcal{P}=\{[5,y,10]^{\rm T}|10\leq y\leq 45\}. All users are randomly distributed in their own circle with the radius of 22 m. The corresponding centers are set as [0,30,0]T[0,30,0]^{\rm T}, [0,35,0]T[0,35,0]^{\rm T}, [10,40,0]T[10,40,0]^{\rm T}, and [10,45,0]T[10,45,0]^{\rm T} m, respectively. Unless otherwise specified, we set PBSmax=40P_{\rm BS}^{\max}=40 dBm and M=120M=120. Other parameters are summarized in Table III.

Refer to caption
Figure 4: Simulation setup.
TABLE III: Simulation parameters
Parameter Value
Communication
parameters
h0=20h_{0}=-20 dB[20], κ0=2.2\kappa_{0}=2.2, κ1=2.8\kappa_{1}=2.8,
κ2=2.6\kappa_{2}=2.6, β0=β1=β2=3\beta_{0}=\beta_{1}=\beta_{2}=3 dB,
σu2=σs2=70\sigma_{u}^{2}=\sigma_{s}^{2}=-70 dBm
Power consumption
parameters
ξ=1.1\xi=1.1, Pb=1.5P_{b}=1.5 mW, PDC=0.3P_{\rm DC}=0.3 mW,
PC=2.1P_{\rm C}=2.1 μ\muW[21], Z=24Z=24 mW,
a=150a=150, q=0.014q=0.014[34]
Other parameters
N=4N=4, βmax=20\beta_{\max}=20 dB[14],
dλ=0.5\frac{d}{\lambda}=0.5, ρ(0)=103\rho^{(0)}=10^{-3}, ϵ=0.05\epsilon=0.05[8]
TABLE IV: Benchmark algorithms
Algorithm Power allocation Transmit beamforming MF-RIS coefficient MF-RIS location
Exhaustive search-based algorithm Exhaustive search Algorithm 1 Algorithm 2 Exhaustive search
SDR-based algorithm Proposition 1 SDR SDR Algorithm 3
MRT-based algorithm Proposition 1 MRT Algorithm 2 Algorithm 3
Random-based algorithm Proposition 1 Algorithm 1 Random coefficient Algorithm 3

To evaluate the performance of the proposed algorithm, we consider four benchmarks, as summarized in Table IV, i.e.:

  • Exhaustive search-based algorithm: The power allocation factors and MF-RIS locations are optimized by the exhaustive search. This case can be regarded as providing a performance upper bound of our proposed algorithm.

  • SDR-based algorithm: The transmit beamforming and MF-RIS coefficients are designed by adopting the SDR method, which ignores the rank-one constraints (33g) and (38g)[36]. The Gaussian randomization approach is applied when the obtained solution is not rank-one.

  • MRT-based algorithm: The transmit beamforming optimization problem is solved by invoking the maximum-ratio transmission (MRT) method[7].

  • Random-based algorithm: The MF-RIS coefficients are randomly set within the feasible region MF\mathcal{R}_{\rm MF}.

Refer to caption
Figure 5: Sum-rate versus PBSmaxP_{\rm BS}^{\max} under different algorithms.

Fig. 5 shows the sum-rate versus PBSmaxP_{\rm BS}^{\max} under different algorithms. The proposed algorithm achieves comparable performance to the exhaustive search-based algorithm with relatively low complexity. Specifically, the complexity of the proposed power allocation and MF-RIS location optimization algorithms is 𝒪(1)\mathcal{O}(1) and 𝒪(I𝐰(6+2M+11J)3.5)\mathcal{O}\big{(}I_{\mathbf{w}}(6+2M+11J)^{3.5}\big{)}, while the complexity of the exhaustive search with accuracy ς\varsigma is 𝒪(1ςJ)\mathcal{O}(\frac{1}{\varsigma^{J}}) and 𝒪(1ς3)\mathcal{O}(\frac{1}{\varsigma^{3}}), respectively. The random-based algorithm performs significantly worse than the proposed algorithm due to the non-optimized MF-RIS coefficients. Besides, the proposed algorithm achieves a higher sum-rate gain than the SDR-based algorithm. This is because using the SDR method to solve the relaxed problem usually generates a high-rank solution, and the constructed solution is normally suboptimal or even infeasible for the original problem[37]. In contrast, the adopted SRCOR method can approach a locally optimal rank-one solution. Additionally, it is observed that the proposed algorithm outperforms the MRT-based algorithm, which confirms the importance of joint optimization of the transmit beamforming and other variables.

To demonstrate the benefits brought by the proposed MF-RIS, we consider the following schemes. Unless otherwise specified, the NOMA technique is adopted for all schemes.

  • MF-RIS with βmkMF1={βmk|βmk[0,βmax],\beta_{m}^{k}\in\mathcal{R}_{\rm MF}^{1}=\{\beta_{m}^{k}|\beta_{m}^{k}\in[0,\beta_{\rm max}], kβmkβmax,m,k}\sum_{k}\beta_{m}^{k}\leq\beta_{\rm max},\forall m,k\}: The BS is assisted by the proposed MF-RIS, where the elements in S mode reflect, refract, and amplify the incident signal simultaneously.

  • MF-RIS with βmkMF2={βmk|βmk[0,βmax],\beta_{m}^{k}\in\mathcal{R}_{\rm MF}^{2}=\{\beta_{m}^{k}|\beta_{m}^{k}\in[0,\beta_{\max}], kβmk=0,m,k}\prod\nolimits_{k}\beta_{m}^{k}=0,\forall m,k\}: This scheme considers a special case of the MF-RIS in which the elements in S mode are divided into two groups. One group is used to serve users in the front half-space, while the other is used to serve users in the back half-space. This group-wise amplitude control reduces the overhead caused by exchanging configuration information between the BS and the MF-RIS, making it easier to implement in practical applications.

  • Active RIS[15]: This type of RIS can amplify and reflect signals simultaneously, or refract and amplify signals simultaneously, but cannot support energy harvesting.

  • STAR-RIS[9]: The communications from the BS to all users are assisted by a STAR-RIS, i.e., αm=1,βmk[0,1],kβmk1,θmk[0,2π),m,k\alpha_{m}=1,\beta_{m}^{k}\in[0,1],\sum\nolimits_{k}\beta_{m}^{k}\leq 1,\theta_{m}^{k}\in[0,2\pi),\forall m,k. Compared to the proposed MF-RIS, the STAR-RIS does not support signal amplification and energy harvesting.

  • Self-sustainable RIS[21]: This type of RIS allows a portion of the elements to operate in signal reflection or refraction mode, while the rest work in H mode.

  • Conventional RIS[7]: In this scheme, the RIS only supports reflection or refraction.

  • Without RIS: This is a baseline with no RIS deployment. Only direct links are considered from the BS to the users.

To achieve full-space coverage, for the active RIS, self-sustainable RIS, and conventional RIS, one reflective RIS and one refractive RIS are deployed adjacent to each other at the same location as the MF-RIS, and each RIS has M/2M/2 elements. In addition, for fairness, we define the total power budget as PtotalmaxP_{\rm total}^{\rm max}, where Ptotalmax=PBSmax+PRISmaxP_{\rm total}^{\rm max}=P_{\rm BS}^{\rm max}+P_{\rm RIS}^{\rm max} and PBSmax=PRISmaxP_{\rm BS}^{\rm max}=P_{\rm RIS}^{\rm max} hold for the active RIS-aided schemes, and Ptotalmax=PBSmaxP_{\rm total}^{\rm max}=P_{\rm BS}^{\rm max} holds for other schemes. Here, PRISmaxP_{\rm RIS}^{\rm max} denotes the maximum amplification power at the active RIS.

Refer to caption
Figure 6: Convergence behavior of the proposed AO algorithm under different MM and different operating schemes.

The convergence behavior of the proposed algorithm with different numbers of MF-RIS elements and different operating schemes is illustrated in Fig. 6. All curves gradually increase and exhibit the trend of convergence after a finite number of iterations. Specifically, the proposed algorithm with M=100M=100 converges to a stable value after about 66 iterations. However, for the cases with M=120M=120, it requires around 88 iterations for convergence. This is because both the number of optimization variables and the number of constraints increase with MM, and thus increase the complexity of solving (15).

Refer to caption
Figure 7: Sum-rate versus PtotalmaxP_{\rm total}^{\max} under different schemes.

Fig. 7 depicts the sum-rate versus the total power budget. For the two self-sustainable schemes, the proposed MF-RIS is far superior to the self-sustainable RIS. Specifically, when Ptotalmax=40P_{\rm total}^{\max}\!=\!40 dBm, the MF-RIS scheme enjoys 98.898.8% higher sum-rate gain than the scheme with self-sustainable RIS. This result can be explained as follows. The MF-RIS adjusts its coefficients in an element-wise manner, while the self-sustainable RIS employs a fixed mode for each element. The latter suffers from throughput loss due to its limited DoFs. Moreover, the signal amplification design effectively alleviates the impact of “double attenuation” on the MF-RIS-aided links. This means that the proposed MF-RIS makes better use of the harvested energy and thus increases the sum-rate of all users. Additionally, compared to the conventional RIS, the MF-RIS achieves 23.423.4% higher sum-rate gain due to its resource allocation flexibility and signal amplification function.

We observe from Fig. 7 that the throughput performance of active RIS and STAR-RIS is better than that of MF-RIS. This observation can be explained as follows: 1) the active RIS and the STAR-RIS use all elements to serve users, while the MF-RIS only uses part of the elements to relay signals; 2) unlike the active RIS and the STAR-RIS, which assume an ideal lossless signal relay and power supply process, the MF-RIS takes into account the inevitable power loss and circuit consumption during energy harvesting and signal amplification. Although the self-sustainability of MF-RIS comes with the decreased performance, the sum-rate loss decreases with PtotalmaxP_{\rm total}^{\max} due to the fact that the elements in H mode can harvest more energy at high power. Besides, the active RIS is superior to the STAR-RIS and the gain increases with PtotalmaxP_{\rm total}^{\max}, indicating that a larger RIS amplification power allows the signal amplification gain to be greater than the gain of full-space coverage. For the MF-RIS, the scheme of βmkMF1\beta_{m}^{k}\in\mathcal{R}_{\rm MF}^{1} always performs better than the scheme of βmkMF2\beta_{m}^{k}\in\mathcal{R}_{\rm MF}^{2}. This is because the continuous set MF1\mathcal{R}_{\rm MF}^{1} allows for more flexibility in amplitude modeling, while the binary set MF2\mathcal{R}_{\rm MF}^{2} restricts the capacity of each element to enhance the desired signal, suppress inter-user interference, and ultimately reduces the achievable sum-rate.

Refer to caption
Figure 8: Sum-rate versus MM under different schemes.
Refer to caption
Figure 9: Sum-rate versus MSM_{\rm S} under different schemes.

Fig. 8 illustrates the sum-rate versus the number of elements. The active RIS outperforms the STAR-RIS as MM increases, owing to its ability to directly amplify the signal. Since a larger MM means that there are more elements operating in S mode, the gap between the MF-RIS and the STAR-RIS becomes negligible. In contrast, maintaining self-sustainability for the self-sustainable RIS is costly. This further confirms that the proposed MF-RIS can effectively compensate for the performance loss caused by self-sustainability through full-space coverage and signal power enhancement.

In Fig. 9, we plot the sum-rate versus the number of elements operating in S mode to exhibit the relationship between sum-rate maximization and energy harvesting maximization. Here, we define MHM_{\rm H} and MSM_{\rm S} as the numbers of elements in H and S modes, respectively, satisfying MH=MmαmM_{\rm H}\!=\!\!M\!-\!\sum_{m\in\mathcal{M}}{\alpha_{m}} and MS=mαmM_{\rm S}\!=\!\!\sum_{m\in\mathcal{M}}{\alpha_{m}}. The sum-rate of the MF-RIS first increases and then decreases as MSM_{\rm S} increases, which deviates from the common sense for passive RISs that more signal relay elements always benefit. This is because the trade-off between MSM_{\rm S} and MHM_{\rm H} at a fixed MM brings a trade-off between sum-rate and energy harvesting. Specifically, when MSM_{\rm S} is small, the increase in MSM_{\rm S} leads to a decrease in MHM_{\rm H} and degrades the energy harvesting performance, but the relatively large MHM_{\rm H} can harvest enough energy for the elements in S mode. Therefore, these signal relay elements can take advantage of reshaping the full-space wireless channels and mitigating their double attenuation to enhance signal reception.

Refer to caption
Figure 10: Sum-rate versus PBSmaxP_{\rm BS}^{\max} under different schemes.

Fig. 9 shows that the sum-rate decreases as MSM_{\rm S} increases after reaching the optimal value. This is because that the decrease in MHM_{\rm H} substantially restricts the energy that can be harvested, whereas the increase in MSM_{\rm S} leads to higher circuit power consumption. Consequently, the available amplification power at the MF-RIS is significantly reduced, making the MF-RIS suffer more from the increased MSM_{\rm S}. When MSM_{\rm S} exceeds the maximum supportable value, the limited harvested energy may not even maintain self-sustainability, resulting in the failure of self-sustainable RISs. Since a larger βmax\beta_{\max} generates a greater output power, the optimal MSM_{\rm S} for the scheme of βmax=16\beta_{\max}\!=\!16 dB is larger than that of βmax=20\beta_{\max}\!=\!20 dB. These results indicate that a flexible element allocation strategy is crucial for self-sustainable RIS schemes to balance the trade-off between sum-rate and energy harvesting. A considerable performance gain is observed from the proposed MF-RIS and the self-sustainable RIS, verifying that the MF-RIS can better utilize the limited harvested power to enhance the sum-rate.

In Fig. 10, we compare the achievable sum-rate of the considered NOMA and the conventional orthogonal multiple access (OMA) schemes. The MF-RIS and the self-sustainable RIS under NOMA yield a larger sum-rate value than their corresponding OMA schemes. Particularly, when PBSmax=40P_{\rm BS}^{\max}=40 dBm, the NOMA systems assisted by the MF-RIS and the self-sustainable RIS attain 251251% and 114.7114.7% higher sum-rate gains than their OMA counterparts, respectively. The reason behind this is twofold: 1) by serving all users within the same resource block, NOMA facilitates more flexible resource allocation to improve spectral efficiency; 2) the location and coefficient design of RIS enable a smart NOMA operation by intelligently tuning the direction of users’ channel vectors.

Refer to caption
Figure 11: Sum-rate versus MM under different deployment strategies and different user location information.
Refer to caption
Figure 12: Sum-rate versus yy under different schemes.

Fig. 11 depicts the achievable sum-rate versus the deployment strategy of RIS under different user location accuracy. We define τ\tau as the location error of the user’s actual location from the estimated location. Here, “Optimal location” invokes exhaustive search to obtain the optimal RIS location, while “Fixed location” fixes the RIS location at 𝐰=[5,20,10]T\mathbf{w}=[5,20,10]^{\rm T} m. The “Proposed algorithm” significantly outperforms the “Fixed location” approach, almost reaching the optimal performance. This is because optimizing the RIS location unleashes the full potential of RIS and NOMA, by providing a new DoF for their interplay. Another observation is that though the sum-rate achieved by the proposed algorithm decreases with increasing user location errors, the gaps between our algorithm and the benchmark schemes remain stable. This shows that the proposed algorithm maintains stable performance even at a low level of the location accuracy.

In Fig. 12, we study the impact of RIS location on sum-rate by varying the YY-coordinate of RIS. For the STAR-RIS scheme, the sum-rate first decreases and then increases as yy increases, but decreases again after about y=30y\!=\!30 m. This trend can be explained as follows. Since the channel gain is a decreasing function of the link distance, the STAR-RIS deployed in the vicinity of the BS or users creates signal hot spots. However, when the STAR-RIS is located at the middle between the BS and users, both the BS-RIS and RIS-user links experience severe signal attenuation. In contrast, the active RIS is less affected by double attenuation as it provides more amplification gain to compensate for path loss when moving away from the BS. The inflection point occurs when deploying the STAR-RIS and active RIS near the user closer to the BS, which allows exploiting the channel gain differences among multiple NOMA users. As for self-sustainable RIS schemes, the sum-rate decreases as the RIS moves away from the BS. The optimal deployment location is closest to the BS within the allowed range. To maintain the balance between the energy supply and demand, both the MF-RIS and the self-sustainable RIS need to allocate more elements for energy harvesting when they are far away from the BS, resulting in fewer elements to relay signals. The above observations show that conventional RISs obtain good performance when they are deployed near the transmitter or receiver, but for self-sustainable RISs, it would be better to deploy closer to the transmitter.

VI Conclusion

In this paper, we proposed an MF-RIS architecture enabling simultaneous signal reflection, refraction, amplification, and energy harvesting. The differences between the proposed MF-RIS and existing SF- and DF-RIS were first discussed from the perspective of the signal model. Next, we investigated the sum-rate maximization problem in an MF-RIS-aided NOMA network and the resulting MINLP problem was efficiently solved by an iterative algorithm. Numerical results provided useful insights for practical system design, which, in particular, are 1) compared to the conventional passive RIS and self-sustainable passive RIS, the proposed MF-RIS attain 23.423.4% and 98.898.8% performance gains, respectively, by integrating multiple functions on one surface; and 2) deploying MF-RIS closer to the transmitter side facilitates energy harvesting and therefore brings a higher sum-rate gain. Several interesting directions to pursue include:

  • Practical implementation: Compared to the prototype design of existing SF- and DF-RIS, the proposed MF-RIS faces new implementation challenges. For example, how to embed circuits that perform signal reflection, refraction, amplification, and energy harvesting functions into a limited substrate simultaneously, and how to balance the efficiency of these circuits.

  • High-accuracy channel estimation: The proposed MF-RIS requires more pilot overhead than existing SF-RIS to estimate the reflection and refraction channels. Although simultaneously estimating all channels reduces the overhead, how to achieve fast and high-accuracy channel estimation requires further research.

  • Low-complexity deployment: To make the proposed MF-RIS easy to deploy in practical systems, we can group the elements and set the same reflective/refractive amplitude for each group. Nevertheless, it remains open how to group the elements during practical deployment to attain desired performance with low complexity.

Appendix A Proof of Lemma 1

Based on the rate expression in (9) and the equivalently combined channel gain γkj\gamma_{kj}, we obtain

p¯kj=rkjmin(i=j+1Jkp¯ki+1γkj).\displaystyle\bar{p}_{kj}=r_{kj}^{\min}\left(\sum\nolimits_{i=j+1}^{J_{k}}\bar{p}_{ki}+\frac{1}{\gamma_{kj}}\right). (46)

According to [39, Proposition 1], the minimum transmit power is derived as

j𝒥kp¯kj\displaystyle\sum\nolimits_{j\in\mathcal{J}_{k}}\bar{p}_{kj} =j𝒥krkjmin(i=j+1Jkp¯ki+1γkj)\displaystyle=\sum\nolimits_{j\in\mathcal{J}_{k}}r_{kj}^{\min}\left(\sum\nolimits_{i=j+1}^{J_{k}}\bar{p}_{ki}+\frac{1}{\gamma_{kj}}\right)
=j𝒥k(i=1j1(rkimin+1))rkjminγkj.\displaystyle=\sum\nolimits_{j\in\mathcal{J}_{k}}\left(\prod\nolimits_{i=1}^{j-1}\left(r_{ki}^{\min}+1\right)\right)\frac{r_{kj}^{\min}}{\gamma_{kj}}. (47)

Thus, in order to make problem (21) feasible, power allocation coefficients should satisfy (22).

Appendix B Proof of Proposition 1

Following the rate-splitting principle and defining the function Ψ(x)=log2(1+x)\Psi(x)=\log_{2}(1+x), we rewrite the achievable rate expression RjjkR_{j\to j}^{k} as follows[40]:

Rjjk\displaystyle R_{j\to j}^{k}\! =(a)Ψ[γkjpkjγkji=j+1Jkpki+1]=(b)Ψ[γkj(p¯kj+pkj)γkji=j+1Jkpki+1]\displaystyle\!\overset{(a)}{=}\!\Psi\Big{[}\frac{\gamma_{kj}p_{kj}}{\gamma_{kj}\sum\nolimits_{i=j+1}^{J_{k}}{p}_{ki}+1}\Big{]}\!\overset{(b)}{=}\!\Psi\Big{[}\frac{\gamma_{kj}(\bar{p}_{kj}+\triangle p_{kj})}{\gamma_{kj}\sum\nolimits_{i=j+1}^{J_{k}}{p}_{ki}+1}\Big{]}
=(c)Ψ[p¯kj+rkjmini=j+1Jkpkii=j+1Jkpki+1γkj]\displaystyle\!\overset{(c)}{=}\!\Psi\Big{[}\frac{\bar{p}_{kj}+r_{kj}^{\min}\sum\nolimits_{i=j+1}^{J_{k}}\triangle p_{ki}}{\sum\nolimits_{i=j+1}^{J_{k}}p_{ki}+\frac{1}{\gamma_{kj}}}\Big{]}
+Ψ[pkjrkjmini=j+1Jkpkip¯kj+rkjmini=j+1Jkpki+i=j+1Jkpki+1γkj]\displaystyle~{}~{}~{}\!+\!\Psi\Big{[}\frac{\triangle{p}_{kj}-r_{kj}^{\min}\sum\nolimits_{i=j+1}^{J_{k}}\triangle p_{ki}}{\bar{p}_{kj}+r_{kj}^{\min}\sum\nolimits_{i=j+1}^{J_{k}}\triangle p_{ki}+\sum\nolimits_{i=j+1}^{J_{k}}p_{ki}+\frac{1}{\gamma_{kj}}}\Big{]}
=(d)Ψ[p¯kj+rkjmini=j+1Jkpkii=j+1Jkp¯ki+i=j+1Jkpki+1γkjrkjmin]\displaystyle\!\overset{(d)}{=}\!\Psi\Big{[}\underbrace{\frac{\bar{p}_{kj}+r_{kj}^{\min}\sum\nolimits_{i=j+1}^{J_{k}}\triangle p_{ki}}{\sum\nolimits_{i=j+1}^{J_{k}}\bar{p}_{ki}+\sum\nolimits_{i=j+1}^{J_{k}}\triangle p_{ki}+\frac{1}{\gamma_{kj}}}}_{r_{kj}^{\min}}\Big{]}
+Ψ[pkjrkjmini=j+1Jkpkii=jJkp¯ki+(1+rkjmin)i=j+1Jkpki+1γkjrkjmin],\displaystyle~{}~{}+\Psi\Big{[}\underbrace{\frac{\triangle{p}_{kj}-r_{kj}^{\min}\sum\nolimits_{i=j+1}^{J_{k}}\triangle p_{ki}}{\sum\nolimits_{i=j}^{J_{k}}\bar{p}_{ki}+(1+r_{kj}^{\min})\sum\nolimits_{i=j+1}^{J_{k}}\triangle p_{ki}+\frac{1}{\gamma_{kj}}}}_{\triangle r_{kj}^{\min}}\Big{]}, (48)

where (b)(b) follows from pkj=p¯kj+pkjp_{kj}=\bar{p}_{kj}+\triangle p_{kj}, (c)(c) holds due to the rate-splitting property[40], i.e., Ψ(x+yz)=Ψ(xz)+Ψ(yx+z)\Psi(\frac{x+y}{z})=\Psi(\frac{x}{z})+\Psi(\frac{y}{x+z}), and (d)(d) is due to the fact that the following equation holds:

p¯kj+rkjmini=j+1Jkpki\displaystyle\bar{p}_{kj}+r_{kj}^{\min}\sum\nolimits_{i=j+1}^{J_{k}}\triangle p_{ki}
=rkjmin(i=j+1Jkp¯ki+1γkj)+rkjmini=j+1Jkpki.\displaystyle=r_{kj}^{\min}\left(\sum\nolimits_{i=j+1}^{J_{k}}\bar{p}_{ki}+\frac{1}{\gamma_{kj}}\right)+r_{kj}^{\min}\sum\nolimits_{i=j+1}^{J_{k}}\triangle p_{ki}. (49)

To simplify the expression of rkjmin\triangle r_{kj}^{\min}, we define

p^kj=(pkjrkjmini=j+1Jkpki)i=1j1(1+rkimin),\displaystyle\!\!\!\triangle\hat{p}_{kj}\!=\!\big{(}\triangle p_{kj}\!-\!r_{kj}^{\min}\sum\nolimits_{i=j+1}^{J_{k}}\!\!\triangle p_{ki}\big{)}\prod\nolimits_{i=1}^{j-1}(1\!+\!r_{ki}^{\min}),\!\!\!\!\!\! (50a)
p^kj=(i=jJkp¯ki+1γkj)i=1j1(1+rkimin).\displaystyle\!\!\!\hat{p}_{kj}\!=\!\big{(}\!\sum\nolimits_{i=j}^{J_{k}}\bar{p}_{ki}\!+\!\frac{1}{\gamma_{kj}}\big{)}\prod\nolimits_{i=1}^{j-1}(1\!+\!r_{ki}^{\min}).\!\!\!\!\!\! (50b)

Based on (50), we then obtain the following equations:

i=j+1Jkp^ki=i=1j(1+rkimin)i=j+1Jkpki,\displaystyle\sum\nolimits_{i=j+1}^{J_{k}}\triangle\hat{p}_{ki}=\prod\nolimits_{i=1}^{j}(1+r_{ki}^{\min})\sum\nolimits_{i=j+1}^{J_{k}}\triangle p_{ki}, (51a)
rkjmin=p^kjp^kj+i=j+1Jkp^ki.\displaystyle\triangle r_{kj}^{\min}=\frac{\triangle\hat{p}_{kj}}{\hat{p}_{kj}+\sum_{i=j+1}^{J_{k}}\triangle\hat{p}_{ki}}. (51b)

As a result, problem (21) is reformulated as

maxp^kj\displaystyle\underset{\triangle\hat{p}_{kj}}{\max} j𝒥kΨ(rkjmin)+j𝒥kΨ(rkjmin)\displaystyle\sum\nolimits_{j\in\mathcal{J}_{k}}\Psi(r_{kj}^{\min})+\sum\nolimits_{j\in\mathcal{J}_{k}}\Psi(\triangle r_{kj}^{\min}) (52a)
s.t.\displaystyle\operatorname{s.t.} j𝒥kp^kj=1j𝒥kp¯kj,\displaystyle\sum\nolimits_{j\in\mathcal{J}_{k}}\triangle\hat{p}_{kj}=1-\sum\nolimits_{j\in\mathcal{J}_{k}}\bar{p}_{kj}, (52b)

where j𝒥kΨ(rkjmin)\sum\nolimits_{j\in\mathcal{J}_{k}}\Psi(r_{kj}^{\min}) is a constant that does not affect the optimality of (52). Since the inequality p^kjp^k(j+1)\hat{p}_{kj}\geq\hat{p}_{k(j+1)} holds and Ψ(rkjmin)\Psi(\triangle r_{kj}^{\min}) increases with rkjmin\triangle{r}_{kj}^{\min}, the optimal solution of (52) is to allocate all the excess power to user UkJkU_{kJ_{k}} with the best equivalent channel gain, i.e.,

p^kJk=1j𝒥kp¯kj,p^kj=0,j{𝒥k/Jk}.\displaystyle\!\!\!\triangle\hat{p}_{kJ_{k}}=1-\sum\nolimits_{j\in\mathcal{J}_{k}}\bar{p}_{kj},~{}~{}\triangle\hat{p}_{kj}=0,~{}\forall j\in\{\mathcal{J}_{k}/J_{k}\}.\!\!\! (53)

Finally, the optimal power allocation coefficients and the corresponding objective value of problem (21) are obtained as (27) and (28), respectively.

Appendix C Proof of Constraint (40)

We apply the penalty-based method to handle constraint ηmk=αm2βmk\eta_{m}^{k}=\alpha_{m}^{2}\beta_{m}^{k}. Note that if we directly add it as a penalty term into the objective function (38a), (38a) will become k𝒦j𝒥kQkj\sum\nolimits_{k\in\mathcal{K}}\sum\nolimits_{j\in\mathcal{J}_{k}}Q_{kj} ρk𝒦m(αm2βmkηmk)-\rho\sum\nolimits_{k\in\mathcal{K}}\sum\nolimits_{m\in\mathcal{M}}(\alpha_{m}^{2}\beta_{m}^{k}-\eta_{m}^{k}), where ρ>0\rho>0 denotes the penalty factor. The resultant objective function is non-concave due to the term αm2βmk\alpha_{m}^{2}\beta_{m}^{k}. To this end, we replace it with its CUB [13]. Define the functions g1(αm,βmk)=αm2βmkg_{1}(\alpha_{m},\beta_{m}^{k})=\alpha_{m}^{2}\beta_{m}^{k} and g2(αm,βmk)=cmk2αm4+(βmk)22cmkg_{2}(\alpha_{m},\beta_{m}^{k})=\frac{c_{m}^{k}}{2}\alpha_{m}^{4}+\frac{(\beta_{m}^{k})^{2}}{2c_{m}^{k}}. Then it is easy to check that g2(αm,βmk)g_{2}(\alpha_{m},\beta_{m}^{k}) is a convex overestimate of g1(αm,βmk)g_{1}(\alpha_{m},\beta_{m}^{k}) for cmk>0c_{m}^{k}>0. Moreover, when cmk=βmkαm2c_{m}^{k}=\frac{\beta_{m}^{k}}{\alpha_{m}^{2}}, the equations g1(αm,βmk)=g2(αm,βmk)g_{1}(\alpha_{m},\beta_{m}^{k})=g_{2}(\alpha_{m},\beta_{m}^{k}) and g1(αm,βmk)=g2(αm,βmk)\nabla g_{1}(\alpha_{m},\beta_{m}^{k})=\nabla g_{2}(\alpha_{m},\beta_{m}^{k}) hold, where g1(αm,βmk)\nabla g_{1}(\alpha_{m},\beta_{m}^{k}) and g2(αm,βmk)\nabla g_{2}(\alpha_{m},\beta_{m}^{k}) are the gradients of g1(αm,βmk)g_{1}(\alpha_{m},\beta_{m}^{k}) and g2(αm,βmk)g_{2}(\alpha_{m},\beta_{m}^{k}), respectively.

Appendix D Terms Introduced in Constraint (43)

The terms introduced in constraint (43) that are unrelated to the optimization variable in the ii-th iteration are given by

𝐃kj=𝐄kj𝐅k𝐄kjH,𝐃¯kj=𝐄kj𝐅k¯𝐄kjH,\displaystyle\mathbf{D}_{kj}=\mathbf{E}_{kj}\mathbf{F}_{k}\mathbf{E}_{kj}^{\rm H},~{}\bar{\mathbf{D}}_{kj}=\mathbf{E}_{kj}\mathbf{F}_{\bar{k}}\mathbf{E}_{kj}^{\rm H}, (54a)
𝐄kj=[𝐡kj,h0𝐏kH𝐠^kj(i1)]H,𝐏k=𝚯k𝐇^(i1),\displaystyle\mathbf{E}_{kj}=\big{[}\mathbf{h}_{kj},h_{0}\mathbf{P}_{k}^{\rm H}\hat{\mathbf{g}}_{kj}^{(i-1)}\big{]}^{\rm H},~{}\mathbf{P}_{k}=\boldsymbol{\Theta}_{k}\hat{\mathbf{H}}^{(i-1)}, (54b)
𝒲1=h0σs2(𝐠^kj(i1))H𝚯k2,\displaystyle\mathcal{W}_{1}=h_{0}\sigma_{s}^{2}\lVert{(\hat{\mathbf{g}}_{kj}^{(i-1)})}^{\mathrm{H}}\boldsymbol{\Theta}_{k}\lVert^{2}, (54c)
𝒲2=𝒲¯σs2k𝒦𝚯kF2h0k𝒦(k𝒦Tr(𝐏k𝐅k𝐏kH)),\displaystyle\mathcal{W}_{2}=\frac{\bar{\mathcal{W}}-\sigma_{s}^{2}\sum_{k\in\mathcal{K}}\lVert\boldsymbol{\Theta}_{k}\lVert_{F}^{2}}{h_{0}\sum\nolimits_{k\in\mathcal{K}}\big{(}\sum_{k^{\prime}\in\mathcal{K}}{\rm Tr}(\mathbf{P}_{k}\mathbf{F}_{k^{\prime}}\mathbf{P}_{k}^{\rm H})\big{)}}, (54d)
𝒲3=ζmσs2(1αm)h0(1αm)k𝒦Tr(𝐓¯m𝐇^(i1)𝐅k(𝐇^(i1))H𝐓¯mH).\displaystyle\mathcal{W}_{3}=\frac{\zeta_{m}-\sigma_{s}^{2}(1-\alpha_{m})}{h_{0}(1-\alpha_{m})\sum\nolimits_{k\in\mathcal{K}}\operatorname{Tr}\big{(}\bar{\mathbf{T}}_{m}\hat{\mathbf{H}}^{(i-1)}\mathbf{F}_{k}{(\hat{\mathbf{H}}^{(i-1)})}^{\rm H}\bar{\mathbf{T}}_{m}^{\rm H}\big{)}}. (54e)

Appendix E Proof of Constraint (43)

We define the slack variable set Δ2={t,tkj,t¯kj,ekj,v,\Delta_{2}=\{t,t_{kj},\bar{t}_{kj},e_{kj},v, v¯,rkj,r¯kj,skj}\bar{v},r_{kj},\bar{r}_{kj},s_{kj}\} as

t=dbsκ02,tkj=dskjκ22,t¯kj=ttkj,ekj=dskjκ2,\displaystyle\!\!\!\!\!\!\!\!\!t\!=\!d_{bs}^{-\frac{\kappa_{0}}{2}},{t}_{kj}\!=\!d_{skj}^{-\frac{\kappa_{2}}{2}},\bar{t}_{kj}\!=\!t{t}_{kj},e_{kj}\!=\!d_{skj}^{-\kappa_{2}}, (55a)
v=v¯=dbsκ0,rkj=r¯kj=𝐝¯kjT𝐃kj𝐝¯kj,skj=𝐝¯kjT𝐃¯kj𝐝¯kj.\displaystyle\!\!\!\!\!\!\!\!\!v\!=\!\bar{v}=d_{bs}^{-\kappa_{0}},r_{kj}\!=\!\bar{r}_{kj}\!=\!\bar{\mathbf{d}}_{kj}^{\rm T}\mathbf{D}_{kj}\bar{\mathbf{d}}_{kj},s_{kj}\!=\!\bar{\mathbf{d}}_{kj}^{\rm T}\bar{\mathbf{D}}_{kj}\bar{\mathbf{d}}_{kj}.\!\!\!\!\!\!\!\!\! (55b)

Constraints (43a) and (43b) are then rewritten as

tdbsκ02,tkjdskjκ22,ekjdskjκ2,\displaystyle t\leq d_{bs}^{-\frac{\kappa_{0}}{2}},~{}~{}t_{kj}\leq d_{skj}^{-\frac{\kappa_{2}}{2}},~{}~{}e_{kj}\geq d_{skj}^{-\kappa_{2}}, (56a)
vdbsκ0,v¯dbsκ0,rkj𝐝¯kjT𝐃kj𝐝¯kj,\displaystyle v\geq d_{bs}^{-\kappa_{0}},~{}~{}\bar{v}\leq d_{bs}^{-\kappa_{0}},~{}~{}r_{kj}\leq\bar{\mathbf{d}}_{kj}^{\rm T}\mathbf{D}_{kj}\bar{\mathbf{d}}_{kj}, (56b)
t¯kjttkj,r¯kj𝐝¯kjT𝐃kj𝐝¯kj,skj𝐝¯kjT𝐃¯kj𝐝¯kj,\displaystyle\bar{t}_{kj}\leq tt_{kj},~{}~{}\bar{r}_{kj}\geq\bar{\mathbf{d}}_{kj}^{\rm T}{\mathbf{D}}_{kj}\bar{\mathbf{d}}_{kj},~{}~{}s_{kj}\geq\bar{\mathbf{d}}_{kj}^{\rm T}\bar{\mathbf{D}}_{kj}\bar{\mathbf{d}}_{kj}, (56c)
Akj1rkj,Bkjskj+ekj𝒲1+σu2,\displaystyle A_{kj}^{-1}\leq r_{kj},~{}B_{kj}\geq s_{kj}+e_{kj}\mathcal{W}_{1}+\sigma_{u}^{2}, (56d)
Ckjr¯kjPkj+Bkj,v𝒲2,v¯𝒲3.\displaystyle C_{kj}\geq\bar{r}_{kj}P_{kj}+B_{kj},~{}~{}v\leq\mathcal{W}_{2},~{}~{}\bar{v}\geq\mathcal{W}_{3}. (56e)

Since the constraints in (56a) and (56b) are still non-convex, we apply the SCA method to deal with them. Specifically, by exploiting the first-order Taylor expansion of 𝐝¯kjT𝐃kj𝐝¯kj\bar{\mathbf{d}}_{kj}^{\rm T}\mathbf{D}_{kj}\bar{\mathbf{d}}_{kj} at the given point {𝐝¯kj()}\{\bar{\mathbf{d}}_{kj}^{(\ell)}\}, constraint rkj𝐝¯kjT𝐃kj𝐝¯kjr_{kj}\leq\bar{\mathbf{d}}_{kj}^{\rm T}\mathbf{D}_{kj}\bar{\mathbf{d}}_{kj} is recast as the following convex one:

rkj(𝐝¯kj())T𝐃kj𝐝¯kj()+2((𝐝¯kj())T𝐃kj𝐝¯kj).\displaystyle r_{kj}\leq-(\bar{\mathbf{d}}_{kj}^{(\ell)})^{\rm T}\mathbf{D}_{kj}\bar{\mathbf{d}}_{kj}^{(\ell)}+2\Re\big{(}(\bar{\mathbf{d}}_{kj}^{(\ell)})^{\rm T}\mathbf{D}_{kj}\bar{\mathbf{d}}_{kj}\big{)}. (57)

To facilitate the derivation of the other constraints in (56a) and (56b), we rewrite them as follows:

g(x,y,z)+g(xb,yb,zb)2xbx2yby2zbzt4κ00,\displaystyle\!\!\!\!\!\!\!\!\!\!\!\!g(x,y,z)\!+\!g(x_{b},y_{b},z_{b})\!-\!2x_{b}x\!-\!2y_{b}y\!-\!2z_{b}z\!-\!t^{-\frac{4}{\kappa_{0}}}\!\leq\!0, (58a)
g(x,y,z)+g(xkj,ykj,0)2xkjx2ykjytkj4κ20,\displaystyle\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!g(x,y,z)\!+\!g(x_{kj},y_{kj},0)\!-\!2x_{kj}x\!-\!2y_{kj}y\!-\!t_{kj}^{-\frac{4}{\kappa_{2}}}\!\leq\!0, (58b)
g(x,y,z)g(xkj,ykj,0)+2xkjx+2ykjy+ekj2κ20,\displaystyle\!\!\!\!\!\!\!\!\!\!\!\!\!\!-g(x,y,z)\!-\!g(x_{kj},y_{kj},0)\!+\!2x_{kj}x\!+\!2y_{kj}y\!+\!e_{kj}^{-\frac{2}{\kappa_{2}}}\!\leq\!0, (58c)
g(x,y,z)g(xb,yb,zb)+2xbx+2yby+2zbz+v2κ00,\displaystyle\!\!\!\!\!\!\!\!\!\!\!\!-\!g(x,y,z)\!\!-\!\!g(x_{b},y_{b},z_{b})\!+\!2x_{b}x\!\!+\!\!2y_{b}y\!+\!2z_{b}z\!+\!v^{-\frac{2}{\kappa_{0}}}\!\leq\!0, (58d)
g(x,y,z)+g(xb,yb,zb)2xbx2yby2zbzv¯2κ00,\displaystyle\!\!\!\!\!\!\!\!\!\!\!\!\!g(x,y,z)\!+\!g(x_{b},y_{b},z_{b})\!-\!2x_{b}x\!-\!2y_{b}y\!-\!2z_{b}z\!-\!\bar{v}^{-\frac{2}{\kappa_{0}}}\!\leq\!0, (58e)

where the function g(a,b,c)g(a,b,c) is defined as g(a,b,c)=a2+b2+c2g(a,b,c)=a^{2}+b^{2}+c^{2}. The existence of non-convex terms t4κ0-t^{-\frac{4}{\kappa_{0}}}, tkj4κ2-t_{kj}^{-\frac{4}{\kappa_{2}}}, v¯2κ0-{\bar{v}}^{-\frac{2}{\kappa_{0}}}, x2-x^{2}, y2-y^{2}, and z2-z^{2} makes (58) non-convex. By replacing these terms with their respective convex first-order Taylor expansions, we obtain the following convex ones:

g(x,y,z)+g(xb,yb,zb)2xbx2yby2zbz\displaystyle g(x,y,z)+g(x_{b},y_{b},z_{b})-2x_{b}x-2y_{b}y-2z_{b}z
+f(t,4κ0)0,\displaystyle\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!+f(t,-\frac{4}{\kappa_{0}})\leq 0, (59a)
g(x,y,z)+g(xkj,ykj,0)2xkjx2ykjy\displaystyle\!\!\!\!\!\!\!\!\!\!\!\!g(x,y,z)+g(x_{kj},y_{kj},0)-2x_{kj}x-2y_{kj}y
+f(tkj,4κ2)0,\displaystyle\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!+f(t_{kj},-\frac{4}{\kappa_{2}})\leq 0, (59b)
f(x,2)+f(y,2)+f(z,2)g(xkj,ykj,0)\displaystyle\!\!\!\!\!\!\!\!\!\!\!\!f(x,2)+f(y,2)+f(z,2)-g(x_{kj},y_{kj},0)
+2xkjx+2ykjy+ekj2κ20,\displaystyle\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!+2x_{kj}x+2y_{kj}y+e_{kj}^{-\frac{2}{\kappa_{2}}}\leq 0, (59c)
f(x,2)+f(y,2)+f(z,2)g(xb,yb,zb)\displaystyle\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!f(x,2)+f(y,2)+f(z,2)-g(x_{b},y_{b},z_{b})
+2xbx+2yby+2zbz+v2κ00,\displaystyle\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!+2x_{b}x+2y_{b}y+2z_{b}z+v^{-\frac{2}{\kappa_{0}}}\leq 0, (59d)
g(x,y,z)+g(xb,yb,zb)2xbx2yby\displaystyle\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!g(x,y,z)+g(x_{b},y_{b},z_{b})-2x_{b}x-2y_{b}y
2zbz+f(v¯,2κ0)0,\displaystyle\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!-2z_{b}z+f(\bar{v},-\frac{2}{\kappa_{0}})\leq 0, (59e)

where f(p,q)=(p())qq(p())q1(pp())f(p,q)=-{(p^{(\ell)})}^{q}-q{(p^{(\ell)})}^{q-1}(p-p^{(\ell)}) is the first-order Taylor expansion of pq-p^{q} at the given point {p()}\{p^{(\ell)}\}.

References

  • [1] Q. Wu and R. Zhang, “Towards smart and reconfigurable environment: Intelligent reflecting surface aided wireless network,” IEEE Commun. Mag., vol. 58, no. 1, pp. 106-112, Jan. 2020.
  • [2] Y. Liu et al., “Reconfigurable intelligent surfaces: Principles and opportunities,” IEEE Commun. Surveys Tuts., vol. 23, no. 3, pp. 1546-1577, 3rd Quart., 2021.
  • [3] K. Liu, Z. Zhang, L. Dai, and L. Hanzo, “Compact user-specific reconfigurable intelligent surfaces for uplink transmission,” IEEE Trans. Commun., vol. 70, no. 1, pp. 680-692, Jan. 2022.
  • [4] W. Ni, X. Liu, Y. Liu, H. Tian, and Y. Chen, “Resource allocation for multi-cell IRS-aided NOMA networks,” IEEE Trans. Wireless Commun., vol. 20, no. 7, pp. 4253-4268, Jul. 2021.
  • [5] W. Wang et al., “Beamforming and jamming optimization for IRS-aided secure NOMA networks,” IEEE Trans. Wireless Commun., vol. 21, no. 3, pp. 1557-1569, Mar. 2022.
  • [6] W. Wang, H. Tian, and W. Ni, “Secrecy performance analysis of IRS-aided UAV relay system,” IEEE Wireless Commun. Lett., vol. 10, no. 12, pp. 2693-2697, Dec. 2021.
  • [7] Q. Wu and R. Zhang, “Beamforming optimization for wireless network aided by intelligent reflecting surface with discrete phase shifts,” IEEE Trans. Commun., vol. 68, no. 3, pp. 1838-1851, Mar. 2020.
  • [8] X. Mu, Y. Liu, L. Guo, J. Lin, and R. Schober, “Joint deployment and multiple access design for intelligent reflecting surface assisted networks,” IEEE Trans. Wireless Commun., vol. 20, no. 10, pp. 6648-6664, Oct. 2021.
  • [9] Y. Liu et al., “STAR: Simultaneous transmission and reflection for 360360^{\circ} coverage by intelligent surfaces,” IEEE Wireless Commun., vol. 28, no. 6, pp. 102-109, Dec. 2021.
  • [10] X. Mu, Y. Liu, L. Guo, J. Lin, and R. Schober, “Simultaneously transmitting and reflecting (STAR) RIS aided wireless communications,” IEEE Trans. Wireless Commun., vol. 21, no. 5, pp. 3083-3098, May 2022.
  • [11] H. Zhang et al., “Intelligent omni-surfaces for full-dimensional wireless communications: Principle, technology, and implementation,” IEEE Commun. Mag., vol. 60, no. 2, pp. 39-45, Feb. 2022.
  • [12] C. Wu, Y. Liu, X. Mu, X. Gu, and O. A. Dobre, “Coverage characterization of STAR-RIS networks: NOMA and OMA,” IEEE Commun. Lett., vol. 25, no. 9, pp. 3036-3040, Sept. 2021.
  • [13] W. Wang, W. Ni, H. Tian, Z. Yang, C. Huang, and K. -K. Wong, “Safeguarding NOMA networks via reconfigurable dual-functional surface under imperfect CSI,” IEEE J. Sel. Topics Signal Process., vol. 16, no. 5, pp. 950-966, Aug. 2022.
  • [14] R. Long, Y. -C. Liang, Y. Pei, and E. G. Larsson, “Active reconfigurable intelligent surface-aided wireless communications,” IEEE Trans. Wireless Commun., vol. 20, no. 8, pp. 4962-4975, Aug. 2021.
  • [15] Z. Zhang et al., “Active RIS vs. passive RIS: Which will prevail in 6G?,” IEEE Trans. Commun., vol. 71, no. 3, pp. 1707-1725, Mar. 2023.
  • [16] K. Liu, Z. Zhang, L. Dai, S. Xu, and F. Yang, “Active reconfigurable intelligent surface: Fully-connected or sub-connected?,” IEEE Commun. Lett., vol. 26, no. 1, pp. 167-171, Jan. 2022.
  • [17] C. You and R. Zhang, “Wireless communication aided by intelligent reflecting surface: Active or passive?,” IEEE Wireless Commun. Lett., vol. 10, no. 12, pp. 2659-2663, Dec. 2021.
  • [18] N. Shlezinger, G. C. Alexandropoulos, M. F. Imani, Y. C. Eldar, and D. R. Smith, “Dynamic metasurface antennas for 6G extreme massive MIMO communications,” IEEE Wireless Commun., vol. 28, no. 2, pp. 106-113, Apr. 2021.
  • [19] Y. Zou, S. Gong, J. Xu, W. Cheng, D. T. Hoang, and D. Niyato, “Wireless powered intelligent reflecting surfaces for enhancing wireless communications,” IEEE Trans. Veh. Technol., vol. 69, no. 10, pp. 12369-12373, Jul. 2020.
  • [20] B. Lyu, P. Ramezani, D. T. Hoang, S. Gong, Z. Yang, and A. Jamalipour, “Optimized energy and information relaying in self-sustainable IRS-empowered WPCN,” IEEE Trans. Commun., vol. 69, pp. 619-633, Oct. 2021.
  • [21] S. Hu, Z. Wei, Y. Cai, C. Liu, D. W. K. Ng, and J. Yuan, “Robust and secure sum-rate maximization for multiuser MISO downlink systems with self-sustainable IRS,” IEEE Trans. Commun., vol. 69, no. 10, pp. 7032-7049, Oct. 2021.
  • [22] S. Kim et al., “Ambient RF energy-harvesting technologies for self-sustainable standalone wireless sensor platforms,” Proc. IEEE, vol. 102, no. 11, pp. 1649-1666, Nov. 2014.
  • [23] A. S. Almansouri, M. H. Ouda, and K. N. Salama, “A CMOS RF-to-DC power converter with 86% efficiency and -19.2-dbm sensitivity,” IEEE Trans. Microw. Theory Techn., vol. 66, no. 5, pp. 2409-2415, May 2018.
  • [24] L. Dai et al., “Reconfigurable intelligent surface-based wireless communications: Antenna design, prototyping, and experimental results,” IEEE Access, vol. 8, pp. 45913-45923, 2020.
  • [25] NTT DOCOMO, “DOCOMO conducts world’s first successful trial of transparent dynamic metasurface,” Jan. 2020. [Online]. Available: https://www.nttdocomo.co.jp/english/info/media_\_center/pr/2020/0117_\_00.html.
  • [26] S. Zeng et al., “Intelligent omni-surfaces: Reflection-refraction circuit model, full-dimensional beamforming, and system implementation,” IEEE Trans. Commun., vol. 70, no. 11, pp. 7711-7727, Nov. 2022.
  • [27] F. Amato, C. W. Peterson, B. P. Degnan, and G. D. Durgin, “Tunneling RFID tags for long-range and low-power microwave applications,” IEEE J. Radio Freq. Identificat., vol. 2, no. 2, pp. 93-103, Jun. 2018.
  • [28] K. W. Choi et al., “Toward realization of long-range wireless-powered sensor networks,” IEEE Wireless Commun., vol. 26, no. 4, pp. 184-192, Aug. 2019.
  • [29] D. C. Erb, O. C. Onar, and A. Khaligh, “An integrated bi-directional power electronic converter with multi-level AC-DC/DC-AC converter and non-inverted buck-boost converter for PHEVs with minimal grid level disruptions,” in Proc. IEEE Vehicle Power Propuls. Conf., Lille, France, Sept. 2010, pp. 1-6.
  • [30] S. P S, V. Suresh Babu, and G. Shiny, “Annealing effects on capacitance density and voltage coefficient of capacitance (VCC) of thin-film capacitor for energy harvesting application,” in Proc. TEQIP III Spons. Int. Conf. Microw. Integr. Circuits Photon. Wireless Netw., Tiruchirappalli, India, May 2019, pp. 223-227.
  • [31] Z. Zeng, S. Shen, B. Wang, J. J. Estrada-Lopez, R. Murch, and E. Sanchez-Sinencio, “An ultra-low-power power management circuit with output bootstrapping and reverse leakage reduction function for RF energy harvesting,” in Proc. IEEE MTT-S Int. Microw. Symp. Dig., Los Angeles, CA, USA, Aug. 2020, pp. 1059-1062.
  • [32] D. Tse and P. Viswanath, Fundamentals of Wireless Communication. Cambridge, U.K.: Cambridge Univ. Press, 2005.
  • [33] J. Zuo, Y. Liu, Z. Ding, L. Song, and H. V. Poor, “Joint design for simultaneously transmitting and reflecting (STAR) RIS assisted NOMA systems,” IEEE Trans. Wireless Commun., vol. 22, no. 1, pp. 611-626, Jan. 2023.
  • [34] P. Zeng, Q. Wu, and D. Qiao, “Energy minimization for IRS-aided WPCNs with non-linear energy harvesting model,” IEEE Commun. Lett., vol. 10, no. 11, pp. 2592-2596, Nov. 2021.
  • [35] J. Cui, Z. Ding, P. Fan, and N. Al-Dhahir, “Unsupervised machine learning-based user clustering in millimeter-wave-NOMA systems,” IEEE Trans. Wireless Commun., vol. 17, no. 11, pp. 7425-7440, Nov. 2018.
  • [36] Z.-Q. Luo, W.-K. Ma, A. 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.
  • [37] P. Cao, J. Thompson, and H. V. Poor, “A sequential constraint relaxation algorithm for rank-one constrained problems,” in Proc. Eur. Signal Process. Conf., Kos, Greece, Aug. 2017, pp. 1060-1064.
  • [38] M. Grant and S. Boyd, “CVX: Matlab software for disciplined convex programming, version 2.1,” [Online]. Available: http: //cvxr.com/cvx/, 2014.
  • [39] J. Cui, Z. Ding, and P. Fan, “A novel power allocation scheme under outage constraints in NOMA systems,” IEEE Signal Process. Lett., vol. 23, no. 9, pp. 1226-1230, Sept. 2016.
  • [40] N. Jindal and A. Goldsmith, “Capacity and optimal power allocation for fading broadcast channels with minimum rates,” IEEE Trans. Inf. Theory, vol. 49, no. 11, pp. 2895-2909, Nov. 2003.