Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/82507
Full metadata record
DC FieldValueLanguage
dc.contributor.authorZhang, Wenjieen
dc.contributor.authorSun, Yingjuanen
dc.contributor.authorDeng, Leien
dc.contributor.authorYeo, Chai Kiaten
dc.contributor.authorYang, Liweien
dc.date.accessioned2019-04-10T06:53:47Zen
dc.date.accessioned2019-12-06T14:56:59Z-
dc.date.available2019-04-10T06:53:47Zen
dc.date.available2019-12-06T14:56:59Z-
dc.date.issued2019en
dc.identifier.citationZhang, W., Sun, Y., Deng, L., Yeo, C. K., & Yang, L. (2019). Dynamic spectrum allocation for heterogeneous cognitive radio networks with multiple channels. IEEE Systems Journal, 13(1), 53-64. doi:10.1109/JSYST.2018.2822309en
dc.identifier.issn1932-8184en
dc.identifier.urihttps://hdl.handle.net/10356/82507-
dc.description.abstractThe rapid growth of wireless communication technology has resulted in the increasing demand on spectrum resources. However, according to a recent study, most of the allocated frequency experiences significant underutilization. One important issue associated with spectrum management in heterogeneous cognitive radio networks is: How to appropriately allocate the spectrum to secondary sender-destination (S-D) pair for sensing and utilization. In this paper, the authors investigate the spectrum allocation problem under a more practical scenario where the heterogeneous characteristics of both the secondary S-D and primary channels are taken into consideration. With the objective to maximize the achievable throughput for secondary S-D, we formulate the spectrum allocation problem as a linear integer optimization problem under spectrum availability constraint, spectrum span constraint, and interference free constraint. This problem is proven to be Non-deterministic Polynomial (NP)-complete, and a recent result in theoretical computer science called randomized rounding algorithm with polynomial computational complexity is developed to find the $\rho$-approximation solution. Evaluation results show that our proposed algorithm can achieve a close-to-optimal solution at a low level of computation complexity.en
dc.format.extent11 p.en
dc.language.isoenen
dc.relation.ispartofseriesIEEE Systems Journalen
dc.rights© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: https://doi.org/10.1109/JSYST.2018.2822309en
dc.subjectCognitive Radio (CR) Networksen
dc.subjectNP-completeen
dc.subjectDRNTU::Engineering::Computer science and engineeringen
dc.titleDynamic spectrum allocation for heterogeneous cognitive radio networks with multiple channelsen
dc.typeJournal Articleen
dc.contributor.schoolSchool of Computer Science and Engineeringen
dc.identifier.doi10.1109/JSYST.2018.2822309en
dc.description.versionAccepted versionen
item.fulltextWith Fulltext-
item.grantfulltextopen-
Appears in Collections:SCSE Journal Articles

SCOPUSTM   
Citations 20

19
Updated on Jul 8, 2024

Web of ScienceTM
Citations 20

18
Updated on Oct 28, 2023

Page view(s) 50

460
Updated on Jul 11, 2024

Download(s) 50

201
Updated on Jul 11, 2024

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.