Achievable Rates for the Fading Half-Duplex Single Relay Selection Network Using Buffer-Aided Relaying

In the half-duplex single relay selection network, comprised of a source, M half-duplex relays, and a destination, only one relay is active at any given time, i.e., only one relay receives or transmits, and the other relays are inactive, i.e., they do not receive nor transmit. The capacity of this network, when all links are affected by independent slow time-continuous fading and additive white Gaussian noise (AWGN) , is still unknown, and only achievable average rates have been reported in the literature so far. In this paper, we present new achievable average rates for this network, which are larger than the best known average rates. These new average rates are achieved with a buffer-aided relaying protocol. Since the developed buffer-aided protocol introduces unbounded delay, we also devise a buffer-aided protocol which limits the delay at the expense of a decrease in rate. Moreover, we discuss the practical implementation of the proposed buffer-aided relaying protocols and show that they do not require more resources for channel state information acquisition than the existing relay selection protocols.

[1]  Il-Min Kim,et al.  Diversity order analysis of the decode-and-forward cooperative networks with relay selection , 2007, IEEE Transactions on Wireless Communications.

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

[3]  H. Vincent Poor,et al.  Performance of selection relaying and cooperative diversity , 2009, IEEE Transactions on Wireless Communications.

[4]  Salama Ikki,et al.  Performance analysis of adaptive decode-and-forward cooperative diversity networks with best-relay selection , 2010, IEEE Transactions on Communications.

[5]  Shang Zhi,et al.  A proof of the queueing formula: L=λW , 2001 .

[6]  Nader F. Mir,et al.  Computer and Communication Networks , 2006 .

[7]  Robert Schober,et al.  Buffer-Aided Relaying with Adaptive Link Selection , 2012, IEEE Journal on Selected Areas in Communications.

[8]  Murat Uysal,et al.  On relay selection for decode-and-forward relaying , 2009, IEEE Transactions on Wireless Communications.

[9]  John S. Thompson,et al.  Buffer-Aided Relay Selection for Cooperative Diversity Systems without Delay Constraints , 2012, IEEE Transactions on Wireless Communications.

[10]  Carl M. Harris,et al.  Fundamentals of queueing theory , 1975 .

[11]  Zhi Chen,et al.  Buffer-Aided Max-Link Relay Selection in Amplify-and-Forward Cooperative Networks , 2015, IEEE Transactions on Vehicular Technology.

[12]  J. Little A Proof for the Queuing Formula: L = λW , 1961 .

[13]  Robert Schober,et al.  Max-Max Relay Selection for Relays with Buffers , 2012, IEEE Transactions on Wireless Communications.

[14]  P. Deuflhard Newton Methods for Nonlinear Problems: Affine Invariance and Adaptive Algorithms , 2011 .

[15]  Vahid Jamali,et al.  Achievable Rate Region of the Bidirectional Buffer-Aided Relay Channel With Block Fading , 2013, IEEE Transactions on Information Theory.

[16]  Zhi Chen,et al.  Max-Ratio Relay Selection in Secure Buffer-Aided Cooperative Wireless Networks , 2014, IEEE Transactions on Information Forensics and Security.

[17]  Aria Nosratinia,et al.  Spectrally-efficient relay selection with limited feedback , 2008, IEEE Journal on Selected Areas in Communications.

[18]  Neelesh B. Mehta,et al.  Optimal timer based selection schemes , 2010, IEEE Transactions on Communications.

[19]  Yindi Jing,et al.  Single and multiple relay selection schemes and their achievable diversity orders , 2009, IEEE Transactions on Wireless Communications.

[20]  Herbert A. David,et al.  Order Statistics , 2011, International Encyclopedia of Statistical Science.

[21]  George K. Karagiannidis,et al.  Performance analysis of single relay selection in rayleigh fading , 2008, IEEE Transactions on Wireless Communications.

[22]  Robert Schober,et al.  Buffer-Aided Relaying With Adaptive Link Selection—Fixed and Mixed Rate Transmission , 2012, IEEE Transactions on Information Theory.

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

[24]  Stephen C. Graves,et al.  Little's Law , 2008 .

[25]  A. Lee Swindlehurst,et al.  Buffer-Aided Relaying for Two-Hop Secure Communication , 2015, IEEE Transactions on Wireless Communications.

[26]  Robert Schober,et al.  Throughput and Diversity Gain of Buffer-Aided Relaying , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[27]  Huaping Liu,et al.  Sum-Rate Optimization in a Two-Way Relay Network with Buffering , 2012, IEEE Communications Letters.

[28]  Robert Schober,et al.  Relay Selection for Simultaneous Information Transmission and Wireless Energy Transfer: A Tradeoff Perspective , 2013, IEEE Journal on Selected Areas in Communications.

[29]  Mohamed-Slim Alouini,et al.  Resource Allocation for Two Source-Destination Pairs Sharing a Single Relay with a Buffer , 2014, IEEE Transactions on Communications.

[30]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[31]  Lie-Liang Yang,et al.  Performance Analysis of Multihop-Diversity-Aided Multihop Links , 2012, IEEE Transactions on Vehicular Technology.