Scheduling for 5G Cellular Networks with Priority and Deadline Constraints

Ido Hadar, Li On Raviv, Amir Leshem

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations

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.

Original languageAmerican English
Title of host publication2018 IEEE International Conference on the Science of Electrical Engineering in Israel, ICSEE 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781538663783
DOIs
StatePublished - 2 Jul 2018
Externally publishedYes
Event2018 IEEE International Conference on the Science of Electrical Engineering in Israel, ICSEE 2018 - Eilat, Israel
Duration: 12 Dec 201814 Dec 2018

Publication series

Name2018 IEEE International Conference on the Science of Electrical Engineering in Israel, ICSEE 2018

Conference

Conference2018 IEEE International Conference on the Science of Electrical Engineering in Israel, ICSEE 2018
Country/TerritoryIsrael
CityEilat
Period12/12/1814/12/18

Bibliographical note

Publisher Copyright:
© 2018 IEEE.

Keywords

  • 5G networks
  • EDF
  • cellular communication
  • resource allocation
  • scheduling

Fingerprint

Dive into the research topics of 'Scheduling for 5G Cellular Networks with Priority and Deadline Constraints'. Together they form a unique fingerprint.

Cite this