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

Energy-efficient and intelligent cooperative spectrum sensing algorithm in cognitive radio networks

Author

Listed:
  • Tangsen Huang
  • Xiangdong Yin
  • Xiaowu Li

Abstract

Green communication is the demand of current and future wireless communication. As the next-generation communication network, cognitive radio network also needs to meet the requirements of green communication. Therefore, improving energy efficiency is an inevitable requirement for the development of cognitive radio networks. However, there is a need to compromise sensing performance while improving energy efficiency. To take into account the two important indicators of sensing performance and energy efficiency, a grouping algorithm is proposed in this article, which can effectively improve the energy efficiency while improving the spectrum sensing performance. The algorithm obtains the initial value of the reliability of the nodes through training, and sorts them according to the highest reliability value, then selects an even number of nodes with the highest reliability value, and divides the selected nodes into two groups, and the two groups of nodes take turns in Alternate work. At this time, other nodes not participating in cooperative spectrum sensing are in a silent state, waiting for the instruction of the fusion center. The experimental results show that compared with the traditional algorithm, the proposed algorithm has a great improvement in the two indicators of sensing performance and energy efficiency.

Suggested Citation

  • Tangsen Huang & Xiangdong Yin & Xiaowu Li, 2022. "Energy-efficient and intelligent cooperative spectrum sensing algorithm in cognitive radio networks," International Journal of Distributed Sensor Networks, , vol. 18(9), pages 15501329221, September.
    • Handle: RePEc:sae:intdis:v:18:y:2022:i:9:p:15501329221125119
    DOI: 10.1177/15501329221125119
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/15501329221125119
    Download Restriction: no
    File URL: https://libkey.io/10.1177/15501329221125119?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
    ---><---

    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:18:y:2022:i:9:p:15501329221125119. 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.