IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v83y2023i2d10.1007_s11235-023-01012-6.html
   My bibliography  Save this article

Throughput optimization for backscatter-and-NOMA-enabled wireless powered cognitive radio network

Author

Listed:
  • Yuzhe Chen

    (Zhejiang University of Technoloy)

  • Yanjun Li

    (Zhejiang University of Technoloy)

  • Meihui Gao

    (Zhejiang University of Technoloy)

  • Xianzhong Tian

    (Zhejiang University of Technoloy)

  • Kaikai Chi

    (Zhejiang University of Technoloy)

Abstract

In a typical wireless powered cognitive radio network, secondary transmitters (STs) perform energy harvesting when the channel is busy and perform active transmission using the harvested energy when the channel is idle. In order to further enhance the throughput of the network, we enable time-division-multiple-access-based backscatter communication (BackCom) when the channel is busy and non-orthogonal-multiple-access (NOMA)-based active transmission when the channel is idle. We aim to maximize the longterm average sum-throughput of all the STs by allocating each ST’s BackCom time, energy harvesting time and transmit power for the NOMA-based active transmission. With consideration of limited battery capacity and time-varying channel, we formulate the problem as a Markov decision process. Both Q-learning and deep Q-learning (DQL) algorithms are proposed to solve the problem to obtain fully online policies. Simulation results show that the proposed DQL algorithm not only efficiently deals with the dynamics of the environment but also improves the average throughput up to 27.5% compared with Q-learning and up to 4 times compared with random policy.

Suggested Citation

  • Yuzhe Chen & Yanjun Li & Meihui Gao & Xianzhong Tian & Kaikai Chi, 2023. "Throughput optimization for backscatter-and-NOMA-enabled wireless powered cognitive radio network," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 83(2), pages 135-146, June.
    • Handle: RePEc:spr:telsys:v:83:y:2023:i:2:d:10.1007_s11235-023-01012-6
    DOI: 10.1007/s11235-023-01012-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-023-01012-6
    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/s11235-023-01012-6?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:telsys:v:83:y:2023:i:2:d:10.1007_s11235-023-01012-6. 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.