Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Networking and Internet Architecture

arXiv:2204.11369 (cs)
[Submitted on 24 Apr 2022]

Title:LTE Cellular Networks Packet Scheduling Algorithms in Downlink and Uplink Transmission, A Survey

Authors:Najem N Sirhan, Manel Martinez-Ramon
View PDF
Abstract:This survey paper provides a detailed explanation of Long Term Evolution cellular network packet scheduling algorithms in both downlink and uplink directions. It starts by explaining the difference between Orthogonal Frequency Division Multiple Access that is used in downlink transmission, and Single Carrier Frequency Division Multiple Access is used in uplink. Then, it explains the difference between the LTE scheduling process in the donwlink and uplink through explaining the interaction between users and the scheduler. Then, it explains the most commonly used downlink and uplink scheduling algorithms through analyzing their formulas, characteristics, most suitable conditions for them to work in, and the main differences among them. This explanation covers the Max Carrier-to-Interference, Round Robin, Proportional Fair, Earliest Deadline First, Modified EDF-PF, Modified-Largest Weighted Delay First, Exponential Proportional Fairness, Token Queues Mechanism, Packet Loss Ratio, Quality Guaranteed, Opportunistic Packet Loss Fair, Low Complexity, LC-Delay, PF-Delay, Maximum Throughput, First Maximum Expansion, and Adaptive Resource Allocation Based Packet Scheduling. Lastly, it provides some concluding remarks.
Subjects: Networking and Internet Architecture (cs.NI)
Cite as: arXiv:2204.11369 [cs.NI]
  (or arXiv:2204.11369v1 [cs.NI] for this version)
  https://doi.org/10.48550/arXiv.2204.11369
Related DOI: https://doi.org/10.5121/ijwmn.2022.14201

Submission history

From: Najem Nafiz Sirhan [view email]
[v1] Sun, 24 Apr 2022 22:13:59 UTC (1,477 KB)
Full-text links:

Access Paper:

  • View PDF
  • Other Formats
license icon view license
Current browse context:
cs.NI
< prev   |   next >
new | recent | 2022-04
Change to browse by:
cs

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)