Abstract

Content caching at the network edge is emerging as a useful solution to mitigate the capacity bottleneck in modern communication architectures. In this work, we study the problem of secure transmission over a caching D2D network where the users can prefetch a portion of popular files in their local cache. Afterwards, users make random request from the library of available files and interact with each other to deliver requested contents from the local cache to satisfy their demands. The communication between the users is wiretapped by an external eavesdropper from whom the communication needs to be kept secret. For this model, we establish a lower bound on the secure transmission rate. Next, we show that the ratio between lower and upper bounds on secure transmission rate as a function of cache memory is bounded within constant multiplicative gap.

Full Text

Published Version

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.