Decentralized joint cache-channel coding over erasure broadcast channels

Abstract : We derive upper bounds on the rate-memory trade-off of cache-aided erasure broadcast channels with K w weak receivers and K s strong receivers. We follow a decentralized placement scenario, where coordination is not needed prior to the delivery phase. We study two setups: a standard scenario without eavesdropper and a wiretap scenario with an external eavesdropper. For both scenarios, we propose joint cache-channel coding schemes that efficiently exploit the cache contents and take into consideration the users' channel characteristics at the same time. We show that the decentralized placement strategy causes only a small increase in delivery rate compared to centralized strategy. Similarly, when cache sizes are moderate, the rate is increased only slightly by securing the communication against external eavesdroppers. This is not the case when cache memories are small and large.
Document type :
Conference papers
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal-cea.archives-ouvertes.fr/cea-01888842
Contributor : Léna Le Roy <>
Submitted on : Friday, October 5, 2018 - 2:52:07 PM
Last modification on : Thursday, October 17, 2019 - 12:34:36 PM
Long-term archiving on: Sunday, January 6, 2019 - 3:43:13 PM

File

Kamel2018.pdf
Files produced by the author(s)

Identifiers

Citation

Sarah Kamel, Mireille Sarkiss, Michèle Wigger. Decentralized joint cache-channel coding over erasure broadcast channels. 2018 IEEE Middle East and North Africa Communications Conference (MENACOMM), Apr 2018, Jounieh, Lebanon. ⟨10.1109/MENACOMM.2018.8371012⟩. ⟨cea-01888842⟩

Share

Metrics

Record views

114

Files downloads

118