Limites Fondamentales De Stockage Dans Les Réseaux Sans Fil

Abstract : Caching, i.e. storing popular contents at caches available at end users, has received a significant interest as a technique to reduce the peak traffic in wireless networks. In particular, coded caching proposed by Maddah-Ali and Niesen has been considered as a promising approach to achieve a constant delivery time as the dimension grows. However, several limitations prevent its applications in practical wireless systems. Throughout the thesis, we address the limitations of classical coded caching in various wireless channels. Then, we propose novel delivery schemes that exploit opportunistically the underlying wireless channels while preserving partly the promising gain of coded caching. In the first part of the thesis, we study the achievable rate region of the erasure broadcast channel with cache and state feedback. We propose an achievable schemeand prove its optimality for special cases of interest. These results are generalized to the multi-antenna broadcast channel with state feedback. In the second part, we study the content delivery over asymmetric block-fading broadcast channels, where the channel quality varies across users and time. Assuming that user requests arrive dynamically, we design an online scheme based on queuing structure and prove that it maximizes the alpha-fair utility among all schemes restricted to decentralized placement. In the last part, we study opportunistic scheduling over the asymmetric fading broadcast channel and aim to design a scalable delivery scheme while ensuring fairness among users. We propose a simple threshold-based scheduling policy of linear complexity that requires only a one-bit feedback from each user.
Document type :
Theses
Complete list of metadatas

Cited literature [54 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01812530
Contributor : Abes Star <>
Submitted on : Monday, June 11, 2018 - 3:02:25 PM
Last modification on : Tuesday, May 14, 2019 - 8:36:55 AM
Long-term archiving on : Wednesday, September 12, 2018 - 7:37:44 PM

File

74162_GHORBEL_2018_diffusion.p...
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01812530, version 1

Citation

Asma Ghorbel. Limites Fondamentales De Stockage Dans Les Réseaux Sans Fil. Autre. Université Paris-Saclay, 2018. Français. ⟨NNT : 2018SACLC031⟩. ⟨tel-01812530⟩

Share

Metrics

Record views

232

Files downloads

174