Opportunistic Content Delivery in Fading Broadcast Channels

Asma Ghorbel, Khac Hoang Ngo, Richard Combes, Mari Kobayashi, Sheng Yang

Research output: Contribution to journalConference articlepeer-review

11 Scopus citations

Abstract

We consider content delivery over fading broadcast channels. A server wants to transmit K files to K users, each equipped with a cache of finite size. Using the coded caching scheme of Maddah-Ali and Niesen, we design an opportunistic delivery scheme where the long-term sum content delivery rate scales with the number of users in the system. The proposed delivery scheme combines superposition coding together with appropriate power allocation across sub-files intended to different subsets of users. We analyze the long- term average sum content delivery rate achieved by two special cases of our scheme: 1) a selection scheme that chooses the subset of users with the largest weighted rate, and 2) a baseline scheme that transmits to all K users using the scheme of Maddah-Ali and Niesen. We prove that coded caching with appropriate user selection is scalable since it yields a linear increase of the average sum content delivery rate.

Original languageEnglish
Pages (from-to)1-6
Number of pages6
JournalProceedings - IEEE Global Communications Conference, GLOBECOM
Volume2018-January
DOIs
StatePublished - 2017
Externally publishedYes
Event2017 IEEE Global Communications Conference, GLOBECOM 2017 - Singapore, Singapore
Duration: 4 Dec 20178 Dec 2017

Fingerprint

Dive into the research topics of 'Opportunistic Content Delivery in Fading Broadcast Channels'. Together they form a unique fingerprint.

Cite this