Lingya LiuCunqing HuaCailian ChenXinping Guan
In this paper, we consider the relay selection and power allocation (RSPA) problem in amplify-and-forward (AF) relaying networks. The objective is to minimize the outage probability at the receiver, assuming that only the mean channel gain information is available. By taking advantage of its special structure, we propose to decompose the RSPA problem into two tractable subproblems, which can be implemented in a semidistributed manner. For the relay selection (RS) subproblem, a relay-ordering-based scheme is designed to incrementally select a subset of relays from the candidate nodes according to a specific metric in a centralized manner, which is dominated by the mean channel gain of each individual nodes. For the power allocation (PA) subproblem, a source-driven iterative algorithm is proposed for each relay to decide its optimal transmit power locally by exploiting the convexity of this subproblem. Simulation results are provided to evaluate the outage and signal-to-noise-ratio (SNR) performance of the proposed scheme under different channel conditions. It is shown that the proposed scheme can dynamically select relays and adjust power allocation according to the SNR and channel conditions. It outperforms the other two benchmark schemes, and the performance is close to the optimal scheme with exhaustive search, but the computational complexity is significantly reduced.
Kai MaPei LiuJie YangXinping Guan
Dongyu WangJianxiong LiXibiao Cai
Lingya LiuCunqing HuaCailian ChenXinping Guan
Lijie WangHaitao ZhaoYi TangJibo Wei
Kai MaPei LiuJie YangXinping Guan