Mobility increases throughput of wireless device-to-device networks with coded caching

The demand for multimedia services in modern networks has experienced exponential growth in recent years and it is expected to dominate the mobile traffic in near future. On the other hand, the link capacity of mobile networks is limited due to the scarce wireless resources. Caching is a popular technique that uses available storage capability of the mobile devices to relieve this traffic tension in high peak hours of network operation. In this paper, we investigate the effect of mobility on a wireless device-to-device (D2D) coded caching architecture. Coded caching is a technique in which library files are split into sub-files and any combination of sub-files can be cached at devices and exchanged between them later. We consider two mobility models for our network architecture and study the effect of mobility on the throughput of the network. We show that, in contrast to the static scenario, by exploiting the mobility in a D2D coded caching network, the coded multi-casting gain and the spatial reuse gain can be attained simultaneously, in terms of the throughput scaling law.

[1]  Leandros Tassiulas,et al.  Mobility Support Through Caching in Content-Based Publish/Subscribe Networks , 2010, 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing.

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

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

[4]  Xuemin Shen,et al.  Hierarchical Cooperation in Ad Hoc Networks: Optimal Clustering and Achievable Throughput , 2009, IEEE Transactions on Information Theory.

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

[6]  Chaitanya Swamy,et al.  Approximation Algorithms for Data Placement Problems , 2008, SIAM J. Comput..

[7]  S. RaijaSulthana Distributed caching algorithms for content distribution networks , 2015 .

[8]  George C. Polyzos,et al.  Proactive selective neighbor caching for enhancing mobility support in information-centric networks , 2012, ICN '12.

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

[10]  Thomas Kunz,et al.  Extending mobility to publish/subscribe systems using a pro-active caching approach , 2010, Mob. Inf. Syst..

[11]  Mehdi Bennis,et al.  Living on the edge: The role of proactive caching in 5G wireless networks , 2014, IEEE Communications Magazine.

[12]  George C. Polyzos,et al.  A Selective Neighbor Caching Approach for Supporting Mobility in Publish/Subscribe Networks ? , 2010 .

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

[14]  Urs Niesen,et al.  Online coded caching , 2014, ICC.

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