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

Handle URI:
http://hdl.handle.net/10754/623932
Title:
User Matching with Relation to the Stable Marriage Problem in Cognitive Radio Networks
Authors:
Hamza, Doha R.; Aissa, Sonia
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.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Citation:
Hamza 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.
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
2016 IEEE 84th Vehicular Technology Conference (VTC-Fall)
Conference/Event name:
84th IEEE Vehicular Technology Conference, VTC Fall 2016
Issue Date:
20-Mar-2017
DOI:
10.1109/vtcfall.2016.7881959
Type:
Conference Paper
Additional Links:
http://ieeexplore.ieee.org/document/7881959/
Appears in Collections:
Conference Papers; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorHamza, Doha R.en
dc.contributor.authorAissa, Soniaen
dc.date.accessioned2017-05-31T11:23:14Z-
dc.date.available2017-05-31T11:23:14Z-
dc.date.issued2017-03-20en
dc.identifier.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.en
dc.identifier.doi10.1109/vtcfall.2016.7881959en
dc.identifier.urihttp://hdl.handle.net/10754/623932-
dc.description.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.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.relation.urlhttp://ieeexplore.ieee.org/document/7881959/en
dc.titleUser Matching with Relation to the Stable Marriage Problem in Cognitive Radio Networksen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journal2016 IEEE 84th Vehicular Technology Conference (VTC-Fall)en
dc.conference.date2016-09-18 to 2016-09-21en
dc.conference.name84th IEEE Vehicular Technology Conference, VTC Fall 2016en
dc.conference.locationMontreal, QC, CANen
dc.contributor.institutionInstitut National de la Recherche Scientifique (INRS-EMT), University of Quebec, Montreal, QC, Canadaen
kaust.authorHamza, Doha R.en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.