An online energy-saving offloading algorithm in mobile edge computing with Lyapunov optimization

IF 4.4 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Ad Hoc Networks Pub Date : 2024-06-18 DOI:10.1016/j.adhoc.2024.103580
Xiaoyan Zhao, Ming Li, Peiyan Yuan
{"title":"An online energy-saving offloading algorithm in mobile edge computing with Lyapunov optimization","authors":"Xiaoyan Zhao,&nbsp;Ming Li,&nbsp;Peiyan Yuan","doi":"10.1016/j.adhoc.2024.103580","DOIUrl":null,"url":null,"abstract":"<div><p>Online computing offloading is an effective method to enhance the performance of mobile edge computing (MEC). However, existing research ignores the impact of system stability and device priority on system performance during task processing.To address the problem of computing offloading for computing-intensive tasks, an online partial offloading algorithm combining task queue length and energy consumption is proposed without any prior information. Firstly, a queue model of IoT devices is created to describe their workload backlogs and reflect the system stability. Then, using Lyapunov optimization, computing offloading problem is decoupled into two sub-problems by calculating the optimal CPU computing rate and device priority, which can determine the task offloading amount and offloading location to complete resource allocation. Finally, the online partial offloading algorithm based on devices priority is solved by minimizing the value of the drift-plus-penalty function’s upper bound to ensure system stability and reduce energy consumption. Theoretical analysis and the outcomes of numerous experiments demonstrate the effectiveness of the proposed algorithm in minimizing system energy consumption while adhering to system constraints, even in dealing with dynamically varying task arrival rates.</p></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.4000,"publicationDate":"2024-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ad Hoc Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1570870524001914","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Online computing offloading is an effective method to enhance the performance of mobile edge computing (MEC). However, existing research ignores the impact of system stability and device priority on system performance during task processing.To address the problem of computing offloading for computing-intensive tasks, an online partial offloading algorithm combining task queue length and energy consumption is proposed without any prior information. Firstly, a queue model of IoT devices is created to describe their workload backlogs and reflect the system stability. Then, using Lyapunov optimization, computing offloading problem is decoupled into two sub-problems by calculating the optimal CPU computing rate and device priority, which can determine the task offloading amount and offloading location to complete resource allocation. Finally, the online partial offloading algorithm based on devices priority is solved by minimizing the value of the drift-plus-penalty function’s upper bound to ensure system stability and reduce energy consumption. Theoretical analysis and the outcomes of numerous experiments demonstrate the effectiveness of the proposed algorithm in minimizing system energy consumption while adhering to system constraints, even in dealing with dynamically varying task arrival rates.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
采用 Lyapunov 优化的移动边缘计算在线节能卸载算法
在线计算卸载是提高移动边缘计算(MEC)性能的有效方法。为解决计算密集型任务的计算卸载问题,本文提出了一种结合任务队列长度和能耗的在线部分卸载算法,无需任何先验信息。首先,创建一个物联网设备队列模型,以描述其工作负载积压情况并反映系统稳定性。然后,利用李雅普诺夫优化法,通过计算最优 CPU 运算速率和设备优先级,将计算卸载问题解耦为两个子问题,从而确定任务卸载量和卸载位置,完成资源分配。最后,通过最小化漂移加惩罚函数的上限值来求解基于设备优先级的在线部分卸载算法,以确保系统稳定性并降低能耗。理论分析和大量实验结果表明,即使在处理动态变化的任务到达率时,所提出的算法也能有效降低系统能耗,同时遵守系统约束。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Ad Hoc Networks
Ad Hoc Networks 工程技术-电信学
CiteScore
10.20
自引率
4.20%
发文量
131
审稿时长
4.8 months
期刊介绍: The Ad Hoc Networks is an international and archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in ad hoc and sensor networking areas. The Ad Hoc Networks considers original, high quality and unpublished contributions addressing all aspects of ad hoc and sensor networks. Specific areas of interest include, but are not limited to: Mobile and Wireless Ad Hoc Networks Sensor Networks Wireless Local and Personal Area Networks Home Networks Ad Hoc Networks of Autonomous Intelligent Systems Novel Architectures for Ad Hoc and Sensor Networks Self-organizing Network Architectures and Protocols Transport Layer Protocols Routing protocols (unicast, multicast, geocast, etc.) Media Access Control Techniques Error Control Schemes Power-Aware, Low-Power and Energy-Efficient Designs Synchronization and Scheduling Issues Mobility Management Mobility-Tolerant Communication Protocols Location Tracking and Location-based Services Resource and Information Management Security and Fault-Tolerance Issues Hardware and Software Platforms, Systems, and Testbeds Experimental and Prototype Results Quality-of-Service Issues Cross-Layer Interactions Scalability Issues Performance Analysis and Simulation of Protocols.
期刊最新文献
TAVA: Traceable anonymity-self-controllable V2X Authentication over dynamic multiple charging-service providers RL-based mobile edge computing scheme for high reliability low latency services in UAV-aided IIoT networks Editorial Board PLLM-CS: Pre-trained Large Language Model (LLM) for cyber threat detection in satellite networks A two-context-aware approach for navigation: A case study for vehicular route recommendation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1