Home > Research > Publications & Outputs > Novel spectral efficient cooperative relaying p...
View graph of relations

Novel spectral efficient cooperative relaying protocols with low communication overhead

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Novel spectral efficient cooperative relaying protocols with low communication overhead. / Haghighi, Ali A.; Navaie, Keivan.
In: IET Communications, Vol. 5, No. 14, 23.09.2011, p. 2009-2017.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

APA

Vancouver

Haghighi AA, Navaie K. Novel spectral efficient cooperative relaying protocols with low communication overhead. IET Communications. 2011 Sept 23;5(14):2009-2017. doi: 10.1049/iet-com.2010.0675

Author

Haghighi, Ali A. ; Navaie, Keivan. / Novel spectral efficient cooperative relaying protocols with low communication overhead. In: IET Communications. 2011 ; Vol. 5, No. 14. pp. 2009-2017.

Bibtex

@article{3d0e8926f4684177a52d2da2efe11b46,
title = "Novel spectral efficient cooperative relaying protocols with low communication overhead",
abstract = "In this study, the authors propose two high spectral efficient relaying protocols with low communication overhead including: the priority-based relay selection (PRS), and the priority-based relay selection with incremental transmission (PRSIT). Relay selection and scheduling are integrated in the proposed protocols to achieve full diversity order as well as high spectral efficiency. The authors then define the communication overhead per allocated time slot to a user as the number of required signalling bits for channel estimation and implementing corresponding communication procedures. In this study, the authors show that their proposed protocols have much lower communication overhead comparing with other high spectral efficient cooperative protocols such as opportunistic relaying (OR) and OR with incremental transmission while their achieved diversity-multiplexing trade off performances are the same as those protocols. The authors further show that the average communication overhead for the PRS and PRSIT is a logarithmic function of the number of users while it is a linear function in OR and OR with incremental transmission. Simulation results also show that however, the authors proposed protocols impose much lower communication overhead, they either outperform or act closely to the existing cooperative protocols in the outage probability.",
keywords = "DIVERSITY-MULTIPLEXING TRADEOFF, WIRELESS NETWORKS, CODED COOPERATION, SELECTION, CHANNELS",
author = "Haghighi, {Ali A.} and Keivan Navaie",
year = "2011",
month = sep,
day = "23",
doi = "10.1049/iet-com.2010.0675",
language = "English",
volume = "5",
pages = "2009--2017",
journal = "IET Communications",
issn = "1751-8628",
publisher = "Institution of Engineering and Technology",
number = "14",

}

RIS

TY - JOUR

T1 - Novel spectral efficient cooperative relaying protocols with low communication overhead

AU - Haghighi, Ali A.

AU - Navaie, Keivan

PY - 2011/9/23

Y1 - 2011/9/23

N2 - In this study, the authors propose two high spectral efficient relaying protocols with low communication overhead including: the priority-based relay selection (PRS), and the priority-based relay selection with incremental transmission (PRSIT). Relay selection and scheduling are integrated in the proposed protocols to achieve full diversity order as well as high spectral efficiency. The authors then define the communication overhead per allocated time slot to a user as the number of required signalling bits for channel estimation and implementing corresponding communication procedures. In this study, the authors show that their proposed protocols have much lower communication overhead comparing with other high spectral efficient cooperative protocols such as opportunistic relaying (OR) and OR with incremental transmission while their achieved diversity-multiplexing trade off performances are the same as those protocols. The authors further show that the average communication overhead for the PRS and PRSIT is a logarithmic function of the number of users while it is a linear function in OR and OR with incremental transmission. Simulation results also show that however, the authors proposed protocols impose much lower communication overhead, they either outperform or act closely to the existing cooperative protocols in the outage probability.

AB - In this study, the authors propose two high spectral efficient relaying protocols with low communication overhead including: the priority-based relay selection (PRS), and the priority-based relay selection with incremental transmission (PRSIT). Relay selection and scheduling are integrated in the proposed protocols to achieve full diversity order as well as high spectral efficiency. The authors then define the communication overhead per allocated time slot to a user as the number of required signalling bits for channel estimation and implementing corresponding communication procedures. In this study, the authors show that their proposed protocols have much lower communication overhead comparing with other high spectral efficient cooperative protocols such as opportunistic relaying (OR) and OR with incremental transmission while their achieved diversity-multiplexing trade off performances are the same as those protocols. The authors further show that the average communication overhead for the PRS and PRSIT is a logarithmic function of the number of users while it is a linear function in OR and OR with incremental transmission. Simulation results also show that however, the authors proposed protocols impose much lower communication overhead, they either outperform or act closely to the existing cooperative protocols in the outage probability.

KW - DIVERSITY-MULTIPLEXING TRADEOFF

KW - WIRELESS NETWORKS

KW - CODED COOPERATION

KW - SELECTION

KW - CHANNELS

U2 - 10.1049/iet-com.2010.0675

DO - 10.1049/iet-com.2010.0675

M3 - Journal article

VL - 5

SP - 2009

EP - 2017

JO - IET Communications

JF - IET Communications

SN - 1751-8628

IS - 14

ER -