Energy efficiency maximization for IRS-assisted UAV short packet communication

Energy efficiency maximization for IRS-assisted UAV short packet communication

Introduction

With development of communication technology, 6G wireless network is beginning to be widely studied1,2,3. Based on the improvement of the fifth generation wireless networks, the 6G wireless networks will enable complete digitization and interconnection of everything, and will promote the realization of various applications, such as eHealth, industry 5.0, connected robots and autonomous systems, and wireless sensor networks4,5,6,7,8. The unmanned aerial vehicle (UAV) plays an important role in air-to-ground communication networks. In9, the energy consumption of the user equipment is minimized in a UAV assisted mobile edge computing (MEC) system. In10, the trajectory design and fairness for facilitating ultra-reliable and low latency communication (URLLC) in UAV-enabled MEC system is investigated.

In order to satisfy the demanding latency requirements of future 6G wireless networks, short packet communication (SPC) is considered11,12. In short packet communication, the probability of decoding errors cannot be ignored due to the use of finite blocklength coding13,14. In15, the authors investigated the transmission rate for short packet communication, and it provides a basis for the study of SPC.

Due to the flexible deployment of the UAV, it is applied widely in short packet communication16,17,18,19. The authors in20 derived an expression for the average information age of the UAV-assisted SPC based on a stochastic hybrid model. An optimization method is proposed in21 to enhance the reliability of UAV-assisted visible light communication with finite blocklength coding. In22, the throughput and reliability of UAV communication systems based on nonlinear energy harvesting are analyzed. Specifically, the finite blocklength coding and infinite blocklength coding are studied respectively. In23, the maximization of energy efficiency for UAV relay SPC scenario is studied. In24, the UAV short packet communication process is divided into two phases, one is data collection and the other is data transmission. And the energy efficiency optimization in data collection and the secure rate optimization in data transmission are studied respectively. In summary, optimizing the performance of UAV short packet communication is a new challenge in future IoT networks.

With the development of the city, the density and height of buildings are increasing. It is possible that the data link between the ground sensors and the UAV are obscured by buildings. Then, some researchers proposed intelligent reflecting surface (IRS) to improve the channel quality and the communication performance. By reflecting the transmitted signal and adjusting the IRS’s phase shifts, the received signals from different paths can be enhanced25. For the passive IRS, it is controlled by low power electronic circuits, and the power consumption is nearly zero26. The phase shift of the linear IRS can be adjusted to increase the energy of the signal and improve the communication rate27. And linear IRS can adjust its reflection characteristics according to real-time communication requirements, which can adapt to different transmission environments. In28, the UAV-mounted IRS for data collection is investigated in an energy-aware manner. And the Synergetic UAV-IRS communication system is considered in29, the directional antenna is used to improve the system performance. In30, the data rate is maximized by optimizing the UAV’s trajectory, user scheduling with mobility and power consumption constraints. In31, the authors study the secure communication of UAV downlink communication systems with assistance of IRS. In32, the existence of jamming in UAV communication with IRS is considered, and the energy efficiency is optimized. The UAV in33 is used as an aerial relay to transmit information to the base station (BS), and the eavesdroppers are considered. The authors in34 studied the maximization of energy efficiency and spectrum efficiency in UAV communication systems with assistance of IRS. In35, the UAV downlink communication with IRS is considered, the sum transmission rate is improved by optimizing the channel resource allocation, UAV placement and beamforming. The research on improving efficiency of IRS will accelerate the realization of 6G communications and green communications.

The above studies on IRS-assisted UAV communication have not considered short packet communication. With development of Internet of Things (IoT), the performance optimization of IRS-assisted UAV SPC has become an urgent research topic36. In recent years, some researchers have carried out research work on UAV SPC systems with assistance of IRS. In37, the UAV and IRS are used as relay nodes for multi-hop relay communication, and the authors improve the communication reliability by optimizing blocklength allocation, UAV’s position and the phase shift of IRS. In38, multiple IRS-equipped UAVs are considered as relays to transmit data from the base station to multiple user groups, and the probability of decoding error is minimized by optimizing the deployment of UAV, beamforming and blocklength allocation. In39, the authors considered a scenario where an access point sends short packet information to the receivers with UAV-mounted IRS. The maximum average age of information is minimized by optimizing the time interval allocation, power allocation and trajectory of UAV.

In IRS-assisted UAV short packet communication, the battery energy carried by the small UAV is limited. However, in most existing studies, the energy efficiency optimization for IRS-assisted UAV SPC is not considered. In this paper, the energy efficiency maximization for UAV short packet communication with assistance of IRS is studied, in which the ground sensor transmits its sensing information to a fixed-wing UAV. The main contributions are listed as follows.

(1) The system model of UAV short packet communication with assistance of IRS is presented in detail. And the mathematical expression of the energy efficiency maximization problem for UAV SPC system with IRS is formulated. The energy efficiency is considered to be maximized by optimizing the passive beamforming of IRS, UAV’s speed, trajectory and transmit power.

(2) The problem of energy efficiency maximization is nonconvex with respect to the system parameters, hence it is difficult to be solved. In order to obtain the optimal solutions, the original optimization problem is firstly divided into three subproblems, then the subproblems are solved separately, and finally the problem is solved by employing an efficient iterative optimization algorithm.

(3) In the numerical results, it is seen that the proposed scheme can obtain higher performance of energy efficiency than benchmark schemes. And there exists an optimal value of flight speed for the UAV to minimize its power consumption. Comparing the scheme without IRS, it can be found that the application of IRS can improve the energy efficiency effectively.

The remaining sections of this paper are organized as follows. In section “System model and problem formulation”, we present the IRS-assisted UAV short packet communication model and formulate the optimization problem. Section “Optimal solutions” is devoted to solve the energy efficiency maximization problem. Simulation results are shown in section “Numerical results”. The conclusion is given in section “Conclusions”.

System model and problem formulation

The system model is shown in Fig. 1, in which a ground sensor d transmits its sensing information to a fixed-wing UAV. Unlike conventional communications, we assume that the ground sensor transmits short packet messages. Since the transmission link from the ground sensor to the UAV is obscured due to the presence of high buildings, IRS is employed to enhance the wireless channel quality. The UAV is flying with altitude (z_u.) For the convenience of analysis, the UAV’s flight time (text {T}) is divided equally into (text {M}) slots, where each slot is (delta _t=text {T}/text {M}.) Then, at time slot n, the UAV’s speed is denoted as ({mathbf{v}}[n]=(v_x[n],v_y[n]),) and its horizontal position is ({mathbf{Q}}[n]=(x[n],y[n]),nin [1,text {M}].) The horizontal positions of the ground sensor d and the IRS are denoted as ({mathbf{C}}_d=(x_d,y_d),) ({mathbf{C}}_r=(x_r,y_r),) respectively. The altitude of the ground sensor d is (z_d,) and the altitude of the IRS is (z_r.)

