Secrecy Energy Efficiency Maximization for UAV-Enabled Mobile Relaying

07/12/2018 ∙ by Lin Xiao, et al. ∙ 0

This paper investigates the secrecy energy efficiency (SEE) maximization problem for unmanned aerial vehicle enabled mobile relaying system, where a high-mobility UAV is exploited to assist delivering the confidential information from a ground source to a legitimate ground destination with the direct link blocked, in the presence of a potential eavesdropper. We aim to maximize SEE of the UAV by jointly optimizing the communication scheduling, power allocation, and UAV trajectory over a finite time horizon. The formulated problem is a mixed-integer non-convex optimization problem that is challenging to be solved optimally. To make the problem tractable, we decompose the problem into three subproblems, and propose an efficient iterative algorithm that alternately optimizes the subproblems. In addition, two special cases are considered as benchmarks in this paper. Simulation results show that the proposed design significantly improves the SEE of the UAV, as compared to the benchmarks



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

I Introduction

Recently, due to the high mobility, on-demand deployment/placement and line-of-sight (LoS) link, unmanned aerial vehicle (UAV) has attracted significant research interests in wireless communications [1], such as for traffic offloading, aerial BSs, mobile relaying [2, 3, 4, 5, 6], information broadcasting and data collection [7, 8, 9, 10]

. Compared to the traditional terrestrial communications, UAV-enabled communications have more flexible mobility and potentially reduced cost. For one thing, UAV-enabled communication systems is especially suitable to be applied for on-demand coverage or unexpected events due to the swift and flexible deployment of UAV. For another, there is more likely to have line-of-sight (LoS) link between UAV-ground link, which can significantly improve link capacity. In addition, UAV-enabled communications provide a new degree of freedom for performance enhancement by trajectory design. Generally speaking, UAV-enabled communications can best suit the communication requirement by trajectory optimization, where the UAV is subject to practical mobility constraints, such as initial/final locations, maximum speed, and maximum acceleration. However, the limited on-board energy of a UAV is one of the biggest challenges in UAV-enabled communications since a UAV needs much additional propulsion energy to maintain aloft. As a result, the authors in

[11] obtained the analytical UAV’s energy consumption model for fixed-wing UAVAs, which was expressed as a function with respect to UAV’s speed and acceleration. Based on this, the work [6] studied the spectrum and energy efficiency maximization issues in a UAV-enable communication system, in which the UAV trajectory and transmit power are jointly optimized. In particular, the UAV’s trajectory is needed to be optimized to achieve a high-rate communication with the ground nodes, while the energy consumption of the UAV is expected to be lower as much as possible [12].

One particular promising use case for UAVs in wireless communications is UAV-enabled mobile relaying. Compared with traditional static relaying, UAV-enabled mobile relaying has many advantages. First, the UAV can adjust the location adaptively to suit the communication environment. Besides, the mobility of the mobile relaying offers new possibilities for on-demand communication and swift deployment/placement. In [5], the authors proposed a UAV-enabled mobile relaying system, where throughput maximization problem is considered via joint transmit power allocation and relay trajectory optimization.

On the other hand, for UAV-enabled wireless communication systems, how to ensure secure transmission of confidential information with the presence of intentional or unintentional eavesdropping is another important problem, due to the broadcast and shared nature of wireless channels. The secrecy rate is the main design metric in physical-layer security and has been investigated in many prior works (e.g., [13, 14, 15, 16, 17, 18],). In the existing literature on physical-layer security, one of the challenging problems is that the eavesdropper is generally passive so that it is difficult to obtain its channel state information (CSI). This motivates us to resolve the CSI of the potential eavesdropper by using UAV because the channel power gain can be easily obtained by obtaining the eavesdropper’s location, while the potential eavesdropper’s location can be detected by the UAV via a UAV-mounted camera or radar [19]. In [20], the physical layer security in UAV-enabled mobile relaying system was studied with the goal of the secrecy rate (SR) maximization, but it did not focus on the UAV trajectory optimization and ignore the communication link between the source and eavesdropper. Motivated by this, we propose a new physical layer security problem in UAV-enable mobile relaying system in this paper.

