Cache-aided data delivery over erasure broadcast channels
File(s)MAG_ICC17.pdf (148.85 KB)
Accepted version
Author(s)
Amiri, MM
Gunduz, D
Type
Conference Paper
Abstract
A cache-aided erasure broadcast channel is studied. The receivers are divided into two sets: the weak and strong receivers, where the receivers in the same set all have the same erasure probability. The weak receivers, in order to compensate for the high erasure probability, are equipped with cache memories of equal size, while the receivers in the strong set have no caches. Data can be pre-delivered to weak receivers' caches over the off-peak traffic period before the receivers reveal their demands. A joint caching and channel coding scheme is proposed such that all the receivers, even the receivers without any cache memories, benefit from the presence of caches across the network. The trade-off between the cache size and the achievable rate is studied, and it is shown that the proposed scheme significantly improves the achievable trade-off upon the state-of-the-art.
Date Issued
2017-07-31
Date Acceptance
2017-05-21
Citation
IEEE International Conference on Communications, 2017
ISBN
9781467389990
ISSN
1550-3607
Publisher
IEEE
Journal / Book Title
IEEE International Conference on Communications
Copyright Statement
© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Sponsor
Commission of the European Communities
Commission of the European Communities
Grant Number
690893
677854
Source
2017 IEEE International Conference on Communications (ICC)
Publication Status
Published
Start Date
2017-05-21
Finish Date
2017-05-25
Coverage Spatial
Paris, France
Date Publish Online
2017-07-31