Fig. 1
Energy efficiency maximization for IRS-assisted UAV short packet communication

UAV short packet communication system with assistance of IRS.

Full size image

Due to the obstruction of urban buildings, the signal transmitted by the ground sensor d reaches the UAV with multiple reflections and scattering. The wireless channel from ground sensor d to the UAV can be considered as Rayleigh fading channel, and the corresponding channel gain is

$$begin{aligned} h_{du}[n]=sqrt{alpha text {D}_{du}^{-beta _{du}}[n]}{tilde{h}}_{du}[n], end{aligned}$$
(1)

where (alpha) is channel power gain with distance of 1m, (beta _{du}) is the path loss exponent of the transmission link from ground sensor d to the UAV, (text {D}_{du}[n]) is the distance between the ground sensor d and the UAV, ({tilde{h}}_{du}[n]) follows circularly symmetric complex Gaussian (CSCG) distribution.

The IRS is composed of (text {L}) reflecting elements. To improve the transmission performance, the IRS reflects the signal sent by the ground sensor d. The phase shift matrix of IRS is given as follows

$$begin{aligned} varvec{Psi }[n]=text {diag}Big (e^{jpsi _1[n]},e^{jpsi _2[n]},…,e^{jpsi _l[n]},…,e^{jpsi _text {L}[n]}Big ),lin [1,text {L}] end{aligned}$$
(2)

where (psi _l[n]) denotes the phase shift of lth reflecting element.

The channel from the ground sensor d to IRS consists of LoS and NLoS components. Therefore, it is considered as a Rician fading channel. The channel gain from the ground sensor d to the IRS is expressed as

$$begin{aligned} {mathbf{h}}_{dr}=sqrt{alpha text {D}_{dr}^{-beta _{dr}}}tilde{{mathbf{h}}}_{dr}in {mathbb {C}}^{text {L}times 1}, end{aligned}$$
(3)

where (text {D}_{dr}) is the distance between the ground sensor d and the IRS, (beta _{dr}) is the path loss exponent of the transmission link from ground sensor d to the IRS, (tilde{{mathbf{h}}}_{dr}) denotes the small-scale fading component. Specifically, the expression of (tilde{{mathbf{h}}}_{dr}) is

$$begin{aligned} tilde{{mathbf{h}}}_{dr}=sqrt{frac{kappa }{kappa +1}}tilde{{mathbf{h}}}_{dr}^text {L}+sqrt{frac{1}{kappa +1}}tilde{{mathbf{h}}}_{dr}^text {N} in {mathbb {C}}^{text {L}times 1}, end{aligned}$$
(4)

where (kappa) is Rician fading factor, (tilde{{mathbf{h}}}_{dr}^text {L}) is the array response of the IRS to the signal transmitted by the ground sensor d, (tilde{{mathbf{h}}}_{dr}^text {N}) is the NLoS component of the link from the ground sensor d to the IRS, which follows CSCG distribution. When the positions of the ground sensor d and the IRS are known, the expression of (tilde{{mathbf{h}}}_{dr}^text {L}) is

$$begin{aligned} tilde{{mathbf{h}}}_{dr}^text {L}=Big (1,e^{-jfrac{2pi }{lambda }phi cos theta _{dr}},…,e^{-jfrac{2pi }{lambda }phi (text {L}-1)cos theta _{dr}}Big )^text {T}, end{aligned}$$
(5)

where (phi) is the reflecting element spacing of IRS, (lambda) is the carrier wavelength transmitted by ground sensor d, (theta _{dr}) is the arrival angle of the link from the ground sensor d to the IRS, and (cos theta _{dr}=(x_d-x_r)/{text {D}_{dr}}.)

Since the UAV and the IRS is far from the ground and is usually not obscured by high objects such as buildings and trees, the link from the IRS to the UAV is considered as LoS link. Therefore, the corresponding channel gain is

$$begin{aligned} {mathbf{h}}_{ru}[n]=sqrt{alpha text {D}_{ru}^{-2}[n]}tilde{{mathbf{h}}}_{ru}[n] in {mathbb {C}}^{text {L}times 1}, end{aligned}$$
(6)

where (text {D}_{ru}[n]) is the distance between IRS and UAV, (tilde{{mathbf{h}}}_{ru}[n]) is the array response. When the positions of the IRS and the UAV are known, the expression of (tilde{{mathbf{h}}}_{ru}[n]) is obtained as follows

$$begin{aligned} tilde{{mathbf{h}}}_{ru}[n]=Big (1,e^{-jfrac{2pi }{lambda }phi cos theta _{ru}[n]},…,e^{-jfrac{2pi }{lambda }phi (text {L}-1)cos theta _{ru}[n]}Big )^text {T}, end{aligned}$$
(7)

where (theta _{ru}[n]) is the departure angle of the transmission link from the IRS to the UAV, (cos theta _{ru}[n]=(x_r-x_u[n])/{text {D}_{ru}[n]}.) According to the current state of research in channel estimation techniques40,41,42, the channel state information (CSI) for IRS-assisted communication systems can be obtained.

The signal received by the UAV has two components, one is the signal transmitted by the ground sensor, and the other is the signal reflected by the IRS. According to the above analysis, it can be obtained that the channel gain from the ground sensor d to the UAV (reflected by IRS) is ({mathbf{h}}_{ru}^{text {H}}varvec{Psi }[n]{mathbf{h}}_{dr}.) Then, the signal-to-noise ratio (SNR) of received signal at UAV is

$$begin{aligned} gamma [n]=frac{text {P}[n]big |h_{du}[n]+{mathbf{h}}_{ru}^text {H}[n]varvec{Psi }[n]{mathbf{h}}_{dr}big |^2}{sigma ^2}, end{aligned}$$
(8)

where (text {P}[n]) is the ground sensor’s transmit power, (sigma ^2) is the variance of AWGN.

For short packet communication, according to15, the maximum transmission rate at the UAV is given as follows

$$begin{aligned} text {R}[n]=log _2(1+gamma [n])-sqrt{frac{text {V}[n]}{m}}frac{{Q}^{-1}(epsilon )}{ln 2}, end{aligned}$$
(9)

where (text {V}[n]=1-(1+gamma [n])^{-2}) is the channel dispersion, (epsilon) is the decoding error probability of the system, m is the blocklength.

Since the energy of the UAV is limited, we consider maximizing the energy efficiency of the UAV SPC system. Therefore, the energy consumed by the UAV during time period (text {T}) needs to be studied. Compared to the energy consumed for UAV flight, the energy consumed for communication can be negligible. Based on the analysis in43, the energy consumption of the UAV flight during time period (text {T}) is

