Resource-Aware Hierarchical Federated Learning in Wireless Video Caching Networks

IF 10.7 1区 计算机科学 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC IEEE Transactions on Wireless Communications Pub Date : 2024-11-07 DOI:10.1109/TWC.2024.3489578
Md Ferdous Pervej;Andreas F. Molisch
{"title":"Resource-Aware Hierarchical Federated Learning in Wireless Video Caching Networks","authors":"Md Ferdous Pervej;Andreas F. Molisch","doi":"10.1109/TWC.2024.3489578","DOIUrl":null,"url":null,"abstract":"Backhaul traffic congestion caused by the video traffic of a few popular files can be alleviated by storing the to-be-requested content at various levels in wireless video caching networks. Typically, content service providers (CSPs) own the content, and the users request their preferred content from the CSPs using their (wireless) internet service providers (ISPs). As these parties do not reveal their private information and business secrets, traditional techniques may not be readily used to predict the dynamic changes in users’ future demands. Motivated by this, we propose a novel \n<underline>r</u>\nesource-\n<underline>aw</u>\nare \n<underline>h</u>\nierarchical \n<underline>f</u>\nederated \n<underline>l</u>\nearning (RawHFL) solution for predicting user’s future content requests. A practical data acquisition technique is used that allows the user to update its local training dataset based on its requested content. Besides, since networking and other computational resources are limited, considering that only a subset of the users participate in the model training, we derive the convergence bound of the proposed algorithm. Based on this bound, we minimize a weighted utility function for jointly configuring the controllable parameters to train the RawHFL energy efficiently under practical resource constraints. Our extensive simulation results validate the proposed algorithm’s superiority, in terms of test accuracy and energy cost, over existing baselines.","PeriodicalId":13431,"journal":{"name":"IEEE Transactions on Wireless Communications","volume":"24 1","pages":"165-180"},"PeriodicalIF":10.7000,"publicationDate":"2024-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Wireless Communications","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10747177/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

Backhaul traffic congestion caused by the video traffic of a few popular files can be alleviated by storing the to-be-requested content at various levels in wireless video caching networks. Typically, content service providers (CSPs) own the content, and the users request their preferred content from the CSPs using their (wireless) internet service providers (ISPs). As these parties do not reveal their private information and business secrets, traditional techniques may not be readily used to predict the dynamic changes in users’ future demands. Motivated by this, we propose a novel r esource- aw are h ierarchical f ederated l earning (RawHFL) solution for predicting user’s future content requests. A practical data acquisition technique is used that allows the user to update its local training dataset based on its requested content. Besides, since networking and other computational resources are limited, considering that only a subset of the users participate in the model training, we derive the convergence bound of the proposed algorithm. Based on this bound, we minimize a weighted utility function for jointly configuring the controllable parameters to train the RawHFL energy efficiently under practical resource constraints. Our extensive simulation results validate the proposed algorithm’s superiority, in terms of test accuracy and energy cost, over existing baselines.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
无线视频缓存网络中的资源感知分层联合学习
在无线视频缓存网络中,通过在不同的层次上存储待请求的内容,可以缓解由少数流行文件的视频流量引起的回程流量拥塞。通常,内容服务提供商(csp)拥有内容,用户使用他们的(无线)互联网服务提供商(isp)向csp请求他们喜欢的内容。由于这些当事人没有泄露他们的私人信息和商业秘密,传统的技术可能不容易用于预测用户未来需求的动态变化。基于此,我们提出了一种新的资源感知分层联邦学习(RawHFL)解决方案,用于预测用户未来的内容请求。使用了一种实用的数据采集技术,允许用户根据其请求的内容更新其本地训练数据集。此外,由于网络和其他计算资源有限,考虑到只有一部分用户参与模型训练,我们推导了算法的收敛界。在此基础上,最小化加权效用函数,共同配置可控参数,在实际资源约束下高效训练RawHFL能量。我们广泛的仿真结果验证了所提出的算法在测试精度和能源成本方面优于现有基线。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
18.60
自引率
10.60%
发文量
708
审稿时长
5.6 months
期刊介绍: The IEEE Transactions on Wireless Communications is a prestigious publication that showcases cutting-edge advancements in wireless communications. It welcomes both theoretical and practical contributions in various areas. The scope of the Transactions encompasses a wide range of topics, including modulation and coding, detection and estimation, propagation and channel characterization, and diversity techniques. The journal also emphasizes the physical and link layer communication aspects of network architectures and protocols. The journal is open to papers on specific topics or non-traditional topics related to specific application areas. This includes simulation tools and methodologies, orthogonal frequency division multiplexing, MIMO systems, and wireless over optical technologies. Overall, the IEEE Transactions on Wireless Communications serves as a platform for high-quality manuscripts that push the boundaries of wireless communications and contribute to advancements in the field.
期刊最新文献
RIS Control through the Lens of Stochastic Network Calculus: An O-RAN Framework for Delay-Sensitive 6G Applications Vector Similarity Search-Based MCS Selection in Massive Multi-User MIMO-OFDM Modeling and Analysis for Multiple-Layer LEO Satellite Internet of Things Constellations Ampli-Flection for 6G: Active-RIS-Aided Aerial Backhaul with Full 3D Coverage Near-Field RIS-Aided Localization Under Deliberate Model Misspecification: Bounds and Algorithms
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1