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.

Cache-aided data delivery over erasure broadcast channels / Mohammadi Amiri, M.; Gunduz, D.. - (2017), pp. 1-6. ((Intervento presentato al convegno 2017 IEEE International Conference on Communications, ICC 2017 tenutosi a fra nel 2017 [10.1109/ICC.2017.7996417].

I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Powered by IRIS-about IRIS-Utilizzo dei cookie

 Copyright © 2022