Caching gain in interference-limited wireless networks

The authors consider the effect of caching in interference-limited wireless networks where fading is the dominant channel effect. First, the authors propose a one-hop transmission strategy for cache-enabled wireless networks, which is based on exploiting multi-user diversity gain. Then, they derive a closed-form result for throughput scaling of the proposed scheme in large networks, which reveals the inherent trade-off between cache memory size and network throughput. Their results show that substantial throughput improvements are achievable in networks with sources equipped with large cache size, compared with previous works where each transmitter could just store one file. Also, the authors provide extensive simulations through which they analyse network throughput and verify their analytical results. Their simulations suggest that the scaling results also hold true even by introducing correlation between channels, making the results more general.

[1]  Leandros Tassiulas,et al.  Asymptotic Laws for Joint Content Replication and Delivery in Wireless Networks , 2012, IEEE Transactions on Information Theory.

[2]  Seyed Pooya Shariatpanahi,et al.  One-Hop Throughput of Wireless Networks with Random Connections , 2012, IEEE Wireless Communications Letters.

[3]  Masoud Ebrahimi Tazeh Mahalleh Throughput Limits of Wireless Networks With Fading Channels , 2007 .

[4]  Giuseppe Caire,et al.  Optimal throughput-outage trade-off in wireless one-hop caching networks , 2013, 2013 IEEE International Symposium on Information Theory.

[5]  Babak Hassibi,et al.  Communication over a wireless network with random connections , 2006, IEEE Transactions on Information Theory.

[6]  Urs Niesen,et al.  Coded Caching With Nonuniform Demands , 2017, IEEE Transactions on Information Theory.

[7]  Alexandros G. Dimakis,et al.  Base-station assisted device-to-device communications for high-throughput wireless video networks , 2012, ICC.

[8]  Masoud Ebrahimi Throughput Limits of Wireless Networks With Fading Channels , 2007 .

[9]  B. Arnold,et al.  A first course in order statistics , 2008 .

[10]  Alexander M. Haimovich,et al.  Opportunistic Relaying in Wireless Networks , 2007, IEEE Transactions on Information Theory.

[11]  Seyed Pooya Shariatpanahi,et al.  Throughput of Large One-Hop Ad Hoc Wireless Networks With General Fading , 2015, IEEE Transactions on Vehicular Technology.

[12]  Alexandros G. Dimakis,et al.  Wireless device-to-device communications with distributed caching , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[13]  Jamshid Abouei,et al.  Delay-Throughput Analysis in Distributed Wireless Networks , 2009 .

[14]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[15]  Shlomo Shamai,et al.  Throughput scaling of wireless networks with random connections , 2010, IEEE Trans. Inf. Theory.

[16]  Urs Niesen,et al.  Decentralized Caching Attains Order-Optimal Memory-Rate Tradeoff , 2013, ArXiv.

[17]  Urs Niesen,et al.  Fundamental Limits of Caching , 2014, IEEE Trans. Inf. Theory.

[18]  Hamid R. Sadjadpour,et al.  On the throughput capacity of information-centric networks , 2013, Proceedings of the 2013 25th International Teletraffic Congress (ITC).

[19]  Urs Niesen,et al.  Decentralized coded caching attains order-optimal memory-rate tradeoff , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).