liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Bandwidth Partition and Allocation for Efficient Spectrum Utilization in Cognitive Communications
SCUT, Peoples R China; Commun and Comp Network Lab GD, Peoples R China.
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
Univ Maryland, MD 20742 USA.
2019 (English)In: Journal of Communications and Networks, ISSN 1229-2370, E-ISSN 1976-5541, Vol. 21, no 4, p. 353-364Article in journal (Refereed) Published
Abstract [en]

Conventional cognitive communications rely heavily on the smartness of secondary (unlicensed) users (SUs) to achieve high spectrum utilization, which involves the optimization of the SUs policies and behaviors for dynamic spectrum access, power allocation among multiple channels, etc. Due to the inherent randomness of the primary users (PUs) transmission, those efforts inevitably increase the implementation complexity and sensing overheads of the SUs, and in turn lower the spectrum utilization efficiency. In this paper, we try to change the focus from SU to PU. A cooperative traffic allocation strategy for PU, together with the non-uniform bandwidth partition, is employed to regularize the PUs resource occupancy pattern without compromising its performance, and to maximize the spare bandwidth for the SU at the same time. We first study the capacity based optimization problem (COP) together with the fully polynomial time approximation scheme (FPTAS) for an approximation guarantee of the global optimum. Then we analyze the subcarrier based optimization problem as the surrogate problem of COP, which can be solved by a greedy algorithm exactly. Both the theoretical analysis and the numerical simulations demonstrate the effectiveness of those methods to achieve the performance that almost identical to that of the global optimum solution.

Place, publisher, year, edition, pages
KOREAN INST COMMUNICATIONS SCIENCES (K I C S) , 2019. Vol. 21, no 4, p. 353-364
Keywords [en]
Cognitive communication; FPTAS; non-uniform bandwidth partition
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:liu:diva-161207DOI: 10.1109/JCN.2019.000031ISI: 000485686000002OAI: oai:DiVA.org:liu-161207DiVA, id: diva2:1365665
Note

Funding Agencies|China Scholar Council (CSC) [201206155005]; Natural Science Foundation of Guangdong Province (CHINA)National Natural Science Foundation of Guangdong Province [S2011010004773]; European FP7 Marie Curie IOF projectEuropean Union (EU) [329313]; NSFNational Science Foundation (NSF) [CCF1420651]; ONROffice of Naval Research [N000141410107]

Available from: 2019-10-25 Created: 2019-10-25 Last updated: 2019-10-25

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Search in DiVA

By author/editor
Yuan, Di
By organisation
Communications and Transport SystemsFaculty of Science & Engineering
In the same journal
Journal of Communications and Networks
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 4 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf