• DocumentCode
    2785070
  • Title

    Utility-based uplink scheduling algorithm for enhancing throughput and fairness in relayed LTE networks

  • Author

    Ruby, Rukhsana ; Mohamed, Amr ; Leung, Victor

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Univ. of British Columbia, Vancouver, BC, Canada
  • fYear
    2010
  • fDate
    10-14 Oct. 2010
  • Firstpage
    520
  • Lastpage
    527
  • Abstract
    Relaying is one of the key techniques considered by the 3GPP LTE-Advanced as part of 4G cellular technologies, aiming to increase the coverage and capacity of the network especially for the edge nodes. In this work, we have considered the uplink scheduling of an LTE network with the help of positioned relay nodes. We have projected the entire problem as a constrained optimization problem. As a solution, we have considered sub-gradient based approach to divide the utility maximization of all nodes, including relay nodes, in the cell into sub-problems of utility optimization of each individual node. Based on this solution we have proposed a scheduling algorithm to allocate resource blocks across all nodes. Numerical calculations and results have been shown to justify that relay nodes can potentially achieve the trade-off between throughput and fairness.
  • Keywords
    3G mobile communication; Long Term Evolution; optimisation; resource allocation; scheduling; 3GPP LTE-advanced; 4G cellular technologies; constrained optimization problem; fairness enhancement; positioned relay nodes; relayed LTE networks; resource block allocation; subgradient based approach; throughput enhancement; utility-based uplink scheduling algorithm; Base stations; Complexity theory; Optimization; Relays; Resource management; Scheduling; Throughput; LTE networks; Uplink Scheduling; proportional fairness; relaying; throughput maximization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Local Computer Networks (LCN), 2010 IEEE 35th Conference on
  • Conference_Location
    Denver, CO
  • ISSN
    0742-1303
  • Print_ISBN
    978-1-4244-8387-7
  • Type

    conf

  • DOI
    10.1109/LCN.2010.5735768
  • Filename
    5735768