On the Diversity–Multiplexing Tradeoff in Multiple-Relay Network

This paper studies the setup of a multiple-relay network in which K half-duplex multiple-antenna relays assist in the transmission between either one or several multiple-antenna transmitter(s) and a multiple-antenna receiver. Each two nodes are assumed to be either connected through a quasi-static Rayleigh-fading channel, or disconnected. We propose a new scheme, which we call random sequential (RS), based on the amplify-and-forward relaying. We prove that for general multiple-antenna multiple-relay networks, the proposed scheme achieves the maximum diversity gain. Furthermore, we derive diversity-multiplexing tradeoff (DMT) of the proposed RS scheme for general single-antenna multiple-relay networks. It is shown that for single-antenna two-hop multiple-access multiple-relay (K > 1) networks (without direct link between the transmitter(s) and the receiver), the proposed RS scheme achieves the optimum DMT. However, for the case of multiple-access single-relay setup, we show that the RS scheme reduces to the naive amplify-and-forward (AF) relaying and is not optimum in terms of DMT, while the dynamic decode-and-forward (DF) scheme is shown to be optimum for this scenario.

[1]  Helmut Bölcskei,et al.  Crystallization in Large Wireless Networks , 2007, IEEE Transactions on Information Theory.

[2]  Antonia Maria Tulino,et al.  Random Matrix Theory and Wireless Communications , 2004, Found. Trends Commun. Inf. Theory.

[3]  Panganamala Ramana Kumar,et al.  A network information theory for wireless communication: scaling laws and optimal operation , 2004, IEEE Transactions on Information Theory.

[4]  P. Vijay Kumar,et al.  Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design , 2008, ArXiv.

[5]  Patrick Mitran,et al.  Space-time diversity enhancements using collaborative communications , 2005, IEEE Transactions on Information Theory.

[6]  Aggelos Bletsas,et al.  A simple Cooperative diversity method based on network path selection , 2005, IEEE Journal on Selected Areas in Communications.

[7]  Shlomo Shamai,et al.  Transmitting to colocated users in wireless ad hoc and sensor networks , 2005, IEEE Transactions on Information Theory.

[8]  Gregory W. Wornell,et al.  Cooperative diversity in wireless networks: Efficient protocols and outage behavior , 2004, IEEE Transactions on Information Theory.

[9]  Alireza Bayesteh,et al.  Asymptotic Analysis of Amplify and Forward Relaying in a Parallel MIMO Relay Network , 2007, IEEE Transactions on Information Theory.

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

[11]  Alireza Bayesteh,et al.  Optimum Diversity-Multiplexing Tradeoff in the Multiple Relays Network , 2007, ArXiv.

[12]  Panganamala Ramana Kumar,et al.  An achievable rate for the multiple-level relay channel , 2005, IEEE Transactions on Information Theory.

[13]  Elza Erkip,et al.  Multiple-Antenna Cooperative Wireless Systems: A Diversity–Multiplexing Tradeoff Perspective , 2007, IEEE Transactions on Information Theory.

[14]  Frank Harary,et al.  Graph Theory , 2016 .

[15]  Philip Schniter,et al.  On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels , 2005, IEEE Transactions on Information Theory.

[16]  Lizhong Zheng,et al.  Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels , 2003, IEEE Trans. Inf. Theory.

[17]  David Tse,et al.  Outage Capacity of the Fading Relay Channel in the Low-SNR Regime , 2006, IEEE Transactions on Information Theory.

[18]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[19]  N. Supérieure Towards the Optimal Amplify-and-Forward Cooperative Diversity Scheme , 2007 .

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

[21]  Helmut Bölcskei,et al.  Capacity scaling laws in MIMO relay networks , 2006, IEEE Transactions on Wireless Communications.

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

[23]  Michael Gastpar,et al.  On the capacity of large Gaussian relay networks , 2005, IEEE Transactions on Information Theory.

[24]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[25]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

[26]  Jean-Claude Belfiore,et al.  Towards the Optimal Amplify-and-Forward Cooperative Diversity Scheme , 2006, IEEE Transactions on Information Theory.

[27]  Michael Gastpar,et al.  Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.

[28]  Michael Gastpar,et al.  The multiple-relay channel: coding and antenna-clustering capacity , 2002, Proceedings IEEE International Symposium on Information Theory,.

[29]  Helmut Bölcskei,et al.  Distributed orthogonalization in large interference relay networks , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

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

[31]  Suhas N. Diggavi,et al.  A Deterministic Approach to Wireless Relay Networks , 2007, ArXiv.