Preference-Aware Caching and Cooperative Coded Multicasting Design for Wireless Backhaul Networks

Aimin Tang, Yao Liu, Xudong Wang
{"title":"Preference-Aware Caching and Cooperative Coded Multicasting Design for Wireless Backhaul Networks","authors":"Aimin Tang, Yao Liu, Xudong Wang","doi":"10.1109/GLOBECOM38437.2019.9013899","DOIUrl":null,"url":null,"abstract":"The joint considering of caching and coded multicasting can significantly improve caching gain, which has become a promising approach to address the explosive growth of wireless traffic demand. In this paper, the design of caching placement and coded multicasting for wireless backhaul networks is explored under heterogeneous file preferences, where the file preference of each small base station (BS) is assumed to be aware at the macro BS. To address the heterogeneous file preferences, a group-based caching and cooperative coded multicasting scheme is developed in this paper. By utilizing the spectral clustering method, the small BSs are first clustered into different groups with similar file preferences. Moreover, a cooperative caching strategy with symmetric file division is designed for each group, where the suboptimal caching proportion of the most popular files is achieved by an approximation analysis. By utilizing the group-based caching structure, an efficient greedy-based two-level cooperative coded multicasting algorithm is then developed. The proposed algorithm not only utilizes the coded multicasting opportunities within each group, but also explores the cooperative coding opportunities among groups. The effectiveness of our proposed scheme is verified by simulation results, which show that our proposed scheme can significantly reduce the traffic load compared to the existing schemes.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"100 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Global Communications Conference (GLOBECOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOBECOM38437.2019.9013899","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The joint considering of caching and coded multicasting can significantly improve caching gain, which has become a promising approach to address the explosive growth of wireless traffic demand. In this paper, the design of caching placement and coded multicasting for wireless backhaul networks is explored under heterogeneous file preferences, where the file preference of each small base station (BS) is assumed to be aware at the macro BS. To address the heterogeneous file preferences, a group-based caching and cooperative coded multicasting scheme is developed in this paper. By utilizing the spectral clustering method, the small BSs are first clustered into different groups with similar file preferences. Moreover, a cooperative caching strategy with symmetric file division is designed for each group, where the suboptimal caching proportion of the most popular files is achieved by an approximation analysis. By utilizing the group-based caching structure, an efficient greedy-based two-level cooperative coded multicasting algorithm is then developed. The proposed algorithm not only utilizes the coded multicasting opportunities within each group, but also explores the cooperative coding opportunities among groups. The effectiveness of our proposed scheme is verified by simulation results, which show that our proposed scheme can significantly reduce the traffic load compared to the existing schemes.
无线回程网络的偏好感知缓存与协同编码多播设计
将高速缓存与编码组播相结合,可以显著提高高速缓存的增益,是解决无线通信需求爆炸式增长的一种很有前途的方法。本文研究了异构文件偏好下无线回传网络的缓存布局和编码组播设计,其中假设每个小基站(BS)的文件偏好在宏观BS上是感知的。为了解决文件的异构偏好,本文提出了一种基于组的缓存和协作编码多播方案。利用谱聚类方法,首先将小BSs聚到具有相似文件偏好的不同组中。此外,针对每组设计了对称文件划分的协同缓存策略,通过近似分析实现了最常用文件的次优缓存比例。利用基于组的缓存结构,提出了一种高效的基于贪婪的两级协同编码多播算法。该算法不仅利用了组内的编码组播机会,而且还探索了组间的合作编码机会。仿真结果验证了所提方案的有效性,与现有方案相比,所提方案能显著降低交通负荷。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信