You are on page 1of 5

716 IEEE WIRELESS COMMUNICATIONS LETTERS, VOL. 9, NO.

5, MAY 2020

Reconfigurable Intelligent Surface Assisted UAV Communication:


Joint Trajectory Design and Passive Beamforming
Sixian Li, Bin Duo, Member, IEEE, Xiaojun Yuan , Senior Member, IEEE, Ying-Chang Liang , Fellow, IEEE,
and Marco Di Renzo, Fellow, IEEE

Abstract—Thanks to the line-of-sight (LoS) transmission and To improve the propagation environment and enhance com-
flexibility, unmanned aerial vehicles (UAVs) effectively improve munication quality, reconfigurable intelligent surface (RIS)
the throughput of wireless networks. Nevertheless, the LoS links has attracted extensive attention [4]–[6]. Generally, a RIS is
are prone to severe deterioration by complex propagation envi-
ronments, especially in urban areas. Reconfigurable intelligent
comprised of abundant reconfigurable reflecting elements that
surfaces (RISs), as a promising technique, can significantly are energy-efficient and cost-effective. Each element in the
improve the propagation environment and enhance communi- RIS can reflect the incident signal by inducing a manageable
cation quality by intelligently reflecting the received signals. phase shift. The phase shifts of all the elements can be jointly
Motivated by this, the joint UAV trajectory and RIS’s passive adjusted to achieve the phase alignment of the signals from dif-
beamforming design for a novel RIS-assisted UAV communica- ferent transmission paths at a desired receiver, also known as
tion system is investigated to maximize the average achievable
rate in this letter. To tackle the formulated non-convex problem,
passive beamforming, so as to increase the signal energy and
we divide it into two subproblems, namely, passive beamform- improve the achievable rate [7]. It is worth noting that unlike
ing and trajectory optimization. We first derive a closed-form the conventional amplify-and-forward relay, the RIS reflects
phase-shift solution for any given UAV trajectory to achieve the the arrived signals by its passive elements, which results in
phase alignment of the received signals from different trans- low energy consumption for the RIS. Besides, the RIS has no
mission paths. Then, with the optimal phase-shift solution, we transmitter module and the elements of the RIS are low-cost,
obtain a suboptimal trajectory solution by using the successive
convex approximation (SCA) method. Numerical results demon-
which reduces the implementation cost of the RIS. Another
strate that the proposed algorithm can considerably improve the advantage is that the RIS can easily work in full-duplex mode
average achievable rate of the system. without complex interference cancellation techniques.
Index Terms—UAV communication, trajectory design, recon-
Due to the complex urban environment, the LoS link
figurable intelligent surface, passive beamforming. between the UAV and the ground user may be blocked,
which severely degrades the channel quality. Considering the
promising RIS technique, we propose a RIS-assisted UAV
I. I NTRODUCTION communication system, where a mobile UAV communicates
with a ground user along its planned trajectory, and its trans-
ITH the rapid development of the fifth-generation (5G)
W wireless networks, unmanned aerial vehicles (UAVs)
are playing an increasingly significant role in improving spec-
mitted signal is reflected to the user via the RIS. Our goal is
to maximize the average achievable rate by jointly designing
UAV trajectory and passive beamforming subject to practi-
tral efficiency [1]. Owing to their high mobility, line-of-sight cal UAV mobility and the RIS’s phase-shift constraints. To
(LoS) transmission, and low cost, UAVs have been widely address the non-convexity of the considered problem, we first
used in various scenarios to enhance communication qual- align the user’s received signals from the UAV and the RIS
ity via jointly optimizing UAV trajectory and communication for maximizing the received signal power. Then, a closed-form
resource allocation, including the common throughput, average phase-shift solution can be obtained, and thus the formulated
secrecy rate, and energy efficiency maximization, etc. [2], [3]. problem is reduced to the optimization of the UAV trajec-
Manuscript received December 15, 2019; accepted January 8, 2020. Date
tory. By applying the successive convex approximation (SCA)
of publication January 14, 2020; date of current version May 8, 2020. This technique, we finally obtain a locally optimal solution for
work was supported in part by the National Key Research and Development the joint design problem. Simulation results demonstrate that
Program of China under Grant 2018YFB1801105 and in part by the Sichuan the proposed algorithm can significantly increase the average
Science and Technology Program under Grant 2018GZ0454. The associate
editor coordinating the review of this article and approving it for publication achievable rate, as compared to benchmark algorithms.
was D. Tarchi. (Corresponding author: Xiaojun Yuan.)
Sixian Li, Xiaojun Yuan, and Ying-Chang Liang are with the National II. S YSTEM M ODEL AND P ROBLEM F ORMULATION
Laboratory of Science and Technology on Communications, University of
Electronic Science and Technology of China, Chengdu 611731, China (e-mail: A. System Model
sxli@std.uestc.edu.cn; xjyuan@uestc.edu.cn; liangyc@ieee.org).
Bin Duo is with the National Laboratory of Science and Technology on In this letter, we consider a downlink transmission system
Communications, University of Electronic Science and Technology of China, consisting of a rotary-wing UAV,1 a ground user, and a RIS
Chengdu 611731, China, and also with the College of Information Science
and Technology, Chengdu University of Technology, Chengdu 610059, China 1 We assume that the UAV has no effect of UAV jittering and wind speed
(e-mail: duo_bin@163.com). uncertainty, i.e., the UAV has a perfectly stable flight [8], [9]. In addition, when
Marco Di Renzo is with the Laboratoire des Signaux et Systèmes, the rotary-wing UAV moves, the variations of its Euler angles are relatively
CNRS, CentraleSupélec, Université Paris-Sud, Université Paris-Saclay, small compared with the fixed-wing UAV. Thus, when the UAV flies higher
91192 Gif-sur-Yvette, France (e-mail: marco.direnzo@l2s.centralesupelec.fr). than the RIS, the probability of the LoS path to be blocked from the UAV to
Digital Object Identifier 10.1109/LWC.2020.2966705 the RIS is very small. Hence, the rotational effects is ignored in this letter.
2162-2345 
c 2020 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.
See https://www.ieee.org/publications/rights/index.html for more information.

Authorized licensed use limited to: J.R.D. Tata Memorial Library Indian Institute of Science Bengaluru. Downloaded on September 20,2022 at 07:03:52 UTC from IEEE Xplore. Restrictions apply.
LI et al.: RIS ASSISTED UAV COMMUNICATION: JOINT TRAJECTORY DESIGN AND PASSIVE BEAMFORMING 717

to the ground user (R-G link) can be modeled by a Rician


fading channel. Specially, the U-R and R-G links are collec-
tively called the U-R-G link. For clarity, unlike a uniform
rectangular array (URA) at the IRS, which can be regarded as
a specular reflector [10], we utilize a ULA at the RIS in this
letter. Therefore, the subsequent channel modeling are char-
acterized as the product channels [10]. The channel gain of
the U-G link in the nth time slot, denoted by hUG [n], can be
expressed as

−κ
hUG [n] = ρdUG [n] h̃, (2)

Fig. 1. A RIS-assisted UAV communication system. where ρ is the path loss at the reference distance D0 = 1 m [7],
κ is the corresponding
 path loss exponent related to the U-G
link, dUG [n] = zU 2 + ||q[n] − w ||2 denotes the distance
G
on a building. This system can be extended to more general between the UAV and the ground user in the nth time slot,
scenarios, e.g., in a crowded area for grand events, where and h̃ represents the random scattering component modeled by
the surrounding base stations are overloaded with heavy com- a zero-mean and unit-variance circularly symmetric complex
munication traffics. UAVs and RISs are deployed for traffic Gaussian (CSCG) random variable.
offloading, so as to enhance the communication quality of The channel gain of the U-R link in the nth time slot,
ground users. As shown in Fig. 1, all communication nodes denoted by h UR [n] ∈ CM ×1 , is given by
are placed in the three dimensional (3D) Cartesian coordinate   T
−2 2π dφ 2π(M −1)dφ
system. The ground user’s horizontal coordinate is denoted by h UR [n]= ρdUR [n] 1, e −j λ UR [n] , . . . , e −j λ UR [n] ,
    
wG = [xG , yG ]T . The UAV flies at a fixed altitude denoted by pathloss array response
zU for a finite time span T. For tractability, T is divided into (3)
N time slots, i.e., T = N δt , where δt is the slot length. As 
a result, the UAV’s horizontal trajectory can be approximated where dUR [n] = (zU − zR + ||q[n] − wR )2 the right- ||2 ,
by the sequence q[n] = [x [n], y[n]]T , n ∈ N = {1, . . . , N }, most term in (3) is the array response of an M-element
x −x [n]
which meets the following mobility constraints: ULA [11], φUR [n] = dR [n] represents the cosine of the
UR
angle of arrival (AoA) of the signal from the UAV to the ULA
q[n + 1] − q[n]2 ≤ D 2 , n = 1, . . . , N − 1, (1a) at the RIS in the nth time slot, d is the antenna separation,
q[N ] − qF 2 ≤ D 2 , q[1] = q0 , (1b) and λ is the carrier wavelength.
Similarly, the channel gain of the R-G link, denoted by
where q0 and qF denote UAV’s initial and final horizontal h RG ∈ CM ×1 , can be expressed as
locations, respectively, D = vmax δt is the maximum distance 

that the UAV can horizontally move within a single time slot, −α β 1
h RG = ρdRG h LoS
RG + h NLoS , (4)
and vmax is the maximum speed of the UAV.
   1+β β + 1 RG
We assume that the UAV and the user are equipped with path loss   
a single omni-directional antenna, while the RIS is equipped array response & small-scale fading
with a uniform linear array (ULA) of M reflecting elements 
where dRG = 2 + ||w − w ||2 , the summed terms
zR
and a controller intelligently adjusting the phase shift of each R G
element. The RIS is located in the x-z plane and parallels to the in (4) include the deterministic LoS component h LoS RG =
x-axis. Let Θ[n] = diag{e j θ1 [n] , e j θ2 [n] , . . . , e j θM [n] } be the 2π 2π
[1, e −j λ dφRG , . . . , e −j λ (M −1)dφRG ]T ∈ CM ×1 and the
diagonal phase-shift matrix for the RIS in the nth time slot, non-LoS (NLoS) component h NLoS M ×1 with the vari-
RG ∈ C
where θi [n] ∈ [0, 2π), i ∈ M = {1, . . . , M }, is the phase ables independently drawn from the CSCG distribution with
shift of the ith reflecting element in time slot n, and the phase −xR
zero mean and unit variance, φRG = xGdRG is the cosine
shifts {θi [n]} are assumed to be continuously controllable. of the angle of departure (AoD) of the signal from the ULA
Furthermore, the first element of the RIS is regarded as the at the RIS to the user, β is the Rician factor, and α is the
reference point whose altitude and horizontal coordinates are path loss exponent related to the R-G link. To facilitate the
denoted by zR and wR = [xR , yR ]T , respectively. Therefore,
subsequent discussions, the complex vector h RG can also be
the distance between the RIS and a certain communication
expressed as below,
node can be approximated by that between the reference point
T
and the corresponding node. h RG = |hRG,1 |e j ω1 , |hRG,2 |e j ω2 , . . . , |hRG,M |e j ωM , (5)
Since UAVs usually fly at high altitudes and RISs are com-
monly placed on the facade of a building, the link from the where |hRG,i | and ωi ∈ [0, 2π) are the magnitude and
UAV to the RIS (U-R link) is assumed to be a LoS channel. phase angle of the ith element of the complex vector h RG ,
Even if the LoS link from the UAV to the ground user (U- respectively. In this letter, we assume that the channel state
G link) is blocked, there still exist extensive scatters. Thus, information (CSI) can be obtained based on existing chan-
we assume the Rayleigh fading channel model for the U-G nel estimation techniques for RIS assisted channels, such as
link. Due to the additional LoS path, the link from the RIS in [12], [13].

Authorized licensed use limited to: J.R.D. Tata Memorial Library Indian Institute of Science Bengaluru. Downloaded on September 20,2022 at 07:03:52 UTC from IEEE Xplore. Restrictions apply.
718 IEEE WIRELESS COMMUNICATIONS LETTERS, VOL. 9, NO. 5, MAY 2020

With (2)-(4), the SNR of the ground user in the nth time Thus, we set θ1 [n] − ω1 = θ2 [n] − ω2 − 2π
λ d φUR [n] = · · · =
slot can be written as θM [n] − ωM − 2πλ d (M − 1)φ UR [n] = arg( h̃), or equivalently,
 2
 
P hUG [n] + h H
RG Θ[n]h UR [n]  2π
θi [n] = arg(h̃) + ωi + d (i − 1)φUR [n], ∀n, i , (11)
γUG [n] = , (6) λ
σ 2
which means that we can achieve the phase alignment of the
where P is the fixed transmit power of the UAV, and σ 2 is the signals at the user for any given UAV trajectory. As such,
noise variance. Thus, the achievable rate in bits/second/Hertz hHRG Θ[n]h UR [n] can be rewritten as
(bps/Hz) of the ground user in the nth time slot is given by
√ M
RUG [n] = log2 (1 + γUG [n]). (7) e j arg(h̃) ρ |hRG,i |
i=1
Accordingly, the average achievable rate over N time slots can hH
RG Θ[n]h UR [n] = . (12)
dUR [n]
be expressed as
Therefore, problem (9) can be reformulated as
1 
N    
1 
N
R̄ = RUG [n]. (8) P  A B 2
N max log2 1 + 2  +
n=1 Q N σ (dUG [n])κ/2 dUR [n] 
n=1
B. Problem Formulation s.t. (1), (13)
√ √ 
In this letter, our objective is to maximize the average where A = ρ|h̃|, and B = ρ M i=1 |hRG,i |.
achievable rate R̄ by jointly optimizing the UAV’s trajec-
tory Q  {q[n], n ∈ N } and the phase-shift matirx Φ  B. Optimization of Q
{Θ[n], n ∈ N } of the RIS over the entire N time slots, sub-
Problem (13) is still non-convex with respect to the
ject to UAV’s mobility and RIS’s phase-shift constraints. Thus,
UAV trajectory variables Q. To tackle the non-convexity of
the problem can be formulated as
problem (13), we introduce slack variables u = {u[n]}N n=1
max R̄ (9a) and v = {v [n]}N
n=1 , and consider the following problem:
Q,Φ   2 
1 
N  
s.t. 0 ≤ θi [n] < 2π, ∀n, i , A B
max log2 1 + γ0  +  (14a)
(1). (9b) Q,u,v N (u[n]) κ/2 v [n] 
n=1
Although the constraints in (1) and (9b) are convex, it is still s.t. dUG [n] ≤ u[n], ∀n (14b)
difficult to solve the problem in (9) optimally due to its non- dUR [n] ≤ v [n], ∀n
convex objective function with respect to Q and Φ. In Section (1), (14c)
III, we propose an efficient algorithm to obtain a suboptimal
solution to problem (9). where γ0 = P /σ 2 . Note that constraints (14b) and (14c) must
hold with equality at the optimal solution of problem (14),
III. P ROPOSED A LGORITHM since otherwise u[n] and v [n] can be increased to reduce the
objective value. Therefore, problems (13) and (14) have the
In this section, we divide problem (9) into two subprob-
same optimal solution. We next consider solving problem (14).
lems, i.e., the passive beamforming and the UAV trajectory
To this end, we introduce an important lemma as follows.
optimization, respectively. For the first subproblem, we align
Lemma 1: Given K1 > 0, K2 > 0 and K3 > 0, the function
the phases of the received signals from the U-G and U-R-
f (x , y) = log2 (1 + K 1 K2 K3
x κ + y 2 + x κ/2 y ) is convex with respect
G links at the user to maximize the received signal energy.
Then, a closed-form phase-shift solution for any given UAV to x > 0 and y > 0.
trajectory can be obtained. Consequently, problem (9) is trans- Proof: See the Appendix.
With Lemma 1, We see that the term RUG slack [n] = log [1 +
formed into the UAV trajectory optimization problem. Finally, 2
A B
γ0 | (u[n])κ/2 + v [n] | ] in (14a) is jointly convex with respect to
2
a locally optimal trajectory solution to the second subproblem
can be obtained by the SCA method. v[n] and u[n]. Note that the first-order Taylor approximation
of a convex function is a global under-estimator. Hence, the
first-order Taylor expansions of RUG slack [n], u 2 [n], v 2 [n] at the
A. Optimal Φ for Given Q
given points u0 = {u0 [n]}n=1 and v0 = {v0 [n]}N
N
n=1 can be
We first consider the optimization of Φ for any given Q.
respectively expressed as
RG Θ[n]h UR [n] can be written as
With (5), h H   
A2 B2 2AB
√ M
|hRG,i |e j (θi [n]−ωi −
2π d(i−1)φ
UR [n]) log2 1 + γ0 + +
ρ λ
(u[n])κ (v [n])2 (u[n])κ/2 (v [n])
i=1
hH
RG Θ[n]h UR [n] = .
dUR [n] B0 [n]
≥ log2 A0 [n] + (u[n] − u0 [n])
(10) A0 [n] ln 2
C0 [n]
If the signals from different paths are combined coherently + (v [n] − v0 [n]), (15)
at the user, the coherent signal construction can maximize the A0 [n] ln 2
received signal power, thereby maximizing the achievable rate. −u 2 [n] ≤ u02 [n] − 2u0 [n]u[n], (16)

