IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0337319.html

Research on multi-channel access strategy based on congestion control with burst traffic in CRNs

Author

Listed:
  • Qianyu Xu
  • Qi Zhang
  • Yang Bi
  • Jaafar Gaber

Abstract

This paper investigates a multi-channel access strategy for cognitive radio networks (CRNs) under bursty traffic conditions, with a focus on congestion control. The proposed approach integrates cross-layer factors including channel fading, user activity, and finite cache capacity and models heterogeneous burst service arrivals using a two-state Markov-modulated Bernoulli process (MMBP-2). A dual-threshold mechanism is implemented in the node buffer to effectively manage congestion. System states are mapped onto a two-dimensional discrete Markov chain, where state transitions are characterized by a high-dimensional transition matrix. Through steady-state analysis, key performance metrics such as average queue length, throughput, delay, and packet loss rate are derived. Simulation results confirm that the model achieves stable operational performance. Building upon this framework, this paper proposes a multi-channel access strategy that maximizes average throughput while minimizing packet loss rate by employing a genetic algorithm. The results show that, in comparison with traditional strategies, the burst flow control model developed in this study effectively meets data access requirements in highly bursty environments. Furthermore, simulation experiments explore how system performance varies with changes in the number of channels and cognitive users, and the key operational threshold is determined. These findings offer valuable guidance for channel access design and capacity planning in burst communication scenarios.

Suggested Citation

  • Qianyu Xu & Qi Zhang & Yang Bi & Jaafar Gaber, 2026. "Research on multi-channel access strategy based on congestion control with burst traffic in CRNs," PLOS ONE, Public Library of Science, vol. 21(1), pages 1-20, January.
  • Handle: RePEc:plo:pone00:0337319
    DOI: 10.1371/journal.pone.0337319
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0337319
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0337319&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0337319?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:plo:pone00:0337319. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.