On Age of Information and Energy-Transfer in a STAR-RIS-assisted System Mohammad Reza Kavianinia mrezakaviani@aut.ac.ir 0 Mohammad Mehdi Setoode 0 Mohammad Javad Emadi mj.emadi@aut.ac.ir 0 EUr IUr Reflection Region 0 Mohammad Reza Kavianinia, Mohammad Mehdi Setoode and Mohammad Javad Emadi are with the Department of Electrical Engineering, Amirkabir University of Technology (Tehran Polytechnic) , Tehran , Iran

-Battery-limited devices and time-sensitive applications are considered as key players in the forthcoming wireless sensor network. Therefore, the main goal of the network is two-fold; Charge battery-limited devices, and pro3 vide status updates to users where information-freshness mat2 ters. In this paper, a multi-antenna base station (BS) in asc information-users by analyzing age of information (AoI) metric. e Therefore, we derive a scheduling policy at BS, and analyze Djoint transmit beamforming and amplitude-phase optimization at BS and STAR-RIS, respectively, to reduce average sum-AoI 5 for the time-sensitive information-users while satisfying minimum ] required energy at energy-harvesting users. Moreover, two different energy-splitting and mode-switching policies at STAR-RIS are ITstudied. Then, by use of an alternating optimization algorithm, .sc tphreobolepmtimisiztaatcikonledpbroybulesmingisthsetusudciecdessainved cnoonnve-cxoanpvepxriotxyimofatitohne Base Station

20 suhirasatravbnelescteiinntogefldliesgivemincuetslstuawnrhfeaiolceuesc(loySn-TttrrAoaRlnl-isnRmgIiStstt)ianttrgua-snaunsmpdd-irtasetflepeopcwetirenfrogtromreeacnnoecnrefigyag-t-
-

