Delay minimization in multiple access channels

Jing Yang, Sennur Ulukus

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Citations (Scopus)

Abstract

We investigate a delay minimization problem in a multiple access wireless communication system. We consider a discrete-time non-fading additive white Gaussian noise (AWGN) multiple access channel. In each slot, bits arrive at the transmitters randomly according to some distribution, which is LLd. from user to user and from slot to slot. Each transmitter has an average power constraint of P. Our goal is to allocate rates to users, from the multiple access capacity region, based on their current queue lengths, in order to minimize the average delay of the system. We formulate the problem as a Markov decision problem (MDP) with an average cost criterion. We first show that the value function is increasing, symmetric and convex in the queue length vector. Taking advantage of these properties, we show that the optimal rate allocation policy is one which tries to equalize the queue lengths as much as possible in each slot, while working on the dominant face of the capacity region.

Original languageEnglish (US)
Title of host publication2009 IEEE International Symposium on Information Theory, ISIT 2009
Pages2366-2370
Number of pages5
DOIs
StatePublished - Nov 19 2009
Event2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of
Duration: Jun 28 2009Jul 3 2009

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8102

Other

Other2009 IEEE International Symposium on Information Theory, ISIT 2009
CountryKorea, Republic of
CitySeoul
Period6/28/097/3/09

Fingerprint

Multiple Access Channel
Queue Length
Transmitters
Multiple Access
Transmitter
Communication systems
Average Cost
Optimal Rates
Gaussian White Noise
Wireless Communication
Decision problem
Value Function
Minimization Problem
Communication Systems
Discrete-time
Face
Minimise
Costs

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Cite this

Yang, J., & Ulukus, S. (2009). Delay minimization in multiple access channels. In 2009 IEEE International Symposium on Information Theory, ISIT 2009 (pp. 2366-2370). [5205978] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2009.5205978
Yang, Jing ; Ulukus, Sennur. / Delay minimization in multiple access channels. 2009 IEEE International Symposium on Information Theory, ISIT 2009. 2009. pp. 2366-2370 (IEEE International Symposium on Information Theory - Proceedings).
@inproceedings{5d167cd9b5bd4ea89ea786d898d6114c,
title = "Delay minimization in multiple access channels",
abstract = "We investigate a delay minimization problem in a multiple access wireless communication system. We consider a discrete-time non-fading additive white Gaussian noise (AWGN) multiple access channel. In each slot, bits arrive at the transmitters randomly according to some distribution, which is LLd. from user to user and from slot to slot. Each transmitter has an average power constraint of P. Our goal is to allocate rates to users, from the multiple access capacity region, based on their current queue lengths, in order to minimize the average delay of the system. We formulate the problem as a Markov decision problem (MDP) with an average cost criterion. We first show that the value function is increasing, symmetric and convex in the queue length vector. Taking advantage of these properties, we show that the optimal rate allocation policy is one which tries to equalize the queue lengths as much as possible in each slot, while working on the dominant face of the capacity region.",
author = "Jing Yang and Sennur Ulukus",
year = "2009",
month = "11",
day = "19",
doi = "10.1109/ISIT.2009.5205978",
language = "English (US)",
isbn = "9781424443130",
series = "IEEE International Symposium on Information Theory - Proceedings",
pages = "2366--2370",
booktitle = "2009 IEEE International Symposium on Information Theory, ISIT 2009",

}

Yang, J & Ulukus, S 2009, Delay minimization in multiple access channels. in 2009 IEEE International Symposium on Information Theory, ISIT 2009., 5205978, IEEE International Symposium on Information Theory - Proceedings, pp. 2366-2370, 2009 IEEE International Symposium on Information Theory, ISIT 2009, Seoul, Korea, Republic of, 6/28/09. https://doi.org/10.1109/ISIT.2009.5205978

Delay minimization in multiple access channels. / Yang, Jing; Ulukus, Sennur.

2009 IEEE International Symposium on Information Theory, ISIT 2009. 2009. p. 2366-2370 5205978 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Delay minimization in multiple access channels

AU - Yang, Jing

AU - Ulukus, Sennur

PY - 2009/11/19

Y1 - 2009/11/19

N2 - We investigate a delay minimization problem in a multiple access wireless communication system. We consider a discrete-time non-fading additive white Gaussian noise (AWGN) multiple access channel. In each slot, bits arrive at the transmitters randomly according to some distribution, which is LLd. from user to user and from slot to slot. Each transmitter has an average power constraint of P. Our goal is to allocate rates to users, from the multiple access capacity region, based on their current queue lengths, in order to minimize the average delay of the system. We formulate the problem as a Markov decision problem (MDP) with an average cost criterion. We first show that the value function is increasing, symmetric and convex in the queue length vector. Taking advantage of these properties, we show that the optimal rate allocation policy is one which tries to equalize the queue lengths as much as possible in each slot, while working on the dominant face of the capacity region.

AB - We investigate a delay minimization problem in a multiple access wireless communication system. We consider a discrete-time non-fading additive white Gaussian noise (AWGN) multiple access channel. In each slot, bits arrive at the transmitters randomly according to some distribution, which is LLd. from user to user and from slot to slot. Each transmitter has an average power constraint of P. Our goal is to allocate rates to users, from the multiple access capacity region, based on their current queue lengths, in order to minimize the average delay of the system. We formulate the problem as a Markov decision problem (MDP) with an average cost criterion. We first show that the value function is increasing, symmetric and convex in the queue length vector. Taking advantage of these properties, we show that the optimal rate allocation policy is one which tries to equalize the queue lengths as much as possible in each slot, while working on the dominant face of the capacity region.

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

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

U2 - 10.1109/ISIT.2009.5205978

DO - 10.1109/ISIT.2009.5205978

M3 - Conference contribution

AN - SCOPUS:70449511643

SN - 9781424443130

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2366

EP - 2370

BT - 2009 IEEE International Symposium on Information Theory, ISIT 2009

ER -

Yang J, Ulukus S. Delay minimization in multiple access channels. In 2009 IEEE International Symposium on Information Theory, ISIT 2009. 2009. p. 2366-2370. 5205978. (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2009.5205978