English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we study the resource allocation problem for a single-cellnon-orthogonal multiple access (NOMA) relay network where an OFDMamplify-and-forward (AF) relay allocates the spectrum and power resources tothe source-destination (SD) pairs. We aim to optimize the resource allocationto maximize the average sum-rate. The optimal approach requires an exhaustivesearch, leading to an NP-hard problem. To solve this problem, we propose twoefficient many-to-many two-sided SD pair-subchannel matching algorithms inwhich the SD pairs and sub-channels are considered as two sets of playerschasing their own interests. The proposed algorithms can provide a sub-optimalsolution to this resource allocation problem in affordable time. Both thestatic matching algorithm and dynamic matching algorithm converge to apair-wise stable matching after a limited number of iterations. Simulationresults show that the capacity of both proposed algorithms in the NOMA schemesignificantly outperforms the conventional orthogonal multiple access scheme.The proposed matching algorithms in NOMA scheme also achieve a betteruser-fairness performance than the conventional orthogonal multiple access.

Sub-channel and Power Allocation for Non-orthogonal Multiple Access Relay Networks with Amplify-and-Forward Protocol