Bounds on Caching D2D Networks With Secure Delivery

Authors

Z. Awan, R. Mathar,

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.

BibTEX Reference Entry 

@inproceedings{AwMa18,
	author = {Zohaib Awan and Rudolf Mathar},
	title = "Bounds on Caching D2D Networks With Secure Delivery",
	pages = "1-5",
	booktitle = "15th International Symposium on Wireless Communications Systems (ISWCS)",
	address = {Lisbon, Portugal},
	doi = 10.1109/ISWCS.2018.8491241,
	month = Aug,
	year = 2018,
	hsb = RWTH-2018-230625,
	}

Downloads

 Download bibtex-file

Sorry, this paper is currently not available for download.