Yadong Zhang;Peng Wang;Qubeijian Wang;Haibin Zhang;Lexi Xu;Wen Sun;Bin Wang
{"title":"基于进化博弈的无线计算能力网络自适应DT关联与传输","authors":"Yadong Zhang;Peng Wang;Qubeijian Wang;Haibin Zhang;Lexi Xu;Wen Sun;Bin Wang","doi":"10.1109/TGCN.2024.3442910","DOIUrl":null,"url":null,"abstract":"Wireless Computing Power Networks (WCPN), guided by green principles, aim to provide efficient, flexible, and environmentally friendly computing services for Internet of Things (IoT) applications by seamlessly coordinating computational and networking resources across diverse nodes. The integration of Digital Twin (DT) technology is crucial for achieving these objectives. However, different DT association strategies play a crucial role in enhancing the capabilities of WCPN. In this paper, recognizing the long-term and dynamic nature of DT deployment in real-world scenarios, we utilize evolutionary game theory to model the association and transfer of DTs, aiming for continuous adaptive adjustments and optimizations in their deployment. Specifically, we propose an evolutionary game-based algorithm for DT association as a complement to the independent decision-making process in DT deployment. Moreover, in light of the inherent limitations of the evolutionary game selection mechanism and the lack of self-learning ability, we introduce a deep Q-network (DQN) based evolutionary game approach that ensures adaptive DT association and transfer by considering factors such as DT synchronization delay, model consistency, and migration costs. Numerical results demonstrate that our proposed algorithms outperform the benchmarks in terms of average user utility and convergence speed.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"9 2","pages":"670-683"},"PeriodicalIF":5.3000,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Evolutionary Game-Based Adaptive DT Association and Transfer for Wireless Computing Power Networks\",\"authors\":\"Yadong Zhang;Peng Wang;Qubeijian Wang;Haibin Zhang;Lexi Xu;Wen Sun;Bin Wang\",\"doi\":\"10.1109/TGCN.2024.3442910\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Wireless Computing Power Networks (WCPN), guided by green principles, aim to provide efficient, flexible, and environmentally friendly computing services for Internet of Things (IoT) applications by seamlessly coordinating computational and networking resources across diverse nodes. The integration of Digital Twin (DT) technology is crucial for achieving these objectives. However, different DT association strategies play a crucial role in enhancing the capabilities of WCPN. In this paper, recognizing the long-term and dynamic nature of DT deployment in real-world scenarios, we utilize evolutionary game theory to model the association and transfer of DTs, aiming for continuous adaptive adjustments and optimizations in their deployment. Specifically, we propose an evolutionary game-based algorithm for DT association as a complement to the independent decision-making process in DT deployment. Moreover, in light of the inherent limitations of the evolutionary game selection mechanism and the lack of self-learning ability, we introduce a deep Q-network (DQN) based evolutionary game approach that ensures adaptive DT association and transfer by considering factors such as DT synchronization delay, model consistency, and migration costs. Numerical results demonstrate that our proposed algorithms outperform the benchmarks in terms of average user utility and convergence speed.\",\"PeriodicalId\":13052,\"journal\":{\"name\":\"IEEE Transactions on Green Communications and Networking\",\"volume\":\"9 2\",\"pages\":\"670-683\"},\"PeriodicalIF\":5.3000,\"publicationDate\":\"2024-08-13\",\"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/10634898/\",\"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/10634898/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
Evolutionary Game-Based Adaptive DT Association and Transfer for Wireless Computing Power Networks
Wireless Computing Power Networks (WCPN), guided by green principles, aim to provide efficient, flexible, and environmentally friendly computing services for Internet of Things (IoT) applications by seamlessly coordinating computational and networking resources across diverse nodes. The integration of Digital Twin (DT) technology is crucial for achieving these objectives. However, different DT association strategies play a crucial role in enhancing the capabilities of WCPN. In this paper, recognizing the long-term and dynamic nature of DT deployment in real-world scenarios, we utilize evolutionary game theory to model the association and transfer of DTs, aiming for continuous adaptive adjustments and optimizations in their deployment. Specifically, we propose an evolutionary game-based algorithm for DT association as a complement to the independent decision-making process in DT deployment. Moreover, in light of the inherent limitations of the evolutionary game selection mechanism and the lack of self-learning ability, we introduce a deep Q-network (DQN) based evolutionary game approach that ensures adaptive DT association and transfer by considering factors such as DT synchronization delay, model consistency, and migration costs. Numerical results demonstrate that our proposed algorithms outperform the benchmarks in terms of average user utility and convergence speed.