User Matching with Relation to the Stable Marriage Problem in Cognitive Radio Networks

Doha R. Hamza, Sonia Aissa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider a network comprised of multiple primary users (PUs) and multiple secondary users (SUs), where the SUs seek access to a set of orthogonal channels each occupied by one PU. Only one SU is allowed to coexist with a given PU. We propose a distributed matching algorithm to pair the network users, where a Stackelberg game model is assumed for the interaction between the paired PU and SU. The selected secondary is given access in exchange for monetary compensation to the primary. The PU optimizes the interference price it charges to a given SU and the power allocation to maintain communication. The SU optimizes its power demand so as to maximize its utility. Our algorithm provides a unique stable matching. Numerical results indicate the advantage of the proposed algorithm over other reference schemes.
Original languageEnglish (US)
Title of host publication2016 IEEE 84th Vehicular Technology Conference (VTC-Fall)
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
ISBN (Print)9781509017010
DOIs
StatePublished - Mar 20 2017

Fingerprint Dive into the research topics of 'User Matching with Relation to the Stable Marriage Problem in Cognitive Radio Networks'. Together they form a unique fingerprint.

Cite this