Non-cooperative resource allocation in amplify-and-forward relay-assisted DS/CDMA networks is tackled in this paper. The relay allocates its amplify-and-forward matrix for achievable sum-rate maximization, whereas the mobile transmitters selfishly allocate their spreading codes for individual achievable rate maximization. Convergence of the proposed algorithm is proved and its performance contrasted against a centralized approach. Moreover, the proposed approach is extended to the case in which the direct path between transmitters and receiver is taken into account. © 2012 IEEE.
Resource allocation in amplify-and-forward relay-assisted DS/CDMA systems
Zappone A.
;
2012-01-01
Abstract
Non-cooperative resource allocation in amplify-and-forward relay-assisted DS/CDMA networks is tackled in this paper. The relay allocates its amplify-and-forward matrix for achievable sum-rate maximization, whereas the mobile transmitters selfishly allocate their spreading codes for individual achievable rate maximization. Convergence of the proposed algorithm is proved and its performance contrasted against a centralized approach. Moreover, the proposed approach is extended to the case in which the direct path between transmitters and receiver is taken into account. © 2012 IEEE.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