[ technique. Through numerical results, AoI-metric and energy

harvesting requirements of the network are analyzed versus 1 different parameters such as number of antennas at BS, size v of STAR-RIS, and transmitted power to highlight how we can 6 improve two-fold performance of the system by utilizing STAR7 RIS compared to the conventional RIS structure. 7

Index Terms—Age of information, energy harvesting, simul2 taneously transmitting and reflecting-reconfigurable intelligent .0 surface, optimization methods. 2 1 I. INTRODUCTION 3 :v E variety of self-powered devices that has gained significant 2 NERGY harvesting is a highly appealing technology for a i interest. Internet of things (IoT) is one example of such sysXtems which are entangled with the energy harvesting feature. a However, if energy harvesting procedure takes a long period, r the user’s performance/experience may not be acceptable due to the delays [1]. Moreover, some other emerging applications, such as cooperative autonomous driving also require fresh and real-time status information [2]. Therefore, energy harvesting and data freshness are two important features in the forthcoming wireless networks.

One of the key technology to improve performance of a wireless system, e.g. spectral-efficiency, energy-efficiency and coverage, is the reconfigurable intelligent surface (RIS). By controlling the phase and/or amplitude of each elements of RIS, one can control the wavefront or equivalently manipulate the wireless propagation channel to enhance the performance [3]. Recently, a promising version of RIS, known as simultaneously transmitting and reflecting RIS (STAR-RIS) has evolved, wherein each element of the RIS can partly reflect and/or transmit the waveform while individually controlling amplitudes and phases of transmitted and reflected parts. Compared to the conventional RIS, one of the main advantages of STAR-RIS is enhancing the coverage from half-space to full-space [4].

Numerous studies on STAR-RIS assisted wireless networks are published in the literature. In [5], a wireless powered IoT network based on a STAR-RIS is studied which indicates the STAR-RIS enhances energy harvesting and information transfer for the considered setup. Also, a wireless-powered mobile edge computing system aided STAR-RIS is investigated in [6], where an STAR-RIS is deployed to assist the energy transfer in the downlink as well as the task offloading in the uplink. Recently, STAR-RIS assisted simultaneous wireless information and power transfer (SWIPT) system is studied in [7]. The trade-off between information users and energy users is investigated through a multi-objective optimization problem.

On the other hand, age of information (AoI), a new metric to measure freshness of information, is defined as the amount of time elapsed from the generation of a previous successfully transmitted status update packet [8]. AoI is becoming one of the key metrics in telecommunication systems which has been investigated and analyzed for different systems and scenarios [9]. For instance, average peak of AoI for a twohop relay wireless power transfer based system is studied in [10], wherein a source and a relay capture their required power by harvesting from received signal transmitted from a power station. Moreover, [11] has investigated potential impact of the conventional RIS in SWIPT system on minimizing sum-AoI.

Most of available studies on STAR-RIS mainly have focused on achievable rate and energy efficiency improvements of a system, and information freshness analysis in presence of STAR-RIS aided SWIPT networks is not studied in the literature. Therefore, in this paper, we present a STAR-RIS assisted SWIPT system in presence of two types of users: 1- Information users (IUs) that require fresh information 2- In the ES protocol, all STAR-RIS elements are able to Energy users (EUs) which ask for energy harvesting from operate in transmitting and reflecting modes at the same a base station. Also, thanks to the STAR-RIS and 360 de- time by splitting the energy. In contrast, for the MS case, gree coverage, in contrast to the conventional RIS technique, each element can operate only in transmitting or reflecting one can support users in front and behind of the STAR- mode. The TaRCs of a generic STAR-RIS are denoted by RAIoSI, sausbjwecetll.toTheunse,rgwye hsaturvdeystminignimcoinzsintrgainotfs afvoerradgieffseuremn-t wΦhkEeS/rMeS³ tm=, ³ drmia* g([p0,³ 11k]efjoθr1k ,E.S. .a,nqd ³ ³ kMtm,e³jθrmMk )*,{ " 0k, 1 }* f{ortM,rS},, STAR protocols. A non-convex problem is formulated to and » mt, » mr * [0, 2Ã ) , " m * M ; These parameters represent optimize transmit beamforming, phase shifts, and the proposed amplitude and phase shift of the m-th element, respectively. It scheduling scheme. The problem is solved by a successive is worth noting that the amplitude parts of TaRCs are subject convex approximation (SCA) based alternating optimization to law of energy conservation, i.e. ³ tm + ³ rm = 1 [4, 12]. (AO) algorithm. Moreover, numerical results for different protocols of STAR-RIS are evaluated and indicate performance improvements compared to that of the conventional RIS. B. Signal Transmissions and Receptions

Organization: Section II represents the proposed system BS sends tIk(n)=ωk(n)xIk(n) and rkE(n) = ϑk(n)xkE (n) to model, STAR-RIS configuration and defines AoI formulation. IUk and EUk, wherein ωk(n) * CNt×1 and ϑk(n) * CNt×1 Section III introduces the optimization problem and specifies denote beamforming vectors for IUk and EUk, respectively. the proposed algorithm. Section IV presents the numerical Also, information and energy signals are presented by xIk(n) > results, and section V concludes the paper. CN ( 0, 1 ) and xkE (n) > CN ( 0, 1 ), respectively. By assuming

Notations: tr(F ) denotes trace of matrix F , F 0 declares maximum power constraint Po at the BS, we have trhoawt Fan disja-tphocsoitliuvmenseimsir-edperfiesneitnetemdabtryixF, [ain,dj]a.nxelesmpeecnitfiiensit-hthe X ωk(n) 2 + X ϑk(n) 2 f Po. ( 3 ) Euclidean norm of the complex-valued vector x, and real part k∈{t,r} k∈{t,r} of x is R{x}. Probability of a random variable x is denoted by Therefore, the single-antenna k-th information user receives PGra{uxs}si,aanndraandzoemro-vmaeriaanblaendisuxn i>tC-vNaria(n0c,e1c).omplex symmetric ykIU(n) = fkH (n)ΦkES/MS(n)G(n)tIk(n) + nIkU, ( 4 )

II. SYSTEM MODEL

A downlink STAR-RIS-aided SWIPT wireless system depicted in Fig. 1, in which a base station (BS) with Nt antennas, by utilizing the STAR-RIS, transmits signals towards singleantenna energy users and information users. The STAR-RIS is equipped with M elements and is utilized to improve performance and coverage of the system by tuning transmitting and reflecting coefficients (TaRCs). As depicted in the figure and without loss of generality and for simplicity, it is assumed that two energy users, i.e. EUt and EUr, and two information users IUt and IUr are located in the transmission and reflection regions of STAR-RIS, respectively.

Also, we consider one information stream per information user and one energy stream for each energy user. Therefore, the BS sends energy signals and status update packets to the energy users and the information users over energy and information channels, respectively. It is assumed that energy channels are orthogonal to information channels to control interference over the information channel and enhance signalto-noise ratio (SNR). Moreover, it is assumed that there are N time slots indexed by n * { 1, . . . , N }, and there is one information channel per time slot. Thus, the scheduling policy to support information users at the BS is constrained by st(n) + sr(n) f 1, sk(n) * { 0, 1}, " k * { t, r}, ( 1 ) ( 2 ) where sk(n) denotes scheduling state at time slot n for IUk.

A. STAR-RIS Configuration

We consider the two well-known energy splitting (ES) and mode switching (MS) schemes for the STAR-RIS [4]. where G(n) * CM×Nt denotes the channel between the BS and STAR-RIS, fkH (n) * C1×M is the channel between STAR-RIS and IUk, ΦkES/MS(n) * CM×M indicates STARRIS settings, and nIkU > CN (0, Ã I2,k) denotes the additive white Gaussian noise (AWGN) at the information user IUk. Thus, the SNR at IUk becomes ³ k(n) = fkH (n)ΦkES/MS(n)G(n)ωk(n) 2 Ã I2,k .

Similarly, the kth single-antenna energy user receives ykEU(n) = ukH (n)ΦkES/MS(n)G(n)rkE (n) + nkEU, where ukH (n) * C1×M is the channel between STAR-RIS and EUk, and nkEU > CN (0, Ã E2,k) indicates AWGN at the energy user EUk. By neglecting noise power relative to the received signal, the harvested energy at EUk becomes

Ek(n) = ukH (n)ΦkES/MS(n)G(n)ϑk(n) 2.

C. Age of Information

The AoI metric indicates the freshness of data of a source from the destination’s perspective. Ak(n) denotes the AoI of IUk in n-th time slot for all n * { 1, ..., N } and k * { t, r}, which is given by [13] Ak(n + 1) = sk(n)bk(n)zk(n) + (1 2 sk(n)bk(n))Ak(n) + 1, ( 8 ) where zk(n) is the system time of the packet in the stream corresponding to IUk, named as Strk. That is, zk(n + 1) = pk(n + 1) = 1 o.w. ( 5 ) ( 6 ) ( 7 ) ( 9 ) where the binary random variable pk(n) is equal to 1 when a new packet from Strk arrives at the BS at time slot n, with a probability of » k; Pr{pk(n) = 1} = » k. Also, bk(n) * {0, 1} is 1 when Strk has an available packet to transmit and turns to 0 only if Strk is scheduled and its packet is delivered successfully without any newly arrived packet. So, bk(n) can be rewritten as follows bk(n+1) = pk(n+1)+bk(n)(12 sk(n))(12 pk(n+1)). ( 10 ) Moreover, a packet from Strk can only be successfully transmitted when it is scheduled and the received SNR to IUk is greater than the threshold value, ³ th as follows ³ k(n) g sk(n)bk(n)³ th, " k * { t, r}. ( 11 )

III. PROBLEM FORMULATION AND OPTIMIZATION We minimize the average sum-AoI for all streams over the time horizon to satisfy the freshness for information users, subject to transferring enough energy to the energy harvesting users. Hence, the optimization problem for ES protocol can be formulated as

P1 : 1 X 2N min ωskk((nn)),,Φϑkk((nn)) n ∀k∈{t,r} s.t. ( 1 ), ( 2 ), ( 3 ), ( 11 ),

X

Ak(n) Φ m = q³ kmejθmk , " m * M, ³ km * 0, 1 , " k *

t, r , ³ tm + ³ rm = 1, " m * M, » mt, » mr * [0, 2Ã ) , " m * M, Ek(n) g E, " k * t, r , where the constraints (12c)-(12f) denote STAR-RIS protocols configurations and the constraint (12g) indicates the required minimum harvested energy E.

By definition, the AoI increases linearly until a status update packet is successfully received, and according to [14], the problem of minimizing the average sum-AoI is equivalent to maximizing the AoI reduction in each time slot, i.e. the difference between the AoI and the system time in that particular slot [11], and the optimization problem ( 12 ) is reformulated as follows

Because of the non-convex constraints, i.e. ( 2 ), ( 11 ), (12g) and STAR-RIS settings, the optimization problem ( 13 ) cannot be solved directly. To deal with the non-convexity issue, we reformulate ( 13 ), and an SCA algorithm based on AO approach is proposed and analyzed in what follows to solve the problem.

A. Problem Reformulation

To deal with the non-convexity of the quality of service and energy harvesting constraints, i.e. ( 11 ) and (12g) respectively, ( 14 ) (16b) (16c) (16d) (16e) (17a) (17b) (17c) (17d) (17e) ( 18 ) which is not a convex optimization problem with respect to the beamforming vectors and TaRCs. Using the similar approach as presented in [15, 16], the AO approach is provided to solve the optimization problem ( 16 ) by splitting it into two subproblems as discussed in what follows.

B. The Scheduling Policy and TaRCs Optimization for ES

Due to the highly-coupled optimization problem ( 16 ), we split the main problem into two sub-problems. Firstly, for given ωk(n) and ϑk(n), we find out the scheduling indicator and TaRCs by solving the following problem as follows max sk(n),ϕk(n), αt,αr

X ∀k∈{t,r}

C. The Scheduling Policy and TaRCs Optimization for MS

The only difference between ES and MS protocols is the constraint (12d), which is substituted by binary constraint and provides non-convex constraint. To deal with the binary constraint, an upper bound is calculated in the j-th iteration by the following first-order Taylor expansion [17] ³ km 2 (³ km)2 f (³ km(j))2 + (1 2 2³ km(j))³ km

= g(³ km(j), ³ km), " m * M, the equations ( 5 ) and ( 7 ) are reformulated as follows P k(n) = diag(fkH (n))G(n)ωk(n),

V k(n) = diag(ukH (n))G(n)ϑk(n), and the TaRCs are rewritten as lt/r = q³ t1/r ejθ1t/r , . . . , q³ tM/rejθMt/r H . Thus, the non-convex constraints, i.e. ( 11 ) and (12g), are reformulated as ³ k(n) = tr(PIk(n)ϕk(n)) g sk(n)bk(n)³ th, " k * { t, r}, Ek(n) = tr(VEk(n)ϕk(n)) g E, " k * { t, r}, ( 15 ) where PIk(n) = P k(n)(P k(n))H , VEk(n) = V k(n)(V k(n))H and ϕk(n) = lk(lk)H , which are positive semi-definite matrices. Furthermore, the aforementioned reformulation problem imposes unit-rank matrice for ϕk(n) which is a non-convex constraint. By using the semi-definite relaxation for removing the unit-rank constraints and relaxing ( 2 ) as sk(n) * [0, 1], the problem ( 13 ) is rewritten as (Ak(n) 2 zk(n))sk(n)bk(n) (16a) max sk(n),ϕk(n), ωk(n),ϑk(n), αt,αr

X ∀k∈{t,r} (12a) (12b) (12c) (12d) (12e) (12f) (12g) (13a) (13b) s.t. ( 1 ), ( 3 ), (12d) 2 (12f), ( 15 ), sk(n) * [0, 1], " k * { r, t}, ϕk(n)[i, i] = αk[i], " k * { r, t}, ϕk(n) 0, " k * { r, t}, (19) (20) (21a) (21b) which the penalty term 2 µ PmM=1 Pk∈{r,t} g(³ km(j), ³ km) with large positive constant µ , added to the objective function of ( 17 ) to address non convexity of binary constraint. D. The Scheduling Policy and Beamforming Optimization with SCA Algorithm

For the given optimal ϕk(n), the constraints ( 15 ) are approximated by use of the Taylor expansion [11] with respect to ωk(n) and ϑk(n) as 2Rnω(i−1)H (n)tr(pIk(n)ϕk(n))(ωk(n) 2 ω(i−1)H (n))o k k + tr(pIk(n)ϕk(n)) ω(i−1)(n) 2 k g sk(n)bk(n)³ th, 2Rnϑ(i−1)H (n)tr(vEk (n)ϕk(n))(ϑk(n) 2 ϑ(i−1)H (n))o k k + tr(vEk (n)ϕk(n)) ϑ(ki−1)(n) 2 g E, where pIk(n) = diag(fkH (n))G(n)(diag(fkH (n))G(n))H , vEk (n) = diag(ukH (n))G(n)(diag(ukH (n))G(n))H in the (i 2 1)th iteration. Thus, the optimization problem ( 16 ) becomes which is a convex problem. Finally, by utilizing AO between ( 17 ) and (21) for the ES protocol and generalized ( 17 ) and (21) for the MS one, solutions are achieved as the algorithm converges. The iterative strategy for solving the problem ( 16 ) is summarized in Algorithm 1.

E. Complexity Analysis

In the previous subsection, the optimization problems ( 17 ) and (21) for the ES and MS protocols are formulated, and can be solved by CVX tool [18]. The complexity of the proposed scheme for the ES protocol is O TAO(TS M 3.5 log2(1/ë))), where TAO, TS and ë are the number of alternating iterations, the number of SCA iterations and stopping accuracy of SCA scheme, respectively. Also, for the MS protocol, we have O TAO(IB TS M 3.5 log2(1/ë))), where IB denotes the number of iterations for the binary convergence.

