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

Bi-objective Optimization of Information Rate and Harvested Power in RIS-aided SWIPT Systems

Abdelhamed Mohamed, A. Zappone,  and Marco Di Renzo Manuscript received April 22, 2022. A. Mohamed and M. Di Renzo are with Université Paris-Saclay, CNRS and CentraleSupélec, Laboratoire des Signaux et Systèmes, 91192 Gif-sur-Yvette, France. A. Zappone is with the University of Cassino and Southern Lazio, 03043 Cassino, Italy. (e-mail: marco.direnzo@centralesupelec.fr).
Abstract

The problem of simultaneously optimizing the information rate and the harvested power in a reconfigurable intelligent surface (RIS)-aided multiple-input single-output downlink wireless network with simultaneous wireless information and power transfer (SWIPT) is addressed. The beamforming vectors, RIS reflection coefficients, and power split ratios are jointly optimized subject to maximum power constraints, minimum harvested power constraints, and realistic constraints on the RIS reflection coefficients. A practical algorithm is developed through an interplay of alternating optimization, sequential optimization, and pricing-based methods. Numerical results show that the deployment of RISs can significantly improve the information rate and the amount of harvested power.

Index Terms:
RIS, SWIPT, multi-objective optimization.

I Introduction

Reconfigurable Intelligent Surfaces (RISs) have emerged as a promising technology for sustainable 6G networks [1, 2]. Thanks to their ability of reflecting and refracting electromagnetic signals in a reconfigurable fashion and with limited energy requirements, RISs can drastically reduce the energy consumptions in wireless networks[3]. In this context, RISs have been also studied in conjunction with the use of simultaneous wireless information and power transfer (SWIPT), which is another key technology to improve the energy-sustainability of future wireless networks.

Several studies show that the use of an RIS can improve both information and power transfer. In [4], the problem of transmit power minimization subject to quality of service (QoS) constraints and minimum energy harvesting requirements is addressed. The optimization problem is tackled by means of a penalty-based algorithm coupled with the alternating optimization technique. In [5], the problem of transmit power minimization for an RIS-assisted SWIPT non-orthogonal multiple-access (NOMA) network is investigated. A two-stage optimization algorithm is proposed to jointly optimize the transmit beamforming vector, the power-split ratio, and the RIS phase shifts under QoS constraints. Semidefinite relaxation coupled with alternating and sequential optimization methods are employed. In [6], the problem of maximizing the weighted sum rate maximization is investigated in a SWIPT-based multi-user multiple-input multiple-output (MIMO) downlink system, subject to minimum harvested energy constraints. Alternating optimization is used in conjunction with sequential optimization and pricing methods. In [7], the authors study the problem of resource allocation in RIS-aided SWIPT-based systems, in which a large RIS is divided into several tiles to be separately designed with the objective of reducing the computational complexity of the design. Both a globally optimal algorithm and a practical approach are developed by means of branch-and-bound and sequential methods. In [8], the trade-off between sum-rate maximization and the total harvested energy is investigated. The ϵ\epsilon-method coupled with alternating optimization is used to tackle the resulting multi-objective problem. In [9], the data rate maximization problem in an RIS-aided system in which multiple receivers perform both information decoding and wireless power reception is analyzed. The problem is tackled by alternating optimization, sequential optimization, and sub-gradient searches.

This work considers a network in which a multiple-antenna base station serves single-antenna users with the aid of an RIS. Each receiver jointly performs information decoding and wireless power reception by means of power splitting. Unlike previous works, the following contributions are made.

1) We consider the bi-objective problem of simultaneously maximizing the information rate and the harvested power. The problem is formulated subject to minimum rate constraints on the downlink channel, minimum harvested power, RIS phase constraints, and maximum transmit power constraint. The resulting NP-hard problem is tackled by an interplay of alternating maximization, sequential optimization, and penalty-based methods. Since the receivers perform both information decoding and wireless power reception, the optimization of the power split ratio is needed, which a novel feature compared to related works on RIS-aided, SWIPT-based systems.

2) The work considers the realistic case in which the phases and moduli of the RIS reflection coefficients are not independent with one another, but are rather coupled by a deterministic function. This further complicates the solution of the resource allocation problem.

3) Numerical results confirm the effectiveness of the proposed algorithm compared to traditional approaches. It is found, in particular, that increasing the number of RIS elements significantly enhances the achieved data rate and the amount of harvested power.

Among previous works, [8] and [9] are the most closely-related to our work. However, [8] investigates the rate and harvested energy trade-off for separated information and power receivers, i.e., each receiver performs either information decoding or wireless power harvesting. Also, independent phases and moduli are assumed for the RIS reflection coefficients. In addition, [9] considers integrated information and power receivers, but it focuses on maximizing only the information rate, without considering power harvesting and the intertwinement between the phase and the amplitude of the RIS reflection coefficients.

Refer to caption
Figure 1: Illustration of the MISO RIS-assisted SWIPT system model.

II System Model and Problem Formulation

