Buffer-Aided Relaying With Adaptive Link Selection—Fixed and Mixed Rate Transmission

We consider a simple network consisting of a source, a half-duplex decode-and-forward relay with a buffer, and a destination. We assume that the direct source-destination link is not available and all links undergo fading. We propose two new buffer-aided relaying schemes with different requirements regarding the availability of channel state information at the transmitter (CSIT). In the first scheme, neither the source nor the relay has full CSIT, and consequently, both nodes are forced to transmit with fixed rates. In contrast, in the second scheme, the source does not have full CSIT and transmits with fixed rate but the relay has full CSIT and adapts its transmission rate accordingly. In the absence of delay constraints, for both fixed rate and mixed rate transmission, we derive the throughput-optimal buffer-aided relaying protocols which select either the source or the relay for transmission based on the instantaneous signal-to-noise ratios (SNRs) of the source-relay and relay-destination links. In addition, for the delay constrained case, we develop buffer-aided relaying protocols that achieve a predefined average delay. Compared to conventional relaying protocols, which select the transmitting node according to a predefined schedule independent of the instantaneous link SNRs, the proposed buffer-aided protocols with adaptive link selection achieve large performance gains. In particular, for fixed rate transmission, we show that the proposed protocol achieves a diversity gain of two as long as an average delay of more than three time slots can be afforded. Furthermore, for mixed rate transmission with an average delay of E{T} time slots, a multiplexing gain of r=1-1/ (2E{T}) is achieved. As a by-product of the considered link-adaptive protocols, we also develop a novel conventional relaying protocol for mixed rate transmission, which yields the same multiplexing gain as the protocol with adaptive link selection. Hence, for mixed rate transmission, for sufficiently large average delays, buffer-aided half-duplex relaying with and without adaptive link selection does not suffer from a multiplexing gain loss compared to full-duplex relaying.

[1]  Remo Guidieri Res , 1995, RES: Anthropology and Aesthetics.

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

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

[4]  H. Vincent Poor,et al.  Buffering in a Three-Node Relay Network , 2008, IEEE Transactions on Wireless Communications.

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

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

[7]  Robert Schober,et al.  Buffer-aided relaying with mixed rate transmission , 2012, 2012 8th International Wireless Communications and Mobile Computing Conference (IWCMC).

[8]  Meixia Tao,et al.  Joint Scheduling and Relay Selection in One- and Two-Way Relay Networks with Buffering , 2009, 2009 IEEE International Conference on Communications.

[9]  Philip Levis,et al.  Practical, real-time, full duplex wireless , 2011, MobiCom.

[10]  Feng Xue,et al.  Cooperation in a Half-Duplex Gaussian Diamond Relay Channel , 2007, IEEE Transactions on Information Theory.

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

[12]  Aria Nosratinia,et al.  Cooperative communication in wireless networks , 2004, IEEE Communications Magazine.

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

[14]  E. Meulen,et al.  Three-terminal communication channels , 1971, Advances in Applied Probability.

[15]  Kaibin Huang,et al.  A new scaling law on throughput and delay performance of wireless mobile relay networks over parallel fading channels , 2009, 2009 IEEE International Symposium on Information Theory.

[16]  Leandros Tassiulas,et al.  Resource Allocation and Cross-Layer Control in Wireless Networks , 2006, Found. Trends Netw..

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

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

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

[20]  R. M. Loynes,et al.  The stability of a queue with non-independent inter-arrival and service times , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.

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

[22]  Gaston H. Gonnet,et al.  On the LambertW function , 1996, Adv. Comput. Math..

[23]  Elza Erkip,et al.  User cooperation diversity. Part I. System description , 2003, IEEE Trans. Commun..

[24]  H. Vincent Poor,et al.  Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution , 2007, IEEE Transactions on Information Theory.

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

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

[27]  Matthew R. McKay,et al.  On the Position Selection of Relays in Diamond Relay Networks , 2011, IEEE Transactions on Communications.

[28]  Aria Nosratinia,et al.  Diversity through coded cooperation , 2006, IEEE Transactions on Wireless Communications.

[29]  Lie-Liang Yang,et al.  Multihop Diversity - A Precious Source of Fading Mitigation in Multihop Wireless Networks , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[30]  Anders Høst-Madsen,et al.  Capacity bounds and power allocation for wireless relay channels , 2005, IEEE Transactions on Information Theory.

[31]  Elza Erkip,et al.  User cooperation diversity. Part II. Implementation aspects and performance analysis , 2003, IEEE Trans. Commun..