IV. NUMERICAL RESULTS AND DISCUSSION

To present numerical results, it is assumed that the Cartesian coordinates of STAR-RIS, EUr, IUr, EUt, IUt and BS are ( 8, 0 ), ( 10, 2 2 ), ( 12, 2 2 ), ( 10, 2 ), ( 12, 2 ) and (0, 0), respectively. Probabilities of the packet arrivals are » k = 0.6, the number of time slots is N = 100, and the noise variance is à I2,k = 1. The path loss exponents for information and energy users are ³ i = 2.2 and ³ e = 2, respectively. We also assume a stronger channel for the energy users than that of the information users. The geometric path-loss and random phase are considered for channel simulation as F = p(1/d)αq, where d represents a relative distance and q = ejφ denotes a random phase shift with a uniform distribution over 0, 2à .

Fig. 2 depicts average sum-AoI versus SNR threshold ³ th for Po = 3, M = 32 and Nt = 4. Average sum-AoI increases Algorithm 1 SCA method for addressing optimization problem given in ( 16 ) Input: Initial values for ωk(0)(n) and ϑ(k0)(n), Channel coeffitcoielenrtasnGce, ëu=kH ,1a0n−d3.fkH . Maximum power Po. Initial value for 1: for i = 1, 2, . . . do 2: For given ωk(i)(n), ϑ(ki)(n), " k update ϕk(n) and sk(n) by solving P2.1. 3: for j = 1, 2, . . . do 4: For given ϕk(n) and sk(n), solve the problem P2.2 to update value of ωk(i+1)(n) and ϑ(i+1)(n) k 5: Until: Convergence of ωk(n), ϑk(n) and sk(n) 6: end for 7: Until Convergence of ϕk(n) and sk(n) .

