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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.