$$begin{aligned} begin{aligned} text {E}^{text {total}}=delta _tsum _{n=1}^{text {M}}Bigg [frac{1}{2}s_0Arrowvert {mathbf{v}}[n]Vert ^3+text {P}_1Big (1+frac{3Vert {mathbf{v}}[n]Vert ^2}{varpi ^2}Big )+text {P}_2Bigg (sqrt{1+frac{Vert {mathbf{v}}[n]Vert ^4}{4text {U}_0^4}}-frac{Vert {mathbf{v}}[n]Vert ^2}{2text {U}_0^2}Bigg )^{1/2}Bigg ], end{aligned} end{aligned}$$
(10)

where (text {P}_1) and (text {P}_2) are the power parameters in the hovering state of the UAV, (s_0) is the parameter related to the parasite power, (varpi) and (text {U}_0) are the parameters related to the rotor blade velocity. In this paper, the energy efficiency is the ratio of the average transmitted bits over the average energy consumption, i.e., (Upsilon =(sum _{n=1}^{text {M}}text {R}[n]delta _t)/text {E}^{text {total}}.)

Next, we will maximize the energy efficiency by optimizing the ground sensor’s transmit power ({mathbf{P}}={{text {P}[n], forall n}},) the IRS’s passive beamforming (varvec{Psi }={{varvec{Psi }[n], forall n}},) the UAV’s speed ({mathbf{v}}={{{mathbf{v}}[n], forall n}}) and trajectory ({mathbf{Q}}={{{mathbf{Q}}[n], forall n}}.) Specifically, we formulate the optimization problem as follows

$$begin{aligned} text{(OP): }&;;mathop {max }limits _{{mathbf{P}},varvec{Psi },{mathbf{Q}},{mathbf{v}}} ,, frac{sum _{n=1}^text {M} text {R}[n]delta _t}{text {E}^{text {total}}} end{aligned}$$
(11a)
$$begin{aligned} text{ s.t.: }&;; {mathbf{Q}}[n]={mathbf{Q}}[n-1]+{mathbf{v}}[n-1]delta _t,n=2,…,text {M}end{aligned}$$
(11b)
$$begin{aligned}&;; {mathbf{Q}}[1]={mathbf{Q}}_text {I} end{aligned}$$
(11c)
$$begin{aligned}&;; {mathbf{Q}}[text {M}]+{mathbf{v}}[text {M}]delta _t={mathbf{Q}}_text {F} end{aligned}$$
(11d)
$$begin{aligned}&;; Vert {mathbf{v}}[n]Vert le v_{max },forall {n} end{aligned}$$
(11e)
$$begin{aligned}&;; 0 le text {P}[n]le text {P}_{max } end{aligned}$$
(11f)
$$begin{aligned}&;; frac{1}{text {M}}sum _{n=1}^text {M} text {P}[n]le text {P}_{text {avg}} end{aligned}$$
(11g)
$$begin{aligned}&;; 0le psi _l[n]le 2pi , forall l,n end{aligned}$$
(11h)

where ({mathbf{Q}}_text {I}) is the initial position of the UAV and ({mathbf{Q}}_text {F}) is the final position, constraints (11b)–(11d) are the trajectory constraints, (11e) is the constraint of UAV’s speed and (v_{max }) is the UAV’s maximum speed, (11g) is the constraint of UAV’s transmit power, (text {P}_{max }) and (text {P}_{text {avg}}) are the maximum transmit power and the average transmit power of ground sensor d, respectively, and constraint (11h) specifies the phase shift range of IRS.

Optimal solutions

The optimization problem (11) can be transformed to problem (12) equivalently by introducing two auxiliary variables (varvec{zeta }={zeta [n],forall n}) and (varvec{eta }={eta [n],forall n},) which is rewritten as

$$begin{aligned} text{(OP1): }&;;mathop {max }limits _{{mathbf{P}},varvec{Psi },{mathbf{Q}},{mathbf{v}},varvec{zeta },varvec{eta }} ,, frac{sum _{n=1}^text {M} tilde{text {R}}[n]delta _t}{text {E}^{text {total}}} end{aligned}$$
(12a)
$$begin{aligned} text{ s.t.: }&;; (11text {b})-(11text {h})end{aligned}$$
(12b)
$$begin{aligned}&;; zeta [n]ge 1-(1+eta [n])^{-2},forall n end{aligned}$$
(12c)
$$begin{aligned}&;; eta [n]ge frac{text {P}[n]|h_{du}[n]+{mathbf{h}}_{ru}^text {H}varvec{Psi }[n]{mathbf{h}}_{dr}|^2}{sigma ^2},forall n end{aligned}$$
(12d)

where

$$begin{aligned} tilde{text {R}}[n]=log _2(1+gamma [n])-sqrt{frac{zeta [n]}{m}}frac{{Q}^{-1}(epsilon )}{ln 2}. end{aligned}$$
(13)

The above problem is difficult to be solved since it is nonconvex. To solve this difficulty, problem (12) is firstly divided into three subproblems, then the subproblems are solved respectively, and finally an iterative algorithm will be proposed.

Transmit power optimization

Given the IRS’s passive beamforming (varvec{Psi }={varvec{Psi }[n],forall n},) the UAV’s speed ({mathbf{v}}={{mathbf{v}}[n],forall n}) and trajectory ({mathbf{Q}}={{mathbf{Q}}[n],forall n},) we firstly optimize the transmit power of the ground sensor d. Problem (12) is rewritten as

$$begin{aligned} text{(OP1.1): }&mathop {max }limits _{{mathbf{P}},varvec{zeta },varvec{eta }} ,, {sum _{n=1}^text {M} tilde{text {R}}[n]delta _t} end{aligned}$$
(14a)
$$begin{aligned} text{ s.t.: }&(11text {f}),(11text {g}),(12text {c}),(12text {d}) end{aligned}$$
(14b)

It can be obtained that problem (14) is nonconvex. We will address this difficulty by using SCA methods.

By using the first order Taylor expansion method, we derive the concave lower bound function of (tilde{text {R}}[n]) as follows

$$begin{aligned} begin{aligned}&tilde{text {R}}[n]=log _2(1+gamma [n])-sqrt{frac{zeta [n]}{m}}frac{{Q}^{-1}(epsilon )}{ln 2}\&ge log _2(1+gamma [n])-Big {zeta _0^{1/2}[n]+zeta [n]zeta _0^{-1/2}[n]Big }frac{{Q}^{-1}(epsilon )}{2sqrt{m}ln 2}\&=tilde{text {R}}_p^{lb}[n], end{aligned} end{aligned}$$
(15)

where (zeta _0[n]) is a given feasible point of (zeta [n]).

By using the SCA method, constraint (12c) can be equivalently replaced by

$$begin{aligned} begin{aligned} zeta [n]ge 1-(1+eta _0[n])^{-2}+2(1+eta _0[n])^{-3}(eta [n]-eta _0[n]),forall n end{aligned} end{aligned}$$
(16)

Based on the above analysis, problem (14) will be reformulated as

