By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ming Hu ; Dept. of Electr. Eng., Arizona State Univ., Tempe, AZ ; Junshan Zhang ; Sadowsky, J.

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

Published in:

INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies  (Volume:3 )

Date of Conference:

7-11 March 2004