Information Age-Based Task Splitting Scheme for Edge Computing-Enabled Networks

IF 5.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Wireless Communications Letters Pub Date : 2024-11-15 DOI:10.1109/LWC.2024.3492095
Jinwoong Kim;Jemin Lee
{"title":"Information Age-Based Task Splitting Scheme for Edge Computing-Enabled Networks","authors":"Jinwoong Kim;Jemin Lee","doi":"10.1109/LWC.2024.3492095","DOIUrl":null,"url":null,"abstract":"This letter focuses on data freshness-based task splitting in edge computing (EC)-enabled networks, where a user’s subtasks are offloaded to EC servers through radio access networks (RANs). A control tower (CT) receives information of available computing resources from EC servers and channel information. Considering the freshness of received information at CT, we define a successful offloading probability (SOP), then formulate the SOP maximization problem by optimizing the task splitting. We propose an alternative algorithm by decomposition with approximation and bisection methods. Numerical results demonstrate the proposed algorithm outperforms a baseline, emphasizing the importance of data freshness on the optimization.","PeriodicalId":13343,"journal":{"name":"IEEE Wireless Communications Letters","volume":"14 2","pages":"270-274"},"PeriodicalIF":5.5000,"publicationDate":"2024-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Wireless Communications Letters","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10755063/","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

This letter focuses on data freshness-based task splitting in edge computing (EC)-enabled networks, where a user’s subtasks are offloaded to EC servers through radio access networks (RANs). A control tower (CT) receives information of available computing resources from EC servers and channel information. Considering the freshness of received information at CT, we define a successful offloading probability (SOP), then formulate the SOP maximization problem by optimizing the task splitting. We propose an alternative algorithm by decomposition with approximation and bisection methods. Numerical results demonstrate the proposed algorithm outperforms a baseline, emphasizing the importance of data freshness on the optimization.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于信息时代的边缘计算网络任务分工方案
这封信的重点是在边缘计算(EC)支持的网络中基于数据新鲜度的任务分割,其中用户的子任务通过无线接入网(ran)卸载到EC服务器。控制塔(CT)接收来自EC服务器的可用计算资源信息和通道信息。考虑CT接收信息的新鲜度,定义了成功卸载概率(SOP),并通过优化任务划分,提出了SOP最大化问题。我们提出了一种替代算法,即近似分解和平分法。数值结果表明,该算法优于基线算法,强调了数据新鲜度对优化的重要性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Wireless Communications Letters
IEEE Wireless Communications Letters Engineering-Electrical and Electronic Engineering
CiteScore
12.30
自引率
6.30%
发文量
481
期刊介绍: IEEE Wireless Communications Letters publishes short papers in a rapid publication cycle on advances in the state-of-the-art of wireless communications. Both theoretical contributions (including new techniques, concepts, and analyses) and practical contributions (including system experiments and prototypes, and new applications) are encouraged. This journal focuses on the physical layer and the link layer of wireless communication systems.
期刊最新文献
Lightweight Domain-Adaptive Modulation Classification Under SNR and Channel Mismatch Fairness-aware ODDM Design for Secrecy Rate Maximization Among Untrusted Users Scalable Deep Reinforcement Learning-based User Pairing for Cell-Free MIMO Network A Novel Lightweight Hybrid MLP and Quantum Neural Network Model for Bit Error Rate Prediction in NOMA-Enabled Visible Light Communication Systems Sum-Rate Maximization for FRIS-enabled NOMA Communications
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1