Traffic aided opportunistic scheduling for downlink transmissions: Algorithms and performance bounds

Ming Hu, Junshan Zhang, John Sadowsky

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

15 Scopus citations

Abstract

In multiuser wireless networks, opportunistic scheduling can improve the system throughput and thus reduce the total completion time. In this paper, we explore the possibility of reducing the completion time further by incorporating traffic information into opportunistic scheduling. In particular, we first establish general properties for opportunistic scheduling with file size information. Then, we develop new traffic aided opportunistic scheduling (TAOS) schemes by making use of file size information and channel variation in a unified manner. We also derive lower and upper bounds on the total completion time. Our results show that the proposed TAOS schemes can yield significant reduction in the total completion time.

Original languageEnglish (US)
Title of host publicationIEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies
Pages1652-1661
Number of pages10
DOIs
StatePublished - Nov 22 2004
EventIEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies - Hongkong, China
Duration: Mar 7 2004Mar 11 2004

Publication series

NameProceedings - IEEE INFOCOM
Volume3
ISSN (Print)0743-166X

Other

OtherIEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies
CountryChina
CityHongkong
Period3/7/043/11/04

Keywords

  • Completion time
  • Cross-layer
  • Opportunistic Scheduling
  • Wireless networks

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Traffic aided opportunistic scheduling for downlink transmissions: Algorithms and performance bounds'. Together they form a unique fingerprint.

  • Cite this

    Hu, M., Zhang, J., & Sadowsky, J. (2004). Traffic aided opportunistic scheduling for downlink transmissions: Algorithms and performance bounds. In IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies (pp. 1652-1661). (Proceedings - IEEE INFOCOM; Vol. 3). https://doi.org/10.1109/INFCOM.2004.1354577