Bison:基于二进制稀疏网络编码的 D2D 移动边缘缓存网络内容共享方案

IF 7.7 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Mobile Computing Pub Date : 2024-09-18 DOI:10.1109/TMC.2024.3463735
Cheng Peng;Jun Yin;Lei Wang;Fu Xiao
{"title":"Bison:基于二进制稀疏网络编码的 D2D 移动边缘缓存网络内容共享方案","authors":"Cheng Peng;Jun Yin;Lei Wang;Fu Xiao","doi":"10.1109/TMC.2024.3463735","DOIUrl":null,"url":null,"abstract":"Mobile edge caching network (MEN), which enables popular or reusable content caching and sharing among adjacent mobile edge devices, has become a promising solution to reduce the traffic and burden over backhaul links. Network coding (NC), represented by classical random linear network coding (RLNC), is utilized to facilitate content delivery and increase throughput in MEN. However, as the harsh decoding condition results in unacceptable time and storage overhead, classical RLNC schemes struggle to be widely deployed in practice. In this work, we propose a cost-effective NC-based content-sharing scheme based on binary sparse network coding (BSNC), called Bison, for D2D-enabled MEN. Based on the shared relationship between the binary sparse coded block (BSCB), Bison first designs a caching maintenance module to characterize the sharing progress and maintain the caching state of each edge node. Then, Bison defines a matching metric named neighbor utility to evaluate neighbors’ matching values by considering nodes’ demand and content decodability. Guiding by the metric, Bison achieves the most beneficial matching relationship among edge nodes through a proposed online matching policy. Finally, Bison devises a coded block delivery strategy to enable the sharing of valuable content between two matched edge nodes. Extensive experiments in simulations and real-world Android testbeds demonstrate its effectiveness and efficiency, wherein Bison is at least 30% less than the RLNC-based scheme on time consumption and at least 10% less than the classical BSNC-based scheme on storage overhead. The results also show that our matching policy and coded block delivery strategy can perform with a low response latency on edge and mobile devices.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 2","pages":"677-695"},"PeriodicalIF":7.7000,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Bison: A Binary Sparse Network Coding Based Contents Sharing Scheme for D2D-Enabled Mobile Edge Caching Network\",\"authors\":\"Cheng Peng;Jun Yin;Lei Wang;Fu Xiao\",\"doi\":\"10.1109/TMC.2024.3463735\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mobile edge caching network (MEN), which enables popular or reusable content caching and sharing among adjacent mobile edge devices, has become a promising solution to reduce the traffic and burden over backhaul links. Network coding (NC), represented by classical random linear network coding (RLNC), is utilized to facilitate content delivery and increase throughput in MEN. However, as the harsh decoding condition results in unacceptable time and storage overhead, classical RLNC schemes struggle to be widely deployed in practice. In this work, we propose a cost-effective NC-based content-sharing scheme based on binary sparse network coding (BSNC), called Bison, for D2D-enabled MEN. Based on the shared relationship between the binary sparse coded block (BSCB), Bison first designs a caching maintenance module to characterize the sharing progress and maintain the caching state of each edge node. Then, Bison defines a matching metric named neighbor utility to evaluate neighbors’ matching values by considering nodes’ demand and content decodability. Guiding by the metric, Bison achieves the most beneficial matching relationship among edge nodes through a proposed online matching policy. Finally, Bison devises a coded block delivery strategy to enable the sharing of valuable content between two matched edge nodes. Extensive experiments in simulations and real-world Android testbeds demonstrate its effectiveness and efficiency, wherein Bison is at least 30% less than the RLNC-based scheme on time consumption and at least 10% less than the classical BSNC-based scheme on storage overhead. The results also show that our matching policy and coded block delivery strategy can perform with a low response latency on edge and mobile devices.\",\"PeriodicalId\":50389,\"journal\":{\"name\":\"IEEE Transactions on Mobile Computing\",\"volume\":\"24 2\",\"pages\":\"677-695\"},\"PeriodicalIF\":7.7000,\"publicationDate\":\"2024-09-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Mobile Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10684086/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Mobile Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10684086/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

