具有不可忽略探测时间的最优中继选择
Optimal Relay Selection with Non-negligible Probing Time
摘要：
本文提出了一种协作无线网络中探测时间不可忽略的最优中继选择算法，并对其进行了分析。为了解决协作通信中带宽利用率下降的问题，引入了中继选择技术。然而，复杂网络往往无法获得中继信道的完整信息，这使得不探测中继信道就无法获得最优的传输源选择策略。特别是当中继候选者的数量很大时，即使探测所有中继信道保证在任何时刻找到最佳中继，由于不可忽略的探测时间，这在过去的文献中经常被忽视的带宽效率的下降也是显着的。在这项工作中，停止规则为基础的中继选择策略确定的源节点决定何时停止探测过程，并选择一个被探测的中继进行合作，在无线信道的随机不确定性。这种中继选择策略进一步示出具有简单的阈值结构。同时，可以同时获得全分集阶数和高带宽利用率。分析和仿真结果都提供了验证索赔。
英文摘要：
In this paper an optimal relay selection algorithm with non-negligible probing time is proposed and analyzed for cooperative wireless networks. Relay selection has been introduced to solve the degraded bandwidth efficiency problem in cooperative communication. Yet complete information of relay channels often remain unavailable for complex networks which renders the optimal selection strategies impossible for transmission source without probing the relay channels. Particularly when the number of relay candidate is large, even though probing all relay channels guarantees the finding of the best relays at any time instant, the degradation of bandwidth efficiency due to non-negligible probing times, which was often neglected in past literature, is also significant. In this work, a stopping rule based relay selection strategy is determined for the source node to decide when to stop the probing process and choose one of the probed relays to cooperate with under wireless channels' stochastic uncertainties. This relay selection strategy is further shown to have a simple threshold structure. At the meantime, full diversity order and high bandwidth efficiency can be achieved simultaneously. Both analytical and simulation results are provided to verify the claims.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
