Linear programming and network flows (2nd ed.)
Linear programming and network flows (2nd ed.)
Distributed scheduling and dynamic pricing in a communication network
Wireless Networks
Uplink scheduling in CDMA packet-data systems
Wireless Networks
Distributed scheduling via pricing with partial orthogonality
Proceedings of the 6th International Conference on Advances in Mobile Computing and Multimedia
IEEE Transactions on Information Theory
Distributed scheduling in a time-varying ad hoc network
Journal of Mobile Multimedia
Unified collision-free coordinated distributed scheduling (CF-CDS) in IEEE 802.16 mesh networks
IEEE Transactions on Wireless Communications
Opportunistic beamforming using dumb antennas
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
This paper studies optimal scheduling in a multiuser wireless network, allowing for simultaneous transmission of sets of users. The approach is based on dynamic optimization. The multiuser scheduling problem is solved numerically as a dynamic programming problem with user-specific power constraints, assuming deterministic channel information during a given scheduling window. The dynamic programming approach enables to solve for both an optimal discrete power allocation and scheduling. Numerical examples suggest that previous results on optimal scheduling based on decomposing a T-period scheduling problem to T separate problems do not hold in general when decomposing the problem to a smaller number of larger problems. An auction-based algorithm for distributed scheduling is proposed, achieving an optimal schedule, assuming one-at-a-time transmission.