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 Citations (Scopus)

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 publicationProceedings - IEEE INFOCOM
Pages1652-1661
Number of pages10
Volume3
DOIs
StatePublished - 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

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

Fingerprint

Scheduling
Wireless networks
Throughput

Keywords

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

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture

Cite this

Traffic aided opportunistic scheduling for downlink transmissions : Algorithms and performance bounds. / Hu, Ming; Zhang, Junshan; Sadowsky, John.

Proceedings - IEEE INFOCOM. Vol. 3 2004. p. 1652-1661.

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

Hu, M, Zhang, J & Sadowsky, J 2004, Traffic aided opportunistic scheduling for downlink transmissions: Algorithms and performance bounds. in Proceedings - IEEE INFOCOM. vol. 3, pp. 1652-1661, IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies, Hongkong, China, 3/7/04. https://doi.org/10.1109/INFCOM.2004.1354577
Hu, Ming ; Zhang, Junshan ; Sadowsky, John. / Traffic aided opportunistic scheduling for downlink transmissions : Algorithms and performance bounds. Proceedings - IEEE INFOCOM. Vol. 3 2004. pp. 1652-1661
@inproceedings{5de7512c778e4e0db2b1581b4d03ae42,
title = "Traffic aided opportunistic scheduling for downlink transmissions: Algorithms and performance bounds",
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.",
keywords = "Completion time, Cross-layer, Opportunistic Scheduling, Wireless networks",
author = "Ming Hu and Junshan Zhang and John Sadowsky",
year = "2004",
doi = "10.1109/INFCOM.2004.1354577",
language = "English (US)",
isbn = "0780383559",
volume = "3",
pages = "1652--1661",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - Traffic aided opportunistic scheduling for downlink transmissions

T2 - Algorithms and performance bounds

AU - Hu, Ming

AU - Zhang, Junshan

AU - Sadowsky, John

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

KW - Completion time

KW - Cross-layer

KW - Opportunistic Scheduling

KW - Wireless networks

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

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

U2 - 10.1109/INFCOM.2004.1354577

DO - 10.1109/INFCOM.2004.1354577

M3 - Conference contribution

AN - SCOPUS:8344246153

SN - 0780383559

VL - 3

SP - 1652

EP - 1661

BT - Proceedings - IEEE INFOCOM

ER -