We consider an RIS-based multi-user multiple-input single-output (MISO) downlink system in which a base station (BS) equipped with MM antennas serves KK single-antenna user equipments (UEs) employing SWIPT. The kk-th UE employs a fraction ρk\rho_{k} of the received power for information decoding (ID), while the rest is used for power harvesting (PH). The channels from the BS to the RIS, from BS to k-th user, and from the RIS to the k-th user are denoted by 𝐆N×M\mathbf{G}\in{{\mathbb{C}}^{N\times M}}, 𝐡d,k1×M{{\mathbf{h}}_{d,k}}\in{{\mathbb{C}}^{1\times M}}, and 𝐡r,k1×N{\mathbf{h}_{r,k}}\in{{\mathbb{C}}^{1\times N}}, respectively, and are assumed to follow the block Rician fading model. The reflection coefficient vector of the RIS is defined by 𝐯=[v1,,vn]N×1\mathbf{v}=[{v_{1}},...,{v_{n}}]\in{{\mathbb{C}}^{N\times 1}}, where vn=fn(θn)ejθn{v_{n}}={f_{n}}({\theta_{n}}){e^{j{\theta_{n}}}} is the reflection coefficient of the n-th reflecting element of the RIS, with πθnπ-\pi\leq{\theta_{n}}\leq\pi and, e.g., fn(θn)=fmin+(1fmin)(sin(θnϕ)+12)α{f_{n}}({\theta_{n}})={f_{\min}}+(1-{f_{\min}}){\left({\frac{{\sin({\theta_{n}}-\phi)+1}}{2}}\right)^{\alpha}} is a function that relates the phase of the reflection coefficient to its modulus, where fmin0{f_{\min}}\geqslant 0, α0,ϕ0\alpha\geqslant 0,\phi\geqslant 0 are circuit implementation constants [10]. In general, the proposed approach can be applied to any continuous and differentiable function fn(θn){f_{n}}({\theta_{n}}). Given the above notation, and defining 𝐇r,k=diag(𝐡𝐫,𝐤)𝐆\mathbf{H}_{r,k}=\text{diag}(\mathbf{h_{r,k}})\mathbf{G}, the achievable sum-rate is:

RID=k=1Klog(1+|(𝐡d,k+𝐯H𝐇r,k)𝐰k|2i=1,ikK|(𝐡d,k+𝐯H𝐇r,k)𝐰i|2+σk2+δk2ρk)\displaystyle{R^{ID}}\!=\!\sum_{k=1}^{K}\log\!\left(\!1\!+\!\frac{{{{\left|{\left({{\mathbf{h}_{d,k}}+{\mathbf{v}^{H}}{\mathbf{H}_{r,k}}}\right){\mathbf{w}_{k}}}\right|}^{2}}}}{{\sum\limits_{i=1,i\neq k}^{{K}}\!\!{{{\left|{\left({{\mathbf{h}_{d,k}}\!+\!{\mathbf{v}^{H}}{\mathbf{H}_{r,k}}}\right){\mathbf{w}_{i}}}\right|}^{2}}\!+\!{\sigma_{k}^{2}}\!+\!\frac{\delta_{k}^{2}}{\rho_{k}}}}}\right) (1)

wherein 𝐰kM×1{{\mathbf{w}_{k}}}\in{{\mathbb{C}}^{M\times 1}} is the transmit beamforming vector, while σk2\sigma^{2}_{k} and δk2\delta^{2}_{k} model the power of the thermal noise and of the noise due to the conversion of the RF signal to the baseband. Furthermore, considering a linear harvesting model, the power harvested by the kk-th UE is PH,k=ηk(1ρk)i=1K|(𝐡d,k+𝐯H𝐇r,k)𝐰i|2P_{H,k}=\eta_{k}(1-{\rho_{k}})\sum\nolimits_{i=1}^{K}{\left|{(\mathbf{h}_{d,k}+\mathbf{v}^{H}\mathbf{H}_{r,k}){\mathbf{w}_{i}}}\right|}^{2}, where ηk[0,1]\eta_{k}\in[0,1] is the efficiency of the power harvesting circuit. Similar to [11], we consider the associated rate function:

RPH=k=1Klog(1+ξkηk(1ρk)σk2i=1K|(𝐡d,k+𝐯H𝐇r,k)𝐰i|2)\displaystyle R^{PH}\!=\!\sum\limits_{k=1}^{K}\!\log\!\left(\!1+\frac{\xi_{k}\eta_{k}(1-{\rho_{k}})}{\sigma_{k}^{2}}\sum\limits_{i=1}^{K}{\left|{(\mathbf{h}_{d,k}+\mathbf{v}^{H}\mathbf{H}_{r,k}){\mathbf{w}_{i}}}\right|}^{2}\!\right) (2)

where ξk[0,1]\xi_{k}\in[0,1] is the efficiency of the conversion from baseband power to RF power.

The goal of this work is to maximize a weighted sum of RIDR^{ID} and RPHR^{PH}, namely:

RsumEq(ρ,𝐰,𝐯,{θn})\displaystyle R^{Eq}_{sum}{(\rm{\rho},\mathbf{w},\mathbf{v},\left\{\theta_{n}\right\})} =RID+λ¯RPH\displaystyle=R^{ID}+\bar{\lambda}R^{PH} (3)

where λ¯\bar{\lambda} is a parameter to be tuned by the network operator according to the priorities granted to ID and PH [11].

Defining 𝐡k=𝐡d,k+𝐯H𝐇r,k\mathbf{h}_{k}=\mathbf{h}_{d,k}+\mathbf{v}^{H}\mathbf{H}_{r,k}, the problem to be tackled in the rest of this work is formulated as:

