Multi-user scheduling in wireless networks with QoS constraints

Lei Ying; R. Srikant; G. E. Dullerad

doi:10.1109/ISIT.2006.261564

Multi-user scheduling in wireless networks with QoS constraints

Lei Ying, R. Srikant, G. E. Dullerad

Arizona State University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

Abstract

We consider a cellular network consisting of a base station and N receivers. The channel states of the receivers are assumed to be identical and independent of each other. The goal is to compare the throughput of two different scheduling policies (a queue-length-based policy and a greedy scheduling policy) given an upper bound on the queue overflow probability. We consider a multi-state channel model, where each channel is assumed to be in one of l. states. Given an upper bound on the queue overflow probability, we obtain a lower bound on the throughput of the queue-length-based policy. For sufficiently large N, the lower bound is shown to be tight, strictly increasing with N, and strictly larger than the throughput of the greedy policy.

Original language	English (US)
Title of host publication	Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
Pages	2759-2763
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2006.261564
State	Published - Dec 1 2006
Event	2006 IEEE International Symposium on Information Theory, ISIT 2006 - Seattle, WA, United States Duration: Jul 9 2006 → Jul 14 2006

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8101

Other

Other	2006 IEEE International Symposium on Information Theory, ISIT 2006
Country/Territory	United States
City	Seattle, WA
Period	7/9/06 → 7/14/06

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2006.261564

Cite this

Multi-user scheduling in wireless networks with QoS constraints. / Ying, Lei; Srikant, R.; Dullerad, G. E.
Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006. 2006. p. 2759-2763 4036475 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Ying, L, Srikant, R & Dullerad, GE 2006, Multi-user scheduling in wireless networks with QoS constraints. in Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006., 4036475, IEEE International Symposium on Information Theory - Proceedings, pp. 2759-2763, 2006 IEEE International Symposium on Information Theory, ISIT 2006, Seattle, WA, United States, 7/9/06. https://doi.org/10.1109/ISIT.2006.261564

@inproceedings{ae7e1f15335548d98ed282a54eee51ad,

title = "Multi-user scheduling in wireless networks with QoS constraints",

abstract = "We consider a cellular network consisting of a base station and N receivers. The channel states of the receivers are assumed to be identical and independent of each other. The goal is to compare the throughput of two different scheduling policies (a queue-length-based policy and a greedy scheduling policy) given an upper bound on the queue overflow probability. We consider a multi-state channel model, where each channel is assumed to be in one of l. states. Given an upper bound on the queue overflow probability, we obtain a lower bound on the throughput of the queue-length-based policy. For sufficiently large N, the lower bound is shown to be tight, strictly increasing with N, and strictly larger than the throughput of the greedy policy.",

author = "Lei Ying and R. Srikant and Dullerad, {G. E.}",

year = "2006",

month = dec,

day = "1",

doi = "10.1109/ISIT.2006.261564",

language = "English (US)",

isbn = "1424405041",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "2759--2763",

booktitle = "Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006",

note = "2006 IEEE International Symposium on Information Theory, ISIT 2006 ; Conference date: 09-07-2006 Through 14-07-2006",

}

TY - GEN

T1 - Multi-user scheduling in wireless networks with QoS constraints

AU - Ying, Lei

AU - Srikant, R.

AU - Dullerad, G. E.

PY - 2006/12/1

Y1 - 2006/12/1

N2 - We consider a cellular network consisting of a base station and N receivers. The channel states of the receivers are assumed to be identical and independent of each other. The goal is to compare the throughput of two different scheduling policies (a queue-length-based policy and a greedy scheduling policy) given an upper bound on the queue overflow probability. We consider a multi-state channel model, where each channel is assumed to be in one of l. states. Given an upper bound on the queue overflow probability, we obtain a lower bound on the throughput of the queue-length-based policy. For sufficiently large N, the lower bound is shown to be tight, strictly increasing with N, and strictly larger than the throughput of the greedy policy.

AB - We consider a cellular network consisting of a base station and N receivers. The channel states of the receivers are assumed to be identical and independent of each other. The goal is to compare the throughput of two different scheduling policies (a queue-length-based policy and a greedy scheduling policy) given an upper bound on the queue overflow probability. We consider a multi-state channel model, where each channel is assumed to be in one of l. states. Given an upper bound on the queue overflow probability, we obtain a lower bound on the throughput of the queue-length-based policy. For sufficiently large N, the lower bound is shown to be tight, strictly increasing with N, and strictly larger than the throughput of the greedy policy.

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

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

U2 - 10.1109/ISIT.2006.261564

DO - 10.1109/ISIT.2006.261564

M3 - Conference contribution

AN - SCOPUS:39049121332

SN - 1424405041

SN - 9781424405046

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2759

EP - 2763

BT - Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006

T2 - 2006 IEEE International Symposium on Information Theory, ISIT 2006

Y2 - 9 July 2006 through 14 July 2006

ER -

Multi-user scheduling in wireless networks with QoS constraints

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this