Frequency-domain packet scheduling for 3GPP LTE uplink

Authors:
Hongkun Yang;Fengyuan Ren;Chuang Lin;Jiao Zhang
Affiliations:
Tsinghua National Laboratory for Information Science and Technology, Department of Computer Science and Technology, Tsinghua University, China;Tsinghua National Laboratory for Information Science and Technology, Department of Computer Science and Technology, Tsinghua University, China;Tsinghua National Laboratory for Information Science and Technology, Department of Computer Science and Technology, Tsinghua University, China;Tsinghua National Laboratory for Information Science and Technology, Department of Computer Science and Technology, Tsinghua University, China
Venue:
INFOCOM'10 Proceedings of the 29th conference on Information communications
Year:
2010

Citing 5
Cited 1

A unified approach to approximating resource allocation and scheduling

Journal of the ACM (JACM)
Introduction to Algorithms

Introduction to Algorithms
Approximating an Interval Scheduling Problem

APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
Scheduling algorithms for multi-carrier wireless data systems

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Instability of the proportional fair scheduling algorithm for HDR

IEEE Transactions on Wireless Communications

Harnessing frequency diversity in wi-fi networks

MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we investigate the frequency-domain packet scheduling (FDPS) problem for 3GPP LTE Uplink (UL). Instead of studying a specific scheduling policy, we provide a unified approach to tackle this issue. First we formalize a general LTE UL FDPS problem which is suitable for various scheduling policies. Then we prove that the problem is MAX SNP-hard, which implies that approximation algorithms with constant approximation ratios are the best that we can hope for. Therefore we design two approximation algorithms, both of which have polynomial runtime. Subsequently, we analyze the two algorithms and find their approximation ratios. The first algorithm is easy to follow, since it is based on a simple greedy method. The second one is based on the local ratio technique and it can approximately solve the LTE UL FDPS problem with a approximation ratio of 2.