Cooperative communications with relay-selection: when to cooperate and whom to cooperate with?
Citations Over TimeTop 1% of 2008 papers
Abstract
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 <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">relay <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">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., " <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">When <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">to <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">cooperate? " and " <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Whom <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">to <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">cooperate <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">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.
Related Papers
- → A total power minimization approach to relay selection for two-way relay networks(2012)7 cited
- Analyzing Selection and Application of a Relay(2004)
- → A New General Purpose Relay for Telephone Switching Systems(1952)9 cited
- Dynamic selection scheme for cooperative relay under high mobility environment(2014)
- → A Unified Relay Framework with both D-F and C-F Relay Nodes(2012)