$$begin{aligned} text{(OP1.2): }&mathop {max }limits _{{mathbf{P}},varvec{zeta },varvec{eta }} ,, {sum _{n=1}^text {M} tilde{text {R}}_p^{lb}[n]delta _t} end{aligned}$$
(17a)
$$begin{aligned} text{ s.t.: }&(11text {f}),(11text {g}),(12text {d}),(16) end{aligned}$$
(17b)

Problem (17) is convex, and we can use CVX to solve it.

Passive beamforming optimization

Given ground sensor’s transmit power ({mathbf{P}}={text {P}[n],forall n},) UAV’s speed ({mathbf{v}}={{mathbf{v}}[n],forall n}) and trajectory ({mathbf{Q}}={{mathbf{Q}}[n],forall n},) we optimize passive beamforming of the IRS. Problem (12) is reformulated as

$$begin{aligned} text{(OP2.1): }&mathop {max }limits _{varvec{Psi },varvec{zeta },varvec{eta }} ,, {sum _{n=1}^text {M} tilde{text {R}}[n]delta _t} end{aligned}$$
(18a)
$$begin{aligned} text{ s.t.: }&(11text {h}),(12text {c}),(12text {d}) end{aligned}$$
(18b)

We define

$$begin{aligned} {mathbf{H}}_u[n]= & Big [tilde{{mathbf{h}}}_{ru}^text {H}[n],{tilde{h}}_{du}[n]Big ], end{aligned}$$
(19)
$$begin{aligned} {mathbf{G}}[n]= & text {diag}Bigg [sqrt{alpha text {D}_{ru}^{-2}[n]}{mathbf{h}}_{dr}^text {T},sqrt{alpha text {D}_{du}^{-beta _{du}}[n]}Bigg ], end{aligned}$$
(20)
$$begin{aligned} {mathbf{z}}[n]= & [z_1[n],z_2[n],…,z_text {L}[n],1]^text {T}, end{aligned}$$
(21)

where (z_l[n]=e^{jpsi _l[n]},lin [1,text {L}]).

According to (19)–(21), we can obtain the equation as follows

$$begin{aligned} h_{du}[n]+{mathbf{h}}_{ru}^text {H}[n]varvec{Psi }[n]{mathbf{h}}_{dr}={mathbf{H}}_u[n]{mathbf{G}}[n]{mathbf{z}}[n]. end{aligned}$$
(22)

Thus, problem (18) can be rewritten as

$$begin{aligned} text{(OP2.2): }&mathop {max }limits _{mathbf{z},varvec{zeta },varvec{eta }} ,, delta _t{sum _{n=1}^text {M} log _2bigg (1+frac{text {P}[n]|mathbf{H}_u[n]mathbf{G}[n]mathbf{z}[n]|^2}{sigma ^2}bigg )}-sqrt{frac{zeta [n]}{m}}frac{{Q}^{-1}(epsilon )}{ln 2} nonumber \ text{ s.t.: }&zeta [n]ge 1-(1+eta [n])^{-2},forall n end{aligned}$$
(23a)
$$begin{aligned}&eta [n]ge frac{text {P}[n]|mathbf{H}_u[n]mathbf{G}[n]mathbf{z}[n]|^2}{sigma ^2},forall n end{aligned}$$
(23b)
$$begin{aligned}&big |z_l[n]big |=1,l=1,…,text {L},forall n end{aligned}$$
(23c)

Since the objective function is nonconcave and the constraints (23b) are nonconvex, problem (23) is nonconvex. Firstly, we employ the same method as in the previous section to transform constraint (23b) into constraint (16). Then, (|{mathbf{H}}_u[n]{mathbf{G}}[n]{mathbf{z}}[n]|^2) can be replaced as

$$begin{aligned} begin{aligned} |{mathbf{H}}_u[n]{mathbf{G}}[n]{mathbf{z}}[n]|^2&={mathbf{H}}_u[n]{mathbf{G}}[n]{mathbf{z}}[n]{mathbf{z}}^text {H}[n]{mathbf{G}}^text {H}[n]{mathbf{H}}_u^text {H}[n]\&=text {Tr}Big ({mathbf{S}}[n]{mathbf{z}}[n]{mathbf{z}}^text {H}[n]Big ), end{aligned} end{aligned}$$
(24)

where ({mathbf{S}}[n]={mathbf{G}}^text {H}[n]{mathbf{H}}_u^text {H}[n]{mathbf{H}}_u[n]{mathbf{G}}[n].)

When the rank of ({mathbf{Z}}[n]) is one and ({mathbf{Z}}[n]succeq 0,) we obtain

$$begin{aligned} {mathbf{Z}}[n]={mathbf{z}}[n]{mathbf{z}}^text {H}[n]. end{aligned}$$
(25)

Given the point (zeta _0,) we obtain the concave lower bound of (tilde{text {R}}[n]) as follows

$$begin{aligned} begin{aligned} tilde{text {R}}[n]&=log _2(1+frac{text {P}[n]text {Tr}({mathbf{S}}[n]{mathbf{Z}}[n])}{sigma ^2})-sqrt{frac{zeta [n]}{m}}frac{{Q}^{-1}(epsilon )}{ln 2}\&ge log _2(1+frac{text {P}[n]text {Tr}({mathbf{S}}[n]{mathbf{Z}}[n])}{sigma ^2})-Big {zeta _0^{1/2}[n]+zeta [n]zeta _0^{-1/2}[n]Big }frac{{Q}^{-1}(epsilon )}{2sqrt{m}ln 2}\&=tilde{text {R}}_{psi }^{lb}[n]. end{aligned} end{aligned}$$
(26)

To address that (text {Rank}({mathbf{Z}}[n])=1) is nonconvex, we use semidefinite relaxation method. Therefore, the problem (23) is reformulated as follows

$$begin{aligned} text{(OP2.3): }&mathop {max }limits _{{mathbf{z}},varvec{zeta },varvec{eta }} ,, delta _tsum _{n=1}^text {M}tilde{text {R}}_{psi }^{lb}[n] end{aligned}$$
(27a)
$$begin{aligned} text{ s.t.: }&zeta [n]ge 1-(1+eta _0[n])^{-2}+2(1+eta _0[n])^{-3}(eta [n]-eta _0[n]),forall n nonumber \&eta [n]ge frac{text {P}[n]text {Tr}({mathbf{S}}[n]{mathbf{Z}}[n])}{sigma ^2},forall n end{aligned}$$
(27b)
$$begin{aligned}&|z_l[n]|=1,forall l,n end{aligned}$$
(27c)
$$begin{aligned}&{mathbf{Z}}[n]succeq 0,forall n end{aligned}$$
(27d)

