A framework for opportunistic scheduling in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multiuser scheduling on the downlink of an LTE cellular system
Research Letters in Communications - Regular issue
Fair Round-Robin: A Low Complexity Packet Schduler with Proportional and Worst-Case Fairness
IEEE Transactions on Computers
Downlink scheduling and resource allocation for OFDM systems
IEEE Transactions on Wireless Communications
Downlink scheduling for multiclass traffic in LTE
EURASIP Journal on Wireless Communications and Networking - 3GPP LTE and LTE Advanced
Quality-driven cross-layer optimized video delivery over LTE
IEEE Communications Magazine
A survey of scheduling and interference mitigation in LTE
Journal of Electrical and Computer Engineering - Special issue on LTE/LTE-advanced cellular communication networks
4G: LTE/LTE-Advanced for Mobile Broadband
4G: LTE/LTE-Advanced for Mobile Broadband
Delay-optimal opportunistic scheduling and approximations: the log rule
IEEE/ACM Transactions on Networking (TON)
Convergence of proportional-fair sharing algorithms under general conditions
IEEE Transactions on Wireless Communications
Two-Level Downlink Scheduling for Real-Time Multimedia Services in LTE Networks
IEEE Transactions on Multimedia
| Hi-index | 0.00 |
Scheduling for flows has been studied before. However, applying the previous schemes directly for LTE networks may not achieve good performance. To have good performance, both frequency domain allocations and time domain allocations for LTE resource blocks are suggested. Our method is suitable for real-time services and it consists of three phases. In frequency domain we design our method to utilize the RBs effectively. In time domain we first manage queues for different applications and propose a mechanism for predicting the packet delays. We introduce the concept of virtual queue to predict the behavior of future incoming packets based on the packets in the current queue. Then based on the calculated results, we introduce a cut-in process to rearrange the transmission order and discard those packets which cannot meet their delay requirements. We compare our scheduling mechanism with maximum throughput, proportional fair, modified largest delay first and exponential proportional fair. Simulation results show our scheduling method can achieve better performance than other schemes.