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

Recent Efficient Iterative Algorithms on Cognitive Radio Cooperative Spectrum Sensing to Improve Reliability and Performance

Author

Listed:
  • Mohsen Akbari
  • Ahmed Wasif Reza
  • Kamarul Ariffin Noordin
  • Kaharudin Dimyati
  • Mohsen Riahi Manesh
  • Mohammad Nour Hindia

Abstract

In cognitive radio (CR), cooperative spectrum sensing (CSS) has been extensively explored to be accounted for in a spectrum scanning method that permits secondary users (SUs) or cognitive radio users to utilize discovered spectrum holes caused by the absence of primary users (PUs). This paper focuses on optimality of analytical study on the common soft decision fusion (SDF) CSS based on different iterative algorithms which confirm low total probability of error and high probability of detection in detail. In fact, all steps of genetic algorithm (GA), particle swarm optimization (PSO), and imperialistic competitive algorithm (ICA) will be well mentioned in detail and investigated on cognitive radio cooperative spectrum sensing (CRCSS) method. Then, the performance of CRCSS employing GA-, PSO-, and ICA-based scheme is analysed in MATLAB simulation to show superiority of these schemes over other conventional schemes in terms of detection and error performance with very less complexity. In addition, the ICA-based scheme also reveals noticeable convergence and time running performance in comparison to other techniques.

Suggested Citation

  • Mohsen Akbari & Ahmed Wasif Reza & Kamarul Ariffin Noordin & Kaharudin Dimyati & Mohsen Riahi Manesh & Mohammad Nour Hindia, 2016. "Recent Efficient Iterative Algorithms on Cognitive Radio Cooperative Spectrum Sensing to Improve Reliability and Performance," International Journal of Distributed Sensor Networks, , vol. 12(1), pages 3701308-370, January.
    • Handle: RePEc:sae:intdis:v:12:y:2016:i:1:p:3701308
    DOI: 10.1155/2016/3701308
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2016/3701308
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2016/3701308?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:12:y:2016:i:1:p:3701308. 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.