Optimal Semi-Persistent Uplink Scheduling Policy for Large-Scale Antenna Systems

Kyung Jun Choi, Kwang Soon Kim

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In this paper, the uplink semi-persistent scheduling policy problem of minimizing network latency is considered for a training-based large-scale antenna system employing two simple linear receivers, a maximum ratio combiner and a zero-forcing receiver, while satisfying each user's reliability and latency constraints under an energy constraint. The network latency is defined as the air-time requested either to serve all users with a minimum quality-of-service, including reliability constraints and minimum throughput levels, or to maximize the spectral efficiency. Optimal non-orthogonal pilots are used to decrease the network latency. An optimization algorithm for determining the latency-optimal uplink scheduling policy using binary-integer programming (BIP) with an exponential-time complexity is proposed. In addition, it is proven that a linear programming relaxation of the BIP can provide an optimal solution with a polynomial-time complexity. Numerical simulations demonstrate that the proposed scheduling policy can provide several times lower network latency in realistic environments than conventional policies. The proposed optimal semi-persistent scheduling policy provides critical guidelines for designing 5G and future cellular systems, particularly for their ultra-reliable low-latency communication services.

Original languageEnglish
Article number8076824
Pages (from-to)22902-22915
Number of pages14
JournalIEEE Access
Volume5
DOIs
Publication statusPublished - 2017 Oct 19

Fingerprint

Scheduling
Antennas
Integer programming
Linear programming
Quality of service
Throughput
Polynomials
Communication
Computer simulation
Air

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Materials Science(all)
  • Engineering(all)

Cite this

@article{bf0947f0fa214f4c87e65079dbbc17d3,
title = "Optimal Semi-Persistent Uplink Scheduling Policy for Large-Scale Antenna Systems",
abstract = "In this paper, the uplink semi-persistent scheduling policy problem of minimizing network latency is considered for a training-based large-scale antenna system employing two simple linear receivers, a maximum ratio combiner and a zero-forcing receiver, while satisfying each user's reliability and latency constraints under an energy constraint. The network latency is defined as the air-time requested either to serve all users with a minimum quality-of-service, including reliability constraints and minimum throughput levels, or to maximize the spectral efficiency. Optimal non-orthogonal pilots are used to decrease the network latency. An optimization algorithm for determining the latency-optimal uplink scheduling policy using binary-integer programming (BIP) with an exponential-time complexity is proposed. In addition, it is proven that a linear programming relaxation of the BIP can provide an optimal solution with a polynomial-time complexity. Numerical simulations demonstrate that the proposed scheduling policy can provide several times lower network latency in realistic environments than conventional policies. The proposed optimal semi-persistent scheduling policy provides critical guidelines for designing 5G and future cellular systems, particularly for their ultra-reliable low-latency communication services.",
author = "Choi, {Kyung Jun} and Kim, {Kwang Soon}",
year = "2017",
month = "10",
day = "19",
doi = "10.1109/ACCESS.2017.2764803",
language = "English",
volume = "5",
pages = "22902--22915",
journal = "IEEE Access",
issn = "2169-3536",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

Optimal Semi-Persistent Uplink Scheduling Policy for Large-Scale Antenna Systems. / Choi, Kyung Jun; Kim, Kwang Soon.

In: IEEE Access, Vol. 5, 8076824, 19.10.2017, p. 22902-22915.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Optimal Semi-Persistent Uplink Scheduling Policy for Large-Scale Antenna Systems

AU - Choi, Kyung Jun

AU - Kim, Kwang Soon

PY - 2017/10/19

Y1 - 2017/10/19

N2 - In this paper, the uplink semi-persistent scheduling policy problem of minimizing network latency is considered for a training-based large-scale antenna system employing two simple linear receivers, a maximum ratio combiner and a zero-forcing receiver, while satisfying each user's reliability and latency constraints under an energy constraint. The network latency is defined as the air-time requested either to serve all users with a minimum quality-of-service, including reliability constraints and minimum throughput levels, or to maximize the spectral efficiency. Optimal non-orthogonal pilots are used to decrease the network latency. An optimization algorithm for determining the latency-optimal uplink scheduling policy using binary-integer programming (BIP) with an exponential-time complexity is proposed. In addition, it is proven that a linear programming relaxation of the BIP can provide an optimal solution with a polynomial-time complexity. Numerical simulations demonstrate that the proposed scheduling policy can provide several times lower network latency in realistic environments than conventional policies. The proposed optimal semi-persistent scheduling policy provides critical guidelines for designing 5G and future cellular systems, particularly for their ultra-reliable low-latency communication services.

AB - In this paper, the uplink semi-persistent scheduling policy problem of minimizing network latency is considered for a training-based large-scale antenna system employing two simple linear receivers, a maximum ratio combiner and a zero-forcing receiver, while satisfying each user's reliability and latency constraints under an energy constraint. The network latency is defined as the air-time requested either to serve all users with a minimum quality-of-service, including reliability constraints and minimum throughput levels, or to maximize the spectral efficiency. Optimal non-orthogonal pilots are used to decrease the network latency. An optimization algorithm for determining the latency-optimal uplink scheduling policy using binary-integer programming (BIP) with an exponential-time complexity is proposed. In addition, it is proven that a linear programming relaxation of the BIP can provide an optimal solution with a polynomial-time complexity. Numerical simulations demonstrate that the proposed scheduling policy can provide several times lower network latency in realistic environments than conventional policies. The proposed optimal semi-persistent scheduling policy provides critical guidelines for designing 5G and future cellular systems, particularly for their ultra-reliable low-latency communication services.

UR - http://www.scopus.com/inward/record.url?scp=85032673957&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85032673957&partnerID=8YFLogxK

U2 - 10.1109/ACCESS.2017.2764803

DO - 10.1109/ACCESS.2017.2764803

M3 - Article

VL - 5

SP - 22902

EP - 22915

JO - IEEE Access

JF - IEEE Access

SN - 2169-3536

M1 - 8076824

ER -