Degrees of Freedom in Cached MIMO Relay Networks

It is well known that conventional cooperative relay schemes cannot provide Degrees of Freedom (DoF) gains due to the cut-set bound. In this paper, we propose a physical layer (PHY) caching scheme for relay networks to achieve DoF gains over conventional relay schemes. By properly caching some popular content at the relay station (RS), the proposed PHY caching can opportunistically transform the unfavorable relay channel topology into a more favorable MIMO broadcast channel topology (cache-induced MIMO cooperation opportunity) and enjoy a large DoF gain. Specifically, we first propose a maximum distance separable (MDS) coded PHY caching scheme to significantly improve the MIMO cooperation opportunity induced by PHY caching. Then we propose a global optimal cache content placement solution to maximize the DoF gain. We also propose a low complexity cache content placement algorithm to find a near-optimal solution without explicit knowledge of the popularity of the content files. Finally, we quantify the DoF gain w.r.t. some important system parameters. Simulations show that the proposed scheme can achieve significant throughput gains over various baselines.

[1]  Aylin Yener,et al.  Degrees of Freedom for the MIMO Multi-Way Relay Channel , 2013, IEEE Transactions on Information Theory.

[2]  Mohamed Hefeeda,et al.  Traffic Modeling and Proportional Partial Caching for Peer-to-Peer Systems , 2008, IEEE/ACM Transactions on Networking.

[3]  R. Pasupathy,et al.  A Guide to Sample Average Approximation , 2015 .

[4]  Helmut Bölcskei,et al.  Fading relay channels: performance limits and space-time signal design , 2004, IEEE Journal on Selected Areas in Communications.

[5]  Harold P. Benson,et al.  Concave Minimization: Theory, Applications and Algorithms , 1995 .

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

[7]  Alexander Shapiro,et al.  Lectures on Stochastic Programming: Modeling and Theory , 2009 .

[8]  Bo Wang,et al.  On the capacity of MIMO relay channels , 2005, IEEE Transactions on Information Theory.

[9]  Syed Ali Jafar,et al.  Degrees of Freedom of Wireless Networks With Relays, Feedback, Cooperation, and Full Duplex Operation , 2009, IEEE Transactions on Information Theory.

[10]  Khaled Ben Letaief,et al.  Optimal Cooperative Beamforming Design for MIMO Decode-and-Forward Relay Channels , 2014, IEEE Transactions on Signal Processing.

[11]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[12]  Jian-Kang Zhang,et al.  The Amplify-and-Forward Half-Duplex Cooperative System: Pairwise Error Probability and Precoder Design , 2007, IEEE Transactions on Signal Processing.

[13]  G. Barish,et al.  World Wide Web caching: trends and techniques , 2000, IEEE Commun. Mag..

[14]  Antal Majthay,et al.  Quasi-concave minimization subject to linear constraints , 1974, Discret. Math..

[15]  Zixiang Xiong,et al.  A Rateless Coded Protocol for Half-Duplex Wireless Relay Channels , 2010, IEEE Transactions on Signal Processing.

[16]  Toshihiko Yamakami,et al.  A Zipf-Like Distribution of Popularity and Hits in the Mobile Web Pages with Short Life Time , 2006, 2006 Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'06).

[17]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).