4.8 Article

Multi-UAV-Enabled Mobile-Edge Computing for Time-Constrained IoT Applications

期刊

IEEE INTERNET OF THINGS JOURNAL
卷 8, 期 20, 页码 15553-15567

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JIOT.2021.3073208

关键词

Internet of Things; Task analysis; Edge computing; Resource management; Servers; Optimization; Delays; Internet of Things (IoT); resource allocation; timely edge computing; unmanned aerial vehicles (UAVs)

资金

  1. National Natural Science Foundation of China [61702426, 61971457]
  2. Innovation Support Program for Chongqing Overseas Returnees [cx2020122]
  3. Shenzhen Science and Technology Program [RCYX20200714114523079]
  4. NSF [ECCS-1923163]

向作者/读者索取更多资源

A novel design framework is proposed for a multi-UAV-enabled MEC system, aiming to maximize the number of served IoT devices. By jointly optimizing UAV trajectory and service indicator, resource allocation, and computation offloading, significant performance gains are achieved over baseline schemes.
Unmanned-aerial-vehicle (UAV)-enabled mobile-edge computing (MEC) has emerged as a promising paradigm to extend the coverage of computation service for Internet of Things (IoT) applications, which are usually time sensitive and computation intensive. In this article, a novel design framework is proposed for a multi-UAV-enabled MEC system, where edge servers are equipped on multiple UAVs to provide flexible computation assistance to IoT devices with hard deadlines. The aim is to maximize the number of served IoT devices through jointly optimizing UAV trajectory and service indicator as well as resource allocation and computation offloading, where the chosen IoT devices will complete their computation tasks on time under given energy budgets and co-channel interference is taken into account. We formulate the optimization problem as a mixed integer nonlinear programming (MINLP), which is challenging to solve directly. The problem is first reformulated to a more mathematically tractable form by adding a penalty term to the objective function. We then decouple the problem into two subproblems and develop an iterative algorithm by solving the two subproblems with alternating optimization and successive convex approximation techniques, where the proposed algorithm converges to a Karush-Kuhn-Tucker (KKT) solution. In addition, an efficient initialization scheme is proposed based on multiple traveling salesman problem with time windows (m-TSPTWs) method. Finally, simulation results are provided to demonstrate that the proposed joint design achieves significant performance gains over baseline schemes.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.8
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据