Performance Analysis of User Scheduling in Massive MIMO with Fast Moving Users


Moe Thet N. W., Baykas T., ÖZDEMİR M. K.

30th IEEE Annual International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2019, İstanbul, Türkiye, 8 - 11 Eylül 2019, cilt.2019-September identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası: 2019-September
  • Doi Numarası: 10.1109/pimrc.2019.8904133
  • Basıldığı Şehir: İstanbul
  • Basıldığı Ülke: Türkiye
  • Anahtar Kelimeler: fast fading channel, massive MIMO, user grouping and scheduling
  • İstanbul Medipol Üniversitesi Adresli: Evet

Özet

This paper analyzes the effect of fast fading Doppler channel on user scheduling algorithms. Considering a millimeter wave (mmWave) downlink massive multiple-input multiple-output (M-MIMO) system, we adopt a two-stage precoding method to cancel the interference from users. Improved K-mean clustering method with weighted likelihood (WLD) similarity measure is employed to group the active users within a given region. After grouping the users, different scheduling methods, semi-orthogonal user selection (SUS) algorithm and greedy algorithm, are implemented. Initially, grouping and scheduling are performed based on the static channels. Then, the scheduled users are simultaneously served for the next time frames without rescheduling while the users are moving. With this approach, this paper reveals how static and time-varying user grouping and scheduling methods perform in terms of system sum-rate when the fast moving users experience the Doppler effect. Different scenarios of number of active users and time frames are simulated. It is observed that rescheduling is required when greedy algorithm is used in order to maintain high sum-rate, while SUS algorithm does not achieve high sum-rate compared to greedy algorithm.