Published June 2004
| Published
Book Section - Chapter
Open
Delay guarantee versus throughput in broadcast fading channels
- Creators
- Sharif, Masoud
- Hassibi, Babak
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
- Eprint ID
- 9768
- Resolver ID
- CaltechAUTHORS:SHAisit04b
- NSF
- CCR-0133818
- Office of Naval Research (ONR)
- N00014-02-1-0578
- Caltech Lee Center for Advanced Networking
- Created
-
2008-03-16Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field