User Matching with Relation to the Stable Marriage Problem in Cognitive Radio Networks
Permanent link to this recordhttp://hdl.handle.net/10754/623932
MetadataShow full item record
AbstractWe 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.
CitationHamza D, Aissa S (2016) User Matching with Relation to the Stable Marriage Problem in Cognitive Radio Networks. 2016 IEEE 84th Vehicular Technology Conference (VTC-Fall). Available: http://dx.doi.org/10.1109/vtcfall.2016.7881959.
Conference/Event name84th IEEE Vehicular Technology Conference, VTC Fall 2016