𝒫𝒜:\displaystyle\mathcal{P_{A}}: 𝚖𝚊𝚡ρ,𝐰,𝐯,{θn}RsumEq(ρ,𝐰,𝐯,{θn})\displaystyle\quad\mathop{\mathtt{max}}\limits_{\rm{\rho},\mathbf{w},\mathbf{v},\left\{\theta_{n}\right\}}{\rm{}}R^{Eq}_{sum}{(\rm{\rho},\mathbf{w},\mathbf{v},\left\{\theta_{n}\right\})} (4)
𝚜.𝚝.\displaystyle\mathtt{s.t.} C1:|𝐡k𝐰k|2ikK|𝐡k𝐰i|2+σk2+δk2ρkγmin,k=1,,K\displaystyle\text{C1:}\;\frac{{{{\left|{\mathbf{h}_{k}{\mathbf{w}_{k}}}\right|}^{2}}}}{{\sum\limits_{i\neq k}^{{K}}{{{\left|{\mathbf{h}_{k}{\mathbf{w}_{i}}}\right|}^{2}}\!+\!{\sigma_{k}^{2}}\!+\!\frac{\delta_{k}^{2}}{{\rho_{k}}}}}}\geq\gamma_{min},\;k=1,\ldots,K (5)
C2:ηk(1ρk)i=1K|𝐡k𝐰i|2Pmin,k=1,,K\displaystyle\text{C2:}~{}{\eta_{k}}(1\!-\!{\rho_{k}})\sum\limits_{i=1}^{K}{{{\left|{{\mathbf{h}_{k}}{\mathbf{w}_{i}}}\right|}^{2}}}\geq P_{min},\;k=1,\ldots,K (6)
C3:k=1K𝐰k2PT,,0ρk1\displaystyle\text{C3:}~{}\sum\limits_{k=1}^{{K}}{{{\left\|{{\mathbf{w}_{k}}}\right\|}^{2}}\leq{P_{T}},}\;,\;~{}0\leq\rho_{k}\leq 1 (7)
C4:vn=fn(θn)ejθn,n=1,,N\displaystyle\text{C4:}~{}{v_{n}}={f_{n}}({\theta_{n}}){e^{j{\theta_{n}}}},\quad{\rm{}}n=1,\dots,N (8)
C5:πθnπ,n=1,,N\displaystyle\text{C5:}~{}-\pi\leq{\theta_{n}}\leq\pi,\quad{\rm{}}~{}n=1,\dots,N (9)

It can be seen that 𝒫𝒜\mathcal{P_{A}} is a non-convex problem due to the non-concavity of both the objective function and the constraints C1, C2, C4. Thus, traditional methods do not apply.

III Proposed Approach

To tackle 𝒫𝒜\mathcal{P_{A}}, we first reformulate the sum of logarithms into a more tractable form by applying the method from [12] to each sum in our objective function. This yields:

𝒫𝒜¯:\displaystyle\overline{{\mathcal{P}_{\mathcal{A}}}}: 𝚖𝚊𝚡αI,βI,αE,βE,ρ,𝐰,𝐯,{θn}f𝒜(αI,βI,αE,βE,ρ,𝐰,𝐯,{θn})\displaystyle\mathop{{\mathtt{max}}}\limits_{\scriptstyle{\rm\alpha_{I}},{\rm\beta_{I}},{\rm\alpha_{E}},{\rm\beta_{E}},\scriptstyle{\rm{\rho},\mathbf{w},\mathbf{v},\left\{\theta_{n}\right\}}}{f_{\mathcal{A}}}({\rm\alpha_{I}},{\rm\beta_{I}},{\rm\alpha_{E}},{\rm\beta_{E}},{\rm{\rho},\mathbf{w},\mathbf{v},\left\{\theta_{n}\right\}}) (10)
s.t(C1),(C2),(C3),(C4),(C5)\displaystyle\text{s.t}~{}\text{(C1)},\text{(C2)},\text{(C3)},\text{(C4)},\text{(C5)}

wherein f𝒜{f_{\mathcal{A}}} is shown in (11) at the top of the next page, with η¯k=ξkηk{{\bar{\eta}}_{k}}={\xi_{k}}{\eta_{k}} and \Re being the real part operator.

f𝒜(αI,βI,αE,βE,ρ,𝐰,𝐯,{θn})=k=1Klog(1+αI,k)+λ¯log(1+αE,k)(αI,k+λ¯αE,k)\displaystyle{f_{\mathcal{A}}}({\rm\alpha_{I}},{\rm\beta_{I}},{\rm\alpha_{E}},{\rm\beta_{E}},{\rm{\rho},\mathbf{w},\mathbf{v},\left\{\theta_{n}\right\}})=\sum\limits_{k=1}^{K}{\log(1+{\alpha_{I,k}})+\bar{\lambda}\log(1+{\alpha_{E,k}})-\left({{\alpha_{I,k}}+\bar{\lambda}{\alpha_{E,k}}}\right)} (11)
+k=1K(2ρk(1+αI,k)(βI,k𝐡k𝐰k))k=1K(|βI,k|2(i=1Kρk|𝐡k𝐰i|2+ρkσk2+δk2))\displaystyle+\sum\limits_{k=1}^{K}{\left({2\sqrt{{\rho_{k}}(1+{\alpha_{I,k}})}\Re(\beta_{I,k}^{*}{\mathbf{h}_{k}}{\mathbf{w}_{k}})}\right)}-\sum\limits_{k=1}^{K}{\left({{{\left|{{\beta_{I,k}}}\right|}^{2}}\left({\sum\limits_{i=1}^{K}{{\rho_{k}}{{\left|{{\mathbf{h}_{k}}{\mathbf{w}_{i}}}\right|}^{2}}+{\rho_{k}}{\sigma_{k}}^{2}}+\delta_{k}^{2}}\right)}\right)}
+k=1K(2λ¯η¯k(1ρk)(1+αE,k)(βE,ki=1K𝐡k𝐰i))k=1K(λ¯|βE,k|2(ξkηk(1ρk)i=1K|𝐡k𝐰i|2+σk2))\displaystyle+\sum\limits_{k=1}^{K}{\left({2\bar{\lambda}\sqrt{{{\bar{\eta}}_{k}}(1-{\rho_{k}})(1+{\alpha_{E,k}})}\Re(\beta_{E,k}^{*}\sum\limits_{i=1}^{K}{{\mathbf{h}_{k}}{\mathbf{w}_{i}}})}\right)}-\sum\limits_{k=1}^{K}{\left({\bar{\lambda}{{\left|{{\beta_{E,k}}}\right|}^{2}}\left({{\xi_{k}}{\eta_{k}}(1-{\rho_{k}})\sum\limits_{i=1}^{K}{{{\left|{{{\mathbf{h}}_{k}}{{\mathbf{w}}_{i}}}\right|}^{2}}}+{\sigma_{k}}^{2}}\right)}\right)}

