期刊
IEEE TRANSACTIONS ON INTELLIGENT VEHICLES
卷 8, 期 5, 页码 3444-3457出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIV.2022.3227367
关键词
Task analysis; Autonomous aerial vehicles; Optimization; Security; Trajectory; Servers; Wireless communication; UAV communication; mobile-edge computing; physical layer security; artificial noise
The MEC-aided-UAV system combines UAVs and MEC to provide flexible and low-latency computing services for pervasive sensing. The optimization issue of offloading tasks to ground base station servers is addressed to ensure the safety of confidential data. A low-complexity iterative algorithm is proposed to solve the non-convex problem and achieve a suboptimal solution.
The promise of unmanned aerial vehicles (UAVs) combined with the mobile edge computing (MEC), named MEC-aided-UAV extends the MEC application to offer new flexible, low-latency computing services and considerable utilities for pervasive sensing of the world. In MEC, the UAV with limited on-board energy and computation resources needs to offload its tasks to resource-rich ground base stations (GBSs) servers. Because of the broadcast nature of line-of-sight (LoS) channels, one of the key challenges in task offloading is to guarantee that confidential data is offloaded safely to the GBSs without being intercepted by eavesdroppers (Eves). In this MEC-aided-UAV system, the GBSs help the UAV compute the offloaded tasks and transmit the artificial noise (AN) to suppress the vicious Eves. We make the first attempt to study the maximum-minimum average secrecy capacity problem, including joint optimization of the trajectory and transmit power of the UAV, the transmit power of AN, the local computation ratio, and the selection of GBSs with consideration of the practical constraints of completion delay of the tasks, maximum velocity, and the power consumption. The optimization issue is confirmed as a mixed-integer non-convex problem. Thereafter, a low-complexity iterative algorithm with the block coordinate descent method and successive convex approximation technique is put forward to get its suboptimal solution. In addition, the convergent solution can be achieved by solving the subproblems in turn. Evaluation results validate that the proposed secure offloading scheme significantly effectiveness the baselines by 17.4%-71.2% on the maximum-minimum average secrecy capacity.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据