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

Ming Hu; Junshan Zhang; John Sadowsky

doi:10.1109/INFCOM.2004.1354577

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

Ming Hu, Junshan Zhang, John Sadowsky

Electrical Engineering

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

19 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 language	English (US)
Title of host publication	IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies
Pages	1652-1661
Number of pages	10
DOIs	https://doi.org/10.1109/INFCOM.2004.1354577
State	Published - 2004
Event	IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies - Hongkong, China Duration: Mar 7 2004 → Mar 11 2004

Publication series

Name	Proceedings - IEEE INFOCOM
Volume	3
ISSN (Print)	0743-166X

Other

Other	IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies
Country/Territory	China
City	Hongkong
Period	3/7/04 → 3/11/04

Keywords

Completion time
Cross-layer
Opportunistic Scheduling
Wireless networks

ASJC Scopus subject areas

Computer Science(all)
Electrical and Electronic Engineering

Access to Document

10.1109/INFCOM.2004.1354577

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

Traffic aided opportunistic scheduling for downlink transmissions: Algorithms and performance bounds. / Hu, Ming; Zhang, Junshan; Sadowsky, John.
IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies. 2004. p. 1652-1661 (Proceedings - IEEE INFOCOM; Vol. 3).

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

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

@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",

series = "Proceedings - IEEE INFOCOM",

pages = "1652--1661",

booktitle = "IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies",

note = "IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies ; Conference date: 07-03-2004 Through 11-03-2004",

}

TY - GEN

T1 - Traffic aided opportunistic scheduling for downlink transmissions

T2 - IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies

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

T3 - Proceedings - IEEE INFOCOM

SP - 1652

EP - 1661

BT - IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies

Y2 - 7 March 2004 through 11 March 2004

ER -

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

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this