IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v277y2019i2d10.1007_s10479-017-2648-3.html
   My bibliography  Save this article

Optimal throughput analysis of multiple channel access in cognitive radio networks

Author

Listed:
  • Sangdon Park

    (Korea Advanced Institute of Science and Technology (KAIST))

  • Ganguk Hwang

    (Korea Advanced Institute of Science and Technology (KAIST))

  • Jun-Kyun Choi

    (Korea Advanced Institute of Science and Technology (KAIST))

Abstract

In this paper we consider a time slotted cognitive radio (CR) network with N wireless channels and M secondary users (SUs). We focus on a multiple channel access policy where each SU stochastically decides whether to access idle channels or not based on the given access probability (AP) that is adapted to the channel state information (CSI), if possible. The AP plays an important role in the random access policy because it can control the number of SUs who can access idle channels in a simple manner and hence alleviate packet collisions among SUs. We assume that each SU can access at most L idle channels simultaneously at a time slot whenever possible. We consider three cases—(a) all SUs have full CSI, (b) all SUs have no CSI, and (c) all SUs have partial CSI. We analyze the throughput of an arbitrary SU for the three cases, and rigorously derive a closed-form expression of the optimal AP values that maximize the throughput of an arbitrary SU for the three cases. From the analysis, we show the impact of multiple channel access and the acquisition of CSI on throughput performance.

Suggested Citation

  • Sangdon Park & Ganguk Hwang & Jun-Kyun Choi, 2019. "Optimal throughput analysis of multiple channel access in cognitive radio networks," Annals of Operations Research, Springer, vol. 277(2), pages 345-370, June.
    • Handle: RePEc:spr:annopr:v:277:y:2019:i:2:d:10.1007_s10479-017-2648-3
    DOI: 10.1007/s10479-017-2648-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-017-2648-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-017-2648-3?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:annopr:v:277:y:2019:i:2:d:10.1007_s10479-017-2648-3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.