Single and Multiple Relay Selection Schemes and their Achievable Diversity Orders
Single and Multiple Relay Selection Schemes and their Achievable Diversity Orders
复制标题
DOI：
10.1109/twc.2008.080109
复制
发表时间：
2009-03-01
影响因子：
10.4
通讯作者：
Jafarkhani, Hamid
中科院分区：
文献类型：
--
作者：
Jing, Yindi;Jafarkhani, Hamid
本文研究无线中继网络中的中继选择方案。首先，我们推导了文献中许多单中继选择方案的多样性。然后，我们推广的中继选择的想法，允许多个中继合作。SNR最优的多中继选择方案可以通过穷举搜索来实现，其复杂度随网络规模呈指数增长。为了降低复杂度，提出了几种信噪比次优的多中继选择方案，其复杂度与中继数目成线性关系。它们被证明可以实现完全的多样性。仿真结果表明，它们的性能远远优于相应的单中继选择方法，非常接近SNR最优的多中继选择方案。此外，对于大型网络，这些多中继选择方案需要与单中继选择方案相同量的来自接收机的反馈比特。
This paper is on relay selection schemes for wireless relay networks. First, we derive the diversity of many single-relay selection schemes in the literature. Then, we generalize the idea of relay selection by allowing more than one relay to cooperate. The SNR-optimal multiple relay selection scheme can be achieved by exhaustive search, whose complexity increases exponentially in the network size. To reduce the complexity, several SNR-suboptimal multiple relay selection schemes are proposed, whose complexity is linear in the number of relays. They are proved to achieve full diversity. Simulation shows that they perform much better than the corresponding single relay selection methods and very close to the SNR-optimal multiple relay selection scheme. In addition, for large networks, these multiple relay selection schemes require the same amount of feedback bits from the receiver as single relay selection schemes.