移动边缘缓存网络(MEN)支持在相邻的移动边缘设备之间实现流行的或可重用的内容缓存和共享,已成为减少回程链路流量和负担的一种有前途的解决方案。以经典随机线性网络编码(RLNC)为代表的网络编码(NC)被用来促进内容传递和提高网络吞吐量。然而,由于苛刻的解码条件导致不可接受的时间和存储开销,经典的RLNC方案难以在实践中广泛部署。在这项工作中,我们提出了一种基于二进制稀疏网络编码(BSNC)的具有成本效益的基于nc的内容共享方案,称为Bison,用于支持d2d的MEN。基于二进制稀疏编码块(BSCB)之间的共享关系,Bison首先设计了缓存维护模块来表征每个边缘节点的共享进程并维护缓存状态。然后,Bison定义了一个名为邻居实用程序的匹配度量,通过考虑节点的需求和内容可解码性来评估邻居的匹配值。Bison在度量的指导下,通过提出的在线匹配策略实现边缘节点之间最有利的匹配关系。最后,Bison设计了一种编码块交付策略,使两个匹配的边缘节点之间能够共享有价值的内容。大量的模拟实验和真实的Android测试平台证明了它的有效性和效率,其中Bison比基于rnc的方案在时间消耗上至少少30%,在存储开销上至少比基于经典bsnc的方案少10%。结果还表明,我们的匹配策略和编码块传递策略可以在边缘和移动设备上以较低的响应延迟执行。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Bison: A Binary Sparse Network Coding Based Contents Sharing Scheme for D2D-Enabled Mobile Edge Caching Network
Mobile edge caching network (MEN), which enables popular or reusable content caching and sharing among adjacent mobile edge devices, has become a promising solution to reduce the traffic and burden over backhaul links. Network coding (NC), represented by classical random linear network coding (RLNC), is utilized to facilitate content delivery and increase throughput in MEN. However, as the harsh decoding condition results in unacceptable time and storage overhead, classical RLNC schemes struggle to be widely deployed in practice. In this work, we propose a cost-effective NC-based content-sharing scheme based on binary sparse network coding (BSNC), called Bison, for D2D-enabled MEN. Based on the shared relationship between the binary sparse coded block (BSCB), Bison first designs a caching maintenance module to characterize the sharing progress and maintain the caching state of each edge node. Then, Bison defines a matching metric named neighbor utility to evaluate neighbors’ matching values by considering nodes’ demand and content decodability. Guiding by the metric, Bison achieves the most beneficial matching relationship among edge nodes through a proposed online matching policy. Finally, Bison devises a coded block delivery strategy to enable the sharing of valuable content between two matched edge nodes. Extensive experiments in simulations and real-world Android testbeds demonstrate its effectiveness and efficiency, wherein Bison is at least 30% less than the RLNC-based scheme on time consumption and at least 10% less than the classical BSNC-based scheme on storage overhead. The results also show that our matching policy and coded block delivery strategy can perform with a low response latency on edge and mobile devices.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Mobile Computing
IEEE Transactions on Mobile Computing 工程技术-电信学
CiteScore
12.90
自引率
2.50%
发文量
403
审稿时长
6.6 months
期刊介绍: IEEE Transactions on Mobile Computing addresses key technical issues related to various aspects of mobile computing. This includes (a) architectures, (b) support services, (c) algorithm/protocol design and analysis, (d) mobile environments, (e) mobile communication systems, (f) applications, and (g) emerging technologies. Topics of interest span a wide range, covering aspects like mobile networks and hosts, mobility management, multimedia, operating system support, power management, online and mobile environments, security, scalability, reliability, and emerging technologies such as wearable computers, body area networks, and wireless sensor networks. The journal serves as a comprehensive platform for advancements in mobile computing research.
期刊最新文献
Harmonizing Global and Local Class Imbalance for Federated Learning O-RAN-Enabled Intelligent Network Slicing to Meet Service-Level Agreement (SLA) CV-Cast: Computer Vision–Oriented Linear Coding and Transmission AdaWiFi, Collaborative WiFi Sensing for Cross-Environment Adaptation BIT-FL: Blockchain-Enabled Incentivized and Secure Federated Learning Framework
×
引用
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