• Türkçe
    • English
  • English 
    • Türkçe
    • English
  • Login
View Item 
  •   [email protected]
  • Araştırma Çıktıları | TR-Dizin | WoS | Scopus | PubMed
  • Scopus İndeksli Yayınlar Koleksiyonu
  • View Item
  •   [email protected]
  • Araştırma Çıktıları | TR-Dizin | WoS | Scopus | PubMed
  • Scopus İndeksli Yayınlar Koleksiyonu
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Performance analysis of user scheduling in massive MIMO with fast moving users

Thumbnail

View/Open

Tam Metin / Full Text (365.4Kb)

Access

info:eu-repo/semantics/embargoedAccess

Date

2019

Author

Thet, Nann Win Moe
Baykaş, Tuncer
Özdemir, Mehmet Kemal

Metadata

Show full item record

Citation

Thet, N. W. M., Baykaş, T. ve Özdemir, M. K. (2019). Performance analysis of user scheduling in massive MIMO with fast moving users. 30th IEEE Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC). Istanbul, Turkey, 8-11 September 2019. IEEE. http://doi.org/10.1109/PIMRC.2019.8904133

Abstract

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.

Source

30th IEEE Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

URI

http://doi.org/10.1109/PIMRC.2019.8904133
https://hdl.handle.net/20.500.12511/4848

Collections

  • Bildiri Koleksiyonu [181]
  • Scopus İndeksli Yayınlar Koleksiyonu [5132]
  • WoS İndeksli Yayınlar Koleksiyonu [5388]



DSpace software copyright © 2002-2015  DuraSpace
Contact Us | Send Feedback
Theme by 
@mire NV
 

 




| Guide | Contact |

[email protected]

by OpenAIRE
Advanced Search

sherpa/romeo

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsInstitution AuthorORCIDTitlesSubjectsTypeLanguageDepartmentCategoryWoS Q ValueScopus Q ValuePublisherAccess TypeThis CollectionBy Issue DateAuthorsInstitution AuthorORCIDTitlesSubjectsTypeLanguageDepartmentCategoryWoS Q ValueScopus Q ValuePublisherAccess Type

My Account

LoginRegister

Statistics

View Google Analytics Statistics

DSpace software copyright © 2002-2015  DuraSpace
Contact Us | Send Feedback
Theme by 
@mire NV
 

 


|| Guide || Library || İstanbul Medipol University || OAI-PMH ||

Kütüphane ve Dokümantasyon Daire Başkanlığı, İstabul, Turkey
If you find any errors in content, please contact: [email protected]

Creative Commons License
[email protected] by İstanbul Medipol University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..

[email protected]:


DSpace 6.2

tarafından İdeal DSpace hizmetleri çerçevesinde özelleştirilerek kurulmuştur.