TUTCRIS - Tampereen teknillinen yliopisto

TUTCRIS

A comparative study of relaying schemes with decode-and-forward over Nakagami$-m$ fading channels

Tutkimustuotosvertaisarvioitu

Standard

A comparative study of relaying schemes with decode-and-forward over Nakagami$-m$ fading channels. / Alexandropoulos, George C.; Papadogiannis, Agisilaos; Sofotasios, Paschalis.

julkaisussa: Journal of Computer Networks and Communications, 2011.

Tutkimustuotosvertaisarvioitu

Harvard

Alexandropoulos, GC, Papadogiannis, A & Sofotasios, P 2011, 'A comparative study of relaying schemes with decode-and-forward over Nakagami$-m$ fading channels', Journal of Computer Networks and Communications.

APA

Alexandropoulos, G. C., Papadogiannis, A., & Sofotasios, P. (2011). A comparative study of relaying schemes with decode-and-forward over Nakagami$-m$ fading channels. Journal of Computer Networks and Communications, [560528].

Vancouver

Alexandropoulos GC, Papadogiannis A, Sofotasios P. A comparative study of relaying schemes with decode-and-forward over Nakagami$-m$ fading channels. Journal of Computer Networks and Communications. 2011. 560528.

Author

Alexandropoulos, George C. ; Papadogiannis, Agisilaos ; Sofotasios, Paschalis. / A comparative study of relaying schemes with decode-and-forward over Nakagami$-m$ fading channels. Julkaisussa: Journal of Computer Networks and Communications. 2011.

Bibtex - Lataa

@article{bc75d2b90b3e424299adc797ce4c0985,
title = "A comparative study of relaying schemes with decode-and-forward over Nakagami$-m$ fading channels",
abstract = "Although relaying can be very beneficial for wireless systems, understanding which relaying schemes can achieve specific performance objectives under realistic fading is crucial. In this paper we present a general framework for modeling and evaluating the performance of dual-hop decode-and-forward (DF) relaying schemes over independent and not necessarily identically distributed (INID) Nakagami-m fading channels. We obtain closed-form expressions for the statistics of the instantaneous output signal-to-noise ratio of repetitive transmission with selection diversity. Furthermore, we present a unified statistical overview of other three significant relaying schemes with DF, one based on repetitive transmission with maximal-ratio diversity and the other two based on relay selection (RS). To compare the considered schemes, we present closed-form and analytical expressions for the outage probability and the average symbol error probability under various modulation methods, respectively. Importantly, it is shown that when the channel state information for RS is perfect, RS-based schemes always outperform repetitive ones. Furthermore, when the direct link between the source and the destination nodes is sufficiently strong, relaying may not result in any gains, and it should be switched off.",
author = "Alexandropoulos, {George C.} and Agisilaos Papadogiannis and Paschalis Sofotasios",
year = "2011",
language = "English",
journal = "Journal of Computer Networks and Communications",
issn = "2090-7141",
publisher = "Hindawi Publishing Corporation",

}

RIS (suitable for import to EndNote) - Lataa

TY - JOUR

T1 - A comparative study of relaying schemes with decode-and-forward over Nakagami$-m$ fading channels

AU - Alexandropoulos, George C.

AU - Papadogiannis, Agisilaos

AU - Sofotasios, Paschalis

PY - 2011

Y1 - 2011

N2 - Although relaying can be very beneficial for wireless systems, understanding which relaying schemes can achieve specific performance objectives under realistic fading is crucial. In this paper we present a general framework for modeling and evaluating the performance of dual-hop decode-and-forward (DF) relaying schemes over independent and not necessarily identically distributed (INID) Nakagami-m fading channels. We obtain closed-form expressions for the statistics of the instantaneous output signal-to-noise ratio of repetitive transmission with selection diversity. Furthermore, we present a unified statistical overview of other three significant relaying schemes with DF, one based on repetitive transmission with maximal-ratio diversity and the other two based on relay selection (RS). To compare the considered schemes, we present closed-form and analytical expressions for the outage probability and the average symbol error probability under various modulation methods, respectively. Importantly, it is shown that when the channel state information for RS is perfect, RS-based schemes always outperform repetitive ones. Furthermore, when the direct link between the source and the destination nodes is sufficiently strong, relaying may not result in any gains, and it should be switched off.

AB - Although relaying can be very beneficial for wireless systems, understanding which relaying schemes can achieve specific performance objectives under realistic fading is crucial. In this paper we present a general framework for modeling and evaluating the performance of dual-hop decode-and-forward (DF) relaying schemes over independent and not necessarily identically distributed (INID) Nakagami-m fading channels. We obtain closed-form expressions for the statistics of the instantaneous output signal-to-noise ratio of repetitive transmission with selection diversity. Furthermore, we present a unified statistical overview of other three significant relaying schemes with DF, one based on repetitive transmission with maximal-ratio diversity and the other two based on relay selection (RS). To compare the considered schemes, we present closed-form and analytical expressions for the outage probability and the average symbol error probability under various modulation methods, respectively. Importantly, it is shown that when the channel state information for RS is perfect, RS-based schemes always outperform repetitive ones. Furthermore, when the direct link between the source and the destination nodes is sufficiently strong, relaying may not result in any gains, and it should be switched off.

M3 - Article

JO - Journal of Computer Networks and Communications

JF - Journal of Computer Networks and Communications

SN - 2090-7141

M1 - 560528

ER -