English
Related papers

Related papers: Caching and Coded Delivery over Gaussian Broadcast…

200 papers

Coded-caching is a promising technique to reduce the peak rate requirement of backhaul links during high traffic periods. In this letter, we study the effect of adaptive transmission on the performance of coded-caching based networks.…

Information Theory · Computer Science 2021-03-15 Behrooz Makki , Mohamed-Slim Alouini

Caching contents at the network edge is an efficient mean for offloading traffic, reducing latency and improving users' quality-of-experience. In this letter, we focus on aspects of storage-bandwidth tradeoffs in which small cell base…

Information Theory · Computer Science 2016-11-18 Syed Tamoor-ul-Hassan , Mehdi Bennis , Pedro H. J. Nardelli , Matti Latva-Aho

Caching is popular technique in content delivery networks that allows for reductions in transmission rates from the content-hosting server to the end users. Coded caching is a generalization of conventional caching that considers the…

Information Theory · Computer Science 2016-07-28 Li Tang , Aditya Ramamoorthy

In this work, we investigate the minimum energy of transmitting correlated sources over the Gaussian multiple-access channel (MAC). Compared to other works on joint source-channel coding, we consider the general scenario where the source…

Information Theory · Computer Science 2013-01-21 Nan Jiang , Yang Yang , Anders Høst-Madsen , Zixiang Xiong

We consider the problem of delivering content cached in a wireless network of n nodes randomly located on a square of area n. The network performance is described by the n2^n-dimensional caching capacity region of the wireless network. We…

Information Theory · Computer Science 2012-09-28 Urs Niesen , Devavrat Shah , Gregory Wornell

This paper studies the fundamental limits of content delivery in a cache-aided broadcast network for correlated content generated by a discrete memoryless source with arbitrary joint distribution. Each receiver is equipped with a cache of…

Information Theory · Computer Science 2018-06-20 Parisa Hassanzadeh , Antonia M. Tulino , Jaime Llorca , Elza Erkip

This paper studies the fundamental limits of the shared-link coded caching problem with correlated files, where a server with a library of $N$ files communicates with $K$ users who can locally cache $M$ files. Given an integer $r \in [N]$,…

Information Theory · Computer Science 2021-06-15 Kai Wan , Daniela Tuninetti , Mingyue Ji , Giuseppe Caire

Coded caching techniques have received significant attention lately due to their provable gains in reducing the cost of data delivery in wireless networks. These gains, however, have only been demonstrated under the assumption of a free…

Information Theory · Computer Science 2020-03-26 Yousef AlHassoun , Faisal Alotaibi , Aly El Gamal , Hesham El Gamal

The capacity of caching networks has received considerable attention in the past few years. A particularly studied setting is the shared link caching network, in which a single source with access to a file library communicates with multiple…

Information Theory · Computer Science 2015-11-25 Mingyue Ji , Antonia Tulino , Jaime Llorca , Giuseppe Caire

This paper studies the decentralized coded caching for a Fog Radio Access Network (F-RAN), whereby two edge-nodes (ENs) connected to a cloud server via fronthaul links with limited capacity are serving the requests of $K_r$ users. We…

Information Theory · Computer Science 2018-05-01 Antonious M. Girgis , Ozgur Ercetin , Mohammed Nafie , Tamer ElBatt

This work concerns the behavior of "good" (capacity achieving) codes in several multi-user settings in the Gaussian regime, in terms of their minimum mean-square error (MMSE) behavior. The settings investigated in this context include the…

Information Theory · Computer Science 2015-02-26 Ronit Bustin , Rafael F. Schaefer , H. Vincent Poor , Shlomo Shamai

We consider a cache-enabled K-user broadcast erasure packet channel in which a server with a library of N files wishes to deliver a requested file to each user who is equipped with a cache of a finite memory M. Assuming that the transmitter…

Information Theory · Computer Science 2015-09-08 Asma Ghorbel , Mari Kobayashi , Sheng Yang

Network densification with small cell base stations is a promising solution to satisfy future data traffic demands. However, increasing small cell base station density alone does not ensure better users quality-of-experience and incurs high…

Information Theory · Computer Science 2015-07-02 Syed Tamoor-ul-Hassan , Mehdi Bennis , Pedro H. J. Nardelli , Matti Latva-Aho

The rate performance of wireless coded caching schemes is typically limited by the lowest achievable per-user rate in the given multicast group, during each transmission time slot. In this paper, we provide a new coded caching scheme,…

Information Theory · Computer Science 2020-03-05 MohammadJavad Salehi , Antti Tölli , Seyed Pooya Shariatpanahi

We consider a server connected to $L$ users over a shared finite capacity link. Each user is equipped with a cache. File requests at the users are generated as independent Poisson processes according to a popularity profile from a library…

Performance · Computer Science 2018-04-30 Mahadesh Panju , Ramkumar Raghu , Vinod Sharma , Rajesh Ramachandran

This paper studies the fundamental limits of caching in a network with two receivers and two files generated by a two-component discrete memoryless source with arbitrary joint distribution. Each receiver is equipped with a cache of equal…

Information Theory · Computer Science 2017-05-15 Parisa Hassanzadeh , Antonia Tulino , Jaime Llorca , Elza Erkip

Low-capacity scenarios have become increasingly important in the technology of the Internet of Things (IoT) and the next generation of wireless networks. Such scenarios require efficient and reliable transmission over channels with an…

Information Theory · Computer Science 2023-02-07 Mohammad Fereydounian , Hamed Hassani , Mohammad Vahid Jamali , Hessam Mahdavifar

The fifth generation wireless networks must provide fast and reliable connectivity while coping with the ongoing traffic growth. It is of paramount importance that the required resources, such as energy and bandwidth, do not scale with…

Information Theory · Computer Science 2016-11-17 Maria Gregori , Jesús Gómez-Vilardebó , Javier Matamoros , Deniz Gündüz

The capacity of a complex and discrete-time memoryless additive white Gaussian noise (AWGN) channel under three constraints, namely, input average power, input amplitude and output delivered power is studied. The output delivered power…

Information Theory · Computer Science 2020-04-27 Morteza Varasteh , Borzoo Rassouli , Bruno Clerckx

This work focuses on quality adaptation as a means to counter the effects of channel degradation in wireless, cache-aided channels. We design a delivery scheme which combines coded caching, superposition coding, and scalable source coding,…

Information Theory · Computer Science 2024-03-05 Eleftherios Lampiris , Giuseppe Caire