• DocumentCode
    2168002
  • Title

    Self-adaptive Genetic algorithm based MU-MIMO scheduling scheme

  • Author

    Chengcheng Yang ; Jiang Han ; Yi Li ; Xiaodong Xu

  • Author_Institution
    Beijing Univ. of Posts & Telecommun., Beijing, China
  • fYear
    2013
  • fDate
    17-19 Nov. 2013
  • Firstpage
    180
  • Lastpage
    185
  • Abstract
    Multi-user Multiple Input Multiple Output (MU-MIMO) system is known to enhance the system capacity with low network delay. One of the biggest challenges with MU-MIMO is on the scheduling scheme which simultaneously selects multiple users to maximize the sum rate. Genetic Algorithm (GA) works perfectly as an optimal or suboptimal solution with quite low complexity to handle such problems. In this paper, we promote a MU-MIMO scheduling scheme which is based on a modified GA, namely Self-adaptive GA (SaGA). SaGA can adjust the performance of population and generation dynamically during run. Furthermore, a self-adaptive elitism strategy also makes contributions to a better behave and faster convergence beyond the traditional GA strategy. Simulation results demonstrate that the performance of SaGA based scheduling is quite approximate to the exhaustive searching while with a much lower complexity.
  • Keywords
    MIMO communication; genetic algorithms; scheduling; MU-MIMO scheduling scheme; SaGA; multiuser multiple input multiple output system; self-adaptive elitism strategy; self-adaptive genetic algorithm; Complexity theory; Convergence; Genetic algorithms; Optimization; Scheduling; Sociology; Statistics; Complexity; MU-MIMO; Scheduling scheme; Self-adaptive Genetic Algorithm; Sum rat;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communication Technology (ICCT), 2013 15th IEEE International Conference on
  • Conference_Location
    Guilin
  • Type

    conf

  • DOI
    10.1109/ICCT.2013.6820369
  • Filename
    6820369