Traffic aided opportunistic scheduling for wireless networks: algorithms and performance bounds
Computer Networks: The International Journal of Computer and Telecommunications Networking
Minimization of Download Times for Large Files over Wireless Channels
IEEE Transactions on Mobile Computing
Combining opportunistic and size-based scheduling in wireless systems
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Dynamic power allocation over block-fading channels with delay constraint
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Journal of Parallel and Distributed Computing
On the optimal trade-off between SRPT and opportunistic scheduling
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
On the optimal trade-off between SRPT and opportunistic scheduling
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Optimal size-based opportunistic scheduler for wireless systems
Queueing Systems: Theory and Applications
| Hi-index | 754.84 |
The third-generation code division multiple access (3G CDMA) mobile communication networks are designed to transmit voice and data over wireless channels. Fundamental problems need to be solved for such mobile communication networks to operate efficiently. One of the problems is finding optimal scheduling algorithms for file transmission over the fading downlink channel from a base station to mobile users. Here, the problem is solved in the case of transmission of a given number of files. Optimal algorithms that minimize the delay and the transmission time are found. Also, specific nonoptimal algorithms are considered and compared numerically with the optimal ones. We consider a slotted downlink with channels to the mobile users that are dependent in the same slot but independent for different slots. Additionally, some generalizations are presented.