In this paper, we consider physical-layer security in UAV-enable mobile relaying system as shown in Fig. 1, where a UAV is employed to relay the information from a ground source node to a ground destination node in the presence of a potential eavesdropper. The direct link between the source and destination is assumed to be severely blocked. Our aim is to maximize the secrecy energy efficiency (SEE) of the UAV in the finite time horizon, via jointly optimizing the communication scheduling, the source/relay power allocation, and UAV’s trajectory over a finite time horizon so as to strike a tradeoff between the secrecy rate and the energy consumption of the UAV. In our proposed design, the UAV’s mobility is subject to the initial/final location as well as the maximum speed/acceleration constraint. We assume that the UAV adopts time-division duplexing (TDD) model and decode-and-forward (DF) relaying. The formulated problem for SEE maximization is a mixed integer non-convex maximization problem that is difficult to solve optimally. To tackle this problem, we propose an efficient iterative problem by applying successive convex approximation (SCA) and Dinkelbach’s algorithm to obtain a suboptimal solution. Numerical results validate our proposed joint design method, and also show that significant performance gain is achieved, as compared to the benchmarks.

Ii System Model and Problem Formulation

Fig. 1: Illustration of physical-layer security in a UAV-enabled mobile relaying system.

Ii-a System Model

As shown in Fig. 1, we consider a wireless communication system where a UAV is dispatched to assist information transmission form a source node (denoted by ) to a legitimate destination node (denoted by ) in the presence of an eavesdropper (denoted by ). The link between and is assumed to be severely blocked. Without loss of generality, a three-dimensional (3D) Cartesian coordinate system is considered. The nodes , and are located at the fixed locations on the ground, whose horizontal coordinates are denoted by , respectively. The UAV is assumed to fly at a fixed altitude meters from a given initial location to a final location within a finite time horizon . At any time instant , the time-varying coordinate of the UAV can be expressed as , and the corresponding horizontal coordinate is denoted as . As thus, the UAV’s velocity, acceleration at any time instant can be expressed as and respectively.

For ease of exposition, the time horizon is discretized into time slots with a sufficiently small and equal-spaced time interval , i.e. . For notational convenience, we let represent the time slot set. Therefore, the UAV’s trajectory within the time interval can be approximately represented by the sequence , where denotes the UAV location at time slot , with . Then, for any time slot , the distance from to the mobile relaying UAV and can be respectively denoted as:


Similarly, the distance from UAV to and can be respectively expressed as:


The initial and final locations of UAV can be expressed as and , respectively. Hence, we have


By using Taylor expansion, the UAV’s location, velocity and acceleration are related as [11]:


where . We further impose the constraint that the UAV should have the same velocity at the initial and final locations, and it is subjected to the maximum velocity and acceleration. These constraints can be expressed as follows:


We assume that the ground-to-UAV/UAV-to-ground link is dominated by the LoS link. Furthermore, the Doppler effect caused by the UAV’s mobility is assumed to be perfectly compensated [11, 5]. As a result, the channel power gain from to the UAV follows from the free space path loss model, which can be expressed as:


where denotes the channel power gain at the reference distance meter. Similarly, channel power gains from the UAV to and can be respectively expressed as:


Since the eavesdropper node and source node are located on the ground, The channel model between and is modeled to constitute both distance-dependent path loss and small-scale Rayleigh fading [21], which can be expressed as:


where is a constant determined by system parameters,

denote the exponentially distributed random variable with unit mean accounting for Rayleigh fading.

is the path loss exponent. Denote and as the transmit power of the source node and the UAV, respectively. Note that and need to satisfy the following constraints:


where and are given average power budgets at the source node and the UAV respectively.

Besides, we assume that the half-duplex relaying with TDD is adopted by the UAV. Thus, we introduce a binary variable

