Finite Backlog Effects on Downlink Scheduling

Files in this item

Files Size Format View
Ahm2003Nov5FiniteBac.PDF 108.3Kb application/pdf Thumbnail

Show full item record

Item Metadata

Title: Finite Backlog Effects on Downlink Scheduling
Author: Ahmed, Nasir; Khojastepour, Mohammad; Sabharwal, Ashutosh; Aazhang, Behnaam
Type: Conference paper
Keywords: Downlink Scheduling; Broadcast; Spectral Efficiency
Citation: N. Ahmed, M. Khojastepour, A. Sabharwal and B. Aazhang, "Finite Backlog Effects on Downlink Scheduling," pp. 399-405, 2003.
Abstract: In a multi-user downlink system, the use of channel estimates in the scheduling process can significantly improve the spectral efficiency. Recent work has shown that from a sum rate capacity standpoint, and assuming infinite queue backlogs, the optimal transmission scheme is to select the user with the largest instantaneous channel gain. A more realistic scenario is considered in this work, in which the downlink scheduling problem with finite queue backlogs is analyzed. It is shown that although time division scheduling is optimal for infinite backlogs, this is not the case for finite buffer sizes. In fact, a simple broadcast scheduler is shown to be more power efficient than the maximum rate time division scheduler under such a scenario.
Date Published: 2003-11-20

This item appears in the following Collection(s)

  • ECE Publications [1048 items]
    Publications by Rice University Electrical and Computer Engineering faculty and graduate students