TY - GEN
T1 - An optimized user selection method for cooperative diversity systems
AU - Michalopoulos, Diomidis S.
AU - Karagiannidis, George K.
AU - Tsiftsis, Theodoros A.
AU - Mallik, Ranjan K.
N1 - Copyright:
Copyright 2008 Elsevier B.V., All rights reserved.
PY - 2006
Y1 - 2006
N2 - Multi-user cooperative diversity is a recent technique promising great improvement of the performance of wireless communication systems operating in fading environments. Based on combinatorial optimization theory and specifically on the so-called knapsack problem, this paper presents a method of optimizing the selection among the potential cooperating users, when amplify-and-forward relays are used. In particular, two optimization problems are studied: the error probability minimization subject to total energy consumption constraints, and the dual one, the energy consumption minimization under error performance constraints. Depending on the frequency of repeating this selection, the above problems are categorized into shortterm and long-term node selection. Numerical examples verify the expected knapsack scheme's advantage of adapting the number of cooperating users, depending on the desired performance-consumption tradeoff. Moreover, long-term node selection seems to lead to similar error or consumption performance compared to the short-term one, despite its simplicity.
AB - Multi-user cooperative diversity is a recent technique promising great improvement of the performance of wireless communication systems operating in fading environments. Based on combinatorial optimization theory and specifically on the so-called knapsack problem, this paper presents a method of optimizing the selection among the potential cooperating users, when amplify-and-forward relays are used. In particular, two optimization problems are studied: the error probability minimization subject to total energy consumption constraints, and the dual one, the energy consumption minimization under error performance constraints. Depending on the frequency of repeating this selection, the above problems are categorized into shortterm and long-term node selection. Numerical examples verify the expected knapsack scheme's advantage of adapting the number of cooperating users, depending on the desired performance-consumption tradeoff. Moreover, long-term node selection seems to lead to similar error or consumption performance compared to the short-term one, despite its simplicity.
UR - http://www.scopus.com/inward/record.url?scp=50949086245&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=50949086245&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2006.853
DO - 10.1109/GLOCOM.2006.853
M3 - Conference contribution
AN - SCOPUS:50949086245
SN - 142440357X
SN - 9781424403578
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
T2 - IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
Y2 - 27 November 2006 through 1 December 2006
ER -