This paper considers a cooperative multiple access (CMA) scheme where two full-duplex sources simultaneously send their own messages to a common destination. As part of their cooperation, each of the two sources also receives and relays part of the message from the other source. This paper develops algorithms for computing the optimal power allocation to achieve the maximal network throughput subject to residual self-interference (RSI) at the non-ideal full-duplex sources. As a generalization of a time-division duplex (TDD) scheme, we consider a three-phase CMA (3P-CMA) scheme which treats the TDD scheme as a special case. The throughput of the 3P-CMA scheme consistently exceeds that of the TDD scheme regardless of the RSI power gain. Also shown in this paper is a semi-closed form of the optimal power allocation when the three-phases are constrained to be identical, i.e., resulting in a one-phase CMA (1P-CMA) scheme. The optimal power allocation of the 1P-CMA scheme takes much less time to compute, and its network throughout is close to that of the 3P-CMA scheme when the RSI power gain is low.

中文翻译：

---

具有非理想全双工源的协作式多址访问的最佳功率分配

本文考虑了一种协作多址（CMA）方案，其中两个全双工源同时将其自己的消息发送到一个公共目标。作为合作的一部分，两个来源中的每一个还接收并中继来自另一个来源的部分消息。本文开发了用于计算最佳功率分配的算法，该算法可在非理想全双工源下经受残余自干扰（RSI）的情况下实现最大的网络吞吐量。作为时分双工（TDD）方案的概括，我们考虑将TDD方案视为特例的三相CMA（3P-CMA）方案。3P-CMA方案的吞吐量始终超过TDD方案的吞吐量，而与RSI功率增益无关。本文还显示了当三相被约束为相同时，即导致单相CMA（1P-CMA）方案时，最优功率分配的半封闭形式。1P-CMA方案的最佳功率分配花费的时间少得多，并且当RSI功率增益低时，其整个网络都接近3P-CMA方案的网络。