Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.