Traffic aided opportunistic scheduling for wireless networks

Algorithms and performance bounds

Ming Hu, Junshan Zhang, John Sadowsky

Research output: Contribution to journalArticle

19 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. More specifically, we first establish convexity 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 bounds and upper bounds on the total completion time, which serve as benchmarks for examining the performance of the TAOS schemes. Our results show that the proposed TAOS schemes can yield significant reduction in the total completion time. The impact of fading, file size distributions, and random arrivals and departures, on the system performance, is also investigated. In particular, in the presence of user dynamics, the proposed TAOS schemes perform well when the arrival rate is reasonably high.

Original languageEnglish (US)
Pages (from-to)505-518
Number of pages14
JournalComputer Networks
Volume46
Issue number4
DOIs
StatePublished - Nov 15 2004

Fingerprint

Wireless networks
Scheduling
Throughput

Keywords

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

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

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

In: Computer Networks, Vol. 46, No. 4, 15.11.2004, p. 505-518.

Research output: Contribution to journalArticle

@article{14c67696cf964345b743d7235b77f0ad,
title = "Traffic aided opportunistic scheduling for wireless networks: 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. More specifically, we first establish convexity 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 bounds and upper bounds on the total completion time, which serve as benchmarks for examining the performance of the TAOS schemes. Our results show that the proposed TAOS schemes can yield significant reduction in the total completion time. The impact of fading, file size distributions, and random arrivals and departures, on the system performance, is also investigated. In particular, in the presence of user dynamics, the proposed TAOS schemes perform well when the arrival rate is reasonably high.",
keywords = "Completion time, Cross-layer, Opportunistic scheduling, Wireless networks",
author = "Ming Hu and Junshan Zhang and John Sadowsky",
year = "2004",
month = "11",
day = "15",
doi = "10.1016/j.comnet.2004.05.005",
language = "English (US)",
volume = "46",
pages = "505--518",
journal = "Computer Networks",
issn = "1389-1286",
publisher = "Elsevier",
number = "4",

}

TY - JOUR

T1 - Traffic aided opportunistic scheduling for wireless networks

T2 - Algorithms and performance bounds

AU - Hu, Ming

AU - Zhang, Junshan

AU - Sadowsky, John

PY - 2004/11/15

Y1 - 2004/11/15

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. More specifically, we first establish convexity 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 bounds and upper bounds on the total completion time, which serve as benchmarks for examining the performance of the TAOS schemes. Our results show that the proposed TAOS schemes can yield significant reduction in the total completion time. The impact of fading, file size distributions, and random arrivals and departures, on the system performance, is also investigated. In particular, in the presence of user dynamics, the proposed TAOS schemes perform well when the arrival rate is reasonably high.

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. More specifically, we first establish convexity 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 bounds and upper bounds on the total completion time, which serve as benchmarks for examining the performance of the TAOS schemes. Our results show that the proposed TAOS schemes can yield significant reduction in the total completion time. The impact of fading, file size distributions, and random arrivals and departures, on the system performance, is also investigated. In particular, in the presence of user dynamics, the proposed TAOS schemes perform well when the arrival rate is reasonably high.

KW - Completion time

KW - Cross-layer

KW - Opportunistic scheduling

KW - Wireless networks

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

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

U2 - 10.1016/j.comnet.2004.05.005

DO - 10.1016/j.comnet.2004.05.005

M3 - Article

VL - 46

SP - 505

EP - 518

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

IS - 4

ER -