IDEAS home Printed from https://ideas.repec.org/a/igg/jitn00/v10y2018i1p49-62.html
   My bibliography  Save this article

A Two Step Multi-Carrier Proportional Fair Scheduling Scheme for Cloud Radio Access Networks

Author

Listed:
  • Syed Danial Ali Shah

    (Incheon National University, Incheon, South Korea)

  • Daehyeong Kim

    (Incheon National University, Incheon, South Korea)

  • Pervez Khan

    (Incheon National University, Incheon, South Korea)

  • Hoon Kim

    (Incheon National University, Incheon, South Korea)

  • Sangwook Han

    (Advanced Standard RD Lab, LG Electronics, Seoul, South Korea)

Abstract

Proportional fair scheduling (PFS) is a widely used scheduling algorithm in the wireless networks which utilizes the network resources efficiently while maintaining a balance with the fairness among the users. It is a channel aware scheduling algorithm that allocates resources to the users with the best channel conditions, it also takes into account the users with bad channel quality by considering the user's access history in the scheduling decision. In this paper, the authors propose a two-step multiple carrier proportional fair scheduling (MC-PF) algorithm for the cloud radio access networks (C-RAN). The main purpose of this algorithm is to maximize the sum of logarithm transmission rate. The scheduler assigns users to each carrier in order to maximize the logarithm transmission rate for overall links of C-RAN. To prove the effectiveness of the proposed algorithm, the authors have shown the simulation results and compared it with the round robin (RR) scheduling scheme.

Suggested Citation

  • Syed Danial Ali Shah & Daehyeong Kim & Pervez Khan & Hoon Kim & Sangwook Han, 2018. "A Two Step Multi-Carrier Proportional Fair Scheduling Scheme for Cloud Radio Access Networks," International Journal of Interdisciplinary Telecommunications and Networking (IJITN), IGI Global, vol. 10(1), pages 49-62, January.
    • Handle: RePEc:igg:jitn00:v:10:y:2018:i:1:p:49-62
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJITN.2018010104
    Download Restriction: no
    ---><---

    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:igg:jitn00:v:10:y:2018:i:1:p:49-62. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.