协作网络中的实用功率分配与贪婪伙伴选择
Practical Power Allocation and Greedy Partner Selection for Cooperative Networks
AI总结：
针对放大转发协作通信，提出一种最小化中断概率的实用功率分配算法，并采用贪婪方法进行伙伴选择。
摘要：
本文提出了一种用于放大转发协作通信的新型功率分配算法，该算法在给定总功率下最小化中断概率。我们以新的形式表述该问题，并求解固定伙伴集下的最优功率分配。所提出的解决方案提供了一种直接的功率分配方案，具有简单的公式，也可通过简单的查找表表示，便于实际实现。仿真结果表明，所提算法的性能与先前发表的迭代最优功率分配算法的结果非常接近。我们还考虑了协作网络中的伙伴选择问题。
英文摘要：
In this paper, we present a novel algorithm for power allocation in the Amplify-and-Forward cooperative communication that minimizes the outage probability with a given value of total power. We present the problem with new formulation and solve the optimal power allocation for a fixed set of partners. The proposed solution provides a direct power allocation scheme with a simple formula that can be also be represented by a simple lookup table which makes it easy for practical implementation. We present simulation results to demonstrate that the performances of the proposed algorithms are very close to results of the previously published iterative optimal power allocation algorithms. We also consider the issue of partner selection in a cooperative network.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
