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

A novel user clustering and efficient resource allocation in non-orthogonal mutliple access for IoT networks

Author

Listed:
  • Syed Muhammad Hamedoon
  • Jawwad Nasar Chattha
  • Muhammad Bilal

Abstract

Optimal resource allocation is crucial for 5G and beyond networks, especially when connecting numerous IoT devices. In this paper, user clustering and power allocation challenges in the downlink of a multi-carrier NOMA system are investigated, with sum rate as the optimization objective. The paper presents an iterative optimization process, starting with user clustering followed by power allocation of the users. Although the simultaneous transmission for multiple users achieves high system throughput in NOMA, it leads to more energy consumption, which is limited by the battery capacity of IoT devices. Enhancing energy efficiency by considering the QoS requirement is a primary challenge in NOMA-enabled IoT devices. Currently, fixed user clustering techniques are proposed without considering the diversity and heterogeneity of channels, leading to poor throughput performance. The proposed user clustering technique is based on the partial brute force search (P-BFS) method, which reduces complexity compared to the traditional exhaustive search method. After the user clustering, we performed optimal power allocation using the Lagrangian multiplier method with Karush-Kuhn-Tucker (KKT) optimal conditions for each user assigned to a subchannel in each cluster. Lastly, a deep neural network (DNN) based proposed P-BFS scheme is used to reduce resource allocation’s complexity further. The simulation results show a significant improvement in the sum rate of the network.

Suggested Citation

  • Syed Muhammad Hamedoon & Jawwad Nasar Chattha & Muhammad Bilal, 2024. "A novel user clustering and efficient resource allocation in non-orthogonal mutliple access for IoT networks," PLOS ONE, Public Library of Science, vol. 19(9), pages 1-23, September.
  • Handle: RePEc:plo:pone00:0309695
    DOI: 10.1371/journal.pone.0309695
    as

    Download full text from publisher

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

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

    File URL: https://libkey.io/10.1371/journal.pone.0309695?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:0309695. 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.