Scheduling and Dynamic Pilot Allocation for Massive MIMO with Varying Traffic

Creative Commons License

Karaca M.

IEEE Wireless Communications Letters, cilt.9, sa.12, ss.2102-2106, 2020 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 9 Sayı: 12
  • Basım Tarihi: 2020
  • Doi Numarası: 10.1109/lwc.2020.3014196
  • Dergi Adı: IEEE Wireless Communications Letters
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Compendex, INSPEC
  • Sayfa Sayıları: ss.2102-2106
  • Anahtar Kelimeler: Resource management, MIMO communication, Optimized production technology, Dynamic scheduling, Antennas, Heuristic algorithms, Massive MIMO, pilot allocation, Lyapunov optimization, random traffic, queue stability
  • TED Üniversitesi Adresli: Evet

Özet

© 2012 IEEE.In this letter, we consider the problem of joint user scheduling and dynamic pilot allocation in a Time-Division Duplex (TDD) based Massive MIMO network under varying traffic condition. One of the main problems with Massive MIMO systems is that the number of available orthogonal pilot signals is limited, and the dynamic allocation of these signals to different users is crucially needed to utilize the full benefit of these systems. In addition, pilot signals are radio resource control (RRC) configured in practice, and hence the frequent reconfiguration causes high signaling overhead and is costly. Using Lyapunov optimization framework, we develop an optimal algorithm that first assigns pilots dynamically based on queue sizes and the channel conditions of users as well as the reconfiguration cost at large time-scale. Then, it schedules users on a small-time scale. Numerical results show the efficacy of our algorithm and demonstrate that pilots do not need to be configured frequently at the expense of increased queue delay.