Unmanned aerial vehicle (UAV) has been widely applied in internet-of-things (IoT) scenarios while the security for UAV communications remains a challenging problem due to the broadcast nature of the line-of-sight (LoS) wireless channels. This paper investigates the security problems for dual UAVassisted mobile edge computing (MEC) systems, where one UAV is invoked to help the ground terminal devices (TDs) to compute the offloaded tasks and the other one acts as a jammer to suppress the vicious eavesdroppers. In our framework, minimum secure computing capacity maximization problems are proposed for both the time division multiple access (TDMA) scheme and non-orthogonal multiple access (NOMA) scheme by jointly optimizing the communication resources, computation resources, and UAVs’ trajectories. The formulated problems are non-trivial and challenging to be solved due to the highly coupled variables. To tackle these problems, we first transform them into more tractable ones then a block coordinate descent based algorithm and a penalized block coordinate descent based algorithm are proposed to solve the problems for TDMA and NOMA schemes, respectively. Finally, numerical results show that the security computing capacity performance of the systems is enhanced by the proposed algorithms as compared with the benchmarks. Meanwhile, the NOMA scheme is superior to the TDMA scheme for security improvement.

With the high altitude and flexible mobility, unmanned aerial vehicle (UAV) assisted mobile edge computing (MEC) is becoming a promising technology to cope with the computation-intensive and latency-critical task in prospective Internet of Things. In this paper, we propose a novel MEC system with several ground servers at access points and one aerial server carried by UAV. To balance the vital metrics of the MEC system, computation bits and energy consumption, we aim to maximize the weighted computation efficiency of the system, subject to the constraints on communication and computation resources, minimum computation requirement and UAV’s mobility. To this end, a joint optimization problem with the goal of weighted computation efficiency maximization is formulated. First, we analyze the problem and transform it into an equivalent tractable form. Then, we solve the challenging non-convex problem by jointly optimizing the computation task assignment, time slot partition, transmission bandwidth and CPU frequency allocation, transmit power allocation, and UAV’s trajectory, based on the Dinkelbach’s method, Lagrange duality and successive convex approximation technique. Furthermore, we propose an alternative computation efficiency maximization algorithm, followed by the convergence and complexity analysis. Finally, numerical simulations show that our proposed algorithm significantly improves the computation efficiency compared to benchmark schemes. It is also validated that the proposed algorithm effectively obtains a good tradeoff between the computation task bits and energy consumption of the system.

In this article, we investigate the content distribution in the hotspot area, whose traffic is offloaded by the combination of the unmanned aerial vehicle (UAV) communication and edge caching. In cache-enabling UAV-assisted cellular networks, the network deployment and resource allocation are vital for quality of experience (QoE) of users with content distribution applications. We formulate a joint optimization problem of UAV deployment, caching placement and user association for maximizing QoE of users, which is evaluated by mean opinion score (MOS). To solve this challenging problem, we decompose the optimization problem into three sub-problems. Specifically, we propose a swap matching based UAV deployment algorithm, then obtain the near-optimal caching placement and user association by greedy algorithm and Lagrange dual, respectively. Finally, we propose a low complexity iterative algorithm for the joint UAV deployment, caching placement and user association optimization problem, which achieves good computational complexity-optimality tradeoff. Simulation results reveal that: i) the MOS of the proposed algorithm approaches that of the exhaustive search method and converges within several iterations; and ii) compared with the benchmark algorithms, the proposed algorithm achieves better performance in terms of MOS, content access delay and backhaul traffic offloading.

In post-disaster scenarios, it is challenging to provide reliable and flexible emergency communications, especially when the mobile infrastructure is seriously damaged. This article investigates the unmanned aerial vehicle (UAV)-based emergency communication networks, in which UAV is used as a mobile aerial base station for collecting information from ground users in affected areas. Due to the breakdown of ground power system after disasters, the available energy of affected user equipment (UE) is limited. Meanwhile, with the complex geographical conditions after disasters, there are obstacles affecting the flight of UAV. Aiming at maximizing the uplink throughput of UAV networks during the flying time, we formulate the UAV trajectory optimization problem considering UE energy limitation and location of obstacles. Since the constraint on UE energy is dynamic and long-term cumulative, it is hard to be solved directly. We transform the problem into a constrained Markov decision-making process (CMDP) with UAV as agent. To tackle the CMDP, we propose a safe-deep-Q-network (safe-DQN)-based UAV trajectory design algorithm, where the UAV learns to selects the optimal action in reasonable policy sets. Simulation results reveal that: 1) the uplink throughput of the proposed algorithm converges within multiple iterations and 2) compared with the benchmark algorithms, the proposed algorithm performs better in terms of uplink throughput and UE energy efficiency, achieving a good trade-off between UE energy consumption and uplink throughput.

The explosive computation demands in the Internet of Things (IoT) have triggered the research interests on unmanned aerial vehicle (UAV) assisted mobile-edge computing (MEC) systems even though there are still many challenges, such as computing delay requirement, multi-UAV cooperation, and resource management. This letter focuses on the computing delay issue in MEC systems assisted by multiple UAVs with the goal of task completion time minimization. In particular, both the partial offloading and binary offloading modes are considered by jointly optimizing time slot size, terminal devices scheduling, computation resource allocation, and UAVs’ trajectories. Particularly, an non-LoS channel model is adopted for UAV-ground communication. To handle the formulated problems, we develop alternating optimization algorithms by invoking the successive convex approximation method, Karush-Kuhn-Tucker conditions and penalized method. Numerical results show that the completion time is significantly decreased by the proposed algorithms.