Drones 07 00688 v2
Drones 07 00688 v2
Article
Energy Minimization in Reconfigurable Intelligent
Surface-Assisted Unmanned Aerial Vehicle-Enabled Wireless
Powered Mobile Edge Computing Systems with Rate-Splitting
Multiple Access
Jihyung Kim 1 , Eunhye Hong 2 , Jaemin Jung 3 , Jinkyu Kang 3 and Seongah Jeong 2,∗
1 Spatial Wireless Transmission Research Section, Electronics and Telecommunications Research Institute,
Daejeon 34129, Republic of Korea; [email protected]
2 School of Electronics Engineering, Kyungpook National University, Daegu 41566, Republic of Korea;
[email protected]
3 Department of Information and Communication Engineering, Myongji University,
Seoul 17058, Republic of Korea; [email protected] (J.J.); [email protected] (J.K.)
* Correspondence: [email protected]; Tel.: +82-53-950-5538
the energy consumption of the UE during offloading and for harvesting the energy for
sustaining their operation.
Unmanned aerial vehicles (UAVs), e.g., drones, have been used as an edge server
for MEC systems, as the line-of-sight (LOS) link can be easily obtained by adjusting the
flying path via their free mobility in a three-dimensional (3D) space [8–10]. In particular,
UAV-mounted cloudlets can be deployed in the proximity of the desired offloading devices,
obtaining high-quality links, which accelerate to replenish the battery of the UE and
transmit the offloaded input and output in WP-MEC systems. However, when severe
channel attenuation or physical blockages, such as high-rise buildings and skyscrapers,
interfere with the LOS links between the UAV and UE, the performance of such systems
deteriorates. In such cases, reconfigurable intelligent surfaces (RISs) can be alternatively
used in various communication systems, such as millimeter wave [11], nonorthogonal
multiple access (NOMA) [12], and free-space optical (FSO) [13]. By controlling the large
number of low-cost reflecting elements of RISs in the vicinity of a transmitter or a receiver,
virtual links can be obtained to encourage the preferred signal propagation environment. To
this end, we aim at minimizing the energy consumption of WP-MEC systems by leveraging
RISs and UAVs.
Main Contributions
Herein, a novel framework of an RIS-assisted WP-MEC system with a UAV-mounted
cloudlet is proposed, which uses rate-splitting multiple access (RSMA) for offloading
multiple UEs. Under this framework, the resource allocation is jointly optimized in terms of
time, power, computing frequencies, and task load, along with the UAV’s trajectory and the
phase-shift matrix of the RIS. To the best of our knowledge, RSMA-based WP-MEC systems
that use UAVs or RISs are at their beginning stage of development, providing insights and
roadmaps for future intelligent drone communications. The detailed contributions of this
work are as follows:
• In order to effectively reduce the energy consumption of WP-MEC channels, we
consider a UAV-mounted cloudlet for obtaining the desired channel links by freely
and simultaneously moving the RIS between the UAV and the UE deployed for ob-
taining additional virtual links. In this system, the problem of minimizing the total
energy consumption is formulated over jointly optimizing the resource allocation
in terms of time, power, computing frequency, and task load, along with the UAV
trajectory and RIS phase-shift matrix. However, the coupling issues between optimiza-
tion variable designs make it challenging to find a globally optimal solution for the
formulated minimization problem. Therefore, an alternating optimization (AO)-based
algorithm is developed to converge a locally optimal solution, and its convergence
and computational complexity are analyzed.
• For wireless energy transfer (WET) and MEC, a new frame structure with four phases
is developed using the harvest-then-computing approach [4], such as the WET phase
and offloading phase—the latter comprising three phases for local computing and
uploading, computing at the UAV, and downloading the computing results.
• The superiority of the proposed WP-MEC system and algorithm is verified via simula-
tion and numerical analysis. Results reveal that the proposed algorithm can reduce
the energy consumption to approximately half of that of the benchmark schemes,
which is essential for systems with insufficient resources, such as short mission times
or a small number of RIS elements. To the best of our knowledge, the consideration
of both RISs and UAV-mounted cloudlets for WP-MEC systems is at its beginning
stage of development, and their performances are further improved by using the
RSMA technique.
The remainder of this paper is organized as follows. Section 2 describes the sys-
tem model. Section 3 presents the problem formulation and the proposed algorithm for
energy-efficient RIS-assisted WP-MEC systems using the UAV-mounted cloudlet. Section 4
discusses the numerical analysis results, and Section 5 concludes the paper.
Drones 2023, 7, 688 3 of 19
2. System Model
Herein, the current state-of-the-art WP-MEC systems are discussed, and the set-up of
the proposed model is discussed.
2.2. Set-Up
Figure 1 shows an RIS-assisted WP-MEC system with RSMA comprising a single-
antenna UAV-mounted cloudlet, an RIS attached to a high building surface, and K single-
antenna UE. Each piece of UE has a computational task to be processed within the mission
time T. All system entities are assumed to be synchronized. This assumption is justified
by correlating preambles regularly, as in the existing cellular system, or by periodically
handshaking and computing the time offsets and the round-trip delays, as in the existing
network time protocols [17] (The robust design against the time offset or imperfect channel
state information in asynchronous environments can be easily extended, e.g., by adopting
the norm-bounded uncertainty model [18] in the proposed design). To complete task
processing, the UE computes a portion of the task locally and offloads the remaining task
to the UAV-mounted cloudlet. For these operations, the UE is assumed to be equipped
with rechargeable batteries, and the energy from radio-frequency signals broadcast by the
Drones 2023, 7, 688 4 of 19
UAV is harvested. Here, RIS with M elements is installed to support energy harvesting and
offloading by generating an additional virtual link between the UE and the UAV. Moreover,
the RSMA method is applied in the uplink for the efficient multiple access of UE to transmit
the offloaded data. For tractability, the total task completion time, T seconds (s), is divided
into N equal time slots, each of which has a duration of τ = T/N in order to be small
enough. In other words, the UAV’s location can be regarded as remaining relatively stable
for each time slot. Each time slot is denoted by n ∈ N = {1, ..., N }.
To this end, each frame of the system is divided into four phases, illustrated in Figure 2,
using the harvest-then-computing technique [5]: (i) WET phase, (ii) local computing and
offloading (LO) phase, (iii) UAV’s computing phase, and (iv) the downloading phase
of the computation results. Specifically, in the WET phase, the UAVs broadcast energy
signals to all the UEs to recharge their batteries. Then, in the LO phase, the UE computes
the partial task via local computing and transmits the remaining offloaded tasks to the
UAV via the uplink RSMA. After receiving the offloaded tasks, the UAV computes them
in the computing phase and transmits the computation results via the downlink in the
downloading phase. The detailed operations and related signal models for each phase
are discussed in the following sections. As the UAV has high-performance processors and
higher transmit power than the UE, and the computation results are typically modest
in size, the time required for the computing and downloading phases of the UAV can
be negligible [5]. Thus, the durations of the WET and LO phases are µn τ and (1 − µn )τ,
respectively, where 0 ≤ µn ≤ 1.
The positions of all nodes of thesystem are modeled using a 3D coordinate system.
The UEs are located at pkE = xkE , ykE , 0 in the ground, and the UAV flies at a fixed height of
Drones 2023, 7, 688 5 of 19
H (m) at pU U U
n = xn , yn , H for each time slot n. The starting and final positions of the UAV
are pU U U U
1 = p I and p N = p F , respectively. To ensure that the UAV has a feasible trajectory,
the maximum speed of the UAV is set to Vmax (m/s), where
1 U
vn = p − pU
n−1 ≤ Vmax , ∀ n ∈ N − {1}. (1)
τ n
Based on a previous study [7], the flying energy consumption of the UAV is ex-
pressed as
f ς2
En (vn ) = τ ς 1 v3n + , ∀n ∈ N , (2)
vn
where ς 1 and ς 2 are the parameters related to the UAV’s weight, air density, wing area,
and wing span efficiency, among other factors [19]. The RIS at time slot n is located at
p R = x R , y R , z R . Accordingly, the Euclidean distances from the RIS to UAV, from the
UAV to UE k, and from the UE k to RIS at time slot n are given by dnRU = p R − pU n ,
UE U E ER E R
dk,n = pn − pk , and dk = pk − p , respectively. Each element of the RIS is repre-
sented as m ∈ M = {1, ..., M }, and the RIS phase-shift matrix at time slot n is defined as
Θn = diag e jθ1,n , ..., e jθ M,n , ∀n ∈ N , (3)
√
where j = −1 and θm,n ∈ [0, 2π ) is the phase shift for ∀m ∈ M and ∀n ∈ N .
All entities are assumed to have the known perfect channel state information (CSI).
However, the proposed design can be applied to an entity with an imperfect CSI, e.g.,
the norm-bounded error model [20]. The channels of RIS-to-UAV and UAV-to-UE links
are assumed to be dominated by the LOS paths [21] and spatially uncorrelated where the
elements in the RIS are linearly separated with a greater than half-wavelength element spac-
ing [22]. Therefore, the channel gain of the RIS-to-UAV links at time slot n is expressed as
s β T
2π ( M−1)d RU
RU 0 − j 2πd RU
λ φn , ..., e − j
h n pU n = 2 1, e λ φn
, ∀n ∈ N , (4)
dnRU
where β 0 is the path loss at the reference distance D0 = 1 m, d is the distance between the
reflecting elements, λ is the carrier wavelength, and φnRU = ( x R − xU RU
n ) /dn is the cosine of
the angle of departure (AoD) of the signal from the RIS to the UAV. The channel gains of
the UAV-to-UE links at time slot n are given by
v
u β
0
hUE
k,n pU
n =u
t ζ , ∀n ∈ N and ∀k ∈ K, (5)
UE
dk,n
where ζ is the path loss exponent of the UAV-to-UE link for the UE. The channels of the
UE-to-RIS links are assumed to follow spatially uncorrelated Rayleigh fading, which yields
the channel gain of the UE-to-RIS at time slot n, expressed as follows:
s T
β0 2π ( M−1)d ER
− j 2πd ER
λ φk , ..., e − j
hkER = ER e
1, e λ φk
ξ kER , ∀k ∈ K, (6)
dk
where e is the path loss exponent of the UE-to-RIS link for the UE, φkER = ( xkE − x R )/dkER is
the cosine of the AoD of the signal from the RIS to UE k, and ξ kER is a circularly symmetric
complex Gaussian (CSCG) random variable with zero mean and unit variance, which
models the random scattering component. Consequently, the effective uplink channel gain
from UE k to the UAV at time slot n can be represented as
H
RU
hk,n pU
n , Θ n = h UE
k,n p U
n + h n pU
n Θn hkER , ∀n ∈ N and ∀k ∈ K. (7)
Drones 2023, 7, 688 6 of 19
where η ∈ (0, 1] is the energy conversion efficiency. Note that the energy harvested at each
UE is supposed to be higher than that needed for its operation.
2 q
xk,n = ∑ Pl,n,j sk,n,s , ∀n ∈ N and ∀k ∈ K, (9)
s =1
where the transmit power of the subsignal sk,n,s at time slot n is represented as Pk,n,s . The
submessages of the UEs are divided based on the split proportion ak,n,s , and submessages
with higher proposition indices have a higher priority compared with other submessages,
which satisfies
Rk,n,1 pU I U I
n , Θn , Pk,n,1 : Rk,n,2 pn , Θn , Pk,n,2 = ak,n,1 : ak,n,2 , ∀n ∈ N and ∀k ∈ K. (10)
Using the predetermined proportion index for UE k, the submessages can be prioritized
based on their known proportional index information. The total received signal at time slot
n can be represented as follows:
K 2 q
I
yn = hk,n pU
n , Θ I
n ∑∑ Pk,n,s sk,n,s + n0 , ∀n ∈ N and ∀k ∈ K, (11)
k =1 s =1
where n0 is the additive white Gaussian noise at the UAV that satisfies CN (0, σ2 ). At the
UAV, all the subsignals are decoded using the successiveinterference cancellation (SIC)
technique, where the decoding order is denoted by πn = π1,n,1 , ..., πk,n,s , ..., πK,n,2 , with
πk,n,s ∈ {1, 2, ..., 2K } being the decoding order of the subsignal s of UE k at the nth time slot
Drones 2023, 7, 688 7 of 19
to be predetermined. Thus, the achievable uplink rate of the subsignal sk,n,s at time slot n is
given by
2
P h I p U , ΘI
k,n,s k,n n n
Rk,n,s pU I
n , Θn , Pk,n,s = B log2 1 + , (12)
2
I
n , Θn
I
∑πl.n.j >πk,n,s Pl,n,j hl,n pU + σ2
for ∀n ∈ N and ∀k ∈ K, where B is the system bandwidth and πl.n.j is the decoding order
of the subsignal j of UE l. The total achievable rate of UE k is
2
Rk,n Pk,n,s , pU
n , Θ I
n = ∑ Rk,n,s pU
n , Θ I
n , ∀n ∈ N , ∀k ∈ K and s ∈ {1, 2}. (13)
s =1
The energy consumption of UE k at time slot n for transferring the offloaded data is
calculated as
2
o
Ek,n ( Pk,n,s ) = (1 − µn )τ ∑ Pk,n,s , ∀n ∈ N and ∀k ∈ K. (14)
s =1
When the offloaded bits from UE k to the UAV is denoted as Lok,n , we have
Lok,n ≤ (1 − µn )τRk,n pU I
n , Θn , Pk,n,s , ∀n ∈ N and ∀k ∈ K. (15)
After offloading Lok,n bits, the remaining Lk,n − Lok,n bits need to be processed by
local computing at UE k. The number of CPU cycles per input bit required for UE k to
compute is Ck , and the number of CPU cycles required for UE k to compute locally at
time slot n is Ck ( Lk,n − Lok,n ). We adopt dynamic voltage and frequency scaling (DVFC)
q
by referring ot a previous study [1]. By adjusting the CPU frequency f k,n for the qth CPU
cycle, UE k can control the amount of energy used for executing the tasks locally, where
q high high
q ∈ {1, ..., Ck ( Lk,n − Lok,n )}, f k,n ∈ (0, f k ], and f k,n is the highest CPU frequency of UE k.
UE k has to complete local computing during (1 − µn )τ, i.e.,
Ck ( Lk,n − Lok,n )
1
∑ q
f k,n
≤ (1 − µn )τ, ∀n ∈ N and ∀k ∈ K, (16)
q =1
Ck ( Lk,n − Lo ) q
where ∑q=1 k,n
1/ f k,n is the total execution time of the local computing process at UE k.
The energy consumption of UE k at time slot n for local computing is therefore calculated as
Ck ( Lk,n − Lok,n ) 2
∑
l q q
Ek,n Lok,n , f k,n = κ f k,n , ∀n ∈ N and ∀k ∈ K, (17)
q =1
K
Enc ( Lok,n ) = ϕ ∑ Lok,n , ∀n ∈ N and ∀k ∈ K. (18)
k =1
The time required for UAV computing and downloading the offloading results is
assumed to be negligible due to the UAV’s high capability and the small output data size [5].
Drones 2023, 7, 688 8 of 19
N
∑ (EnE (µn , PnE ) + Enc ( Lok,n ) + En (vn )) + Ec ,
f
Etot (µ, P, L, v) = (19)
n =1
where µ , {µn }n∈N , P , { PnE , Pk,n,s }n∈N ,k∈K,s∈{1,2} , v , {vn }n∈N , L , { Lk,n , Lok,n }n∈N ,k∈K ,
EnE (µn , PnE ) = µn τPnE , and Ec denotes the energy consumed by the circuit and control at
the UAV and RIS, which is usually a fixed value that can be ignored. Thus, the energy
minimization problem is formulated as follows:
q high
0 ≤ f k,n ≤ f k , ∀n ∈ N and ∀k ∈ K, (20h)
PnE , Pk,n,s , Lk,n , Lok,n ≥ 0, ∀n ∈ N and ∀k ∈ K and s ∈ {1, 2}, (20i)
pU
1 = pU
I , pU
N = pU
F. (20j)
E I q
where pU , { pU n }n∈N ,Θ , { Θn , Θn }n∈N , and f , { f k,n }n∈N ,k ∈K . The constraint (20c)
is for the total bits to be calculated; (20d) bounds locally computed tasks such that they
do not exceed the maximum CPU frequency that can be processed during the LO phase;
(20e) is the energy harvesting constraint that the harvested energy has to be larger than
or equal to the total energy consumption of the UE; (20f) bounds the time allocation for
the WET and the LO phases; (20g) and (20i) are non-negative constraints of the RIS phase
shift, power allocation, and offloading task size; (20h) bounds the CPU frequency of UE k;
and (1) and (20j) guarantee the valid path of the UAV. As the objective function (20a) and
constraints (10), (15), (16) and (20e) are nonconvex, the problem (20) is nonconvex.
local CPU frequencies and obtain the remaining optimization variables of (20) using the
AO algorithm.
Lemma 1. Given the number of bits to be computed, the ideal local CPU frequencies of the UE
required to minimize the computing energy consumption are given as
C L − L o
o
Ck ( Lk,n − Lk,n ) k k,n
1 2 k,n
f k,n = f k,n = · · · = f k,n = , ∀n ∈ N and ∀k ∈ K. (21)
(1 − µ n ) τ
for ∀n ∈ N and ∀k ∈ K.
N
min
{P,L}
∑ EnE (µn , PnE ) + Enc ( Lok,n ) (23a)
n =1
s.t. (10), (15), (20c), (20d), (20i), (22c). (23b)
This problem is nonconvex due to the constraints (10) and (15). Using the constraint (10),
the constraint (15) is equivalently written as
ak,n,s Lok,n
≤ Rk,n pU
n , Θ I
P
n k,n,s ,
, ∀n ∈ N and ∀k ∈ K. (24)
(1 − µ n ) τ
Successive convex approximation (SCA) is used to handle this constraint [9,25], which
can approximately solve a nonconvex problem by converting it into a sequence of convex
subproblems. In this technique, the nonconvex objective function and constraints are re-
placed with suitable convex approximations, enabling iterative problem solution iterations.
Then, the right side of (24) can be written as
Drones 2023, 7, 688 10 of 19
Rk,n,s pU I
n , Θn , Pk,n,s
2
P h I p U , ΘI
k,n,s k,n n n
= B log2 1 +
2
I
I
∑πl.n.j >πk,n,s Pl,n,j hl,n pUn , Θ n + σ2
= B log2 ∑ I
Pl,n,j |hl,n ( pU I 2
n , Θn )| + σ
2
− B log2 ∑ I
Pl,n,j |hl,n ( pU I 2
n , Θn )| + σ
2
πl.n.j ≥πk,n,s πl.n.j >πk,n,s
∑ ∑
I (z)
≥ B log2 Pl,n,j |hl,n ( pU I 2
n , Θn )| + σ
2
− B log2 I
Pl,n,j |hl,n ( pU I 2
n , Θn )| + σ
2
πl.n.j ≥πk,n,s πl.n.j >πk,n,s
I ( pU , Θ I )|2 ( P (z)
∑πl.n.j >πk,n,s |hl,n n n l,n,j − Pl,n,j ) P
− (z)
, R̂k,n,s , (25)
I 2
∑πl.n.j >πk,n,s Pl,n,j |hl,n ( pn , Θn )| + σ log(2)
I U 2
(z)
where Pk,n,s is the local point at iteration z. Accordingly, the problem (22) can be trans-
formed as
N
min
{P,L} n=1
∑ (EnE (µn , PnE ) + Enc ( Lok,n )) (26a)
(26) is a convex problem that can be easily solved using the standard mathematical convex
optimization method or a toolbox such as CVX [25,26].
rewritten as
H M UE
β0
hk,n pU RU
n , Θn = hn pU
n Θn hkER =
ER e/2
∑ e jψm,k , (27)
dnRU
dk m =1
UE = θ 2π ER RU ER
where ψm,k m,n + λ d ( m − 1)( φk − φn ) + arg ( ξ k ). When the signals from dif-
ferent paths are combined coherently at the UE and UAV, the received signal power is
maximized. As hUE UE UE
k,n is a real value (7), if ψm,k = arg ( hk,n ) = 0, the achievable uplink rate
u H
Rk,n and the harvested energy Ek,n can be maximized. Accordingly, the optimal phase shift
of the RIS at time slot n can be expressed as follows:
2π
θm,n = d(m − 1)(φnRU − φkER ) , ∀n ∈ N and ∀m ∈ M. (28)
λ
Based on the phase design of the RIS in (28), the trajectory of the UAV needs to
be designed.
Drones 2023, 7, 688 11 of 19
Thus, the effective channel gain for UE k at time slot n can be rewritten as
v
u β
0 β0 M
hk,n pU
n =u
t ζ + RU ER e/2 , ∀n ∈ N and ∀k ∈ K. (29)
dUE dn dk
k,n
Using the proposed phase design Θ in (28), the subproblem for the UAV’s trajectory
design is expressed as
N
∑
f
min En (vn ) (30a)
pU ,v n =1
s.t. (1), (24), (20j), (22c). (30b)
As the objective function (30) and the constraints (22c), and (24) are nonconvex, the
SCA method is applied by introducing the slack variables ṽ = {ṽn }∀n , u = {uk,n }∀k,n ,
w = {wn }∀n , and t = {tk,n }∀k,n , which yield the following convex problem:
N
∑
f
min Ẽn (vn , ṽn ) (31a)
{ pU ,v,ṽ,u,w,t } n =1
s.t. (1), (20j), (A3) (31b)
tk,n ≤ ĥk,n , ∀n ∈ N and ∀k ∈ K (31c)
ak,n,s Lok,n
≤ R̂U
k,n,s ,∀n ∈ N and ∀k ∈ K and s ∈ {1, 2} (31d)
(1 − µ n ) τ
κCk3 ( Lk,i − Lok,i )3
!
n
∑ o
Ek,i ( Pk,n,s )+
(1 − µ i )2 τ 2
≤ ηµn τPnE ĥk,n , ∀n ∈ N and ∀k ∈ K.
i =1
(31e)
The derivations of (31) are detailed in Appendix A. Algorithm 1 is used to obtain the
solution of the problem (31), which can be readily solved using CVX (version 2.2) [25,26].
Due to its convexity, the solution to problem (32) can be readily obtained using CVX [25,26].
Drones 2023, 7, 688 12 of 19
180
160
140
120
100
80
60
40
20
0
2 4 6 8 10 12 14 16 18 20
Figure 3. Total energy consumption of the UAV obtained using the proposed Algorithm 2 versus the
number of iterations ( M = 16).
Therefore, the total complexity of the proposed algorithm is calculated as O( N2 N1 (KN )3.5 ),
where N2 is the number of iterations in Algorithm 2.
4. Numerical Results
The performance of Algorithm 2 to jointly optimize the local CPU frequency f , the
uplink and downlink power P, the bit allocation L, the UAV’s trajectory { pU , v}, the RIS’s
phase shift Θ, and the time ratio µ is investigated via numerical results. Throughout the
numerical results, we consider K = 2 UEs located at p1E = (−5, 5, 0) and p2E = (5, 5, 0)
and the RIS with M elements located at p R = (0, 1, 2). The UAV is supposed to fly from
pU U
I = (−10, 0, 5) to p F = (10, 0, 5). For simplicity, all UE is considered to have the same
amount of data to process. Unless otherwise specified, the remaining parameters for the
simulations are given in Table 1 by following [9,10].
For reference, the proposed method is compared with five benchmark schemes:
(i) no optimization of transmit power and bit allocation (No_pow&bit_alloc_opt), where
the trajectory pU of the UAV and the time ratio µ are obtained using the proposed algo-
rithm, and the equal allocation of transmit power and bit is considered for offloading per
interval; (ii) no optimization of the UAV’s trajectory (No_tra_opt) [4], where the time ratio
µ, transmit power P, and bit allocation L are optimized using the proposed algorithm,
and the UAV flies in a straight line from initial to final positions at a constant velocity;
(iii) no optimization of time ratio (No_time_ratio_opt), where the time ratio µk = 0.5 for
all k ∈ K is constant, and the UAV’s trajectory pU , transmit power P, and bit allocation L
are optimized using the proposed algorithm; (iv) the proposed algorithm without the RIS
(Proposed algorithm w/o RIS), where Algorithm 2 is applied to the case without the RIS
that has the only direct path of the UAV-to-UE communication link, and therefore, it does
not require the RIS’s phase-shift design; and (v) the proposed algorithm with orthogonal
multiple access (OMA) (Proposed algorithm w/ OMA), where the proposed Algorithm 2
is applied for the OMA case. Note that, in the OMA approach, only one message has to
Drones 2023, 7, 688 14 of 19
be communicated for each user; therefore, each user is assigned to 1/K time or frequency
resource to avoid any interference.
First, the convergence of the proposed algorithms is numerically investigated. Figure 3
shows the total energy consumption of the UAV versus the number of iterations obtained
by Algorithm 2 with different mission time T, where the number of RIS elements is M = 16.
Here, the iterations of the proposed algorithm are the outer iterations of Algorithm 2. The
proposed algorithm converges quickly in terms of the total energy consumption of the
UAV at about 10–14 steps. Moreover, it is observed that the number of iterations required
to converge increases with the number of optimized variables, e.g., by considering a large
number of slots with a large T.
Figure 4 shows the optimal trajectories of a UAV designed using the proposed algo-
rithm. In Figure 4, the UAV gets closer to the location between the UE and RIS to mitigate
the path loss between the UAV and UE, as well as that between the UAV and the RIS.
This is because the performances in terms of the harvested energy at the UE in the WET
phase and the achievable rate of the UE are inversely and exponentially proportional to
the interdistances from the UAV to the UE and to the RIS. However, in the case of a large
number of RIS elements, i.e., M = 1024, as the path loss of the UE–RIS–UAV link can be
sufficiently compensated by the optimized RIS phase shift Θ, the optimal UAV’s trajectory
can be identical to the benchmark scheme with no optimization of the UAV’s trajectory
(No_tra_opt).
4.5
3.5
2.5
1.5
0.5
0
-10 -5 0 5 10
Figure 4. Optimal trajectory of the UAV obtained using the proposed Algorithm 2 ( T = 40).
The impact of the mission time T on the total energy consumption of the UAV is
shown in Figure 5, with the number of RIS elements M = 16. It is noticed that the proposed
algorithm always outperforms the other benchmark schemes. In addition, the performance
of either No_tra_opt or No_time_ratio_opt is similar to that of the proposed algorithm
at a low mission time T. This is because the improvement in performance obtained by
optimizing either the UAV’s trajectory or time ratio becomes small due to stringent con-
straints at a low mission time T. In contrast, the energy consumption of the UAV for
Drones 2023, 7, 688 15 of 19
the benchmark scheme without the optimization of transmit power and bit allocation
(No_pow&bit_alloc_opt) approaches that of the proposed algorithm as the mission time T
increases. Thus, the significance of the optimal resource allocation is emphasized when the
resource for communication and computing, i.e., mission time T, is insufficient. Moreover,
as a less-achievable rate for transferring the offloaded data per time slot is required for
ensuring sufficient mission time, the performance gain of RSMA decreases compared with
that of OMA as the mission time T increases. Oppositely, the performance gap between the
cases with and without the RIS exists despite the joint optimization of the energy consump-
tion of the UAV. This can be explained by the reduction in the channel gain resulting from
the no-virtual-RIS link in the case without the RIS, which drastically reduced the achievable
rate and amount of energy harvested at the UE.
2000
1800
1600
1400
1200
1000
800
600
400
200
0
4 8 12 16 20 24 28 32 36 40
Figure 5. Total energy consumption of the UAV versus the mission time T (M = 16).
In Figure 6, the total energy consumption of the UAV is plotted versus the number of
RIS elements M at the mission time T = 25. Figure 6 shows that the energy consumption of
the UAV decreases with an increasing number of RIS elements, M, owing to the improved
channel gains that enable better performance of WET and an achievable rate. In particular,
the amount of energy harvested at the UE increases with the channel gain at a fixed transmit
power PnE at the UAV, as shown in (8). The desired channel links can also be elevated by
increasing the number of RIS elements M and by designing the flying path of the UAV to
move toward the UE or the RIS, as observed in Figure 4. It is also noticeable that, for a
small number of RIS elements M, the performance superiority of the proposed algorithm is
pronounced compared with other reference schemes. As mentioned above, it is observed
that the advantage of RSMA is pronounced for a small number of RIS elements, whereas
the advantage of RIS becomes prominent for a large number of RIS elements.
Drones 2023, 7, 688 16 of 19
900
850
800
750
700
650
600
550
500
450
8 16 32 64 128 256 512 1024
Figure 6. Total energy consumption of the UAV versus the number of RIS elements, M (T = 25).
5. Concluding Remarks
A novel RIS-assisted WP-MEC design framework with the aid of a UAV-mounted
cloudlet is proposed herein to minimize the total energy consumption of the UAV. By
adopting the UAV-mounted cloudlet in order to move freely, the desired channel links can
be established for improving the energy efficiency. Simultaneously, as the RIS between the
UAV and the UE is deployed, the channel gain can be enhanced thanks to the additional
virtual links. The uplink RSMA method is used for improving the spectral efficiency in the
offloading procedure of multiple UEs. For realizing WET and MEC, a new frame structure
comprising four phases is proposed, such as the (i) WET phase, (ii) local computing
and offloading (LO) phase, (iii) UAV’s computing phase, and (iv) downloading phase
of the computing results. For each phase, we provided detailed operations and related
signal models, based on which the energy minimization problem is formulated to jointly
optimize resource allocation along with UAV trajectory and the RIS phase-shift matrix.
Due to coupling issues between the designs of the optimization variables, an AO-based
algorithm is developed to converge to a locally optimal solution, and its convergence
and computational complexity are analyzed. Via simulation results, the superiority of the
proposed WP-MEC systems and algorithm are verified, and it is revealed that the proposed
algorithm reduces the energy consumption to about half of that of the benchmark schemes.
This performance gain of the proposed algorithm becomes prominent in the system with
insufficient resources, such as a short mission time or a small number of RIS elements.
To the best our knowledge, the consideration of both an RIS and UAV-mounted cloudlet
for the WP-MEC system has been at the beginning stage of development, and the system
performance can be further improved using the RSMA method. The proposed system and
algorithm can provide insights into the performances of various 6G system configurations
and applications with high computational complexity and low latency, such as extended
reality (XR) and remote diagnosis. As future works, the proposed WP-MEC systems can
Drones 2023, 7, 688 17 of 19
be extended to a robust design against time offset or imperfect channel state information in
asynchronous environments.
Author Contributions: Conceptualization, E.H. and S.J.; methodology, E.H. and S.J.; software, J.J.
and J.K. (Jinkyu Kang); validation, J.K. (Jihyoung Kim), J.K. (Jinkyu Kang) and S.J.; formal analysis,
J.K. (Jihyoung Kim) and J.J.; investigation, E.H.; resources, J.K. (Jihyoung Kim); data curation, J.J.;
writing—original draft preparation, E.H. and J.K. (Jihyoung Kim); writing—review and editing, J.K.
(Jihyoung Kim), J.K. (Jinkyu Kang) and S.J.; visualization, J.K. (Jinkyu Kang); supervision, S.J.; project
administration, J.K. (Jihyoung Kim); funding acquisition, J.K. (Jihyoung Kim) and S.J. All authors
have read and agreed to the published version of the manuscript.
Funding: This work was supported by the Electronics and Telecommunications Research Institute
(ETRI) funded by the Korean government [23ZH1100, Study on 3D Communication Technology for
Hyper-Connectivity]. This work was supported by a National Research Foundation of Korea (NRF)
grant funded by the Korean government (MSIT) (No. 2023R1A2C2005507) and an NRF grant funded
by the MSIT (No. 2021R1F1A1050734)..
Data Availability Statement: Data are contained within the article.
Conflicts of Interest: The authors declare no conflict of interest..
For applying the SCA technique [9,25], we adopt the first-order Taylor expansion at a
U (z)
local point pn , where z = 1, 2, ... is the iteration number of the SCA method. Accordingly,
the left-hand side of (A2) can be approximated as its linear lower bound, and an additional
constraint can be obtained as follows:
U (z) T U (z) 2
U (z) U (z)
τ 2 ṽ2n − 2 pn − pn−1 pU
n − p U
n −1 ≤ p n − p n −1 , ∀ n ∈ N . (A3)
To handle the nonconvexity of the constraints (22c) and (24), the slack variables uk,n
and wn are introduced for all k, n, which allows us to rewrite (30) as
f
min Ẽn (vn , ṽn ) (A4a)
{ pU ,v,ṽ,u,w}
where we have s
β0 β0 M
h̃k,n = ζ
+ e/2 , (A6)
(uk,n ) wn dkER
which is lower-bounded as
!
2 A2 B2 2AB
h̃k,n = ++
(wn )2 (uk,n )ζ/2 wn
(uk,n )ζ
(z) (z) (z) (z) (z)
≥ M1 − M2 uk,n − uk,n − M3 wn − wn
2
, ĥk,n , (A7)
(z) (z)
with uk,n and wn being the zth iterate of uk,n and wn in the SCA algorithm, respectively,
p β M
A = β 0 , B = ER0 e/2 ,
(dk )
(z) A2 B2 2AB
M1 = ζ + + , (A8)
(z) 2 (z) ζ/2 (z)
(z)
uk,n wn uk,n wn
(z) ζ A2 ζ AB
M2 = ζ +1 + (A9)
ζ/2+1
(z) (z) (z)
uk,n uk,n wn
(z) 2B2 2AB
and M3 = 3 + 2 . (A10)
ζ/2
(z) (z) (z)
wn uk,n wn
However, (A5) is neither convex nor concave with respect to uk,n and wn . To address
2
this issue, we introduce the slack variable t = {tk,n }∀k,n to satisfy tk,n ≤ ĥk,n and
R̃U
k,n,s ≥ B log2 ∑ Pl,n,j tl,n + σ2 − B log2 ∑ Pl,n,j tl,n + σ2
πl.n.j ≥πk,n,s πl.n.j >πk,n,s
∑ ∑
(z)
≥ B log2 Pl,n,j tl,n + σ2 − B log2 Pl,n,j tl,n + σ2
πl.n.j ≥πk,n,s πl.n.j >πk,n,s
(z)
∑πl.n.j >πk,n,s Pl,n,j (tl,n − tl,n )
− (z)
∑πl.n.j >πk,n,s Pl,n,j tl,n + σ2 log(2)
, R̂U
k,n,s . (A11)
Thus, we can finally have the convex optimization problem (31) for the UAV’s trajec-
tory design.
References
1. Mao, Y.; You, C.; Zhang, J.; Huang, K.; Letaief, K.B. A survey on mobile edge computing: The communication perspective. IEEE
Commun. Surv. Tutorials 2017, 19, 2322–2358. [CrossRef]
2. Huang, J.; Wang, M.; Wu, Y.; Chen, Y.; Shen, X. Distributed offloading in overlapping areas of mobile-edge computing for Internet
of Things. IEEE Internet Things J. 2022, 9, 13837–13847. [CrossRef]
3. Yazid, Y.; Ez-Zazi, I.; Guerrero-Gonzalez, A.; El Oualkadi, A.; Arioua, M. UAV-enabled mobile edge-computing for IoT based on
AI: A comprehensive review. Drones 2021, 5, 148. [CrossRef]
4. Bai, T.; Pan, C.; Ren, H.; Deng, Y.; Elkashlan, M.; Nallanathan, A. Resource allocation for intelligent reflecting surface aided
wireless powered mobile edge computing in OFDM systems. IEEE Trans. Wirel. Commun. 2021, 20, 5389–5407. [CrossRef]
Drones 2023, 7, 688 19 of 19
5. Wang, F.; Xu, J.; Wang, X.; Cui, S. Joint offloading and computing optimization in wireless powered mobile-edge computing
systems. IEEE Trans. Wirel. Commun. 2017, 17, 1784–1797. [CrossRef]
6. Wang, F.; Zhang, X. IRS/UAV-Based Edge-Computing/Traffic-Offloading Over RF-Powered 6G Mobile Wireless Networks. In
Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC), Austin, TX, USA, 10–13 April 2022;
pp. 1272–1277.
7. Hu, X.; Wong, K.K.; Zhang, Y. Wireless-powered edge computing with cooperative UAV: Task, time scheduling and trajectory
design. IEEE Trans. Wirel. Commun. 2020, 19, 8083–8098. [CrossRef]
8. Yoo, S.; Jeong, S.; Kang, J. Hybrid UAV-enabled Secure Offloading via Deep Reinforcement Learning. IEEE Wirel. Commun. Lett.
2023, 12, 972–976. [CrossRef]
9. Jeong, S.; Simeone, O.; Kang, J. Mobile edge computing via a UAV-mounted cloudlet: Optimization of bit allocation and path
planning. IEEE Trans. Veh. Technol. 2017, 67, 2049–2063. [CrossRef]
10. Jeong, S.; Simeone, O.; Kang, J. Mobile cloud computing with a UAV-mounted cloudlet: Optimal bit allocation for communication
and computation. IET Commun. 2017, 11, 969–974. [CrossRef]
11. Liu, Y.; Deng, H.; Peng, C. Channel Estimation for RIS-Assisted MIMO Systems in Millimeter Wave Communications. Sensors
2023, 23, 5516. [CrossRef]
12. Kumaravelu, V.B.; Imoize, A.L.; Soria, F.R.C.; Velmurugan, P.G.S.; Thiruvengadam, S.J.; Do, D.-T.; Murugadass, A. RIS-Assisted
Fixed NOMA: Outage Probability Analysis and Transmit Power Optimization. Future Internet 2023, 15, 249. [CrossRef]
13. Chapala, V.K.; Zafaruddin, S.M. Multiple RIS-Assisted Mixed FSO-RF Transmission Over Generalized Fading Channels. IEEE
Syst. J. 2023, 17, 3515–3526. [CrossRef]
14. Zhou, F.; Wu, Y.; Hu, R.Q.; Qian, Y. Computation rate maximization in UAV-enabled wireless-powered mobile-edge computing
systems. IEEE J. Sel. Areas Commun. 2018, 36, 1927–1941. [CrossRef]
15. Liu, Y.; Xiong, K.; Ni, Q.; Fan, P.; Letaief, K.B. UAV-assisted wireless powered cooperative mobile edge computing: Joint offloading,
CPU control, and trajectory optimization. IEEE Internet Things J. 2020, 7, 2777–2790. [CrossRef]
16. Zhou, F.;Wu, Y.; Sun, H.; Chu, Z. UAV-enabled mobile edge computing: Offloading optimization and trajectory design. In
Proceedings of the IEEE International Conference on Communications (ICC), Kansas City, MO, USA, 20–24 May 201; pp. 1–6.
17. Ghosh, A.; Zhang, J.; Andrews, J.G.; Muhamed, R. Fundamentals of LTE; Pearson United Kingdom: London, UK, 2010.
18. Shen, Y.; Dai, W.; Win, M.Z. Power Optimization for Network Localization. IEEE/ACM Trans. Netw. 2014, 22, 1337–1350. [CrossRef]
19. Hu, X.; Wong, K.K.; Yang, K.; Zheng, Z. UAV-assisted relaying and edge computing: Scheduling and trajectory optimization. IEEE
Trans. Wirel. Commun. 2019, 18, 4738–4752. [CrossRef]
20. Zhou, G.; Pan, C.; Ren, H.; Wang, K.; Nallanathan, A. A Framework of Robust Transmission Design for IRS-aided MISO
Communications with Imperfect Cascaded Channels. IEEE Trans. Signal Process. 2020, 68, 5092–5106. [CrossRef]
21. Wei, Z.; Cai, Y.; Sun, Z.; Ng, D.W.K.; Yuan, J.; Zhou, M.; Sun, L. Sum-rate maximization for IRS-assisted UAV OFDMA communi-
cation systems. IEEE Trans. Wirel. Commun. 2020, 20, 2530–2550. [CrossRef]
22. Li, Z.; Kundu, N.K.; Rao, J.; Shen, S.; McKay, M.R.; Murch, R. Performance analysis of RIS-assisted communications with element
grouping and spatial correlation. IEEE Wirel. Commun. Lett. 2023, 12, 630–634. [CrossRef]
23. Mao, Y.; Dizdar, O.; Clerckx, B.; Schober, R.; Popovski, P.; Poor, H.V. Rate-splitting multiple access: Fundamentals, survey, and
future research trends. IEEE Commun. Surv. Tutorials 2022, 24, 2073–2126. [CrossRef]
24. Katwe, M.; Singh, K.; Clerckx, B.; Li, C.P. Rate Splitting Multiple Access for Sum-Rate Maximization in IRS Aided Uplink
Communications. IEEE Trans. Wirel. Commun. 2022, 22, 2246–2261. [CrossRef]
25. Boyd, S.P.; Vandenberghe, L. Convex Optimization; Cambridge University Press: Cambridge, UK, 2004.
26. CVX: Matlab Software for Disciplined Convex Programming. Available online: http://cvxr.com/cvx/ (accessed on
4 September 2023).
27. Wu, Q.; Zhou, X.; Schober, R. IRS-assisted wireless powered NOMA: Do we really need different phase shifts in DL and UL? IEEE
Wirel. Commun. Lett. 2021, 10, 1493–1497. [CrossRef]
28. Zeng, P.; Wu, Q.; Qiao, D. Energy minimization for IRS-aided WPCNs with nonlinear energy harvesting model. IEEE Wirel.
Commun. Lett. 2021, 10, 2592–2596. [CrossRef]
29. Bertsekas, D.P. Nonlinear Programming. J. Oper. Res. Soc. 1997, 48, 334. [CrossRef]
30. Scutari, G.; Facchinei, F.; Lampariello, L. Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I:
Theory. IEEE Trans. Signal Process. 2017, 65, 1929–1944. [CrossRef]
31. Zhang, G.; Wu, Q.; Cui, M.; Zhang, R. Securing UAV communications via joint trajectory and power control. IEEE Trans. Wirel.
Commun. 2019, 18, 1376–1389. [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual
author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to
people or property resulting from any ideas, methods, instructions or products referred to in the content.