Distributed Partner Selection Algorithm for Decode-and-Forward Cooperative Diversity
Qu Chun · Chinese Journal of Computers · 2010
In this paper,the authors study the partner selection problem in decode-and-forward cooperative diversity systems.First,the authors present the mathematical model of the partner selection problem,which can minimize the total power consumption of the source and the partner subject to the average bit error rate (BER) constraints at the partner and the destination.Therefore,the model not only can exploit the inherent spatial diversity in multiuser wireless systems and remarkably enhance the transmission performance,but also can improve the capacity of wireless networks and conserve the power consumption in mobile nodes.In order to provide insight into the manner in which the performance depends on the partner,the authors then derive the closed-form average BER expressions at the partner and the destination for M-ary quadrature amplitude modulation (M-QAM) over Rayleigh fading channels.According to the mathematical model and these expressions,the authors propose a distributed partner selection algorithm,which can select the optimal partner to forward messages at the expense of little overhead in distributed wireless networks.In addition,the proposed distributed algorithm can dynamically adjust the selected partner in response to the changes of channel states.Accordingly,the algorithm can be adaptive to channel states.Furthermore,the authors present simulations to confirm the proposed algorithm.