IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v18y2022i1p15501477211064741.html
   My bibliography  Save this article

Optimal downlink power allocation schemes for OFDM-NOMA-based Internet of things

Author

Listed:
  • Ya Gao
  • Fei Yu
  • Haoran Zhang
  • Yongpeng Shi
  • Yujie Xia

Abstract

With the continuous development of fifth-generation technology, the number of mobile terminal Internet of Things devices has increased exponentially. How to effectively improve the throughput of fifth-generation systems has become a challenge. In the Internet of Things networks, ultra-dense networks and non-orthogonal multiple access technology have drawn extensive attention in recent years, because they can achieve multiplexing from the space domain and power domain. To improve the throughput of the system, this article combines non-orthogonal multiple access with ultra-dense networks technology and considers the orthogonal frequency division multiplexing non-orthogonal multiple access–based ultra-dense networks with multiple base stations and multiple Internet of Things devices. In particular, first, we build the network model and channel model. Second, we construct the downlink transmission rate maximizing problem subject to the total power. Then, to solve this problem, we divide it into three sub-problems: device grouping, inter-sub-band power allocation, and intra-sub-band power allocation problems. Solving these sub-problems, we obtain the optimal power allocation schemes by jointly employing channel-state sorting–pairing algorithm, water-filling algorithm, and convex optimization theory. Finally, numerical simulations are conducted to validate the performance of our proposed optimal downlink power allocation scheme. Experimental results show that the total throughput of the system has been significantly improved.

Suggested Citation

  • Ya Gao & Fei Yu & Haoran Zhang & Yongpeng Shi & Yujie Xia, 2022. "Optimal downlink power allocation schemes for OFDM-NOMA-based Internet of things," International Journal of Distributed Sensor Networks, , vol. 18(1), pages 15501477211, January.
  • Handle: RePEc:sae:intdis:v:18:y:2022:i:1:p:15501477211064741
    DOI: 10.1177/15501477211064741
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/15501477211064741
    Download Restriction: no

    File URL: https://libkey.io/10.1177/15501477211064741?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:intdis:v:18:y:2022:i:1:p:15501477211064741. 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.