Skip to main navigation Skip to search Skip to main content

An adaptive IRS adjusting algorithm aids communication in heterogeneous cognitive radio networks

  • Xiaoying Zhu
  • , Shi Wang*
  • , Xiaohui Xu
  • , Yi Lou
  • , Hao Sun
  • *Corresponding author for this work
  • Liaoning Technical University
  • School of Information Science and Engineering, Harbin Institute of Technology Weihai

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, we present an adaptive intelligent reflecting surfaces (IRS) adjusting algorithm designed to enhance the communication quality of secondary users (SUs) within heterogeneous cognitive radio networks (CRNs), using a cross-layer analysis approach. Initially, a Markov model is established based on queue analysis of SUs' buffer. Subsequently, to optimize the diagonal reflection coefficient matrix of the IRS, we derive the key objectives of the established multi-objective optimization problem, including potential throughput, data packet rejection rate, and data packet queue length of SUs, into closed-form expressions. Thereafter, the optimal solution guides the dynamic pre-adjustment of IRS by the station. Simulation results verify the superior performance of the proposed algorithm, particularly in terms of spectral efficiency and bit error rate, compared to existing methods.

Original languageEnglish
Article number103343
JournalAin Shams Engineering Journal
Volume16
Issue number5
DOIs
StatePublished - Apr 2025
Externally publishedYes

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

  1. SDG 3 - Good Health and Well-being
    SDG 3 Good Health and Well-being

Keywords

  • Adaptive adjusting algorithm
  • Cognitive radio
  • Intelligent reflecting surface
  • Markov model
  • Performance evaluation
  • Queue theory

Fingerprint

Dive into the research topics of 'An adaptive IRS adjusting algorithm aids communication in heterogeneous cognitive radio networks'. Together they form a unique fingerprint.

Cite this