to express the communication scheduling, with , indicating that the UAV receives information from , while implying that the UAV transmits information to . Therefore, at time slot , the achievable rate from to the UAV can be expressed as:


where is the white Gaussian noise power at the UAV receiver, and denotes the reference received signal-to-noise ratio (SNR) at the reference distance meter. The achievable rate at time slot from to can be expressed as:


where . Similarly, the achievable rate from the mobile UAV to and in time slot can be respectively expressed as:


Therefore, based on the equation (II-A) and (II-A), the secrecy throughput from to the UAV over the time slots can be written as:


where . With (II-A) and (II-A), the secrecy throughput from the UAV to over the time slots can be expressed as:


We assume that the UAV adopts the DF relaying in the considered secure communications system, for which the UAV can only forward the secrecy information that has already been received from . As a result, at any time slot, the total information bits that has been forwarded by the UAV should be no more than the secrecy bits it received from . Hence, by assuming that the processing delay at the UAC is one slot, the following information-causality constraints needs to be satisfied:


In this paper, the communication-related energy consumption of the UAV such as signal processing is ignored as it is usually much smaller than the propulsion energy of the UAV [11]. Based on [11], an effective upper bound for the propulsion energy consumption of fixed-wing UAV with velocity and acceleration can be expressed as:


where and are two constant parameters related to aerodynamics, represents the gravitational acceleration. Moreover, denotes the change of kinetic energy of the UAV, whose value is only related to the UAV’s mass as well as the initial and final speeds. With the constraint (9), the kinetic energy of UAV is .

Ii-B Problem Formulation

In this paper, we consider the secrecy energy efficiency (SEE) issue for the UAV-enabled mobile relaying system. Our objective is to maximize the SEE by jointly optimizing the communication scheduling, transmit power and UAV trajectory. The problem can be mathematically formulated as:


where s are omitted since the objective function in (1) and right-hand side (RHS) of (22) must be non-negative at the optimal solution. Otherwise, the value of the objective function can be non-decreased by setting and without violating the constraints in (16) and (17).

Note that (1) is a mixed-integer non-convex problem. Firstly, the constraint (26) is non-convex, and the objective function is also non-concave and complex. Secondly, the constraint in (28) involves integer constraint. Therefore, the problem (1) is challenging to be solved optimally.

Iii Proposed Solution

In this section, A sub-optimal solution is proposed to deal with the original problem. Successive convex approximation (SCA) and Dinkelbach’s techniques are adopted to deal with the (1) problem, and an efficient iterative algorithm is proposed. Specifically, problem () is decomposed into three subproblems to optimize the communication scheduling variable and transmit power , as well as the UAV’s trajectory , respectively. A suboptimal solution can be obtained by alternately solving these three subproblems in an iterative manner until the algorithm converges.

Iii-a Subproblem1: Communication Scheduling Optimization

To make the original problem more tractable, we first consider the communication scheduling issue. The binary variables in constraint (28) are proposed to relax into continuous variables: i.e.,. Moreover, for any given transmit power and UAV’s trajectory , where denoting the iteration, the energy consumption of the UAV is constant. Therefore, problem () can be equivalently reformulated as:


Note that the constraints in (35) and (36) are linear with respect to for given transmit power and UAV trajectory. Hence, problem () is a convex optimization problem that can be efficiently solved by standard convex optimization tools such as CVX [22]

It is noted that in the optimal solution of the problem (), if the optimal communication scheduling variables are all binary, then the relaxation is tight and the obtained solution is a locally optimal solution of the problem ()[23]. Otherwise, we should reconstruct the communication scheduling solution for problem (). To tackle this issue, it is proposed to divided each time slot into sub-slots. Therefore, the total available time sub-slots is . Then, the numbers of sub-slots assigned for the communication link from to UAV and the link from UAV to in time slot are and respectively, where indicate the nearest integer of . In order to achieve the binary solution for the communication scheduling between the link and link , it is proposed to increase to guarantee approach an integer. For example, suppose the optimal scheduling variable in slot . Then, the time slot i can be divided into sub-slots, which makes . It permits the communication scheduling solution as a binary solution with zero relaxation gap. Therefore, the binary solution for the relaxation problem () can be easily reconstructed by adopting the subdivision time slot method.

