Beyond cut-set bounds - the approximate capacity of D2D networks

Device-to-Device (D2D) communication is emerging as a viable solution for alleviating the severe capacity crunch in content-centric wireless networks. D2D encourages backhaul-free communication directly between devices with similar content requirements grouped into clusters. In this work, a self-sustaining D2D network is considered, where a set of commonly requested files are completely stored within the collective devices memories in a cluster and file requests from devices are serviced by local inter-device multicast transmissions. For such a network, new information theoretic converse results are developed, in the form of a lower bound on the minimum D2D multicast rate as a function of the storage per device. The proposed converse is then used to characterize the approximate tradeoff between the device storage and D2D multicast rate to within a constant multiplicative gap of 8.

[1]  Giuseppe Caire,et al.  Fundamental limits of distributed caching in D2D wireless networks , 2013, 2013 IEEE Information Theory Workshop (ITW).

[2]  Urs Niesen,et al.  Online Coded Caching , 2013, IEEE/ACM Transactions on Networking.

[3]  Giuseppe Caire,et al.  Fundamental Limits of Caching in Wireless D2D Networks , 2014, IEEE Transactions on Information Theory.

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

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

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

[7]  R. Michael Buehrer,et al.  Learning distributed caching strategies in small cell networks , 2014, 2014 11th International Symposium on Wireless Communications Systems (ISWCS).

[8]  T. Charles Clancy,et al.  Fundamental Limits of Caching With Secure Delivery , 2013, IEEE Transactions on Information Forensics and Security.

[9]  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).

[10]  Urs Niesen,et al.  Fundamental limits of caching , 2012, 2013 IEEE International Symposium on Information Theory.

[11]  T. Charles Clancy,et al.  Decentralized caching with secure delivery , 2014, 2014 IEEE International Symposium on Information Theory.

[12]  T. Charles Clancy,et al.  Secure caching with non-uniform demands , 2014, 2014 4th International Conference on Wireless Communications, Vehicular Technology, Information Theory and Aerospace & Electronic Systems (VITAE).

[13]  Alexandros G. Dimakis,et al.  FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers , 2013, IEEE Transactions on Information Theory.

[14]  Alexandros G. Dimakis,et al.  FemtoCaching: Wireless video content delivery through distributed caching helpers , 2011, 2012 Proceedings IEEE INFOCOM.

[15]  Giuseppe Caire,et al.  Wireless Device-to-Device Caching Networks: Basic Principles and System Performance , 2013, IEEE Journal on Selected Areas in Communications.