IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v9y2013i10p875342.html
   My bibliography  Save this article

An Improved Centralized Cognitive Radio Network Spectrum Allocation Algorithm Based on the Allocation Sequence

Author

Listed:
  • Jianli Zhao
  • Jinsha Yuan

Abstract

The demand of the wireless communications service is increasing in recent years, and the demand of the wireless communication rate is increasing too. However, the static spectrum allocation mechanism results in lots of free spectrum resources in space, and the spectrum is wasted. The cognitive radio technology with intelligent searching and efficient utilization of the idle spectrum resources just provides the opportunity to use the free spectrum resources. Thus, the spectrum allocation technology of the cognitive radio has also been more and more broadly concerned. In order to avoid the interference, a mathematical model of spectrum allocation for cognitive radio spectrum allocation algorithm is established through a graph theory. The spectrum allocation algorithms with different allocation objectives based on graph theory are studied according to the different network structures. After the basic ideas and allocation processes of these algorithms are described, a centralized network spectrum allocation algorithm based on the allocation sequence is proposed. Simulation results show that the improved algorithm can significantly reduce the time overhead and can have better fairness compared with other existing Collaborative-Max-Sum-Reward (CSUM), Collaborative-Max-Min-Reward (CMIN), and Collaborative-Max-Proportional-Fair (CFAIR) algorithms under the same design criterion.

Suggested Citation

  • Jianli Zhao & Jinsha Yuan, 2013. "An Improved Centralized Cognitive Radio Network Spectrum Allocation Algorithm Based on the Allocation Sequence," International Journal of Distributed Sensor Networks, , vol. 9(10), pages 875342-8753, October.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:10:p:875342
    DOI: 10.1155/2013/875342
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/875342
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/875342?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:9:y:2013:i:10:p:875342. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.