In order to tackle (10), the first step is to embed (C4) into the objective, resorting to a penalty-based approach, which yields:

𝒫¯:\displaystyle\overline{{\mathcal{P}_{\mathcal{B}}}}: 𝚖𝚊𝚡αI,βI,αE,βE,ρ,𝐰,𝐯,{θn}f𝒜Γn=1N|vnfn(θn)ejθn|2\displaystyle\mathop{{\mathtt{max}}}\limits_{\scriptstyle{\rm\alpha_{I}},{\rm\beta_{I}},{\rm\alpha_{E}},{\rm\beta_{E}},\scriptstyle{\rm{\rho},\mathbf{w},\mathbf{v},\left\{\theta_{n}\right\}}}{f_{\mathcal{A}}}-\Gamma\sum\limits_{n=1}^{N}{{{\left|{{v_{n}}-{f_{n}}({\theta_{n}}){e^{j{\theta_{n}}}}}\right|}^{2}}} (12)
s.t(C1),(C2),(C3),(C5)\displaystyle\text{s.t}~{}\text{(C1)},\text{(C2)},\text{(C3)},\text{(C5)}

wherein Γ\Gamma represents the penalty coefficient used for penalizing the violation of the equality constraint (C4). If Γ\Gamma\to\infty, the solution of the original problem is obtained. Problem (12) will be tackled by alternating optimization, as explained next.

III-A Optimization of αI,k,αE,k{\alpha_{I,k}},{\alpha_{E,k}}, βIk,βEk,ρk\beta_{Ik},\beta_{Ek},\rho_{k}

The optimal αI,k,αE,k,βIk,βEk{\alpha_{I,k}},{\alpha_{E,k}},\beta_{Ik},\beta_{Ek} are found by simply setting the gradient of the objective to zero, which yields:

αI,k=r2+rr2+42,βI,k=ρk(1+αIk)(𝐡k𝐰k)i=1Kρk|𝐡k𝐰i|2+ρkσk2+δk2\displaystyle{\alpha_{I,k}}\!=\!\frac{{{r^{2}}\!+\!r\sqrt{{r^{2}}\!+\!4}}}{2},{\beta_{I,k}}\!=\!\frac{{\sqrt{{{\rho}_{k}}(1\!+\!{{\alpha}_{Ik}})}({{{\mathbf{h}}}_{k}}{{{\mathbf{w}}}_{k}})}}{{\!\sum\limits_{i=1}^{K}{{{\rho}_{k}}{{\left|{{{{\mathbf{h}}}_{k}}{{{\mathbf{w}}}_{i}}}\right|}^{2}}\!\!+\!{{\rho}_{k}}{\sigma_{k}}^{2}}\!+\!\delta_{k}^{2}}} (13)
αE,k=r~2+r~r~2+42,βE,k=η¯k(1ρk)(1+αEk)i=1K𝐡k𝐰iη¯k(1ρk)i=1K|𝐡k𝐰i|2+σk2\displaystyle{\alpha_{E,k}}\!=\!\frac{{{{\tilde{r}}^{2}}\!+\!\tilde{r}\sqrt{{{\tilde{r}}^{2}}\!+\!4}}}{2},{\beta_{E,k}}\!=\!\frac{{\sqrt{{{\bar{\eta}}_{k}}(1\!-\!{{\rho}_{k}})(1\!+\!{{\alpha}_{Ek}})}\!\sum\limits_{i=1}^{K}{{{{\mathbf{h}}}_{k}}{{{\mathbf{w}}}_{i}}}}}{{{{{\bar{\eta}}_{k}}(1\!-\!{{\rho}_{k}})\sum\limits_{i=1}^{K}{{{\left|{{{{\mathbf{h}}}_{k}}{{{\mathbf{w}}}_{i}}}\right|}^{2}}}\!+\!{\sigma_{k}}^{2}}}} (14)

with r~=η¯(1ρk){βE,ki=1𝐡k𝐰i}\tilde{r}\!\!=\!\!\sqrt{\bar{\eta}(1\!-\!{\rho_{k}})}\Re\!\left\{\!{\beta_{E,k}^{*}\!\sum\limits_{i=1}{{{{{\mathbf{h}}}_{k}}{{{\mathbf{w}}}_{i}}}}}\!\right\}, r=ρk{βI,k𝐡k𝐰k}r\!\!=\!\!\sqrt{{\rho_{k}}}\Re\!\left\{\!{\beta_{I,k}^{*}{{{{{\mathbf{h}}}_{k}}{{{\mathbf{w}}}_{k}}}}}\!\right\}.

