Cooperative edge-caching based transmission with minimum effective delay in heterogeneous cellular networks

IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Computer Communications Pub Date : 2024-08-28 DOI:10.1016/j.comcom.2024.107928
Jiachao Yu, Chao Zhai, Hao Dai, Lina Zheng, Yujun Li
{"title":"Cooperative edge-caching based transmission with minimum effective delay in heterogeneous cellular networks","authors":"Jiachao Yu,&nbsp;Chao Zhai,&nbsp;Hao Dai,&nbsp;Lina Zheng,&nbsp;Yujun Li","doi":"10.1016/j.comcom.2024.107928","DOIUrl":null,"url":null,"abstract":"<div><p>In heterogeneous cellular networks (HCNs), neighboring users often request similar contents asynchronously. Based on the content popularity, base stations (BSs) can download and cache contents when the network is idle, and transmit them locally when the network is busy, which can effectively reduce the backhaul burden and the transmission delay. We consider a two-tier HCN, where macro base stations (MBSs) and small base stations (SBSs) can cooperatively and probabilistically cache contents. Each user is associated to the BS with the maximum average received signal power in any tier. With the cooperative content transfer between MBS tier and SBS tier, users can adaptively obtain contents from BSs or remote content servers. We properly model both wired and wireless delays when a user requests an arbitrary content, and propose the concept of effective delay. Content caching probabilities are optimized using the Marine Predators Algorithm via minimizing the average effective delay. Numerical results show that our proposed cooperative caching scheme achieves much shorter delays than the benchmark caching schemes.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107928"},"PeriodicalIF":4.5000,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Communications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0140366424002755","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

In heterogeneous cellular networks (HCNs), neighboring users often request similar contents asynchronously. Based on the content popularity, base stations (BSs) can download and cache contents when the network is idle, and transmit them locally when the network is busy, which can effectively reduce the backhaul burden and the transmission delay. We consider a two-tier HCN, where macro base stations (MBSs) and small base stations (SBSs) can cooperatively and probabilistically cache contents. Each user is associated to the BS with the maximum average received signal power in any tier. With the cooperative content transfer between MBS tier and SBS tier, users can adaptively obtain contents from BSs or remote content servers. We properly model both wired and wireless delays when a user requests an arbitrary content, and propose the concept of effective delay. Content caching probabilities are optimized using the Marine Predators Algorithm via minimizing the average effective delay. Numerical results show that our proposed cooperative caching scheme achieves much shorter delays than the benchmark caching schemes.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
异构蜂窝网络中基于边缘缓存的合作传输与最小有效延迟
在异构蜂窝网络(HCN)中,相邻用户经常异步请求类似的内容。基站(BS)可以根据内容的受欢迎程度,在网络空闲时下载并缓存内容,在网络繁忙时在本地传输内容,从而有效减少回程负担和传输延迟。我们考虑了两层 HCN,其中宏基站(MBS)和小基站(SBS)可以合作并以概率方式缓存内容。每个用户都与任意层中平均接收信号功率最大的基站相关联。通过 MBS 层和 SBS 层之间的合作内容传输,用户可以自适应地从 BS 或远程内容服务器获取内容。我们对用户请求任意内容时的有线和无线延迟进行了适当建模,并提出了有效延迟的概念。通过最小化平均有效延迟,使用海洋捕食者算法优化内容缓存概率。数值结果表明,我们提出的合作缓存方案比基准缓存方案实现了更短的延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computer Communications
Computer Communications 工程技术-电信学
CiteScore
14.10
自引率
5.00%
发文量
397
审稿时长
66 days
期刊介绍: Computer and Communications networks are key infrastructures of the information society with high socio-economic value as they contribute to the correct operations of many critical services (from healthcare to finance and transportation). Internet is the core of today''s computer-communication infrastructures. This has transformed the Internet, from a robust network for data transfer between computers, to a global, content-rich, communication and information system where contents are increasingly generated by the users, and distributed according to human social relations. Next-generation network technologies, architectures and protocols are therefore required to overcome the limitations of the legacy Internet and add new capabilities and services. The future Internet should be ubiquitous, secure, resilient, and closer to human communication paradigms. Computer Communications is a peer-reviewed international journal that publishes high-quality scientific articles (both theory and practice) and survey papers covering all aspects of future computer communication networks (on all layers, except the physical layer), with a special attention to the evolution of the Internet architecture, protocols, services, and applications.
期刊最新文献
Editorial Board A deep dive into cybersecurity solutions for AI-driven IoT-enabled smart cities in advanced communication networks The pupil outdoes the master: Imperfect demonstration-assisted trust region jamming policy optimization against frequency-hopping spread spectrum High-performance BFT consensus for Metaverse through block linking and shortcut loop Automating 5G network slice management for industrial applications
×
引用
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