Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published June 2004 | Published
Book Section - Chapter Open

Delay guarantee versus throughput in broadcast fading channels

Abstract

We consider a single-antenna broadcast fading channel with n backlogged users. Assuming the transmission is packet-based, we define the delay as the minimum number of channel uses that guarantees all n users successfully receive m packets. A delay optimal strategy such as round-robin achieves the delay of mn. For the optimal throughput strategy (i.e. transmitting to the user with the best channel condition at each channel use), we derive the mean and variance of the delay for any m and n. For large n, it is proved that the expected delay in receiving the first packet in all users scales like n log n as opposed to n for the round-robin scheduling.

Additional Information

© 2004 IEEE. Reprinted with Permission. Publication Date: 27 June-2 July 2004. Posted online: 2005-01-10. This work was supported in part by NSF Grant CCR-0133818, by the office of Naval Research Grant N00014-02-1-0578, and by Caltech's Lee Center for Advanced Networking.

Attached Files

Published - SHAisit04b.pdf

Files

SHAisit04b.pdf
Files (240.7 kB)
Name Size Download all
md5:7b33724b49f1d2ac2439c1ce2caf2c2f
240.7 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
March 5, 2024