论启用 D2D 的无线缓存网络的成本最小化设计:联合推荐、缓存和路由的视角

IF 1.5 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC
Yu Hua, Yaru Fu, Qi Zhu
{"title":"论启用 D2D 的无线缓存网络的成本最小化设计:联合推荐、缓存和路由的视角","authors":"Yu Hua,&nbsp;Yaru Fu,&nbsp;Qi Zhu","doi":"10.1049/cmu2.12716","DOIUrl":null,"url":null,"abstract":"<p>Cache-enabled device-to-device (D2D) network has been deemed as an effective technique to offload the data traffic. However, the gain of the caching schemes is closely related to the homogeneity among users' preference distribution. To tackle this issue, recommendation is a promising proactive approach. It increases the request probability of recommended contents, reshaping users' contents demand patterns, and improving caching performance. Moreover, considering the heterogeneous network settings, i.e. content retrieval costs vary, the routing design becomes a non-negligible factor on caching performance optimization. On these grounds, the average system cost of D2D-enabled wireless caching networks with multiple BSs is first described. Then the routing strategies are designed together with caching and recommendation policies by minimizing the average cost of these networks. The optimization problem is proven as NP-hard. To facilitate the analysis, the original problem is decoupled into two sub-problems and solve them respectively. Afterwards, all the variables are optimized in an alternating manner until the convergence is achieved. The proposed algorithm's convergence performance and benefits over benchmark strategies in terms of total cost and cache hit ratio are supported by Monte-Carlo simulation results.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.5000,"publicationDate":"2024-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12716","citationCount":"0","resultStr":"{\"title\":\"On the design of cost minimization for D2D-enabled wireless caching networks: A joint recommendation, caching, and routing perspective\",\"authors\":\"Yu Hua,&nbsp;Yaru Fu,&nbsp;Qi Zhu\",\"doi\":\"10.1049/cmu2.12716\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Cache-enabled device-to-device (D2D) network has been deemed as an effective technique to offload the data traffic. However, the gain of the caching schemes is closely related to the homogeneity among users' preference distribution. To tackle this issue, recommendation is a promising proactive approach. It increases the request probability of recommended contents, reshaping users' contents demand patterns, and improving caching performance. Moreover, considering the heterogeneous network settings, i.e. content retrieval costs vary, the routing design becomes a non-negligible factor on caching performance optimization. On these grounds, the average system cost of D2D-enabled wireless caching networks with multiple BSs is first described. Then the routing strategies are designed together with caching and recommendation policies by minimizing the average cost of these networks. The optimization problem is proven as NP-hard. To facilitate the analysis, the original problem is decoupled into two sub-problems and solve them respectively. Afterwards, all the variables are optimized in an alternating manner until the convergence is achieved. The proposed algorithm's convergence performance and benefits over benchmark strategies in terms of total cost and cache hit ratio are supported by Monte-Carlo simulation results.</p>\",\"PeriodicalId\":55001,\"journal\":{\"name\":\"IET Communications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2024-01-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12716\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IET Communications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1049/cmu2.12716\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Communications","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/cmu2.12716","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

支持缓存的设备到设备(D2D)网络被认为是卸载数据流量的有效技术。然而,缓存方案的收益与用户偏好分布的一致性密切相关。为了解决这个问题,推荐是一种很有前途的主动方法。它能提高被推荐内容的请求概率,重塑用户的内容需求模式,提高缓存性能。此外,考虑到异构网络设置(即内容检索成本各不相同),路由设计成为优化缓存性能的一个不可忽视的因素。在此基础上,首先描述了具有多个 BS 的 D2D 无线高速缓存网络的平均系统成本。然后,通过最小化这些网络的平均成本,设计路由策略以及缓存和推荐策略。优化问题被证明为 NP 难。为便于分析,将原问题分解为两个子问题并分别求解。然后,交替优化所有变量,直至达到收敛。蒙特卡洛模拟结果证明了所提算法的收敛性能,以及在总成本和缓存命中率方面优于基准策略的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

On the design of cost minimization for D2D-enabled wireless caching networks: A joint recommendation, caching, and routing perspective

On the design of cost minimization for D2D-enabled wireless caching networks: A joint recommendation, caching, and routing perspective

Cache-enabled device-to-device (D2D) network has been deemed as an effective technique to offload the data traffic. However, the gain of the caching schemes is closely related to the homogeneity among users' preference distribution. To tackle this issue, recommendation is a promising proactive approach. It increases the request probability of recommended contents, reshaping users' contents demand patterns, and improving caching performance. Moreover, considering the heterogeneous network settings, i.e. content retrieval costs vary, the routing design becomes a non-negligible factor on caching performance optimization. On these grounds, the average system cost of D2D-enabled wireless caching networks with multiple BSs is first described. Then the routing strategies are designed together with caching and recommendation policies by minimizing the average cost of these networks. The optimization problem is proven as NP-hard. To facilitate the analysis, the original problem is decoupled into two sub-problems and solve them respectively. Afterwards, all the variables are optimized in an alternating manner until the convergence is achieved. The proposed algorithm's convergence performance and benefits over benchmark strategies in terms of total cost and cache hit ratio are supported by Monte-Carlo simulation results.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IET Communications
IET Communications 工程技术-工程:电子与电气
CiteScore
4.30
自引率
6.20%
发文量
220
审稿时长
5.9 months
期刊介绍: IET Communications covers the fundamental and generic research for a better understanding of communication technologies to harness the signals for better performing communication systems using various wired and/or wireless media. This Journal is particularly interested in research papers reporting novel solutions to the dominating problems of noise, interference, timing and errors for reduction systems deficiencies such as wasting scarce resources such as spectra, energy and bandwidth. Topics include, but are not limited to: Coding and Communication Theory; Modulation and Signal Design; Wired, Wireless and Optical Communication; Communication System Special Issues. Current Call for Papers: Cognitive and AI-enabled Wireless and Mobile - https://digital-library.theiet.org/files/IET_COM_CFP_CAWM.pdf UAV-Enabled Mobile Edge Computing - https://digital-library.theiet.org/files/IET_COM_CFP_UAV.pdf
×
引用
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学术官方微信