Home > Research > Publications & Outputs > Achieving Optimal Diversity Gain in Buffer-Aide...

Research

Associated organisational unit

Links

Text available via DOI:

View graph of relations

Achieving Optimal Diversity Gain in Buffer-Aided Relay Networks With Small Buffer Size

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Achieving Optimal Diversity Gain in Buffer-Aided Relay Networks With Small Buffer Size. / Xu, Peng; Ding, Zhiguo; Krikidis, Ioannis et al.
In: IEEE Transactions on Vehicular Technology, Vol. 65, No. 10, 10.2016, p. 8788-8794.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Xu, P, Ding, Z, Krikidis, I & Dai, X 2016, 'Achieving Optimal Diversity Gain in Buffer-Aided Relay Networks With Small Buffer Size', IEEE Transactions on Vehicular Technology, vol. 65, no. 10, pp. 8788-8794. https://doi.org/10.1109/TVT.2015.2507360

APA

Xu, P., Ding, Z., Krikidis, I., & Dai, X. (2016). Achieving Optimal Diversity Gain in Buffer-Aided Relay Networks With Small Buffer Size. IEEE Transactions on Vehicular Technology, 65(10), 8788-8794. https://doi.org/10.1109/TVT.2015.2507360

Vancouver

Xu P, Ding Z, Krikidis I, Dai X. Achieving Optimal Diversity Gain in Buffer-Aided Relay Networks With Small Buffer Size. IEEE Transactions on Vehicular Technology. 2016 Oct;65(10):8788-8794. Epub 2015 Dec 9. doi: 10.1109/TVT.2015.2507360

Author

Xu, Peng ; Ding, Zhiguo ; Krikidis, Ioannis et al. / Achieving Optimal Diversity Gain in Buffer-Aided Relay Networks With Small Buffer Size. In: IEEE Transactions on Vehicular Technology. 2016 ; Vol. 65, No. 10. pp. 8788-8794.

Bibtex

@article{5e282dc5c14f4cdcbf6b52c912584265,
title = "Achieving Optimal Diversity Gain in Buffer-Aided Relay Networks With Small Buffer Size",
abstract = "This paper investigates the buffer-aided relay selection problem for a decode-and-forward cooperative wireless network with K relays. We propose a new relay selection scheme that incorporates the status of the relay buffers and the instantaneous strength of the wireless links. Specifically, each link is assigned with a weight related to the buffer status; then, the best relay is selected with the largest weight among all the qualified source-relay and relay-destination links. We derive the closed-form expression for the outage probability and the diversity gain by introducing several Markov chains (MCs) to model the evolution of the buffer status. The analysis shows that the proposed scheme can achieve the optimal diversity gain 2K for a small L (i.e., L ≥ 3), an improvement in comparison with the existing max-link scheme that achieves the optimal diversity gain only when L is sufficiently large, where L denotes the buffer size of each relay. The provided theoretical and numerical results confirm the performance gain of the proposed relay selection scheme over the existing max-link scheme.",
author = "Peng Xu and Zhiguo Ding and Ioannis Krikidis and Xuchu Dai",
year = "2016",
month = oct,
doi = "10.1109/TVT.2015.2507360",
language = "English",
volume = "65",
pages = "8788--8794",
journal = "IEEE Transactions on Vehicular Technology",
issn = "0018-9545",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

RIS

TY - JOUR

T1 - Achieving Optimal Diversity Gain in Buffer-Aided Relay Networks With Small Buffer Size

AU - Xu, Peng

AU - Ding, Zhiguo

AU - Krikidis, Ioannis

AU - Dai, Xuchu

PY - 2016/10

Y1 - 2016/10

N2 - This paper investigates the buffer-aided relay selection problem for a decode-and-forward cooperative wireless network with K relays. We propose a new relay selection scheme that incorporates the status of the relay buffers and the instantaneous strength of the wireless links. Specifically, each link is assigned with a weight related to the buffer status; then, the best relay is selected with the largest weight among all the qualified source-relay and relay-destination links. We derive the closed-form expression for the outage probability and the diversity gain by introducing several Markov chains (MCs) to model the evolution of the buffer status. The analysis shows that the proposed scheme can achieve the optimal diversity gain 2K for a small L (i.e., L ≥ 3), an improvement in comparison with the existing max-link scheme that achieves the optimal diversity gain only when L is sufficiently large, where L denotes the buffer size of each relay. The provided theoretical and numerical results confirm the performance gain of the proposed relay selection scheme over the existing max-link scheme.

AB - This paper investigates the buffer-aided relay selection problem for a decode-and-forward cooperative wireless network with K relays. We propose a new relay selection scheme that incorporates the status of the relay buffers and the instantaneous strength of the wireless links. Specifically, each link is assigned with a weight related to the buffer status; then, the best relay is selected with the largest weight among all the qualified source-relay and relay-destination links. We derive the closed-form expression for the outage probability and the diversity gain by introducing several Markov chains (MCs) to model the evolution of the buffer status. The analysis shows that the proposed scheme can achieve the optimal diversity gain 2K for a small L (i.e., L ≥ 3), an improvement in comparison with the existing max-link scheme that achieves the optimal diversity gain only when L is sufficiently large, where L denotes the buffer size of each relay. The provided theoretical and numerical results confirm the performance gain of the proposed relay selection scheme over the existing max-link scheme.

U2 - 10.1109/TVT.2015.2507360

DO - 10.1109/TVT.2015.2507360

M3 - Journal article

VL - 65

SP - 8788

EP - 8794

JO - IEEE Transactions on Vehicular Technology

JF - IEEE Transactions on Vehicular Technology

SN - 0018-9545

IS - 10

ER -