论文标题

GJRA:IIOTS PEC无人机服务的全球联合资源分配计划

GJRA: A Global Joint Resource Allocation Scheme for UAV service of PEC in IIoTs

论文作者

Wang, Jin, Jin, Caiyan, Tang, Qiang, Xiong, Naixue

论文摘要

工业互联网(IIOT)是一种新兴的范式,可以通过将大量无线设备部署到行业场景中,使工业运营更加高效和聪明。但是,由于计算能力和电池的有限,工业互联网设备(IIOTD)无法很好地执行计算密集型或延迟敏感的任务,并在实用方面提供了长期服务。为了应对这些挑战,我们提出了一个有效的全球联合资源分配计划,用于无人驾驶飞机(UAV)在工业互联网(IIOTS)中为普遍性边缘计算(PEC)服务(IIOTS),并在本文中研究了一项协作的无人机服务器-Ioiotds计划。在我们提出的计划中,IITD可以通过将无人机作为PEC服务器和移动电源来提供高效性能,甚至可以保持高效的电池用完,以提供IIOTD的任务卸载和能源收集机会。考虑到卸载位置选择,设备资源分配和系统性能,我们旨在通过联合优化任务卸载决策,收费资源分配,连接管理和UAV计算资源分配,以最大程度地降低所有IIOTD的整体服务潜伏期。但是,公式的优化问题是混合成员非线性编程(MINLP)问题,通常可以解决问题。为了解决该问题,我们将其分解为基于区块坐标下降(BCD)方法的多个凸子问题,以获得最佳解决方案。绩效评估表明,根据IIOTD的整体服务延迟,我们的计划优于现有方案。

The Industrial Internet of Things (IIoT) is an emerging paradigm to make industrial operations more efficient and intelligent by deploying a massive number of wireless devices to industry scenes. However, due to the limited computing capability and batteries, the Industrial Internet of Things Devices (IIoTDs) can't perform the computation-intensive or delay-sensitive tasks well and provide long-term services in practical. To tackle these challenges, we present an effective global joint resource allocation scheme for Unmanned Aerial Vehicle (UAV) service of Pervasive Edge Computing (PEC) in Industrial Internet of Things (IIoTs) and studied a collaborative UAV server-IIoTDs scheme in this paper. In our proposed scheme, the IIoTDs can keep high-efficiency performance even their battery ran out, by deploying the UAV as a PEC server and a mobile power source to provide task offloading and energy harvesting opportunities for IIoTDs. In consideration of the offloading position selection, devices resource allocation and system performance, we aim to minimize the overall service latency of all IIoTDs consisting of task computation latency and offloading latency, by joint optimizing the task offloading decisions, charging resources allocation, connection management, and UAV computation resources allocation. However, the formulated optimization problem is a mixed-integer nonlinear programming (MINLP) problem which is challenging to solve in general. In order to address the problem, we decompose it into multiple convex sub-problems based on block-coordinate descent (BCD) method to obtain the optimal solution. Performance evaluation demonstrates that our scheme outperforms the existing schemes in terms of the overall service latency of IIoTDs.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源