SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
Probability in the Engineering and Informational Sciences
Exploiting medium access diversity in rate adaptive wireless LANs
Proceedings of the 10th annual international conference on Mobile computing and networking
Stable scheduling policies for fading wireless channels
IEEE/ACM Transactions on Networking (TON)
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Optimal channel probing and transmission scheduling for opportunistic spectrum access
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Opportunistic spectral usage: bounds and a multi-band CSMA/CA protocol
IEEE/ACM Transactions on Networking (TON)
Scheduling with limited information in wireless systems
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Scheduling in multi-channel wireless networks: rate function optimality in the small-buffer regime
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
IEEE Journal on Selected Areas in Communications - Special issue on broadband access networks: Architectures and protocols
Low-complexity scheduling algorithms for multi-channel downlink wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
On the capacity of MIMO broadcast channels with partial side information
IEEE Transactions on Information Theory
Dynamic server allocation to parallel queues with randomly varying connectivity
IEEE Transactions on Information Theory
Limited feedback schemes for downlink OFDMA based on sub-channel groups
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
This paper studies the allocation of feedback resources in the downlink of a frequency-division duplex (FDD) multichannel wireless system. We consider a downlink network with a single base station, L shared channels, and N mobile users. Throughput optimal algorithms like MaxWeight in general require the complete channel-state information (CSI) (N L link states) for scheduling. Acquiring the complete CSI, however, is a prohibitive overhead in multichannel networks when the number of users is large. In this paper, we consider the scenario where the base station allocates only a limited amount of uplink resources for acquiring channel-state information. We first show that to support a (1-ε) fraction of the full throughput region (the throughput region with the complete CSI), the base station needs to acquire at least Θ ((1-ε)L) link states at each time-slot. We then propose a Weight-Based Feedback allocation, named WBF, and show that WBF together with MaxWeight scheduling achieves a (1-ε) fraction of the full throughput region by acquiring Θ(L log 1/ε) link states per time-slot. For i.i.d. ON-OFF channels, we further prove that Θ(L log 1/ε) link states per time-slot is necessary for achieving a (1-ε) fraction of the full throughput region.