### Abstract

In this paper, we consider information transmission over a block Rayleigh fading channel, where a finite size buffer is employed to match the source traffic with the channel service capability. Given the buffer size, the transmission capability of a block fading Rayleigh channel is characterized from two aspects: (i) the buffer behavior when the input traffic rate is constant; and (ii) the traffic rate that can be supported by the channel for a given overflow probability constraint. For the first problem, the stationary distribution of the queue length in the buffer is derived by discretizing the queue length using a uniform quantization strategy. It is also shown that the overflow probability of the finite size buffer decreases exponentially with buffer size. An explicit upper bound on the overflow probability is also given. For the second one, a new concept of ε-overflow rate is proposed to measure the transmission capability of a block fading channel under overflow probability constraints. It will be shown that the ε-overflow rate is larger than the ε-outage capacity under the same outage constraint and will meet the great gap between outage capacity and ergodic capacity as the overflow probability constraint varies.

Original language | English |
---|---|

Pages (from-to) | 1581-1591 |

Number of pages | 11 |

Journal | Wireless Communications and Mobile Computing |

Volume | 12 |

Issue number | 18 |

DOIs | |

Publication status | Published - 25 Dec 2012 |

Externally published | Yes |

### Fingerprint

### Keywords

- ε-overflow rate
- block Rayleigh fading channel
- finite length buffer
- stationary distribution, overflow probability

### ASJC Scopus subject areas

- Information Systems
- Computer Networks and Communications
- Electrical and Electronic Engineering

### Cite this

*Wireless Communications and Mobile Computing*,

*12*(18), 1581-1591. https://doi.org/10.1002/wcm.2326

**Performance analysis for buffer-aided communication over block Rayleigh fading channels : Queue length distribution, overflow probability, and ε-overflow rate.** / Dong, Yunquan; Fan, Pingyi; Letaief, Khaled; Murch, Ross D.

Research output: Contribution to journal › Article

*Wireless Communications and Mobile Computing*, vol. 12, no. 18, pp. 1581-1591. https://doi.org/10.1002/wcm.2326

}

TY - JOUR

T1 - Performance analysis for buffer-aided communication over block Rayleigh fading channels

T2 - Queue length distribution, overflow probability, and ε-overflow rate

AU - Dong, Yunquan

AU - Fan, Pingyi

AU - Letaief, Khaled

AU - Murch, Ross D.

PY - 2012/12/25

Y1 - 2012/12/25

N2 - In this paper, we consider information transmission over a block Rayleigh fading channel, where a finite size buffer is employed to match the source traffic with the channel service capability. Given the buffer size, the transmission capability of a block fading Rayleigh channel is characterized from two aspects: (i) the buffer behavior when the input traffic rate is constant; and (ii) the traffic rate that can be supported by the channel for a given overflow probability constraint. For the first problem, the stationary distribution of the queue length in the buffer is derived by discretizing the queue length using a uniform quantization strategy. It is also shown that the overflow probability of the finite size buffer decreases exponentially with buffer size. An explicit upper bound on the overflow probability is also given. For the second one, a new concept of ε-overflow rate is proposed to measure the transmission capability of a block fading channel under overflow probability constraints. It will be shown that the ε-overflow rate is larger than the ε-outage capacity under the same outage constraint and will meet the great gap between outage capacity and ergodic capacity as the overflow probability constraint varies.

AB - In this paper, we consider information transmission over a block Rayleigh fading channel, where a finite size buffer is employed to match the source traffic with the channel service capability. Given the buffer size, the transmission capability of a block fading Rayleigh channel is characterized from two aspects: (i) the buffer behavior when the input traffic rate is constant; and (ii) the traffic rate that can be supported by the channel for a given overflow probability constraint. For the first problem, the stationary distribution of the queue length in the buffer is derived by discretizing the queue length using a uniform quantization strategy. It is also shown that the overflow probability of the finite size buffer decreases exponentially with buffer size. An explicit upper bound on the overflow probability is also given. For the second one, a new concept of ε-overflow rate is proposed to measure the transmission capability of a block fading channel under overflow probability constraints. It will be shown that the ε-overflow rate is larger than the ε-outage capacity under the same outage constraint and will meet the great gap between outage capacity and ergodic capacity as the overflow probability constraint varies.

KW - ε-overflow rate

KW - block Rayleigh fading channel

KW - finite length buffer

KW - stationary distribution, overflow probability

UR - http://www.scopus.com/inward/record.url?scp=84871721483&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84871721483&partnerID=8YFLogxK

U2 - 10.1002/wcm.2326

DO - 10.1002/wcm.2326

M3 - Article

AN - SCOPUS:84871721483

VL - 12

SP - 1581

EP - 1591

JO - Wireless Communications and Mobile Computing

JF - Wireless Communications and Mobile Computing

SN - 1530-8669

IS - 18

ER -