Optimal Power Allocation for Cooperative Multiple Access With Non-Ideal Full-Duplex Sources
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...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on communications 2021-04, Vol.69 (4), p.2372-2386 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
ISSN: | 0090-6778 1558-0857 |
DOI: | 10.1109/TCOMM.2020.3047629 |