Bi-objective Optimization of Information Rate and Harvested Power in RIS-aided SWIPT Systems
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 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.

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 antennas serves single-antenna user equipments (UEs) employing SWIPT. The -th UE employs a fraction 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 , , and , respectively, and are assumed to follow the block Rician fading model. The reflection coefficient vector of the RIS is defined by , where is the reflection coefficient of the n-th reflecting element of the RIS, with and, e.g., is a function that relates the phase of the reflection coefficient to its modulus, where , are circuit implementation constants [10]. In general, the proposed approach can be applied to any continuous and differentiable function . Given the above notation, and defining , the achievable sum-rate is:
(1) |
wherein is the transmit beamforming vector, while and 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 -th UE is , where is the efficiency of the power harvesting circuit. Similar to [11], we consider the associated rate function:
(2) |
where is the efficiency of the conversion from baseband power to RF power.
The goal of this work is to maximize a weighted sum of and , namely:
(3) |
where is a parameter to be tuned by the network operator according to the priorities granted to ID and PH [11].
Defining , the problem to be tackled in the rest of this work is formulated as:
(4) | ||||
(5) | ||||
(6) | ||||
(7) | ||||
(8) | ||||
(9) |
It can be seen that 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 , 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:
(10) | ||||
wherein is shown in (11) at the top of the next page, with and being the real part operator.
(11) | ||||
In order to tackle (10), the first step is to embed (C4) into the objective, resorting to a penalty-based approach, which yields:
(12) | ||||
wherein represents the penalty coefficient used for penalizing the violation of the equality constraint (C4). If , the solution of the original problem is obtained. Problem (12) will be tackled by alternating optimization, as explained next.
III-A Optimization of ,
The optimal are found by simply setting the gradient of the objective to zero, which yields:
(13) |
(14) |
with , .
The optimization with respect to the coefficients is also straightforward. With respect to , 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 :
(15) |
Thus, with respect to , the problem is convex and can be solved by standard convex optimization algorithms [13].
III-B Optimization of
When all the other variables are fixed, the objective function is a concave function of the transmit beamforming vectors . 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 is upper-bounded by its first-order Taylor expansion as follows:
(16) |
whereing is the solution from the previous iteration. Thus, exploiting (16) and elaborating, (C1) can be recast as:
(17) | ||||
Similarly, (C2) can be reformulated as follows:
(18) |
III-C Optimization of
The approach is similar to that used for the optimization of . In fact, the objective is concave in , while constraints (C1) and (C2) can be handled by the SCA method. Specifically, (C1) can be replaced by the convex constraint:
(19) | ||||
and (C2) by the convex constraint:
(20) |
III-D Updating
The RIS phase shifts are the solutions of the problem:
(21) |
It can be seen that the problem is separable over , i.e., each summand can be optimized separately. Thus, defining , the optimal is found by solving the problem
(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 , where is the number of variables and [15].. Thus, the complexity of optimizing is , while the complexity of optimizing and are , and , respectively, with and being the number of iterations of the SCA methods used to optimize and . On the other hand, the optimal 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 . In fact, the problem can be decoupled over the optimization variables, and, for each , the optimal is obtain by solving (22). Thus, the overall complexity of the proposed method is given by , where 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 [15]. A typical value is , 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 transmit antennas are arranged in a uniform linear array, and a set of UEs are considered. The UEs are randomly and uniformly distributed within a disk of radius centered at . The -elements RIS is located at . All channels are modeled as , where and are the line-of-sight (LOS) and non-LOS (NLOS) components, and is either , , or . The NLOS component follows the Rayleigh fading model, while the LOS component is , with:
where and are the inter-antenna separation and the wavelength, respectively. We assume . The large-scale distance-dependent path-loss is , where is the link distance and is the reference distance at which the reference path-loss dB is defined, 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.
Parameters | Values |
---|---|
Number of RIS elements | 60 |
Maximum transmission power | = 10 dB |
Path-loss exponent - RIS-aided channels | |
Path-loss exponent - Direct channel | |
Rician factor | dB |
Power conversion noise | dBm |
Thermal noise power | dBm |
Minimum harvested power | mW |
Minimum SINR requirement | dB |
Power conversion efficiency | |
Combining weight | = [0.1, 1] |
Conversion efficiency (uplink) | 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 . The preference parameter is utilized to determine the service priority between optimizing the sum-rate (i.e., with a low value of ) or optimizing the harvested power (i.e., with a high value of ). 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 gives higher priority to information decoding. The figures reports the trade-off between the sum-rate and harvested power for any values of .




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 of the RIS elements. We observe that the sum-rate and the harvested power increase as increases. The highest values are obtained when , 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 . 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 , where is the number of receive antennas and 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.