Sharif, Masoud and Hassibi, Babak (2004) Delay guarantee versus throughput in broadcast fading channels. In: International Symposium on Information Theory (ISIT 2004), Chicago, IL, 27 June-2 July 2004. IEEE , Piscataway, NJ, p. 245. ISBN 0780382803 http://resolver.caltech.edu/CaltechAUTHORS:SHAisit04b
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:SHAisit04b
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.
|Item Type:||Book Section|
|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.|
|Subject Keywords:||Rayleigh channels; broadcast channels; data communication; delays; packet switching; transmitting antennas; Rayleigh fading channel; backlogged users; broadcast fading channels; delay guarantee; optimal throughput strategy; packet-based transmission; single-antenna|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Kristin Buxton|
|Deposited On:||16 Mar 2008|
|Last Modified:||26 Dec 2012 09:52|
Repository Staff Only: item control page