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)
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)
Managing resources and quality of service in heterogeneous wireless systems exploiting opportunism
IEEE/ACM Transactions on Networking (TON)
Dynamic power allocation and routing for time-varying wireless networks
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 |
We consider a wireless downlink network with a single base-station, N mobile users and L shared on-off channels. Each mobile user receives a downlink traffic flow from the basestation where a separate queue is maintained for each flow. In this multi-channel downlink network, throughput-optimal scheduling algorithms such as the MaxWeight scheduling require the complete channel state information (i.e., NL channel states) for scheduling. This could be a significant overhead when the number of mobile users is large. This paper considers wireless downlink networks with limited feedback bandwidth so that at most F of the N L channel states can be reported at each time slot. We propose dynamic feedback allocation schemes, named as Longest-Queue-First Feedback-Allocation (LQF-FA) and Modified-Longest-Queue-First Feedback-Allocation (MLQFFA), which dynamically and adaptively allocate the feedback resource according to queue-lengths and channel statistics. We prove that given a fixed feedback resource F, the LQFFA+ Max Weight is throughput-optimal under a mean approximation; and the throughput difference between the MLQFFA+ MaxWeight and the MaxWeight with the complete channel state information decreases exponentially as a function of F/L when F = O(L2).