where ({mathbf{Z}}={{mathbf{Z}}[n],forall n}.) The problem (27) is convex, so we can use CVX toolbox to solve it. Because of the relaxation of constraint (text {Rank}({mathbf{Z}}[n])=1,) solution of problem (27) is an upper bound of the solution of problem (18). After solving problem (27), we will find a solution that satisfies constraint (text {Rank}({mathbf{Z}}[n])=1.) Firstly, we perform an eigenvalue decomposition of ({mathbf{Z}}[n]) to obtain ({mathbf{Z}}[n]={mathbf{F}}[n]{mathbf{M}}[n]{mathbf{F}}^text {H}[n].) Then we define (bar{{mathbf{z}}}[n]={mathbf{F}}[n]{mathbf{M}}^{1/2}[n]{mathbf{r}}[n],) where ({mathbf{r}}[n]) follows CSCG distribution. Among all the values of ({mathbf{r}}[n],) we find the maximal value of (bar{{mathbf{z}}}[n],) which is the suboptimal solution of problem (23). Finally, the optimal phase shift for problem (18) is (psi _l[n]=text {arg}big ({bar{z}}_l[n]/{bar{z}}_{text {L}+1}[n]big ).) For the active IRS, similar methods can be used to adjust the phase shifts to improve the communication performance.

UAV trajectory and speed optimization

Given ground sensor’s transmit power ({mathbf{P}}={text {P}[n],forall n},) the IRS’s passive beamforming (varvec{Psi }={varvec{Psi }[n],forall n},) we will optimize the UAV’s speed and trajectory. Problem (12) is reformulated as

$$begin{aligned} text{(OP3.1): }&mathop {max }limits _{{mathbf{Q}},{mathbf{v}},varvec{zeta },varvec{eta }} ,, frac{delta _t{sum _{n=1}^text {M} tilde{text {R}}[n]}}{text {E}^{text {total}}}end{aligned}$$
(28a)
$$begin{aligned} text{ s.t.: }&(11text {b})-(11text {e}), (12text {c}), (12text {d}) end{aligned}$$
(28b)

By introducing auxiliary variable (varvec{rho }={rho [n],forall n},) the problem (28) is transformed as

$$begin{aligned} text{(OP3.2): }&mathop {max }limits _{{mathbf{Q}},{mathbf{v}},varvec{zeta },varvec{eta },varvec{rho }} ,, frac{delta _t{sum _{n=1}^text {M}log _2(1+frac{text {P}[n]rho [n]}{sigma ^2})}-sqrt{frac{zeta [n]}{m}}frac{{Q}^{-1}(epsilon )}{ln 2}}{text {E}^{text {total}}}end{aligned}$$
(29a)
$$begin{aligned} text{ s.t.: }&(11text {b})-(11text {e}), (12text {c}), (12text {d}) end{aligned}$$
(29b)
$$begin{aligned}&rho [n]le Big |h_{du}[n]+{mathbf{h}}_{ru}^text {H}[n]varvec{Psi }[n]{mathbf{h}}_{dr}Big |^2,forall n end{aligned}$$
(29c)

It is seen that (29a) is nonconcave and the constraints (12c), (12d) and (29c) are nonconvex. Similar to the previous section, we equivalently transform constraint (12c) into constraint (16).

To facilitate the analysis, we give the following equation

$$begin{aligned} begin{aligned}&Big |h_{du}[n]+{mathbf{h}}_{ru}^text {H}[n]varvec{Psi }[n]{mathbf{h}}_{dr}Big |^2 \&=Big [text {D}_{du}^{-beta _{du}/2}[n],text {D}_{ru}^{-1}[n]Big ]{mathbf{W}}[n]Big [text {D}_{du}^{-beta _{du}/2}[n],text {D}_{ru}^{-1}[n]Big ]^text {T}, end{aligned} end{aligned}$$
(30)

where ({mathbf{W}}[n]=alpha {mathbf{w}}^text {H}[n]{mathbf{w}}[n],) ({mathbf{w}}[n]=big [{tilde{h}}_{du}[n],tilde{{mathbf{h}}}_{ru}^text {H}[n]varvec{Psi }[n]{mathbf{h}}_{dr}big ].) The elements of (tilde{{mathbf{h}}}_{ru}[n]) are nonconvex and nonlinear with the position of the UAV. This will make it extremely difficult to construct equivalent convex constraints. Therefore, we approximate (tilde{{mathbf{h}}}_{ru}[n]) in the kth iteration by utilizing the UAV’s position in the ((k-1))th iteration.

By introducing auxiliary variables ({mathbf{u}}={u[n],forall n}) and (varvec{chi }={chi [n],forall n},) we equivalently transform constraint (12d) into

$$begin{aligned} eta [n]ge frac{text {P}[n]{mathbf{E}}[n]{mathbf{W}}[n]{mathbf{E}}^text {T}[n]}{sigma ^2}, end{aligned}$$
(31)
$$begin{aligned} u^{-4/beta _{du}}[n]le text {D}_{du}^2[n], end{aligned}$$
(32)
$$begin{aligned} chi ^{-2}[n]le text {D}_{ru}^2[n], end{aligned}$$
(33)

where ({mathbf{E}}[n]=big [u[n],chi [n]big ]). Since the right-hand side functions of (32) and (33) are both convex, their concave lower bounds can be obtained as follows

$$begin{aligned} text {D}_{du}^2[n]ge x_d^2-2x_dx_u[n]+y_d^2-2y_dy_u[n]+(z_d-z_u)^2+text {F}[n],end{aligned}$$
(34)
$$begin{aligned} text {D}_{ru}^2[n]ge x_r^2-2x_rx_u[n]+y_r^2-2y_ry_u[n]+(z_r-z_u)^2+text {F}[n], end{aligned}$$
(35)

where

$$begin{aligned} begin{aligned} text {F}[n]=2x_{u,0}[n]x_u[n]-x_{u,0}^2[n]+2y_{u,0}[n]y_u[n]-y_{u,0}^2[n]. end{aligned} end{aligned}$$
(36)

Similar to constraint (12d), we add two auxiliary variables ({mathbf{e}}={e[n],forall n}) and (varvec{tau }={tau [n],forall n}) to decompose constraint (29c) into the following three constraints

$$begin{aligned} rho [n]le {mathbf{B}}[n]{mathbf{W}}[n]{mathbf{B}}^text {T}[n], end{aligned}$$
(37)
$$begin{aligned} e^{-4/beta _{du}}[n]ge text {D}_{du}^2[n], end{aligned}$$
(38)
$$begin{aligned} tau ^{-2}[n]ge text {D}_{ru}^2[n], end{aligned}$$
(39)

where ({mathbf{B}}[n]=big [e[n],tau [n]big ].) Constraint (37) is nonconvex, however, ({mathbf{B}}[n]{mathbf{W}}[n]{mathbf{B}}^text {T}[n]) is convex to ({mathbf{B}}[n].) Then, its concave lower bound can be obtained as follows

