Secure coded caching in wireless ad hoc networks

Mohsen Karimzadeh Kiskani, H. Sadjadpour
{"title":"Secure coded caching in wireless ad hoc networks","authors":"Mohsen Karimzadeh Kiskani, H. Sadjadpour","doi":"10.1109/ICCNC.2017.7876159","DOIUrl":null,"url":null,"abstract":"A decentralized coded caching technique is introduced for wireless ad hoc networks in which all the existing contents are randomly combined and cached. The scaling behavior of the network is studied in terms of both capacity and security. Proactive and reactive routing techniques for coded caching are presented and the scaling capacity of the network for each case is derived. It has been shown that by using reactive routing, any content can be retrieved by selecting a random path while providing asymptotic optimum solution. The proposed coded caching significantly simplifies the routing protocol in cached networks. We further prove that asymptotic perfect secrecy can be achieved using proposed coded caching scheme.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Computing, Networking and Communications (ICNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCNC.2017.7876159","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

A decentralized coded caching technique is introduced for wireless ad hoc networks in which all the existing contents are randomly combined and cached. The scaling behavior of the network is studied in terms of both capacity and security. Proactive and reactive routing techniques for coded caching are presented and the scaling capacity of the network for each case is derived. It has been shown that by using reactive routing, any content can be retrieved by selecting a random path while providing asymptotic optimum solution. The proposed coded caching significantly simplifies the routing protocol in cached networks. We further prove that asymptotic perfect secrecy can be achieved using proposed coded caching scheme.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
无线自组织网络中的安全编码缓存
针对无线自组织网络中所有现有内容的随机组合和缓存,提出了一种分散编码缓存技术。从容量和安全性两个方面研究了网络的扩展行为。提出了用于编码缓存的主动和被动路由技术,并推导了每种情况下网络的扩展容量。结果表明,利用无功路由,在提供渐近最优解的同时,可以通过选择随机路径来检索任意内容。所提出的编码缓存大大简化了缓存网络中的路由协议。进一步证明了所提出的编码缓存方案可以实现渐近完全保密。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A game-theoretic analysis of energy-depleting jamming attacks Overlapping user grouping in IoT oriented massive MIMO systems Towards zero packet loss with LISP Mobile Node Social factors for data sparsity problem of trust models in MANETs An approach to online network monitoring using clustered patterns
×
引用
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