The optimization with respect to the coefficients {ρk}\{\rho_{k}\} is also straightforward. With respect to {ρk}\{\rho_{k}\}, in fact, the objective function is strictly concave and the constraints (C2), (C3) are affine. Moreover, (C1) can be rewritten in a linear form as follows, for any k=1,,Kk=1,\ldots,K:

ρk|𝐡k𝐰k|2γmin(ρki=1,ikK|𝐡k𝐰i|2+ρkσk2+δk2)0{\rho_{k}}{\left|{{{{\mathbf{h}}}_{k}}{{{\mathbf{w}}}_{k}}}\right|^{2}}-{\gamma_{min}}\left({{\rho_{k}}\sum\limits_{i=1,i\neq k}^{K}{{{\left|{{{{\mathbf{h}}}_{k}}{{{\mathbf{w}}}_{i}}}\right|}^{2}}+{\rho_{k}}\sigma_{k}^{2}+\delta_{k}^{2}}}\right)\geq 0 (15)

Thus, with respect to {ρk}\{\rho_{k}\}, the problem is convex and can be solved by standard convex optimization algorithms [13].

III-B Optimization of 𝐰k\mathbf{w}_{k}

When all the other variables are fixed, the objective function is a concave function of the transmit beamforming vectors 𝐰k\mathbf{w}_{k}. However, constraints (C1) and (C2) are still not convex. To deal with them, we resort to the successive convex approximation (SCA) method [6],[14]. Specifically, the convex term |𝐡k𝐰k|2{\left|{{{{\mathbf{h}}}_{k}}{{\mathbf{w}}_{k}}}\right|}^{2} is upper-bounded by its first-order Taylor expansion as follows:

𝐰kH𝐡kH𝐡k𝐰k2(𝐰k(t)H𝐡kH𝐡k𝐰k)(𝐰k(t)H𝐡kH𝐡k𝐰k(t)){\mathbf{w}}_{k}^{H}{\mathbf{h}}_{k}^{H}{{\mathbf{h}}_{k}}{{\mathbf{w}}_{k}}\!\geq\!2\Re\!\left(\!{{\mathbf{w}}_{k}^{(t)H}\!{\mathbf{h}_{k}^{H}}{{\mathbf{h}}_{k}}{{\mathbf{w}}_{k}}}\!\right)\!\!-\!\!\left(\!{{\mathbf{w}}_{k}^{(t)H}\!{\mathbf{h}}_{k}^{H}{{\mathbf{h}}_{k}}{\mathbf{w}}_{k}^{(t)}}\!\right) (16)

whereing 𝐰k(t),k{{\mathbf{w}}_{k}^{(t)},\forall k} is the solution from the previous iteration. Thus, exploiting (16) and elaborating, (C1) can be recast as:

γmin(ik|𝐡k𝐰i|2+σk2+δk2ρk)\displaystyle\gamma_{\min}\!\left(\!\sum_{i\neq k}|\mathbf{h}_{k}\mathbf{w}_{i}|^{2}\!+\!\sigma_{k}^{2}\!+\!\frac{\delta_{k}^{2}}{\rho_{k}}\right) (17)
+𝐰k(t)H𝐡kH𝐡k𝐰k(t)2(𝐰k(t)H𝐡kH𝐡k𝐰k)0\displaystyle\!+\!{{\mathbf{w}}_{k}^{(t)H}{\mathbf{h}}_{k}^{H}{{\mathbf{h}}_{k}}{\mathbf{w}}_{k}^{(t)}}\!\!-\!2\Re\left({{\mathbf{w}}_{k}^{(t)H}{\mathbf{h}_{k}^{H}}{{\mathbf{h}}_{k}}{{\mathbf{w}}_{k}}}\right)\!\leq\!0

Similarly, (C2) can be reformulated as follows:

ηk(1ρk)k=1K2(𝐰i(t)H𝐡kH𝐡k𝐰i)𝐰i(t)H𝐡kH𝐡k𝐰i(t)Pmin\displaystyle\begin{aligned} \eta_{k}(1\!-\!\rho_{k})\!&\sum_{k=1}^{K}2\Re\left({{\mathbf{w}}_{i}^{(t)H}{\mathbf{h}_{k}^{H}}{{\mathbf{h}}_{k}}{{\mathbf{w}}_{i}}}\right)\!-\!{{\mathbf{w}}_{i}^{(t)H}{\mathbf{h}}_{k}^{H}{{\mathbf{h}}_{k}}{\mathbf{w}}_{i}^{(t)}}\\ &\hskip 42.67912pt\!\geq\!P_{min}\end{aligned} (18)

By replacing the constraints (C1) and (C2) with (17) and (18), we obtain the convex surrogate problem to be solved in each iteration of the SCA method for optimizing 𝐰k\mathbf{w}_{k}.

III-C Optimization of 𝐯\mathbf{v}

The approach is similar to that used for the optimization of 𝐰k\mathbf{w}_{k}. In fact, the objective is concave in 𝐯\mathbf{v}, while constraints (C1) and (C2) can be handled by the SCA method. Specifically, (C1) can be replaced by the convex constraint:

