随机多用户多中继网络的安全概率缓存

Lisheng Fan, Xianfu Lei, Nan Zhao, P. Fan, G. Karagiannidis
{"title":"随机多用户多中继网络的安全概率缓存","authors":"Lisheng Fan, Xianfu Lei, Nan Zhao, P. Fan, G. Karagiannidis","doi":"10.1109/WCSP.2018.8555898","DOIUrl":null,"url":null,"abstract":"In this paper, we study a stochastic multi-user multi-relay network, where the data transmission can be overheard by multiple eavesdroppers. The users, relays and eavesdroppers are assumed to arrive at the network subject to homogeneous poisson point process (PPP). Cache equipped at the relays and users can pre-store part of file contents, which can help enhance the transmission security. Hence, it is of vital importance to design an effective secure probabilistic caching strategy to ensure the security of content transmission. To this end, we first consider several cache-aided transmission modes of self-fetch, D2D-transmission, relay-transmission, and source-transmission. We then study the network secrecy performance by analyzing the expression of secure cache throughput and an analytical lower bound. In order to maximize the secure cache throughput, we further optimize the probabilistic caching strategy by using a heuristic algorithm. Numerical results are provided to demonstrate that the proposed strategy outperforms the conventional caching strategies.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Secure Probabilistic Caching for Stochastic Multi-User Multi-Relay Networks\",\"authors\":\"Lisheng Fan, Xianfu Lei, Nan Zhao, P. Fan, G. Karagiannidis\",\"doi\":\"10.1109/WCSP.2018.8555898\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we study a stochastic multi-user multi-relay network, where the data transmission can be overheard by multiple eavesdroppers. The users, relays and eavesdroppers are assumed to arrive at the network subject to homogeneous poisson point process (PPP). Cache equipped at the relays and users can pre-store part of file contents, which can help enhance the transmission security. Hence, it is of vital importance to design an effective secure probabilistic caching strategy to ensure the security of content transmission. To this end, we first consider several cache-aided transmission modes of self-fetch, D2D-transmission, relay-transmission, and source-transmission. We then study the network secrecy performance by analyzing the expression of secure cache throughput and an analytical lower bound. In order to maximize the secure cache throughput, we further optimize the probabilistic caching strategy by using a heuristic algorithm. Numerical results are provided to demonstrate that the proposed strategy outperforms the conventional caching strategies.\",\"PeriodicalId\":423073,\"journal\":{\"name\":\"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCSP.2018.8555898\",\"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 10th International Conference on Wireless Communications and Signal Processing (WCSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCSP.2018.8555898","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文研究了一种随机多用户多中继网络,其中数据传输可能被多个窃听者窃听。假设用户、中继和窃听者均遵循均质泊松点过程(PPP)到达网络。在中继和用户处设置缓存,可以预先存储部分文件内容,有助于提高传输的安全性。因此,设计一种有效的安全概率缓存策略来保证内容传输的安全性至关重要。为此,我们首先考虑了几种缓存辅助传输模式:自获取、d2d传输、中继传输和源传输。然后通过分析安全缓存吞吐量的表达式和分析下界来研究网络的保密性能。为了使安全缓存吞吐量最大化,我们使用启发式算法进一步优化了概率缓存策略。数值结果表明,该策略优于传统的缓存策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Secure Probabilistic Caching for Stochastic Multi-User Multi-Relay Networks
In this paper, we study a stochastic multi-user multi-relay network, where the data transmission can be overheard by multiple eavesdroppers. The users, relays and eavesdroppers are assumed to arrive at the network subject to homogeneous poisson point process (PPP). Cache equipped at the relays and users can pre-store part of file contents, which can help enhance the transmission security. Hence, it is of vital importance to design an effective secure probabilistic caching strategy to ensure the security of content transmission. To this end, we first consider several cache-aided transmission modes of self-fetch, D2D-transmission, relay-transmission, and source-transmission. We then study the network secrecy performance by analyzing the expression of secure cache throughput and an analytical lower bound. In order to maximize the secure cache throughput, we further optimize the probabilistic caching strategy by using a heuristic algorithm. Numerical results are provided to demonstrate that the proposed strategy outperforms the conventional caching strategies.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信