We consider the problem of uplink/downlink scheduling in a multichannel wireless access point network where channel states differ across channels as well as users, vary with time, and can be measured only infrequently. We demonstrate that, unlike infrequent measurement of queue lengths, infrequent measurement of channel states reduce the maximum attainable throughput.We then prove that in frequency division multiplexed systems, a dynamic scheduling policy that depends on both the channel rates (averaged over the measurement interval) and the queue lengths, is throughput optimal. We also generalize the scheduling policy to solve the joint power allocation and scheduling problem. In addition, we provide simulation studies that demonstrate the...
Abstract—We study a problem of scheduling real-time traffic with hard delay constraints in an unreli...
Abstract — We consider “opportunistic ” downlink scheduling of data traffic in a wireless network. I...
It is well known that opportunistic scheduling algorithms are throughput optimal under dynamic chann...
We consider the problem of uplink/downlink scheduling in a multichannel wireless access point networ...
We consider the problem of scheduling packets over channels with time-varying quality. This problem ...
The field of wireless communications has experienced huge growth in the last decades. Various new us...
We consider the problem of scheduling of a wireless channel (server) to several queues. Each queue h...
We consider a scheduler for the downlink of a wireless channel when only partial channel-state infor...
Abstract — An analytical framework for radio link level perfor-mance evaluation under scheduling and...
We study opportunistic feedback of channel state and scheduling of users transmissions at a wireless...
textabstractChannel-aware scheduling strategies, such as the Proportional Fair algorithm for the CDM...
Abstract—This paper considers the problem of designing scheduling algorithms for multi-channel (e.g....
textThis thesis examines the problem of scheduling with incomplete and/or local information in wirel...
This paper studies scheduling in multichannel wireless net-works with flow-level dynamics. We consid...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
Abstract—We study a problem of scheduling real-time traffic with hard delay constraints in an unreli...
Abstract — We consider “opportunistic ” downlink scheduling of data traffic in a wireless network. I...
It is well known that opportunistic scheduling algorithms are throughput optimal under dynamic chann...
We consider the problem of uplink/downlink scheduling in a multichannel wireless access point networ...
We consider the problem of scheduling packets over channels with time-varying quality. This problem ...
The field of wireless communications has experienced huge growth in the last decades. Various new us...
We consider the problem of scheduling of a wireless channel (server) to several queues. Each queue h...
We consider a scheduler for the downlink of a wireless channel when only partial channel-state infor...
Abstract — An analytical framework for radio link level perfor-mance evaluation under scheduling and...
We study opportunistic feedback of channel state and scheduling of users transmissions at a wireless...
textabstractChannel-aware scheduling strategies, such as the Proportional Fair algorithm for the CDM...
Abstract—This paper considers the problem of designing scheduling algorithms for multi-channel (e.g....
textThis thesis examines the problem of scheduling with incomplete and/or local information in wirel...
This paper studies scheduling in multichannel wireless net-works with flow-level dynamics. We consid...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
Abstract—We study a problem of scheduling real-time traffic with hard delay constraints in an unreli...
Abstract — We consider “opportunistic ” downlink scheduling of data traffic in a wireless network. I...
It is well known that opportunistic scheduling algorithms are throughput optimal under dynamic chann...