γmin(ikK|(𝐡d,k+𝐯H𝐇r,k)𝐰i|2+σk2+δk2ρk)\displaystyle\gamma_{\min}\left(\sum\limits_{i\neq k}^{K}|(\mathbf{h}_{d,k}+\mathbf{v}^{H}\mathbf{H}_{r,k})\mathbf{w}_{i}|^{2}+\sigma_{k}^{2}+\frac{\delta_{k}^{2}}{\rho_{k}}\right) (19)
+(𝐡d,k+𝐯(t)H𝐇r,k)𝐰k𝐰kH(𝐡d,k+𝐯(t)H𝐇r,k)H\displaystyle+(\mathbf{h}_{d,k}+\mathbf{v}^{(t)H}\mathbf{H}_{r,k})\mathbf{w}_{k}\mathbf{w}_{k}^{H}(\mathbf{h}_{d,k}+\mathbf{v}^{(t)H}\mathbf{H}_{r,k})^{H}
2{(𝐡d,k+𝐯(t)H𝐇r,k)𝐰k𝐰kH(𝐡d,k+𝐯H𝐇r,k)H}0\displaystyle-2\Re\{(\mathbf{h}_{d,k}+\mathbf{v}^{(t)H}\mathbf{H}_{r,k})\mathbf{w}_{k}\mathbf{w}_{k}^{H}(\mathbf{h}_{d,k}+\mathbf{v}^{H}\mathbf{H}_{r,k})^{H}\}\leq 0\;

and (C2) by the convex constraint:

ηk(1ρk)i=1K(𝐡d,k+𝐯(t)H𝐇r,k)𝐰i𝐰iH(𝐡d,k+𝐯(t)H𝐇r,k)H\displaystyle\eta_{k}(1\!-\!\rho_{k})\!\sum_{i=1}^{K}(\mathbf{h}_{d,k}\!+\!\mathbf{v}^{(t)H}\mathbf{H}_{r,k})\mathbf{w}_{i}\mathbf{w}_{i}^{H}(\mathbf{h}_{d,k}\!+\!\mathbf{v}^{(t)H}\mathbf{H}_{r,k})^{H}\!\!-
2{(𝐡d,k+𝐯(t)H𝐇r,k)𝐰i𝐰iH(𝐡d,k+𝐯H𝐇r,k)H}Pmin\displaystyle 2\Re\{\!(\mathbf{h}_{d,k}\!\!+\!\mathbf{v}^{(t)H}\!\mathbf{H}_{r,k})\mathbf{w}_{i}\mathbf{w}_{i}^{H}(\mathbf{h}_{d,k}\!\!+\!\mathbf{v}^{H}\!\mathbf{H}_{r,k})^{H}\!\}\!\geq\!P_{min} (20)

By replacing the constraints (C1) and (C2) with (19) and (III-C), we obtain the convex surrogate problem to be solved in each iteration of the SCA method for optimizing 𝐯\mathbf{v}.

III-D Updating θn\theta_{n}

The RIS phase shifts are the solutions of the problem:

max{θn}n=1N|vnfn(θn)ejθn|2,𝚜.𝚝.πθnπ\mathop{\max}\limits_{\left\{{{\theta_{n}}}\right\}}-{\sum\limits_{n=1}^{N}{\left|{{v_{n}}-{f_{n}}({\theta_{n}}){e^{j{\theta_{n}}}}}\right|}^{2}}\;,\;\mathtt{s.t.}-\pi\leqslant{\theta_{n}}\leqslant\pi (21)

It can be seen that the problem is separable over nn, i.e., each summand can be optimized separately. Thus, defining φn=arg(vn)\varphi_{n}=\arg({v_{n}}), the optimal θn\theta_{n} is found by solving the problem

maxθn[π,π]\displaystyle\mathop{\max}\limits_{{\theta_{n}}\in[-\pi,\pi]}{} 2fn(θn)|vn|cos(φnθn)fn2(θn)\displaystyle 2{f_{n}}({\theta_{n}})\left|{{v_{n}}}\right|\cos({\varphi_{n}}-{\theta_{n}})-f_{n}^{2}({\theta_{n}}) (22)

which can be solved by standard numerical methods.

III-E Convergence and Complexity

Finally, the overall algorithm to solve the optimization problem is obtained by iteratively optimizing the different optimization variables. Each iteration monotonically increases the objective value, which guarantees convergence. Moreover, the computational complexity is polynomial in the number of variables, since only the solution of convex problems is required111We recall that a convex problem can be solved with a complexity 𝒞=𝒪(Lη)\mathcal{C}=\mathcal{O}(L^{\eta}), where LL is the number of variables and 1η41\leq\eta\leq 4 [15].. Thus, the complexity of optimizing {ρk}\{\rho_{k}\} is 𝒪(Kηk)\mathcal{O}(K^{\eta_{k}}), while the complexity of optimizing {𝐰k}\{\mathbf{w}_{k}\} and 𝐯\mathbf{v} are 𝒪(Iw(MK)ηw)\mathcal{O}(I_{w}(MK)^{\eta_{w}}), and 𝒪(IvNηv)\mathcal{O}(I_{v}N^{\eta_{v}}), respectively, with IwI_{w} and IvI_{v} being the number of iterations of the SCA methods used to optimize 𝐰\mathbf{w} and 𝐯\mathbf{v}. On the other hand, the optimal {αI,k,αE,k,βIk,βEk}\{\alpha_{I,k},\alpha_{E,k},\beta_{Ik},\beta_{Ek}\} are available in closed-form in (13), (14) and thus the complexity required for their computation can be neglected. Similarly, the complexity of Problem (21) can also be neglected, as it is linear in NN. In fact, the problem can be decoupled over the NN optimization variables, and, for each NN, the optimal θn\theta_{n} is obtain by solving (22). Thus, the overall complexity of the proposed method is given by 𝒞=I(𝒪(Kηk)+𝒪(Iw(MK)ηw)+𝒪(IvNηv))\mathcal{C}=I(\mathcal{O}(K^{\eta_{k}})+\mathcal{O}(I_{w}(MK)^{\eta_{w}})+\mathcal{O}(I_{v}N^{\eta_{v}})), where II is the number of alternating optimization iterations to be run until convergence. The exponents of the polynomial are not available in closed-form, but it is known that they are upper-bounded by 44 [15]. A typical value is 3.53.5, which comes up when interior-point methods are used [13].