$$begin{aligned} begin{aligned} {mathbf{B}}[n]{mathbf{W}}[n]{mathbf{B}}^text {T}[n] ge 2{mathfrak {R}}big [{mathbf{B}}_0[n]{mathbf{W}}[n]{mathbf{B}}^text {T}[n]big ]-{mathbf{B}}_0[n]{mathbf{W}}[n]{mathbf{B}}_0^text {T}[n]. end{aligned} end{aligned}$$
(40)

In constraints (38) and (39), (e^{-4/beta _{du}}[n]) and (tau ^{-2}[n]) are convex to e[n] and (tau [n],) respectively. Then, the constraints (38) and (39) can be replaced by the following constraints

$$begin{aligned} e_0^{-4/beta _{du}}[n]-4e_0^{-(1+4/beta _{du})}[n](e[n]-e_0[n])big /{beta _{du}} ge text {D}_{du}^2[n], end{aligned}$$
(41)
$$begin{aligned} tau _0^{-2}[n]-2tau _0^{-3}[n](tau [n]-tau _0[n])ge text {D}_{ru}^2[n]. end{aligned}$$
(42)

Since problem (28) is a fractional maximization problem, we will perform additional steps to obtain an objective function with a concave-convex structure. Then, problem (28) is solved by using existing fractional programming (FP) methods. Given the point (zeta _0,) the concave lower bound of the numerator of the objective function is

$$begin{aligned} begin{aligned}&log _2bigg (1+frac{text {P}[n]rho [n]}{sigma ^2}bigg )-sqrt{frac{zeta [n]}{m}}frac{{Q}^{-1}(epsilon )}{ln 2} \&ge log _2bigg (1+frac{text {P}[n]rho [n]}{sigma ^2}bigg )-Big {zeta _0^{1/2}[n]+zeta [n]zeta _0^{-1/2}[n]Big }frac{{Q}^{-1}(epsilon )}{2sqrt{m}ln 2}\&=tilde{text {R}}_Q^{lb}[n]. end{aligned} end{aligned}$$
(43)

With the assistance of the auxiliary variable ({mathbf{c}}={c[n],forall n},) (text {E}^{text {total}}) can be transformed into

$$begin{aligned} bar{text {E}}^{text {total}}=delta _tsum _{n=1}^text {M}bigg [frac{1}{2}s_0Vert {mathbf{v}}[n]Vert ^3+text {P}_1(1+frac{3Vert {mathbf{v}}[n]Vert ^2}{varpi ^2})+text {P}_2c[n]bigg ], end{aligned}$$
(44)

and the constraint

$$begin{aligned} c^{-2}[n]-c^2[n]le frac{Vert {mathbf{v}}[n]Vert ^2}{text {U}_0^2}. end{aligned}$$
(45)

In (45), ((c^{-2}[n]-c^2[n])) is a difference convex structure with respect to c[n], and ({Vert {mathbf{v}}[n]Vert ^2}/{text {U}_0^2}) is convex to ({mathbf{v}}[n].) Therefore, by using the SCA method, we can rewrite constraint (45) as

$$begin{aligned} begin{aligned} c^{-2}[n]+c_0^2[n]-2c_0[n]c[n]le frac{1}{text {U}_0^2}Big [Vert {mathbf{v}}_0[n]Vert ^2+2{mathbf{v}}_0^text {T}[n]({mathbf{v}}[n]-{mathbf{v}}_0[n])Big ]. end{aligned} end{aligned}$$
(46)

Then, the problem (28) is reformulated as follows

$$begin{aligned} text{(OP3.3): }&mathop {max }limits _{mathbf{Q},mathbf{v},varvec{zeta },varvec{eta },varvec{rho },mathbf{e},varvec{tau },mathbf{u},varvec{chi },mathbf{c}} ,, frac{delta _t{sum _{n=1}^text {M}tilde{text {R}}_Q^{lb}[n]}}{bar{text {E}}^{text {total}}}end{aligned}$$
(47a)
$$begin{aligned} text{ s.t.: }&(11text {b})-(11text {e}), (16), (31), (41), (42), (46) nonumber \&u^{-4/beta _{du}}[n]le x_d^2-2x_dx_u[n]+y_d^2-2y_dy_u[n]+(z_d-z_u)^2+text {F}[n],forall n nonumber \&chi ^{-2}[n]le x_r^2-2x_rx_u[n]+y_r^2-2y_ry_u[n]+(z_r-z_u)^2+text {F}[n],forall n nonumber \&rho [n]le 2mathfrak {R}Big [mathbf{B}_0[n]mathbf{W}[n]mathbf{B}^text {T}[n]Big ]-mathbf{B}_0[n]mathbf{W}[n]mathbf{B}_0^text {T}[n], forall n end{aligned}$$
(47b)

In (47a), ({delta _t{sum _{n=1}^text {M}tilde{text {R}}_Q^{lb}[n]}}/{bar{text {E}}^{text {total}}}) is a fraction with a concave-convex structure, hence Dinkelbach’s method is used to solve Problem (47). According to44, we transform Problem (47) by introducing multiplication factor (iota _k) as follows

$$begin{aligned} text{(OP3.4): }&mathop {max }limits _{{mathbf{Q}},{mathbf{v}},varvec{zeta },varvec{eta },varvec{rho },{mathbf{e}},varvec{tau },{mathbf{u}},varvec{chi },{mathbf{c}}} ,, delta _t{sum _{n=1}^text {M}tilde{text {R}}_Q^{lb}[n]}-iota _kbar{text {E}}^{text {total}}end{aligned}$$
(48a)
$$begin{aligned} text{ s.t.: }&(11text {b})-(11text {e}), (16), (31), nonumber \&(41), (42), (46), (47text {c})-(47text {e}) end{aligned}$$
(48b)

where (iota _k) denotes the factor value at the kth iteration. Problem (48) is convex, so we can use CVX toolbox to solve it.

Algorithm 1
figure a

Joint Optimization Algorithm for Problem (11)

Full size image

Joint optimization algorithm

Based on the analyses in sections “Transmit power optimization”, “Passive beamforming optimization” and “UAV trajectory and speed optimization”, we have transformed the transmit power optimization, passive beamforming optimization, UAV trajectory and speed optimization problem into standard convex optimization problems. Then, an efficient iterative algorithm will be proposed by optimizing the subproblems (17), (27) and (48) in an iterative manner. The proposed algorithm is shown in Algorithm 1.

According to45, the energy efficiency (Upsilon) is non-decreasing at each iteration. The convergence of Algorithm 1 is proved as follows.

