Blockchain and digital twin empowered edge caching for D2D wireless networks

IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS Future Generation Computer Systems-The International Journal of Escience Pub Date : 2025-01-02 DOI:10.1016/j.future.2024.107704
Jianbo Du , Zuting Yu , Shulei Li , Bintao Hu , Yuan Gao , Xiaoli Chu
{"title":"Blockchain and digital twin empowered edge caching for D2D wireless networks","authors":"Jianbo Du ,&nbsp;Zuting Yu ,&nbsp;Shulei Li ,&nbsp;Bintao Hu ,&nbsp;Yuan Gao ,&nbsp;Xiaoli Chu","doi":"10.1016/j.future.2024.107704","DOIUrl":null,"url":null,"abstract":"<div><div>Edge caching is considered a promising technology to fulfill user equipment (UE) requirements for content services. In this paper, we explore the use of blockchain and digital twin technologies to support edge caching in a Device-to-Device (D2D) wireless network, where each UE may fetch content from its own caching buffer, from other UEs through D2D links, or from a content server. A digital twin monitors and predicts the operating status of UE by storing crucial data such as the location, estimated processing capability, and remaining energy of each UE. To enable secure and credible trading between UEs, the blockchain technology is used to supervise transactions and constantly update UEs’ reputation values. We formulate an optimization problem to maximize an objective function that considers the content fetching performance, network lifetime and UE’s handover costs by optimizing the content placement and fetching strategies, subject to constraints on the UE’s storage capacity, the upper limit of serving other UEs, and latency requirements. To solve this complicated problem for a dynamic network environment, we propose a proximal policy optimization-based deep reinforcement learning framework. Simulation results demonstrate that our proposed algorithm converges rapidly and can efficiently maximize the rewards, network lifetime and content fetching gain while minimizing handover costs.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"166 ","pages":"Article 107704"},"PeriodicalIF":6.2000,"publicationDate":"2025-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Future Generation Computer Systems-The International Journal of Escience","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167739X2400668X","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Edge caching is considered a promising technology to fulfill user equipment (UE) requirements for content services. In this paper, we explore the use of blockchain and digital twin technologies to support edge caching in a Device-to-Device (D2D) wireless network, where each UE may fetch content from its own caching buffer, from other UEs through D2D links, or from a content server. A digital twin monitors and predicts the operating status of UE by storing crucial data such as the location, estimated processing capability, and remaining energy of each UE. To enable secure and credible trading between UEs, the blockchain technology is used to supervise transactions and constantly update UEs’ reputation values. We formulate an optimization problem to maximize an objective function that considers the content fetching performance, network lifetime and UE’s handover costs by optimizing the content placement and fetching strategies, subject to constraints on the UE’s storage capacity, the upper limit of serving other UEs, and latency requirements. To solve this complicated problem for a dynamic network environment, we propose a proximal policy optimization-based deep reinforcement learning framework. Simulation results demonstrate that our proposed algorithm converges rapidly and can efficiently maximize the rewards, network lifetime and content fetching gain while minimizing handover costs.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
19.90
自引率
2.70%
发文量
376
审稿时长
10.6 months
期刊介绍: Computing infrastructures and systems are constantly evolving, resulting in increasingly complex and collaborative scientific applications. To cope with these advancements, there is a growing need for collaborative tools that can effectively map, control, and execute these applications. Furthermore, with the explosion of Big Data, there is a requirement for innovative methods and infrastructures to collect, analyze, and derive meaningful insights from the vast amount of data generated. This necessitates the integration of computational and storage capabilities, databases, sensors, and human collaboration. Future Generation Computer Systems aims to pioneer advancements in distributed systems, collaborative environments, high-performance computing, and Big Data analytics. It strives to stay at the forefront of developments in grids, clouds, and the Internet of Things (IoT) to effectively address the challenges posed by these wide-area, fully distributed sensing and computing systems.
期刊最新文献
Self-sovereign identity framework with user-friendly private key generation and rule table Accelerating complex graph queries by summary-based hybrid partitioning for discovering vulnerabilities of distribution equipment DNA: Dual-radio Dual-constraint Node Activation scheduling for energy-efficient data dissemination in IoT Blending lossy and lossless data compression methods to support health data streaming in smart cities Energy–time modelling of distributed multi-population genetic algorithms with dynamic workload in HPC clusters
×
引用
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