IV Numerical Results

For our numerical study, we consider an RIS-assisted MISO communication system, in which the M=8M=8 transmit antennas are arranged in a uniform linear array, and a set of K=4K=4 UEs are considered. The UEs are randomly and uniformly distributed within a disk of 1m1~{}m radius centered at (5m,5m)(5~{}m,5~{}m). The NN-elements RIS is located at (0m,5m)(0~{}m,5~{}m). All channels are modeled as X=Lx(ϵ1+ϵX¯LOS+11+ϵX¯NLOS)X=L_{x}\left(\sqrt{\frac{\epsilon}{1+\epsilon}}\bar{X}^{LOS}+\sqrt{\frac{1}{1+\epsilon}}\bar{X}^{NLOS}\right), where X¯LOS\bar{X}^{LOS} and X¯NLOS\bar{X}^{NLOS} are the line-of-sight (LOS) and non-LOS (NLOS) components, and XX is either 𝐆\mathbf{G}, 𝐡r,k\mathbf{h}_{r,k}, or 𝐡d,k\mathbf{h}_{d,k}. The NLOS component follows the Rayleigh fading model, while the LOS component is X¯LOS=𝐚N(θAoA)𝐚MH(θAoD)\bar{X}^{LOS}=\mathbf{a}_{N}(\theta^{AoA})\mathbf{a}_{M}^{H}(\theta^{AoD}), with:

𝐚N(θAoA)=[1,ej2πdλsin(θAoA),,ej2πdλ(N1)sin(θAoA)]T\displaystyle\mathbf{a}_{N}(\theta^{AoA})=[1,e^{j\frac{2\pi d}{\lambda}\sin(\theta^{AoA})}~{},~{}...~{},e^{j\frac{2\pi d}{\lambda}(N-1)\sin(\theta^{AoA})}]^{T}
𝐚M(θAoD)=[1,ej2πdλsin(θAoD),,ej2πdλ(M1)sin(θAoD)]T\displaystyle\mathbf{a}_{M}(\theta^{AoD})=[1,e^{j\frac{2\pi d}{\lambda}\sin(\theta^{AoD})}~{},~{}...~{},e^{j\frac{2\pi d}{\lambda}(M-1)\sin(\theta^{AoD})}]^{T}

where dd and λ\lambda are the inter-antenna separation and the wavelength, respectively. We assume d/λ=1/2d/\lambda=1/2. The large-scale distance-dependent path-loss is L=C0(dD0)xlL=C_{0}{\left(\frac{d}{D_{0}}\right)^{-x_{l}}}, where dd is the link distance and D0=1D_{0}=1 is the reference distance at which the reference path-loss C0=30C_{0}=-30dB is defined, xlx_{l} is the path-loss exponent. The rest of the simulation parameters are given in Table 1. For comparison, we evaluate the performance gain achieved by the proposed algorithm in comparison with the “No-RIS” scenario, in which there is no RIS deployed in the system.

TABLE I: Simulation Parameters.
Parameters Values
Number of RIS elements 60
Maximum transmission power PTP_{T}= 10 dB
Path-loss exponent - RIS-aided channels xl=2.2x_{l}=2.2
Path-loss exponent - Direct channel xl=3.6x_{l}=3.6
Rician factor ϵ=5\epsilon=5 dB
Power conversion noise δk2=δ2=50\delta_{k}^{2}=\delta^{2}=-50dBm
Thermal noise power σk2=σ2=40\sigma_{k}^{2}=\sigma^{2}=-40dBm
Minimum harvested power Pmin=105P_{min}=10^{-5}mW
Minimum SINR requirement γmin=10\gamma_{\min}=10dB
Power conversion efficiency ηk=η=0.6\eta_{k}=\eta=0.6
Combining weight λ¯\bar{\lambda}= [0.1, 1]
Conversion efficiency (uplink) ξk\xi_{k} 0.005

Figure 3 depicts the relationship between the number of RIS elements versus the sum-rate and the harvested power. It can be observed that employing more RIS elements leads to a monotonic growth of the amount of harvested power and sum-rate. The figure reveals the effectiveness of the proposed algorithm compared to the “No RIS” case (denoted by “w/o RIS”). This monotonic gain is due to the appropriate design of the phase shift vector of the RIS elements, which results in strong virtual LOS paths between the BS and the UEs.

In Fig. 3, we explore the trade-off between the sum-rate and harvested power as a function of the number of RIS elements. We observe that employing more RIS elements enhances the sum-rate and harvested power. Moreover, the figure highlights the impact of the preference parameter λ¯\bar{\lambda}. The preference parameter λ¯\bar{\lambda} is utilized to determine the service priority between optimizing the sum-rate (i.e., with a low value of λ¯\bar{\lambda}) or optimizing the harvested power (i.e., with a high value of λ¯\bar{\lambda}). When the system prioritizes power harvesting, the proposed algorithm allocates more power to the power harvesting receiver, and thus the sum-rate decreases. Similarly, reducing the value of λ¯\bar{\lambda} gives higher priority to information decoding. The figures reports the trade-off between the sum-rate and harvested power for any values of λ¯\bar{\lambda}.