$$begin{aligned} begin{aligned}&Upsilon (text {P}_k,varvec{Psi }_k,text {Q}_k,text {v}_k) \&{mathop {le }limits ^{(a)}}Upsilon (text {P}_{k+1},varvec{Psi }_k,text {Q}_k,text {v}_k)\&{mathop {le }limits ^{(b)}}Upsilon (text {P}_{k+1},varvec{Psi }_{k+1},text {Q}_k,text {v}_k)\&{mathop {le }limits ^{(c)}}Upsilon (text {P}_{k+1},varvec{Psi }_{K+1},text {Q}_{k+1},text {v}_{k+1}),\ end{aligned} end{aligned}$$
(49)

where the conditions (a), (b) and (c) hold since (text {P}_{k+1},) (varvec{Psi }_{K+1},) (text {Q}_{k+1}) and (text {v}_{k+1}) are the optimal solutions of subproblems (17), (27) and (48), respectively. The maximal number of iterations of Algorithm 1 is supposed to be (k_{max },) the parameters (text {P},) (varvec{Psi },) (text {Q}) and (text {v}) are convergent when (Upsilon) converge.

The proposed Algorithm 1 has fast convergence speed, which will be shown in the simulations. Next, the complexity of the algorithm will be analyzed. In step 3, the complexity is (Omega _1={mathcal {O}}(omega _1(3text {M})^{3.5}),) where (omega _1) is the number of iterations in step 3. In step 4, the complexity is (Omega _2={mathcal {O}}(omega _2sqrt{text {L}+1}(text {M}(text {L}+1)^3+text {M}^2(text {L}+1)+text {M}^3)),) where (omega _2) is the number of iterations in step 4. In step 5, the complexity is (Omega _3={mathcal {O}}(omega _3(12text {M})^{3.5}),) where (omega _3) is the number of iterations in step 5. Therefore, the complexity of the proposed algorithm 1 is ({mathcal {O}}(k(Omega _1+Omega _2+Omega _3))).

Numerical results

In the simulations, we suppose that the flight altitude of the UAV is (z_u=100)m, the initial position of the UAV is ({mathbf{Q}}_text {I}=(-150,-150)) and the final position is ({mathbf{Q}}_text {F}=(150,-150)). And the horizontal positions of the ground sensor d and the IRS are ({mathbf{C}}_d=(0,50)) and ({mathbf{C}}_r=(0,0)), respectively. The altitude of the ground sensor d is (z_d=10)m. The altitude of IRS is (z_r=30)m. The time slot is set to be (delta _t=text {T}/text {N}=1)s. (beta _{du}=3.8,) (beta _{dr}=2.3,) and the reflecting element spacing of the IRS is set to be (d=lambda /2.) The maximal transmit power of ground sensor d is (text {P}_{max }=1)W. The average transmit power of ground sensor d is (text {P}_{text {avg}}=text {P}_{max }/2). The value of the threshold in the Joint Optimization Algorithm is (xi =0.001). The UAV’s maximum speed is (v_{max }=40)m/s, and the minimum flight speed of the UAV is (v_{min }=3)m/s. Other parameter settings are given in Table 1.

Fig. 2
figure 2

Convergence performance of Algorithm 1.

Full size image
Table 1 Parameter settings.
Full size table

Figure 2 shows the performance of convergence of algorithm 1. As seen in Fig. 2, the proposed algorithm can reach convergence after ten iterations. Fig. 2 also shows the relationship between the energy efficiency and the number of reflecting elements L. It is shown that the energy efficiency of the considered system increases with the value of L.

In Fig. 3, the UAV trajectory of the proposed scheme is compared with four schemes: (1) “EE-Max, without IRS”: In this scheme, we consider maximizing the energy efficiency without IRS. (2) “AR-Max”: The average transmission rate of the UAV system is maximized by optimizing the passive beamforming of IRS, UAV’s trajectory and transmit power. (3) “AR-Max, without IRS”: Maximizing the transmission rate without IRS. (4) “Line trajectory”: The energy efficiency maximized with straight line trajectory and fixed value of speed of the UAV. In Fig. 3, it is seen that the UAV’s optimal position is between the ground sensor and the IRS. When there is no IRS, the UAV’s optimal position is above the ground sensor.

Fig. 3
figure 3

Comparison of UAV trajectories for different schemes.

Full size image
Fig. 4
figure 4

UAV flight speed versus time slot for different schemes.

Full size image

Figure 4 depicts the UAV flight speed versus time slot for different schemes. The UAV in the “AR-Max” scheme and the “AR-Max, without IRS” scheme will fly to the optimal position with maximum speed, and then circle around at the optimal position with minimum speed. The speed of the UAV decreases gradually in “EE-Max, without IRS” scheme and our proposed scheme, and when the UAV reaches the optimal position, it flies with a fixed speed. This indicates there exists an optimal speed that minimizes the energy consumption.

Fig. 5
figure 5

Energy efficiency versus altitude of the UAV for different schemes.

Full size image
Fig. 6
figure 6

Energy efficiency versus flight time of the UAV for different schemes.

Full size image

Figure 5 shows the energy efficiency versus altitude of the UAV for different schemes. Compared to other schemes, the proposed scheme can obtain higher value of energy efficiency. By comparing the proposed scheme and “EE-Max, without IRS” scheme, it can be found that the assistance of IRS can enhance the energy efficiency. For example, when the altitude of the UAV is 300m, compared with the “EE-Max, without IRS” scheme, the energy efficiency of the proposed scheme is increased about 25%. Moreover, the proposed scheme and “EE-Max, without IRS” scheme can obtain higher system energy efficiency than “AR-Max” scheme and “AR-Max, without IRS” scheme. This is because both “AR-Max” scheme and “AR-Max, without IRS” scheme are optimized to maximize the transmission rate. And the value of energy efficiency in all considered schemes decreases with altitude of the UAV.

Figure 6 gives the energy efficiency versus flight time of the UAV for different schemes. In the “Line trajectory” scheme, the energy efficiency decreases with the flight time. The reason is that the speed of the UAV decreases with the UAV’s flight time, which results in an increase in the energy consumption. The energy efficiency for the other four schemes increases with the flight time of the UAV. Moreover, the energy efficiency of proposed scheme and “EE-Max, without IRS” scheme increases with the flight time at a faster rate. This is because the two schemes improve the energy efficiency via joint optimization of multiple system parameters.

Figure 7 compares the energy efficiency and energy consumption for different flight times in the “Line trajectory” scheme, where “EE” is the abbreviation for energy efficiency. Compared to “Line trajectory” scheme, the energy consumption of the proposed scheme is significantly reduced by optimizing the speed and trajectory of the UAV. The energy efficiency in the proposed scheme increases with the UAV flight time. The reason is that both the trajectory and speed of the UAV are optimized in the proposed scheme. Thus, the average power consumption of the UAV decreases with the UAV flight time.

Fig. 7
figure 7

The energy efficiency and energy consumption versus flight time of the UAV.

Full size image
Fig. 8
figure 8

Energy efficiency versus blocklength for various decoding error probabilities.

Full size image

