{"title":"Scheduling For 5G Cellular Networks With Priority And Deadline Constraints","authors":"Ido Hadar, Li-on Raviv, Amir Leshem","doi":"10.1109/ICSEE.2018.8646225","DOIUrl":null,"url":null,"abstract":"Packet scheduling in 5G networks can significantly affect the performance of beam forming techniques since the allocation of multiple users to the same time-frequency block causes interference between users. A combination of beam forming and scheduling can thus improve the performance of multi-user MIMO systems. Furthermore, in realistic conditions, data packets have both priority and deadlines beyond which they become obsolete. In this paper we propose a simple scheduling algorithm which takes priorities and deadlines into account and allocates users to resource blocks and spatial beams. We demonstrate the merits of the proposed technique compared to other state-of-the-art scheduling methods through simulations.","PeriodicalId":254455,"journal":{"name":"2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSEE.2018.8646225","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
Packet scheduling in 5G networks can significantly affect the performance of beam forming techniques since the allocation of multiple users to the same time-frequency block causes interference between users. A combination of beam forming and scheduling can thus improve the performance of multi-user MIMO systems. Furthermore, in realistic conditions, data packets have both priority and deadlines beyond which they become obsolete. In this paper we propose a simple scheduling algorithm which takes priorities and deadlines into account and allocates users to resource blocks and spatial beams. We demonstrate the merits of the proposed technique compared to other state-of-the-art scheduling methods through simulations.