数字双子边缘网络中的信息时代与能源优化

Yongna Guo, Yaru Fu, Yan Zhang, Tony Q. S. Quek
{"title":"数字双子边缘网络中的信息时代与能源优化","authors":"Yongna Guo, Yaru Fu, Yan Zhang, Tony Q. S. Quek","doi":"arxiv-2409.11799","DOIUrl":null,"url":null,"abstract":"In this paper, we study the intricate realm of digital twin synchronization\nand deployment in multi-access edge computing (MEC) networks, with the aim of\noptimizing and balancing the two performance metrics Age of Information (AoI)\nand energy efficiency. We jointly consider the problems of edge association,\npower allocation, and digital twin deployment. However, the inherent randomness\nof the problem presents a significant challenge in identifying an optimal\nsolution. To address this, we first analyze the feasibility conditions of the\noptimization problem. We then examine a specific scenario involving a static\nchannel and propose a cyclic scheduling scheme. This enables us to derive the\nsum AoI in closed form. As a result, the joint optimization problem of edge\nassociation and power control is solved optimally by finding a minimum weight\nperfect matching. Moreover, we examine the one-shot optimization problem in the\ncontexts of both frequent digital twin migrations and fixed digital twin\ndeployments, and propose an efficient online algorithm to address the general\noptimization problem. This algorithm effectively reduces system costs by\nbalancing frequent migrations and fixed deployments. Numerical results\ndemonstrate the effectiveness of our proposed scheme in terms of low cost and\nhigh efficiency.","PeriodicalId":501280,"journal":{"name":"arXiv - CS - Networking and Internet Architecture","volume":"26 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Age-of-Information and Energy Optimization in Digital Twin Edge Networks\",\"authors\":\"Yongna Guo, Yaru Fu, Yan Zhang, Tony Q. S. Quek\",\"doi\":\"arxiv-2409.11799\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we study the intricate realm of digital twin synchronization\\nand deployment in multi-access edge computing (MEC) networks, with the aim of\\noptimizing and balancing the two performance metrics Age of Information (AoI)\\nand energy efficiency. We jointly consider the problems of edge association,\\npower allocation, and digital twin deployment. However, the inherent randomness\\nof the problem presents a significant challenge in identifying an optimal\\nsolution. To address this, we first analyze the feasibility conditions of the\\noptimization problem. We then examine a specific scenario involving a static\\nchannel and propose a cyclic scheduling scheme. This enables us to derive the\\nsum AoI in closed form. As a result, the joint optimization problem of edge\\nassociation and power control is solved optimally by finding a minimum weight\\nperfect matching. Moreover, we examine the one-shot optimization problem in the\\ncontexts of both frequent digital twin migrations and fixed digital twin\\ndeployments, and propose an efficient online algorithm to address the general\\noptimization problem. This algorithm effectively reduces system costs by\\nbalancing frequent migrations and fixed deployments. Numerical results\\ndemonstrate the effectiveness of our proposed scheme in terms of low cost and\\nhigh efficiency.\",\"PeriodicalId\":501280,\"journal\":{\"name\":\"arXiv - CS - Networking and Internet Architecture\",\"volume\":\"26 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Networking and Internet Architecture\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.11799\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Networking and Internet Architecture","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.11799","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了多接入边缘计算(MEC)网络中数字孪生同步和部署的复杂领域,旨在优化和平衡信息时代(AoI)和能效这两个性能指标。我们共同考虑了边缘关联、功率分配和数字孪生部署等问题。然而,该问题固有的随机性给确定最佳解决方案带来了巨大挑战。为了解决这个问题,我们首先分析了优化问题的可行性条件。然后,我们研究了一个涉及静态信道的特定场景,并提出了一种循环调度方案。这样,我们就能以封闭形式推导出 AoI 总和。因此,通过寻找最小权重的完美匹配,边缘关联和功率控制的联合优化问题得到了优化解决。此外,我们还研究了频繁数字孪生迁移和固定数字孪生部署情况下的单次优化问题,并提出了一种高效的在线算法来解决一般优化问题。该算法通过平衡频繁迁移和固定部署,有效降低了系统成本。数值结果证明了我们提出的方案在低成本和高效率方面的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Age-of-Information and Energy Optimization in Digital Twin Edge Networks
In this paper, we study the intricate realm of digital twin synchronization and deployment in multi-access edge computing (MEC) networks, with the aim of optimizing and balancing the two performance metrics Age of Information (AoI) and energy efficiency. We jointly consider the problems of edge association, power allocation, and digital twin deployment. However, the inherent randomness of the problem presents a significant challenge in identifying an optimal solution. To address this, we first analyze the feasibility conditions of the optimization problem. We then examine a specific scenario involving a static channel and propose a cyclic scheduling scheme. This enables us to derive the sum AoI in closed form. As a result, the joint optimization problem of edge association and power control is solved optimally by finding a minimum weight perfect matching. Moreover, we examine the one-shot optimization problem in the contexts of both frequent digital twin migrations and fixed digital twin deployments, and propose an efficient online algorithm to address the general optimization problem. This algorithm effectively reduces system costs by balancing frequent migrations and fixed deployments. Numerical results demonstrate the effectiveness of our proposed scheme in terms of low cost and high efficiency.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信