8: end for Output: The optimal values: ϕk(n), sk(n), ωk(n) and ϑk(n). with ³ th because, with greater demands for communication quality, successful transmission is more challenging to achieve. Besides, the average sum-AoI increases by increasing the energy harvesting threshold from E = 2 30 to E = 2 10 [dB], since power allocation and beamforming must be adjusted to meet the requirements of energy users. So, there is a compromise between the average sum-AoI and the harvested energy of energy users. Additionally, compared to MS protocol, ES protocol shows better performance with the same parameters. Also, ES and MS based STAR-RIS always outperforms the conventional RIS structure.

In Fig. 3, average sum-AoI versus transmit power Po is plotted for E = 2 20 [dB], M = 32 and Nt = 4. By increasing Po, SNR is improved and due to higher chance of successful delivery, average sum-AoI is decreased. Also, the difference between the performance of ES and MS protocols, and conventional RIS becomes more significant as ³ th increases.

The average sum-AoI versus number of antennas is illustrated in Fig. 4. It demonstrates that increasing the number of antennas Nt from 4 to 20 at the BS improves the average sumAoI, with Po = 3, E = 2 20 [dB], and M = 32. Similarly, in Fig. 5, the average sum-AoI is decreased dramatically by increasing the number of STAR-RIS elements M from 16 to 128, with Po = 3, E = 2 20 [dB], and Nt = 4. Therefore, based on the energy harvesting and data freshness requirements, one can select number of antennas at the BS and configure the STAR-RIS size and policy.

