以内容为中心的无线自组织网络中的合作组缓存策略

S. Soleimani, Xiaofeng Tao, Yuhong Li
{"title":"以内容为中心的无线自组织网络中的合作组缓存策略","authors":"S. Soleimani, Xiaofeng Tao, Yuhong Li","doi":"10.1109/ICCCHINA.2018.8641166","DOIUrl":null,"url":null,"abstract":"As next generation wireless mobile networks are witnessing a fundamental shift from connection-centric communications to content-centric communications, the content-centric wireless ad hoc network emerges as a promising paradigm for providing content delivery in an efficient, reliable, and secure way. In this paper, we investigate cooperative group caching management in content-centric wireless ad hoc network. Content caching probability is proposed to optimize the cache placement in order to choose the most valuable neighboring node to execute placement with the lowest probability. With the optimal cache scheme, we analytically derive and numerically evaluate the cache hit probability and the average number of successfully served requests. Simulation results show that the proposed cooperative group caching strategy outperforms the existing results.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Cooperative Group Caching Strategy in Content-Centric Wireless Ad Hoc Networks\",\"authors\":\"S. Soleimani, Xiaofeng Tao, Yuhong Li\",\"doi\":\"10.1109/ICCCHINA.2018.8641166\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As next generation wireless mobile networks are witnessing a fundamental shift from connection-centric communications to content-centric communications, the content-centric wireless ad hoc network emerges as a promising paradigm for providing content delivery in an efficient, reliable, and secure way. In this paper, we investigate cooperative group caching management in content-centric wireless ad hoc network. Content caching probability is proposed to optimize the cache placement in order to choose the most valuable neighboring node to execute placement with the lowest probability. With the optimal cache scheme, we analytically derive and numerically evaluate the cache hit probability and the average number of successfully served requests. Simulation results show that the proposed cooperative group caching strategy outperforms the existing results.\",\"PeriodicalId\":170216,\"journal\":{\"name\":\"2018 IEEE/CIC International Conference on Communications in China (ICCC)\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE/CIC International Conference on Communications in China (ICCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCHINA.2018.8641166\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCHINA.2018.8641166","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随着下一代无线移动网络见证了从以连接为中心的通信到以内容为中心的通信的根本性转变,以内容为中心的无线自组织网络作为一种有前途的范例以高效、可靠和安全的方式提供内容交付。本文研究了以内容为中心的无线自组网中的协作组缓存管理。提出了内容缓存概率来优化缓存布局,以最小的概率选择最有价值的相邻节点执行布局。利用最优缓存方案,我们解析推导并数值计算了缓存命中概率和平均成功服务请求数。仿真结果表明,所提出的协作组缓存策略优于已有的缓存策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Cooperative Group Caching Strategy in Content-Centric Wireless Ad Hoc Networks
As next generation wireless mobile networks are witnessing a fundamental shift from connection-centric communications to content-centric communications, the content-centric wireless ad hoc network emerges as a promising paradigm for providing content delivery in an efficient, reliable, and secure way. In this paper, we investigate cooperative group caching management in content-centric wireless ad hoc network. Content caching probability is proposed to optimize the cache placement in order to choose the most valuable neighboring node to execute placement with the lowest probability. With the optimal cache scheme, we analytically derive and numerically evaluate the cache hit probability and the average number of successfully served requests. Simulation results show that the proposed cooperative group caching strategy outperforms the existing results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信