Figure 8 plots the energy efficiency versus blocklength for various decoding error probabilities. We observe that the energy efficiency increases with blocklength. This is because in short packet communication, the larger the blocklength, the larger the maximum achievable communication rate, which leads to an increase in the energy efficiency. In addition, the energy efficiency of the system is more sensitive to changes in blocklength when the decoding error probability is smaller.

Conclusions

In this paper, the energy efficiency optimization problem for IRS-assisted UAV short packet communication is studied. We maximize the energy efficiency by jointly designing the transmit power, passive beamforming of IRS, UAV trajectory and speed. The successive convex approximation method and Dinkelbach method are used to solve the optimization problem. Based on the simulation results, we can find that the proposed scheme can achieve higher value of energy efficiency than the benchmark schemes. Compared with the scheme without IRS, it can be found that the application of IRS can improve the energy efficiency effectively.

Related Articles

Energy metabolism in health and diseases

Energy metabolism is indispensable for sustaining physiological functions in living organisms and assumes a pivotal role across physiological and pathological conditions. This review provides an extensive overview of advancements in energy metabolism research, elucidating critical pathways such as glycolysis, oxidative phosphorylation, fatty acid metabolism, and amino acid metabolism, along with their intricate regulatory mechanisms. The homeostatic balance of these processes is crucial; however, in pathological states such as neurodegenerative diseases, autoimmune disorders, and cancer, extensive metabolic reprogramming occurs, resulting in impaired glucose metabolism and mitochondrial dysfunction, which accelerate disease progression. Recent investigations into key regulatory pathways, including mechanistic target of rapamycin, sirtuins, and adenosine monophosphate-activated protein kinase, have considerably deepened our understanding of metabolic dysregulation and opened new avenues for therapeutic innovation. Emerging technologies, such as fluorescent probes, nano-biomaterials, and metabolomic analyses, promise substantial improvements in diagnostic precision. This review critically examines recent advancements and ongoing challenges in metabolism research, emphasizing its potential for precision diagnostics and personalized therapeutic interventions. Future studies should prioritize unraveling the regulatory mechanisms of energy metabolism and the dynamics of intercellular energy interactions. Integrating cutting-edge gene-editing technologies and multi-omics approaches, the development of multi-target pharmaceuticals in synergy with existing therapies such as immunotherapy and dietary interventions could enhance therapeutic efficacy. Personalized metabolic analysis is indispensable for crafting tailored treatment protocols, ultimately providing more accurate medical solutions for patients. This review aims to deepen the understanding and improve the application of energy metabolism to drive innovative diagnostic and therapeutic strategies.

Tissue macrophages: origin, heterogenity, biological functions, diseases and therapeutic targets

Macrophages are immune cells belonging to the mononuclear phagocyte system. They play crucial roles in immune defense, surveillance, and homeostasis. This review systematically discusses the types of hematopoietic progenitors that give rise to macrophages, including primitive hematopoietic progenitors, erythro-myeloid progenitors, and hematopoietic stem cells. These progenitors have distinct genetic backgrounds and developmental processes. Accordingly, macrophages exhibit complex and diverse functions in the body, including phagocytosis and clearance of cellular debris, antigen presentation, and immune response, regulation of inflammation and cytokine production, tissue remodeling and repair, and multi-level regulatory signaling pathways/crosstalk involved in homeostasis and physiology. Besides, tumor-associated macrophages are a key component of the TME, exhibiting both anti-tumor and pro-tumor properties. Furthermore, the functional status of macrophages is closely linked to the development of various diseases, including cancer, autoimmune disorders, cardiovascular disease, neurodegenerative diseases, metabolic conditions, and trauma. Targeting macrophages has emerged as a promising therapeutic strategy in these contexts. Clinical trials of macrophage-based targeted drugs, macrophage-based immunotherapies, and nanoparticle-based therapy were comprehensively summarized. Potential challenges and future directions in targeting macrophages have also been discussed. Overall, our review highlights the significance of this versatile immune cell in human health and disease, which is expected to inform future research and clinical practice.

Advancements in 2D layered material memristors: unleashing their potential beyond memory

The scalability of two-dimensional (2D) materials down to a single monolayer offers exciting prospects for high-speed, energy-efficient, scalable memristors. This review highlights the development of 2D material-based memristors and potential applications beyond memory, including neuromorphic, in-memory, in-sensor, and complex computing. This review also encompasses potential challenges and future opportunities for advancing these materials and technologies, underscoring the transformative impact of 2D memristors on versatile and sustainable electronic devices and systems.

Advance in peptide-based drug development: delivery platforms, therapeutics and vaccines

The successful approval of peptide-based drugs can be attributed to a collaborative effort across multiple disciplines. The integration of novel drug design and synthesis techniques, display library technology, delivery systems, bioengineering advancements, and artificial intelligence have significantly expedited the development of groundbreaking peptide-based drugs, effectively addressing the obstacles associated with their character, such as the rapid clearance and degradation, necessitating subcutaneous injection leading to increasing patient discomfort, and ultimately advancing translational research efforts. Peptides are presently employed in the management and diagnosis of a diverse array of medical conditions, such as diabetes mellitus, weight loss, oncology, and rare diseases, and are additionally garnering interest in facilitating targeted drug delivery platforms and the advancement of peptide-based vaccines. This paper provides an overview of the present market and clinical trial progress of peptide-based therapeutics, delivery platforms, and vaccines. It examines the key areas of research in peptide-based drug development through a literature analysis and emphasizes the structural modification principles of peptide-based drugs, as well as the recent advancements in screening, design, and delivery technologies. The accelerated advancement in the development of novel peptide-based therapeutics, including peptide-drug complexes, new peptide-based vaccines, and innovative peptide-based diagnostic reagents, has the potential to promote the era of precise customization of disease therapeutic schedule.

Probabilistic machine learning for battery health diagnostics and prognostics—review and perspectives

Diagnosing lithium-ion battery health and predicting future degradation is essential for driving design improvements in the laboratory and ensuring safe and reliable operation over a product’s expected lifetime. However, accurate battery health diagnostics and prognostics is challenging due to the unavoidable influence of cell-to-cell manufacturing variability and time-varying operating circumstances experienced in the field. Machine learning approaches informed by simulation, experiment, and field data show enormous promise to predict the evolution of battery health with use; however, until recently, the research community has focused on deterministic modeling methods, largely ignoring the cell-to-cell performance and aging variability inherent to all batteries. To truly make informed decisions regarding battery design in the lab or control strategies for the field, it is critical to characterize the uncertainty in a model’s predictions. After providing an overview of lithium-ion battery degradation, this paper reviews the current state-of-the-art probabilistic machine learning models for health diagnostics and prognostics. Details of the various methods, their advantages, and limitations are discussed in detail with a primary focus on probabilistic machine learning and uncertainty quantification. Last, future trends and opportunities for research and development are discussed.

Responses

Your email address will not be published. Required fields are marked *