基于任务依赖的URLLC边缘网络资源优化分配:基于有限块长度的数字孪生方法

IF 5.3 2区 计算机科学 Q1 TELECOMMUNICATIONS
Muhammad Awais;Haris Pervaiz;Qiang Ni;Wenjuan Yu
{"title":"基于任务依赖的URLLC边缘网络资源优化分配:基于有限块长度的数字孪生方法","authors":"Muhammad Awais;Haris Pervaiz;Qiang Ni;Wenjuan Yu","doi":"10.1109/TGCN.2024.3425442","DOIUrl":null,"url":null,"abstract":"Next-generation wireless networks envision ubiquitous access and computational capabilities by seamlessly integrating aerial and terrestrial networks. Digital twin (DT) technology emerges as a proactive and cost-effective approach for resource-limited networks. Mobile edge computing (MEC) is pivotal in facilitating mobile offloading, particularly under the demanding constraints of ultra-reliable and low-latency communication (URLLC). This study proposes an advanced bisection sampling-based stochastic solution enhancement (BSSE) algorithm to minimize the system’s overall energy-time cost by jointly optimizing task offloading and resource allocation strategies. The formulated problem is a mixed-integer nonlinear programming problem due to its inherently combinatorial linkage with task-offloading decisions and strong correlation with resource allocation. The proposed algorithm operates iteratively through the following steps: 1) narrowing the search space through a one-climb policy, 2) developing a closed-form solution for optimal CPU frequency and transmit power, and 3) implementing randomized task offloading, which updates it in the direction of reducing objective value. The scalability of the proposed algorithm is also analyzed for a two-device model, which is subsequently extended to multiple devices. Comparative analysis against benchmark schemes reveals that our approach reduces total energy-time cost by 15.35% to 33.12% when weighting parameter <inline-formula> <tex-math>$\\partial ^{\\lambda }_{k_{2}}$ </tex-math></inline-formula> is increased from 0.1 to 0.3, respectively.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"9 1","pages":"177-190"},"PeriodicalIF":5.3000,"publicationDate":"2024-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Task Dependency Aware Optimal Resource Allocation for URLLC Edge Network: A Digital Twin Approach Using Finite Blocklength\",\"authors\":\"Muhammad Awais;Haris Pervaiz;Qiang Ni;Wenjuan Yu\",\"doi\":\"10.1109/TGCN.2024.3425442\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Next-generation wireless networks envision ubiquitous access and computational capabilities by seamlessly integrating aerial and terrestrial networks. Digital twin (DT) technology emerges as a proactive and cost-effective approach for resource-limited networks. Mobile edge computing (MEC) is pivotal in facilitating mobile offloading, particularly under the demanding constraints of ultra-reliable and low-latency communication (URLLC). This study proposes an advanced bisection sampling-based stochastic solution enhancement (BSSE) algorithm to minimize the system’s overall energy-time cost by jointly optimizing task offloading and resource allocation strategies. The formulated problem is a mixed-integer nonlinear programming problem due to its inherently combinatorial linkage with task-offloading decisions and strong correlation with resource allocation. The proposed algorithm operates iteratively through the following steps: 1) narrowing the search space through a one-climb policy, 2) developing a closed-form solution for optimal CPU frequency and transmit power, and 3) implementing randomized task offloading, which updates it in the direction of reducing objective value. The scalability of the proposed algorithm is also analyzed for a two-device model, which is subsequently extended to multiple devices. Comparative analysis against benchmark schemes reveals that our approach reduces total energy-time cost by 15.35% to 33.12% when weighting parameter <inline-formula> <tex-math>$\\\\partial ^{\\\\lambda }_{k_{2}}$ </tex-math></inline-formula> is increased from 0.1 to 0.3, respectively.\",\"PeriodicalId\":13052,\"journal\":{\"name\":\"IEEE Transactions on Green Communications and Networking\",\"volume\":\"9 1\",\"pages\":\"177-190\"},\"PeriodicalIF\":5.3000,\"publicationDate\":\"2024-07-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Green Communications and Networking\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10596126/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"TELECOMMUNICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Green Communications and Networking","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10596126/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

下一代无线网络设想通过无缝集成空中和地面网络实现无处不在的访问和计算能力。数字孪生(DT)技术作为资源有限的网络的一种主动和经济有效的方法而出现。移动边缘计算(MEC)在促进移动卸载方面至关重要,特别是在超可靠和低延迟通信(URLLC)的苛刻限制下。本文提出了一种先进的基于二分抽样的随机解增强(BSSE)算法,通过联合优化任务卸载和资源分配策略,使系统的总能量时间成本最小化。由于其固有的与任务卸载决策的组合联系和与资源分配的强相关性,该问题是一个混合整数非线性规划问题。该算法通过以下步骤进行迭代运算:1)通过一次爬升策略缩小搜索空间;2)开发最优CPU频率和发射功率的封闭形式解;3)实现随机任务卸载,使其朝着目标值减小的方向更新。本文还分析了该算法在双设备模型下的可扩展性,并将其扩展到多设备模型。与基准方案的比较分析表明,该方法可将总能源时间成本降低15.35%% to 33.12% when weighting parameter $\partial ^{\lambda }_{k_{2}}$ is increased from 0.1 to 0.3, respectively.
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Task Dependency Aware Optimal Resource Allocation for URLLC Edge Network: A Digital Twin Approach Using Finite Blocklength
Next-generation wireless networks envision ubiquitous access and computational capabilities by seamlessly integrating aerial and terrestrial networks. Digital twin (DT) technology emerges as a proactive and cost-effective approach for resource-limited networks. Mobile edge computing (MEC) is pivotal in facilitating mobile offloading, particularly under the demanding constraints of ultra-reliable and low-latency communication (URLLC). This study proposes an advanced bisection sampling-based stochastic solution enhancement (BSSE) algorithm to minimize the system’s overall energy-time cost by jointly optimizing task offloading and resource allocation strategies. The formulated problem is a mixed-integer nonlinear programming problem due to its inherently combinatorial linkage with task-offloading decisions and strong correlation with resource allocation. The proposed algorithm operates iteratively through the following steps: 1) narrowing the search space through a one-climb policy, 2) developing a closed-form solution for optimal CPU frequency and transmit power, and 3) implementing randomized task offloading, which updates it in the direction of reducing objective value. The scalability of the proposed algorithm is also analyzed for a two-device model, which is subsequently extended to multiple devices. Comparative analysis against benchmark schemes reveals that our approach reduces total energy-time cost by 15.35% to 33.12% when weighting parameter $\partial ^{\lambda }_{k_{2}}$ is increased from 0.1 to 0.3, respectively.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Green Communications and Networking
IEEE Transactions on Green Communications and Networking Computer Science-Computer Networks and Communications
CiteScore
9.30
自引率
6.20%
发文量
181
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信