Energy-efficient scheduling of delay constrained traffic over fading channels
IEEE Transactions on Wireless Communications
Analysis of energy efficiency in fading channels under QoS constraints
IEEE Transactions on Wireless Communications
Delay reduction via lagrange multipliers in stochastic network optimization
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Cost sharing with network coding in two-way relay networks
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Delay-optimal resource allocation for OFDMA systems via stochastic approximation
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Low-complexity scheduling algorithms for multi-channel downlink wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Utility optimal scheduling in energy harvesting networks
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Low-complexity scheduling algorithms for multichannel downlink wireless networks
IEEE/ACM Transactions on Networking (TON)
LIFO-backpressure achieves near-optimal utility-delay tradeoff
IEEE/ACM Transactions on Networking (TON)
Utility optimal scheduling in energy-harvesting networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 754.84 |
We consider the fundamental delay tradeoffs for minimizing energy expenditure in a multiuser wireless downlink with randomly varying channels. First, we extend the Berry-Gallager bound to a multiuser context, demonstrating that any algorithm that yields average power within O(1/V) of the minimum power required for network stability must also have an average queueing delay greater than or equal to Omega(radicV). We then develop a class of algorithms, parameterized by V, that come within a logarithmic factor of achieving this fundamental tradeoff. The algorithms overcome an exponential state-space explosion, and can be implemented in real time without a priori knowledge of traffic rates or channel statistics. Further, we discover a ldquosuperfastrdquo scheduling mode that beats the Berry-Gallager bound in the exceptional case when power functions are piecewise linear.