IDEAS home Printed from https://ideas.repec.org/a/sae/joudef/v20y2023i3p303-316.html
   My bibliography  Save this article

Analysis of user pairing non-orthogonal multiple access network using deep Q-network algorithm for defense applications

Author

Listed:
  • Shankar Ravi
  • Gopal Ramchandra Kulkarni
  • Samrat Ray
  • Malladi Ravisankar
  • V Gokula krishnan
  • D S K Chakravarthy

Abstract

Non-orthogonal multiple access (NOMA) networks play an important role in defense communication scenarios. Deep learning (DL)-based solutions are being considered as viable ways to solve the issues in fifth-generation (5G) and beyond 5G (B5G) wireless networks, since they can provide a more realistic solution in the real-world wireless environment. In this work, we consider the deep Q-Network (DQN) algorithm-based user pairing downlink (D/L) NOMA network. We have applied the convex optimization (CO) technique and optimized the sum rate of all the wireless users. First, the near-far (N-F) pairing and near-near and far-far (N-N and F-F) pairing strategies are investigated for the multiple numbers of users, and a closed-form (CF) expression of the achievable rate is derived. After that, the optimal power allocation (OPA) factors are derived using the CO technique. Through simulations, it has been demonstrated that the DQN algorithms perform much better than the deep reinforcement learning (DRL) and conventional orthogonal frequency-division multiple access (OFDMA) schemes. The sum-rate performance significantly increases with OPA factors. The simulation results are in close agreement with the analytical results.

Suggested Citation

  • Shankar Ravi & Gopal Ramchandra Kulkarni & Samrat Ray & Malladi Ravisankar & V Gokula krishnan & D S K Chakravarthy, 2023. "Analysis of user pairing non-orthogonal multiple access network using deep Q-network algorithm for defense applications," The Journal of Defense Modeling and Simulation, , vol. 20(3), pages 303-316, July.
    • Handle: RePEc:sae:joudef:v:20:y:2023:i:3:p:303-316
    DOI: 10.1177/15485129211072548
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/15485129211072548
    Download Restriction: no
    File URL: https://libkey.io/10.1177/15485129211072548?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:joudef:v:20:y:2023:i:3:p:303-316. 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.