Refer to caption
Figure 2: Sum-rate and harvested power versus the number of RIS elements for λ¯=\bar{\lambda}=0.6.
Refer to caption
Figure 3: Trade-off between the sum-rate and harvested power with the number of RIS elements.
Refer to caption
Figure 4: Trade-off between the sum-rate and harvested power with fminf_{min}.
Refer to caption
Figure 5: Trade-off between the sum-rate and harvested power with the number of UEs KK.

In Fig. 5, we examine the trade-off between the sum-rate and harvested power with the minimum value of the amplitude of the reflection coefficient fminf_{min} of the RIS elements. We observe that the sum-rate and the harvested power increase as fminf_{min} increases. The highest values are obtained when fmin=1f_{min}=1, which is the ideal case for an RIS. In Fig. 5, finally, we investigate the trade-off between the sum-rate and harvested power as a function of the number of UEs KK. We see that the sum-rate and harvested power increases and decreases, respectively, as the number of UEs increases. This can be explained because the sum-rate is proportional to min(M,KNr)min(M,KN_{r}), where Nr=1N_{r}=1 is the number of receive antennas and M=8M=8 is fixed. Thus, the achievable data rate boosts as the number of UEs grows. On the other hand, the harvested power decreases due to the inverse relationship between the harvested power and the sum-rate.

V Conclusion

In this paper, we have investigated the trade-off between the sum-rate and power harvested in a multi-user RIS-aided downlink MISO system with SWIPT. Specifically, enforcing QoS constraints and practical phase shifts constraints, the transmit beamforming vector, the power splitting ratio, and the RIS reflection coefficients are jointly optimized by a two-layer penalty-based algorithm. Simulation results show that the proposed algorithm can significantly outperform conventional system deployments in the absence of RISs.

References

  • [1] M. Di Renzo, A. Zappone, M. Debbah, M.-S. Alouini, C. Yuen, J. de Rosny, and S. Tretyakov, “Smart radio environments empowered by reconfigurable intelligent surfaces: How it works, state of research, and the road ahead,” IEEE J. Sel. Areas Commun., vol. 38, no. 11, pp. 2450–2525, 2020.
  • [2] 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, 2020.
  • [3] C. Huang, S. Hu, G. C. Alexandropoulos, A. Zappone, C. Yuen, R. Zhang, M. D. Renzo, and M. Debbah, “Holographic MIMO surfaces for 6g wireless networks: Opportunities, challenges, and trends,” IEEE Wirel. Commun., vol. 27, no. 5, pp. 118–125, 2020.
  • [4] Q. Wu and R. Zhang, “Joint active and passive beamforming optimization for intelligent reflecting surface assisted SWIPT under QoS constraints,” IEEE J. Sel. Areas Commun., vol. 38, no. 8, pp. 1735–1748, 2020.
  • [5] Z. Li, W. Chen, Q. Wu, K. Wang, and J. Li, “Joint beamforming design and power splitting optimization in IRS-assisted SWIPT NOMA networks,” IEEE Trans. Wireless Commun., vol. 21, no. 3, pp. 2019–2033, 2022.
  • [6] C. Pan, H. Ren, K. Wang, M. Elkashlan, A. Nallanathan, J. Wang, and L. Hanzo, “Intelligent reflecting surface aided MIMO broadcasting for simultaneous wireless information and power transfer,” IEEE J. Sel. Areas Commun., vol. 38, no. 8, pp. 1719–1734, 2020.
  • [7] D. Xu, V. Jamali, X. Yu, D. W. K. Ng, and R. Schober, “Optimal resource allocation design for large IRS-assisted SWIPT systems: A scalable optimization framework,” IEEE Trans. Commun, vol. 70, no. 2, pp. 1423–1441, 2022.
  • [8] A. Khalili, S. Zargari, Q. Wu, D. W. K. Ng, and R. Zhang, “Multi-objective resource allocation for IRS-aided SWIPT,” IEEE Commun. Lett., vol. 10, no. 6, pp. 1324–1328, 2021.
  • [9] C. He, X. Xie, K. Yang, and Z. J. Wang, “A joint power splitting, active and passive beamforming optimization framework for IRS assisted MIMO SWIPT system,” arXiv preprint arXiv:2105.14545, 2021.
  • [10] S. Abeywickrama, R. Zhang, Q. Wu, and C. Yuen, “Intelligent reflecting surface: Practical phase shift model and beamforming optimization,” IEEE Trans. Commun, vol. 68, no. 9, pp. 5849–5863, 2020.
  • [11] J. Tang, Y. Yu, M. Liu, D. K. C. So, X. Zhang, Z. Li, and K.-K. Wong, “Joint power allocation and splitting control for SWIPT-enabled NOMA systems,” IEEE Trans. Wireless Commun., vol. 19, no. 1, pp. 120–133, 2020.
  • [12] K. Shen and W. Yu, “Fractional programming for communication systems—part ii: Uplink scheduling via matching,” IEEE Trans. Signal Process., vol. 66, no. 10, pp. 2631–2644, 2018.
  • [13] S. Boyd and L. Vandenberghe, Convex optimization.   Cambridge university press, 2004.
  • [14] C. Pan, H. Ren, M. Elkashlan, A. Nallanathan, and L. Hanzo, “Robust beamforming design for ultra-dense user-centric C-RAN in the face of realistic pilot contamination and limited feedback,” IEEE Trans. Wireless Commun., vol. 18, no. 2, pp. 780–795, 2019.
  • [15] A. Ben-Tal and A. Nemirovski, Lectures on Modern Convex Optimization: Analysis, Algorithms, Engineering Applications.   MPS-SIAM Series on Optimization, SIAM, 2001.