V. CONCLUSIONS

We explored average sum-AoI optimization in SWIPT networks with the assistance of STAR-RIS. An AO algorithm was proposed to cope with the non-convexity of the optimization problem. STAR-RIS TaRCS are optimized by problem transformation, and beamforming vectors optimization at the BS is performed by SCA algorithm. Numerical results highlighted that the performance of the proposed algorithm for ES and MS protocols is more beneficial than that of the conventional RIS, and the ES protocol outperforms the MS one. Also, numerical results show a trade-off between the average sum-AoI and the

Fig. 4: Average sum-AoI versus the number of antennas. harvested energy constraint. Increasing the number of antennas at the BS, and especially the number of STAR-RIS elements can improve performance of the system.

[1] H. Hu , K. Xiong , G. Qu , Q. Ni , P. Fan , and K. B. Letaief , “ AoI-minimal trajectory planning and data collection in UAV-assisted wireless powered IoT networks , ” IEEE Internet Things J. , vol. 8 , no. 2 , pp. 1211 - 1223 , 2020 . [2] I. Sorkhoh , C. Assi , D. Ebrahimi , and S. Sharafeddine , “ Optimizing information freshness for MEC-enabled cooperative autonomous driving,” IEEE Trans. Intell. Transp. Syst. , vol. 23 , no. 8 , pp. 13 127 - 13 140, 2021 . [3] E. Basar , M. Di Renzo , J. De Rosny , M. Debbah , M.- S. Alouini , and R. Zhang , “ Wireless communications through reconfigurable intelligent surfaces,” IEEE access , vol. 7 , pp. 116 753 - 116 773, 2019 . [4] Y. Liu , X. Mu , J. Xu , R. Schober , Y. Hao , H. V. Poor , and L. Hanzo, “STAR: Simultaneous transmission and reflection for 360° coverage by intelligent surfaces,” IEEE Wirel . Commun., vol. 28 , no. 6 , pp. 102 - 109 , 2021 . [5] W. Du , Z. Chu , G. Chen, P. Xiao , Y. Xiao , X. Wu , and W. Hao, “ STARRIS assisted wireless powered IoT networks , ” IEEE Trans. Veh . Technol., 2023 . [6] X. Qin , Z. Song , T. Hou , W. Yu , J. Wang , and X. Sun , “ Joint resource allocation and configuration design for STAR-RIS-enhanced wirelesspowered MEC,” IEEE Trans. Commun. , vol. 71 , no. 4 , pp. 2381 - 2395 , 2023 . [7] H. Liu , G. Li , X. Li , Y. Liu , G. Huang, and Z. Ding , “ Effective capacity analysis of STAR-RIS-assisted NOMA networks,” IEEE Wireless Commun . Lett. , vol. 11 , no. 9 , pp. 1930 - 1934 , 2022 . [8] M. A. Abd-Elmagid , H. S. Dhillon , and N. Pappas , “ AoI-optimal joint sampling and updating for wireless powered communication systems , ” IEEE Trans. Veh . Technol., vol. 69 , no. 11 , pp. 14 110 - 14 115, 2020 . [9] R. D. Yates , Y. Sun , D. R. Brown , S. K. Kaul , E. Modiano, and S. Ulukus , “ Age of information: An introduction and survey ,” IEEE J. Sel . Areas Commun., vol. 39 , no. 5 , pp. 1183 - 1210 , 2021 . [10] Y. Khorsandmanesh , M. J. Emadi , and I. Krikidis , “ Average peak age of information analysis for wireless powered cooperative networks , ” IEEE Trans. Cogn. Commun. Netw. , vol. 7 , no. 4 , pp. 1291 - 1303 , 2021 . [11] W. Lyu , Y. Xiu , J. Zhao , and Z. Zhang , “ Optimizing the age of information in RIS-aided SWIPT networks , ” IEEE Trans. Veh . Technol., vol. 72 , no. 2 , pp. 2615 - 2619 , 2022 . [12] J. Xu , Y. Liu , X. Mu , and O. A. Dobre , “ STAR-RISs: Simultaneous transmitting and reflecting reconfigurable intelligent surfaces,” IEEE Commun . Lett. , vol. 25 , no. 9 , pp. 3134 - 3138 , 2021 . [13] A. Muhammad , M. Elhattab , M. A. Arfaoui , A. Al-Hilo , and C. Assi , “ Age of information optimization in RIS-assisted wireless networks , ” IEEE Trans. Netw . Service Manag., 2023 . [14] S. Zhang , H. Zhang, Han, Poor, and Song, “ Age of information in a cellular internet of UAVs: Sensing and communication trade-off design,” IEEE Trans. Wirel . Commun., vol. 19 , no. 10 , pp. 6578 - 6592 , 2020 . [15] M. A. Saeidi , M. J. Emadi , H. Masoumi , M. R. Mili , D. W. K. Ng , and I. Krikidis , “ Weighted sum-rate maximization for multi-IRS-assisted full-duplex systems with hardware impairments,” IEEE Trans. Cogn. Commun. Netw. , vol. 7 , no. 2 , pp. 466 - 481 , 2021 . [16] H. Niu , Z. Chu , F. Zhou , and Z. Zhu , “ Simultaneous transmission and reflection reconfigurable intelligent surface assisted secrecy MISO networks,” IEEE Commun . Lett. , vol. 25 , no. 11 , pp. 3498 - 3502 , 2021 . [17] X. Mu , Y. Liu , L. Guo , J. Lin , and R. Schober , “ Simultaneously transmitting and reflecting (STAR) RIS aided wireless communications , ” IEEE Trans. Wirel . Commun., vol. 21 , no. 5 , pp. 3083 - 3098 , 2021 . [18] M. Grant and S. Boyd , “CVX: Matlab software for disciplined convex programming , version 2 .1,” 2014 .