Authorized licensed use limited to: J.R.D. Tata Memorial Library Indian Institute of Science Bengaluru. Downloaded on September 20,2022 at 07:03:52 UTC from IEEE Xplore. Restrictions apply.
LI et al.: RIS ASSISTED UAV COMMUNICATION: JOINT TRAJECTORY DESIGN AND PASSIVE BEAMFORMING 719

Algorithm 1 Proposed Algorithm for Solving (9)


1: Initialization: Set initial variables (Q0 , Φ0 , u0 , v0 ) and
iteration number k = 0. Set R̄0 by using (8) with given
(Q0 , Φ0 ).
2: repate
3: Set k ← k + 1;
4: Update (Qk , uk , vk ) by solving problem (18);
5: With given Qk , update Φk by using (11);
6: With given (Qk , Φk ), update R̄k by using (8).
R̄ −R̄k −1
7: until: k

< .
k

Fig. 2. UAV trajectories by different algorithms when T = 740 s.

−v 2 [n] ≤ v02 [n] − 2v0 [n]v [n], (17)


Among these benchmarks, “heuristic trajectory” means that
where
  the UAV first flies directly to the ground user at vmax , then
A2 B2 2AB hovers above the user as long as possible, and finally flies to
A0 [n] = 1 + γ0 + + ,
(u0 [n])κ (v0 [n])2 (u0 [n])κ/2 (v0 [n]) qF at vmax by the end of T. Naturally, the UAV trajectories
  of the HT/PB and HT/NPB algorithms are identical regardless
κA2 κAB
B0 [n] = −γ0 (κ+1)
+ , of passive beamforming. Thus, we use the same marker to
(u0 [n]) (v0 [n])(u0 [n])(κ/2+1) represent the trajectories of the two algorithms in Fig. 2. Note
and B0 [n] C0 [n]
that since A [n] and A [n] in (18a) contain small-scale
  0 ln 2 ln 2
0
2B 2 2AB fading terms h̃ and h NLoS
RG , their statistical average values are
C0 [n] = −γ0 + .
(v0 [n])3 (u0 [n])κ/2 (v0 [n])2 used to obtain an averaged trajectory in our simulations. The
remaining parameters are set as q0 = [ − 500, 20]T m, qF =
As such, problem (14) can be approximated as
[500, 20]T m, wG = [0, 70]T m, wR = [0, 0]T m, zU =
1  B0 [n]
N
C0 [n] 80 m, zR = 40 m, vmax = 25 m/s, δt = 1 s, M = 90,
max u[n] + v [n] (18a) σ 2 = −80 dBm, P = 0.01 W, d = λ2 , α = 2.8, κ = 3.5,
Q,u,v N A0 [n] ln 2 A0 [n] ln 2
n=1 β = 3 dB, ρ = −20 dB, and  = 10−4 .
s.t. (dUG [n])2 + (u0 [n])2 − 2u0 [n]u[n] ≤ 0, ∀n, (18b) Fig. 2 illustrates that the JT&PB algorithm is different from
(dUR [n])2 + (v0 [n])2 − 2v0 [n]v [n] ≤ 0, ∀n, all the benchmark algorithms from the perspective of UAV tra-
jectory. When there is sufficient time for the UAV, the UAV
(1). (18c)
will have the freedom to spend more time in hovering around
Problem (18) is a convex optimization problem, and thus can a certain location to improve the average achievable rate. As
be solved efficiently by standard solvers, such as the CVX. such, we set a sufficiently large T, e.g., T = 740 s, to observe
the variations of the trajectories optimized by all the algo-
C. Overall Algorithm rithms. As shown in Fig. 2, we observe that when T = 740 s,
the T/NPB, HT/PB, and HT/NPB algorithms find the same
According to the obtained solutions in the previous two
hovering location, namely, hovering above the ground user.
subproblems, the overall algorithm for solving problem (9)
Moreover, the more quickly the UAV approaches the hovering
is summarized in Algorithm 1, where  is used to control
location, the higher the average achievable rate. Hence, the
the accuracy of convergence. Following the results in [3],
trajectories of the three benchmark algorithms are identical.
we can guarantee that the average achievable rate by solv-
Note that the trajectory of our JT&PB algorithm is signifi-
ing problem (9) is non-decreasing over iterations. Besides, the
cantly different from those of the benchmark algorithms. The
complexity of the proposed algorithm is O(Kite N 3.5 ), where
reason is that the JT&PB algorithm can balance the channel
Kite indicates the total number of iterations.
gains between the U-G link and U-R-G link in each time slot
to choose a trajectory, so as to achieve the best communica-
IV. N UMERICAL R ESULTS tion quality. This is also the reason why the trajectory of the
In this section, we provide simulation results for demon- JT&PB algorithm is an arc path and its hovering location is
strating the validity of the proposed joint UAV trajectory and different from those of the benchmark algorithms. With the
RIS’s passive beamforming optimization algorithm (denoted help of Fig. 3, we also see that the JT&PB algorithm achieves
by JT&PB). The following benchmark algorithms are used a considerable performance improvement compared with all
for comparison: the benchmark algorithms.
• UAV trajectory design without passive beamforming Fig. 3 shows the average achievable rates by all the con-
(referred to as T/NPB). sidered algorithms versus T. Since with a large T the UAV
• Heuristic trajectory with passive beamforming (referred has sufficient time to transmit more information above its
to as HT/PB). hovering location, the average achievable rates of all the
• Heuristic trajectory without passive beamforming benchmark schemes increase with T. Moreover, the average
(referred to as HT/NPB). achievable rate of the proposed JT&PB algorithm significantly

