IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v77y2021i4d10.1007_s11235-021-00786-x.html
   My bibliography  Save this article

Power allocation and temporal fair user group scheduling for downlink NOMA

Author

Listed:
  • Eray Erturk

    (University of Southern California)

  • Ozlem Yildiz

    (New York University)

  • Shahram Shahsavari

    (University of Waterloo)

  • Nail Akar

    (Bilkent University)

Abstract

Non-Orthogonal Multiple Access (NOMA) has been proposed as a new radio access technique for cellular networks as an alternative to OMA (Orthogonal Multiple Access) in which the users of a group (pairs or triples of users in a group are considered in this paper) are allowed to use the wireless channel simultaneously. In this paper, for downlink single-input single-output SISO-NOMA, a heuristic power allocation algorithm within a group is first proposed which attempts to ensure that the users of a group benefit from simultaneous transmission equally in terms of achievable throughput. Moreover, a user group scheduling algorithm is proposed for downlink NOMA systems by which a user group is to be dynamically selected for transmission while satisfying long term temporal fairness among the individual contending users. The effectiveness of the proposed power allocation method along with the temporal fair scheduling algorithm for downlink NOMA is validated with simulations and the performance impact of the transmit power and the coverage radius of the base station as well as the number of users are thoroughly studied.

Suggested Citation

  • Eray Erturk & Ozlem Yildiz & Shahram Shahsavari & Nail Akar, 2021. "Power allocation and temporal fair user group scheduling for downlink NOMA," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 77(4), pages 753-766, August.
    • Handle: RePEc:spr:telsys:v:77:y:2021:i:4:d:10.1007_s11235-021-00786-x
    DOI: 10.1007/s11235-021-00786-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-021-00786-x
    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-021-00786-x?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ghassan Alnwaimi & Hatem Boujemaa, 2022. "Optimal packet length for non orthogonal multiple access," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 79(3), pages 357-367, March.

    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:77:y:2021:i:4:d:10.1007_s11235-021-00786-x. 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.