Fair scheduling in wireless packet networks
IEEE/ACM Transactions on Networking (TON)
A PTAS for the multiple knapsack problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Intra-flow loss recovery and control for VoIP
MULTIMEDIA '01 Proceedings of the ninth ACM international conference on Multimedia
Scheduling real-time traffic with deadlines over a wireless channel
Wireless Networks
Fair Real-Time Traffic Scheduling over a Wireless LAN
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Computationally efficient bandwidth allocation and power control for OFDMA
IEEE Transactions on Wireless Communications
Cross-layer optimization for OFDM wireless networks-part I: theoretical framework
IEEE Transactions on Wireless Communications
IEEE Transactions on Information Theory
Opportunistic beamforming using dumb antennas
IEEE Transactions on Information Theory
Adaptation techniques in wireless packet data services
IEEE Communications Magazine
IEEE Communications Magazine
Computational analysis and efficient algorithms for micro and macro OFDMA downlink scheduling
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
The scheduling logic at the base station of a shared wireless medium supports time-dependent (synchronous) applications by allocating timely transmission grants. To this end, it must take into account not only the deadlines of the pending packets, but also the channel conditions for each potential sender, the requirements of nonsynchronous applications, and the packet retransmission strategy. With respect to these factors, we identify three scheduling scenarios and show that the scheduler logic faces a different challenge in addressing each of them. We then present a generic scheduling algorithm that translates all the factors relevant to each scenario into a common profit parameter, and selects the most profitable transmission instances.