Frequency Domain Packet Scheduling with MIMO for 3GPP LTE Downlink

In this paper, we formalize a general Frequency Domain Packet Scheduling (FDPS) problem for 3GPP LTE Downlink (DL). The DL FDPS problem incorporates the SingleUser Multiple Input Multiple Output (SU-MIMO) technique, and can express various scheduling policies, including the Proportional-Fair metric,...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on wireless communications 2013-04, Vol.12 (4), p.1752-1761
Main Authors: Xu, Yinsheng, Yang, Hongkun, Ren, Fengyuan, Lin, Chuang, Shen, Xuemin Sherman
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Algorithms
Applied sciences
Approximation
Approximation algorithms
Approximation methods
approximation ratio
Downlink
downlink (DL)
Equipments and installations
Exact sciences and technology
Frequency domain analysis
frequency domain packet scheduling (FDPS)
Frequency domains
Information, signal and communications theory
Long Term Evolution
Long Term Evolution (LTE)
Mathematical analysis
matroid
MIMO
Mobile communication systems
Mobile radiocommunication systems
Multiplexing
optimization algorithm
Packets (communication)
Radiocommunications
Scheduling
Signal and communications theory
Studies
submodular function
Switching and signalling
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Wireless communication
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we formalize a general Frequency Domain Packet Scheduling (FDPS) problem for 3GPP LTE Downlink (DL). The DL FDPS problem incorporates the SingleUser Multiple Input Multiple Output (SU-MIMO) technique, and can express various scheduling policies, including the Proportional-Fair metric, the MaxWeight scheduling, etc. For LTE DL SU-MIMO, the constraint of selecting only one MIMO mode (transmit diversity or spatial multiplexing) per user in each transmission time interval (TTI) increases the hardness of the FDPS problem. We prove the problem is MAX SNP-hard, which implies approximation algorithms with constant approximation ratios are the best we can expect. Subsequently, we propose an approximation algorithm of polynomial runtime. The solution is based on a greedy method for maximizing a non-decreasing submodular function over a matroid. The algorithm can solve the general DL FDPS problem with an approximation ratio of 4. We implement the proposed algorithm and compare its performance with other well-known schedulers.
ISSN:1536-1276
1558-2248
DOI:10.1109/TWC.2013.022113.120678