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
IEEE Journal on Selected Areas in Communications - Special issue on broadband access networks: Architectures and protocols
Limited feedback schemes for downlink OFDMA based on sub-channel groups
IEEE Journal on Selected Areas in Communications
On distributed scheduling with heterogeneously delayed network-state information
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
This paper studies feedback resource allocation 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 the MaxWeight scheduling in general require the complete channel state information (with N × L link states) for scheduling, which could be unaffordably expensive when the number of users is large. In this paper, we consider the scenario where the base station allocates only limited uplink resource for acquiring channel state information. We first show that to support a fraction (1 - ε) of the full throughput region (the throughput region with full channel state information), the base station needs to acquire at least Θ(L) link states at each time slot. We then propose a Weight Based Feedback allocation, named WBF, and show that WBF together with the MaxWeight scheduling achieves a fraction (1 - ε) of the full throughput region by acquiring at most Θ(L log 1 ⁄ ε) link states per time slot.