Loading…

Cooperative communications with relay-selection: when to cooperate and whom to cooperate with?

In this paper; we propose a new cooperative communication protocol, which achieves higher bandwidth efficiency while guaranteeing the same diversity order as that of the conventional cooperative schemes. The proposed scheme considers relay selection via the available partial channel state informatio...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on wireless communications 2008-07, Vol.7 (7), p.2814-2827
Main Authors: Ibrahim, A.S., Sadek, A.K., Weifeng Su, Liu, K.J.R.
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper; we propose a new cooperative communication protocol, which achieves higher bandwidth efficiency while guaranteeing the same diversity order as that of the conventional cooperative schemes. The proposed scheme considers relay selection via the available partial channel state information (CSI) at the source and the relays. In particular, we discuss the multi-node decode-and-forward cooperative scenarios, where arbitrary N relays are available. The source determines when it needs to cooperate with one relay only, and which relay to cooperate with in case of cooperation, i.e., " When to cooperate? " and " Whom to cooperate with? ". An optimal relay is the one which has the maximum instantaneous scaled harmonic mean functionof its source-relay and relay-destination channel gains. For the symmetric scenario, we derive an approximate expression of the bandwidth efficiency and obtain an upper bound on the symbol error rate (SER) performance. We show that full diversity is guaranteed and that a significant increase of the bandwidth efficiency is achieved. Moreover, we present the tradeoff between the achievable bandwidth efficiency and the corresponding SER. Finally, the obtained analytical results are verified through computer simulations.
ISSN:1536-1276
1558-2248
DOI:10.1109/TWC.2008.070176