Authorized licensed use limited to: J.R.D. Tata Memorial Library Indian Institute of Science Bengaluru. Downloaded on September 20,2022 at 07:03:52 UTC from IEEE Xplore. Restrictions apply.
720 IEEE WIRELESS COMMUNICATIONS LETTERS, VOL. 9, NO. 5, MAY 2020

 
∂2f 6K2 y −4 +2K3 x −κ/2 y −3
=
∂y 2 ln 2(1+K1 x −κ +K2 y −2 +K3 x −κ/2 y −1 )
(2K2 y −3 +K3 x −κ/2 y −2 )2
− , (22)
ln 2(1+K1 x −κ +K2 y −2 +K3 x −κ/2 y −1 )2
∂2f κ/2K3 x −κ/2−1 y −2
z =
∂x ∂y ln 2(1+K1 x −κ +K2 y −2 +K3 x −κ/2 y −1 )
(κK1 x −κ−1+(κ/2)K3 y −1 x −κ/2−1 )(2K2 y −3+K3 x −κ/2 y −2 )
− .
ln 2(1+K1 x −κ+K2 y −2+K3 x −κ/2 y −1 )2
(23)
Therefore, the Hessian of f (x, y) is
Fig. 3. Average achievable rate performance by different algorithms verus T.
⎡ 2 ⎤
∂ f ∂2f
∂x 2 ∂x ∂y
∇2 f = ⎣ ∂2f ∂2f
⎦. (24)
∂y∂x ∂y 2
exceeds that of the other algorithms. This demonstrates that the
∂ f 2 ∂ f ∂ f 2 2
∂ f ∂ f 2 2
joint optimization of UAV trajectory and passive beamforming Since ∂x 2 > 0 and ∂x 2 ∂y 2 − ∂x ∂y ∂y∂x > 0, the Hessian
achieves a substantial gain, as compared with the counterpart
matrix ∇2 f is positive definite. Thus, f (x, y) is a convex
approaches in which either UAV trajectory or passive beam-
function.
forming is optimized. Thus, the ground user can enjoy the
most benefit of the channel gains from both the UAV and the
RIS, thereby obtaining the largest average achievable rate. R EFERENCES
[1] L. Gupta, R. Jain, and G. Vaszkun, “Survey of important issues in UAV
communication networks,” IEEE Commun. Surveys Tuts., vol. 18, no. 2,
V. C ONCLUSION pp. 1123–1152, 2nd Quart., 2016.
In this letter, the RIS technique was applied to enhance [2] B. Duo, Q. Wu, X. Yuan, and R. Zhang, “Energy efficiency maximization
for full-duplex UAV secrecy communication.” [Online]. Available:
the power of the received signal, thus further improving the https://arxiv.org/abs/1906.07346.
achievable rate of the UAV-enabled communication system. [3] G. Zhang, Q. Wu, M. Cui, and R. Zhang, “Securing UAV communi-
To maximize the average achievable rate, we proposed a joint cations via joint trajectory and power control,” IEEE Trans. Wireless
Commun., vol. 18, no. 2, pp. 1376–1389, Feb. 2019.
UAV trajectory and RIS’s passive beamforming optimization [4] C. Huang, A. Zappone, G. C. Alexandropoulos, M. Debbah, and
algorithm for obtaining the high-quality suboptimal solution. C. Yuen, “Reconfigurable intelligent surfaces for energy efficiency in
Simulation results demonstrated that the assistance of the wireless communication,” IEEE Trans. Wireless Commun., vol. 18, no. 8,
RIS is beneficial to substantially improve the communication pp. 4157–4170, Aug. 2019.
[5] Q. Wu and R. Zhang, “Towards smart and reconfigurable environment:
quality of UAV-enabled networks. Intelligent reflecting surface aided wireless network,” IEEE Commun.
Mag., to be published.
[6] Y.-C. Liang, R. Long, Q. Zhang, J. Chen, H. V. Cheng, and H. Guo,
A PPENDIX “Large intelligent surface/antennas (LISA): Making reflective radios
P ROOF OF L EMMA 1 smart,” J. Commun. Inf. Netw., vol. 4, no. 2, pp. 40–50, Jun. 2019.
[7] Q. Wu and R. Zhang, “Intelligent reflecting surface enhanced wireless
Lemma 1 is proved by the definition of convex function. network via joint active and passive beamforming,” IEEE Trans. Wireless
First, the first-order partial derivatives of f (x, y) with respect Commun., vol. 18, no. 11, pp. 5394–5409, Nov. 2019.
to x and y are given by [8] F. Jiang and A. L. Swindlehurst, “Optimization of UAV heading for
the ground-to-air uplink,” IEEE J. Sel. Areas Commun., vol. 30, no. 5,
∂f −κK1 x −κ−1 − (κ/2)K3 y −1 x −κ/2−1 pp. 993–1005, Jun. 2012.
= , (19) [9] W. Feng, J. Wang, Y. Chen, X. Wang, N. Ge, and J. Lu, “UAV-
∂x ln 2(1 + K1 x −κ + K2 y −2 + K3 x −κ/2 y −1 ) aided MIMO communications for 5G Internet of Things,” IEEE Internet
−2K2 y −3 − K3 x −κ/2 y −2
Things J., vol. 6, no. 2, pp. 1731–1740, Apr. 2019.
∂f
= . (20) [10] E. Basar, M. Di Renzo, J. De Rosny, M. Debbah, M. Alouini, and
∂y ln 2(1 + K1 x −κ + K2 y −2 + K3 x −κ/2 y −1 ) R. Zhang, “Wireless communications through reconfigurable intelligent
surfaces,” IEEE Access, vol. 7, pp. 116753–116773, 2019.
Then, the second-order partial derivatives of f (x, y) are [11] D. Tse and P. Viswanath, Fundamentals of Wireless Communication.
Cambridge, U.K.: Cambridge Univ., 2005.
given by [12] Z.-Q. He and X. Yuan, “Cascaded channel estimation for large intelligent
 
metasurface assisted massive MIMO,” IEEE Wireless Commun. Lett., to
∂2f κ(κ+1)K1 x −κ−2 +(κ/2)(κ/2+1)K3 y −1 x −κ/2−2
= be published.
∂x 2 ln 2(1+K1 x −κ +K2 y −2 +K3 x −κ/2 y −1 ) [13] D. Mishra and H. Johansson, “Channel estimation and low-complexity
beamforming design for passive intelligent surface assisted MISO wire-
(κK1 x −κ−1 +(κ/2)K3 y −1 x −κ/2−1 )2
− , (21) less energy transfer,” in Proc. IEEE Int. Conf. Acoust. Speech Signal
ln 2(1+K1 x −κ +K2 y −2 +K3 x −κ/2 y −1 )2 Process. (ICASSP), May 2019, pp. 4659–4663.

Authorized licensed use limited to: J.R.D. Tata Memorial Library Indian Institute of Science Bengaluru. Downloaded on September 20,2022 at 07:03:52 UTC from IEEE Xplore. Restrictions apply.

You might also like