Decentralized joint cache-channel coding over erasure broadcast channels - Archive ouverte HAL Access content directly
Conference Papers Year :

Decentralized joint cache-channel coding over erasure broadcast channels

(1) , (2, 3) , (1)
1
2
3

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.
Fichier principal
Vignette du fichier
Kamel2018.pdf (307.16 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

cea-01888842 , version 1 (05-10-2018)

Identifiers

Cite

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⟩
140 View
165 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More