arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2008.00199cs.NIcs.AIeess.SP
收藏

雾辅助IoT系统中的绿色卸载:集成学习和控制的在线视角

Green Offloading in Fog-Assisted IoT Systems: An Online Perspective Integrating Learning and Control

School of Information Science and Technology, ShanghaiTech University(上海科技大学信息科学与技术学院)

Xin Gao, Xi Huang, Ziyu Shao, Yang Yang

摘要:

在雾辅助物联网系统中,通常的做法是将任务从物联网设备卸载到其附近的雾节点,以减少任务处理延迟和能耗。然而,在线节能方案的设计仍然是一个开放的问题,因为各种不确定性的系统动力学,如处理能力和传输速率。此外,决策过程受到雾节点和物联网设备资源限制的约束,使设计更加复杂。在本文中,我们制定这样的任务卸载问题与未知的系统动力学作为一个组合的多臂强盗(CMAB)问题的长期约束的时间平均能耗。通过在线学习和在线控制的有效结合,我们提出了一个\textit{Learning-Aided Green Offloading}(LAGO)计划。在LAGO中,我们采用强盗学习方法来处理开发探索权衡,并利用虚拟队列技术来处理长期约束。我们的理论分析表明,LAGO可以减少平均任务延迟与一个可调的次线性遗憾界在有限的时间范围内,并满足长期的时间平均能量约束。我们进行了大量的模拟来验证这些理论结果。

英文摘要:

In fog-assisted IoT systems, it is a common practice to offload tasks from IoT devices to their nearby fog nodes to reduce task processing latencies and energy consumptions. However, the design of online energy-efficient scheme is still an open problem because of various uncertainties in system dynamics such as processing capacities and transmission rates. Moreover, the decision-making process is constrained by resource limits on fog nodes and IoT devices, making the design even more complicated. In this paper, we formulate such a task offloading problem with unknown system dynamics as a combinatorial multi-armed bandit (CMAB) problem with long-term constraints on time-averaged energy consumptions. Through an effective integration of online learning and online control, we propose a \textit{Learning-Aided Green Offloading} (LAGO) scheme. In LAGO, we employ bandit learning methods to handle the exploitation-exploration tradeoff and utilize virtual queue techniques to deal with the long-term constraints. Our theoretical analysis shows that LAGO can reduce the average task latency with a tunable sublinear regret bound over a finite time horizon and satisfy the long-term time-averaged energy constraints. We conduct extensive simulations to verify such theoretical results.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