Iii-B Subproblem2: Transmit Power Optimization

In this section, we investigate the transmit power optimization issue for the original problem. Considering the iteration, suppose the communication scheduling solution and UAV’s trajectory are given. Then, the problem () can be reformulated as:


where , and . Note that the problem () is non-convex as the objective function is non-concave and the casusality constraints in (39) is non-convex. To tackle this issue, convex approximation method is adopted. By introducing slack variables , we obtain the following problem:


Specifically, it can be verified that there always exist one optimal solution to problem () satisfying the constraints in (43) with equalities. Otherwise, we can always decrease without decreasing the objective function value. Therefore, problem () is equivalent to problem ().

Note that problem () is still a non-convex problem due to the non-concave objective functions as well as the non-convex constraint in (42). To deal with the non-convexity, SCA technique is applied to obtain an approximate solution. In particular, for the term of in the objective function of (), it is concave with respect to . Thus, its first-order Taylor expansion at the given local point

is a global over-estimator, i.e.,


Similarly, for the concave term of in the RHS of the constraint (42), by the given point , it can be upper-bounded as:


Adopting (44) and (45) to reformulated the problem (), it can be approximated as the following problem, which can be presented as:


Note that the problem () is convex problem, which can be efficiently solved by standard convex optimization tools such as CVX. Moreover, the first-order Taylor expansion in (44) suggests that the objective values of () and () are equal only at , and problem () maximizes the lower bound of the objective function of problem (), the objective value of () with the solution achieved by solving problem () is always no smaller than that with the given point .

Iii-C Subproblem 3: Trajectory Optimization

In this section, we consider UAV trajectory optimization issue of the original problem () with the fixed communication scheduling and transmit power at the -th iteration. This subproblem is formulated as:

Note that this subproblem is challenging to solve optimally due to the non-convexity of the objective function of () and the information-causality constraints in (26) with respect to the trajectory . As a result, we propose an approximate solution by applying SCA method and Dinkelbach’s algorithm. First, by introducing slack variables , , , , and , the problem () can be reformulated as:


It can be verified that at the optimal solution of problem (), the constraints (47),(48),(51-53) should hold with equalities. This is due to that: can be decreased to improve the objective value; can be increased to improve the objective value; can be decreased to achieve a larger upper bound of the objective function, and can be increased to achieve a larger lower upper bound of the objective function, which lead to the non-decreasing of the objective value. Therefore, problems () and () are equivalent. Note that the problem () is a non-convex problem since the constraints (48),(51-53) are non-convex. Next, we focus on solving the non-convexity of problem ().

As for the constraint in (48), the term is convex with respect to . Hence, we can obtain its lower bound function via its first-order Taylor expansion at any given point , which is a global under-estimator [22],[4], i.e.,


Similarly, for the RHS of the constraints in (51) and (52), they are convex functions of and , respectively. Thus, based on the Taylor approximation method, we can obtain their lower bound functions by given any point and , respectively, i.e.,




Note that the information-causality constraint in (53) is non-convex. To make it feasible for convex optimization, SCA method is applied. Note that the term of in (53) is a convex function with respect to , which can be lower bound at any given point as follows:




Therefore, with (55),(56),(57) and (60), problem () is reformulated as:


Note that all constraints of problem () are convex, and the objective function of () consists of a concave numerator and a convex denominator, which motives us to employ the Dinkelbach’s algorithm to efficiently solve this fractional programming problem [11, 4]. In addition, the problem () actually maximizes the lower bound of the objective function, as a result, the obtained solution by solving () should be non-decreasing over iterations.

Iii-D Overall Algorithm

Algorithm 1: Proposed solution for solving problem ()
1: Initialize , slack variables
, accuracy , Let ;
2: Repeat:
3: Solve problem () for the given
, denote the optimal solution as