IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/5201545.html
   My bibliography  Save this article

Hybrid OFDMA Resource Allocation Scheme for Ensuring Required Level of Proportional Fairness

Author

Listed:
  • Ming Sun
  • Kangle Zhai
  • Wei Cao
  • Ying Wang
  • Yaoqun Xu

Abstract

The new-generation wireless communication networks are envisioned to offer higher sum data rates along with the required level of fairness. Previous works tend to suffer from a decayed performance as subcarriers become relatively insufficient in allocation to users. To maximize the sum data rates and ensure the required level of proportional fairness, this paper presents a hybrid OFDMA resource allocation scheme which uses Hungarian algorithm combined with a greedy method for subcarrier allocation and uses bee colony optimization for power allocation. The proposed subcarrier allocation scheme can make full use of advantages of both globally optimal Hungarian algorithm in enhancing sum data rates and locally optimal greedy method in maintaining a reasonable fairness level and can make Hungarian algorithm work in a searching mode for further improvement of sum data rates and fairness. The proposed power allocation scheme can converge to the required level of proportional fairness but with higher sum data rates if the subcarrier allocation does not achieve the required fairness. Simulation results show that the proposed scheme can obtain the required level of proportional fairness but with higher sum data rates even if subcarriers are relatively insufficient in allocation to users. Complexity analysis shows the proposed method has moderate complexity.

Suggested Citation

  • Ming Sun & Kangle Zhai & Wei Cao & Ying Wang & Yaoqun Xu, 2020. "Hybrid OFDMA Resource Allocation Scheme for Ensuring Required Level of Proportional Fairness," Mathematical Problems in Engineering, Hindawi, vol. 2020, pages 1-19, October.
  • Handle: RePEc:hin:jnlmpe:5201545
    DOI: 10.1155/2020/5201545
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2020/5201545.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2020/5201545.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2020/5201545?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:hin:jnlmpe:5201545. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.