Principles of mobile communication (2nd ed.)
Principles of mobile communication (2nd ed.)
Dynamic Global Packet Routing in Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Scheduling and performance limits of networks with constantly changing topology
IEEE Transactions on Information Theory
Multiaccess fading channels. II. Delay-limited capacities
IEEE Transactions on Information Theory
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
IEEE Communications Magazine
Access control of data in integrated voice/data CDMA systems: benefits and tradeoffs
IEEE Journal on Selected Areas in Communications
Distributed throughput-maximization using the up- and downlink duality in wireless networks
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Distributed scheduling via pricing with partial orthogonality
Proceedings of the 6th International Conference on Advances in Mobile Computing and Multimedia
Flow level performance comparison of packet scheduling schemes for UMTS EUL
WWIC'08 Proceedings of the 6th international conference on Wired/wireless internet communications
Distributed scheduling in a time-varying ad hoc network
Journal of Mobile Multimedia
Multiuser scheduling via dynamic optimization
WWIC'10 Proceedings of the 8th international conference on Wired/Wireless Internet Communications
Hi-index | 0.00 |
Uplink scheduling in wireless systems is gaining importance due to arising uplink intensive data services (ftp, image uploads etc.), which could be hampered by the currently in-built asymmetry in favor of the downlink. In this work, we propose and study algorithms for efficient uplink packet-data scheduling in a CDMA cell. The algorithms attempt to maximize system throughput under transmit power limitations on the mobiles assuming instantaneous knowledge of user queues and channels. However no channel statistics or traffic characterization is necessary. Apart from increasing throughput, the algorithms also improve fairness of service among users, hence reducing chances of buffer overflows for poorly located users.The major observation arising from our analysis is that it is advantageous on the uplink to schedule "strong" users one-at-a-time, and "weak" users in larger groups. This contrasts with the downlink where one-at-a-time transmission for all users has shown to be the preferred mode in much previous work. Based on the optimal schedules, we propose less complex and more practical approximate methods, both of which offer significant performance improvement compared to one-at-a-time transmission, and the widely acclaimed Proportional Fair (PF) algorithm, in simulations. When queue content cannot be fed back, we propose a simple modification of PF, Uplink PF (UPF), that offers similar improvement.