We propose a distributed spectrum access algorithm for cognitive radio relay networks with multiple primary users (PU) and multiple secondary users (SU). The key idea behind the proposed algorithm is that the PUs negotiate with the SUs on the amount of time the SUs are either (i) allowed spectrum access, or (ii) cooperatively relaying the PU's data, such that both the PUs' and the SUs' minimum sum-rate requirement are satisfied. We prove that the proposed algorithm will result in a stable matching and is weak Pareto optimal. Numerical analysis also reveal that the distributed algorithm can achieve a performance comparable to an optimal centralized solution, but with significantly less overhead and complexity.
In this paper, we study the resource allocation and scheduling problem for a downlink non-orthogonal multiple access (NOMA) network where the base station (BS) allocates the spectrum resources and power to the set of users. We aim to optimize the sub-channel assignment and power allocation to achieve a balance between the number of scheduled users and total sum-rate maximization. To solve the above problem, we propose a many-to-many two-sided user-subchannel matching algorithm in which the set of users and sub-channels are considered as two sets of players pursuing their own interests. The algorithm converges to a pair-wise stable matching after a limited number of iterations. Simulation results show that the proposed algorithm can approach the performance of the upper bound and greatly outperforms the OFDMA scheme.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.