Matching Theory for Channel Allocation in Cognitive Radio Networks
| dc.contributor.author | Cao, Long | |
| dc.contributor.author | Yao, Fuqiang | |
| dc.contributor.author | Zhao, Hangsheng | |
| dc.contributor.author | Zhang, Jianzhao | |
| dc.coverage.issue | 4 | cs | 
| dc.coverage.volume | 25 | cs | 
| dc.date.accessioned | 2017-01-27T06:24:09Z | |
| dc.date.available | 2017-01-27T06:24:09Z | |
| dc.date.issued | 2016-12 | cs | 
| dc.description.abstract | For a cognitive radio network (CRN) in which a set of secondary users (SUs) competes for a limited number of channels (spectrum resources) belonging to primary users (PUs), the channel allocation is a challenge and dominates the throughput and congestion of the network. In this paper, the channel allocation problem is first formulated as the 0-1 integer programming optimization, with considering the overall utility both of primary system and secondary system. Inspired by matching theory, a many-to-one matching game is used to remodel the channel allocation problem, and the corresponding PU proposing deferred acceptance (PPDA) algorithm is also proposed to yield a stable matching. We compare the performance and computation complexity between these two solutions. Numerical results demonstrate the efficiency and obtain the communication overhead of the proposed scheme. | en | 
| dc.format | text | cs | 
| dc.format.extent | 741-748 | cs | 
| dc.format.mimetype | application/pdf | en | 
| dc.identifier.citation | Radioengineering. 2016 vol. 25, č. 4, s. 741-748. ISSN 1210-2512 | cs | 
| dc.identifier.doi | 10.13164/re.2016.0741 | en | 
| dc.identifier.issn | 1210-2512 | |
| dc.identifier.uri | http://hdl.handle.net/11012/63759 | |
| dc.language.iso | en | cs | 
| dc.publisher | Společnost pro radioelektronické inženýrství | cs | 
| dc.relation.ispartof | Radioengineering | cs | 
| dc.relation.uri | http://www.radioeng.cz/fulltexts/2016/16_04_0741_0748.pdf | cs | 
| dc.rights | Creative Commons Attribution 3.0 Unported License | en | 
| dc.rights.access | openAccess | en | 
| dc.rights.uri | http://creativecommons.org/licenses/by/3.0/ | en | 
| dc.subject | cognitive radio | en | 
| dc.subject | channel allocation | en | 
| dc.subject | optimization | en | 
| dc.subject | matching theory | en | 
| dc.subject | stable matching | en | 
| dc.subject | computation complexity | en | 
| dc.title | Matching Theory for Channel Allocation in Cognitive Radio Networks | en | 
| dc.type.driver | article | en | 
| dc.type.status | Peer-reviewed | en | 
| dc.type.version | publishedVersion | en | 
| eprints.affiliatedInstitution.faculty | Fakulta eletrotechniky a komunikačních technologií | cs | 
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- 16_04_0741_0748.pdf
- Size:
- 319.83 KB
- Format:
- Adobe Portable Document Format
- Description:
