Stochastic resource allocation over fading multiple access and broadcast channels

Authors:
Na Gao;Xin Wang
Affiliations:
iCORE Wireless Communications Laboratory, Department of Electrical and Computer Engineering, Florida Atlantic University, Boac Raton, FL;iCORE Wireless Communications Laboratory, Department of Electrical and Computer Engineering, Florida Atlantic University, Boac Raton, FL
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 6
Cited 0

Adaptive signal processing algorithms: stability and performance

Adaptive signal processing algorithms: stability and performance
Convex Optimization

Convex Optimization
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm

Queueing Systems: Theory and Applications
Multiaccess fading channels. I. Polymatroid structure, optimal resource allocation and throughput capacities

IEEE Transactions on Information Theory
Capacity and optimal resource allocation for fading broadcast channels .I. Ergodic capacity

IEEE Transactions on Information Theory
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the optimal rate and power allocation that maximizes a general utility function of average user rates in a fading multiple-access or broadcast channel. By exploiting the greedy structure of the capacity-achieving resource allocation for both multiple-access and broadcast channels, it is established that utility-maximizing allocation policy can be obtained through dual-based gradient descent iterations with fast convergence and low complexity per iteration. Relying on stochastic averaging tools, we further develop a class of stochastic gradient iterations which are capable of asymptotically converging to the optimal benchmark with guarantees on the minimum average user rates, even when the fading channel distribution is unknown a priori.