Cognitive radio relay networks with multiple primary and secondary users: Distributed stable matching algorithms for spectrum access

Siavash Bayat*, Raymond H.Y. Louie, Yonghui Li, Branka Vucetic

*Corresponding author for this work

Research output: Chapter in Book/Conference Proceeding/ReportConference Paper published in a bookpeer-review

40 Citations (Scopus)

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.

Original languageEnglish
Title of host publication2011 IEEE International Conference on Communications, ICC 2011
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event2011 IEEE International Conference on Communications, ICC 2011 - Kyoto, Japan
Duration: 5 Jun 20119 Jun 2011

Publication series

NameIEEE International Conference on Communications
ISSN (Print)0536-1486

Conference

Conference2011 IEEE International Conference on Communications, ICC 2011
Country/TerritoryJapan
CityKyoto
Period5/06/119/06/11

Fingerprint

Dive into the research topics of 'Cognitive radio relay networks with multiple primary and secondary users: Distributed stable matching algorithms for spectrum access'. Together they form a unique fingerprint.

Cite this