A blind matching algorithm for cognitive radio networks

Handle URI:
http://hdl.handle.net/10754/621297
Title:
A blind matching algorithm for cognitive radio networks
Authors:
Hamza, Doha R.; Shamma, Jeff S. ( 0000-0001-5638-9551 )
Abstract:
We consider a cognitive radio network where secondary users (SUs) are allowed access time to the spectrum belonging to the primary users (PUs) provided that they relay primary messages. PUs and SUs negotiate over allocations of the secondary power that will be used to relay PU data. We formulate the problem as a generalized assignment market to find an epsilon pairwise stable matching. We propose a distributed blind matching algorithm (BLMA) to produce the pairwise-stable matching plus the associated power allocations. We stipulate a limited information exchange in the network so that agents only calculate their own utilities but no information is available about the utilities of any other users in the network. We establish convergence to epsilon pairwise stable matchings in finite time. Finally we show that our algorithm exhibits a limited degradation in PU utility when compared with the Pareto optimal results attained using perfect information assumptions. © 2016 IEEE.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Citation:
Hamza D, Shamma JS (2016) A blind matching algorithm for cognitive radio networks. 2016 IEEE International Symposium on Information Theory (ISIT). Available: http://dx.doi.org/10.1109/ISIT.2016.7541837.
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
2016 IEEE International Symposium on Information Theory (ISIT)
Conference/Event name:
2016 IEEE International Symposium on Information Theory, ISIT 2016
Issue Date:
15-Aug-2016
DOI:
10.1109/ISIT.2016.7541837
Type:
Conference Paper
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.authorShamma, Jeff S.en
dc.date.accessioned2016-11-03T06:57:07Z-
dc.date.available2016-11-03T06:57:07Z-
dc.date.issued2016-08-15en
dc.identifier.citationHamza D, Shamma JS (2016) A blind matching algorithm for cognitive radio networks. 2016 IEEE International Symposium on Information Theory (ISIT). Available: http://dx.doi.org/10.1109/ISIT.2016.7541837.en
dc.identifier.doi10.1109/ISIT.2016.7541837en
dc.identifier.urihttp://hdl.handle.net/10754/621297-
dc.description.abstractWe consider a cognitive radio network where secondary users (SUs) are allowed access time to the spectrum belonging to the primary users (PUs) provided that they relay primary messages. PUs and SUs negotiate over allocations of the secondary power that will be used to relay PU data. We formulate the problem as a generalized assignment market to find an epsilon pairwise stable matching. We propose a distributed blind matching algorithm (BLMA) to produce the pairwise-stable matching plus the associated power allocations. We stipulate a limited information exchange in the network so that agents only calculate their own utilities but no information is available about the utilities of any other users in the network. We establish convergence to epsilon pairwise stable matchings in finite time. Finally we show that our algorithm exhibits a limited degradation in PU utility when compared with the Pareto optimal results attained using perfect information assumptions. © 2016 IEEE.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.titleA blind matching algorithm for cognitive radio networksen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journal2016 IEEE International Symposium on Information Theory (ISIT)en
dc.conference.date10 July 2016 through 15 July 2016en
dc.conference.name2016 IEEE International Symposium on Information Theory, ISIT 2016en
dc.contributor.institutionSchool of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, United Statesen
kaust.authorHamza, Doha R.en
kaust.authorShamma, Jeff S.en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.