DMCA
Order optimal delay for opportunistic scheduling in multi-user wireless uplinks and downlinks (2006)
| Venue: | Proc. of Allerton Conf. on Communication, Control, and Computing (invited paper |
| Citations: | 43 - 6 self |
BibTeX
@INPROCEEDINGS{Neely06orderoptimal,
author = {Michael J. Neely},
title = {Order optimal delay for opportunistic scheduling in multi-user wireless uplinks and downlinks},
booktitle = {Proc. of Allerton Conf. on Communication, Control, and Computing (invited paper},
year = {2006}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract — We consider a one-hop wireless network with independent time varying channels and N users, such as a multiuser uplink or downlink. We first show that general classes of scheduling algorithms that do not consider queue backlog necessarily incur average delay that grows at least linearly with N. We then construct a dynamic queue-length aware algorithm that stabilizes the system and achieves an average delay that is independent of N. This is the first analytical demonstration that O(1) delay is achievable in such a multi-user wireless setting. The delay bounds are achieved via a technique of queue grouping together with basic Lyapunov stability and statistical multiplexing concepts.
Keyphrases
order optimal delay multi-user wireless uplink opportunistic scheduling basic lyapunov stability one-hop wireless network average delay multi-user wireless setting statistical multiplexing concept general class dynamic queue-length aware algorithm queue backlog multiuser uplink independent time delay bound first analytical demonstration incur average delay
