Online computation and competitive analysis
Online computation and competitive analysis
Analysis of iterative waterfilling algorithm for multiuser power control in digital subscriber lines
EURASIP Journal on Applied Signal Processing
Algorithmic Game Theory
A jamming game in wireless networks with transmission cost
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
Spectrum management for interference-limited multiuser communication systems
IEEE Transactions on Information Theory
Reliable communication under channel uncertainty
IEEE Transactions on Information Theory
Fading channels: information-theoretic and communications aspects
IEEE Transactions on Information Theory
Asynchronous Iterative Water-Filling for Gaussian Frequency-Selective Interference Channels
IEEE Transactions on Information Theory
Spectrum sharing for unlicensed bands
IEEE Journal on Selected Areas in Communications
Dynamic power allocation under arbitrary varying channels: an online approach
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
We consider the power control problem in a time-slotted wireless channel, shared by a finite number of mobiles that transmit to a common base station. The channel between each mobile and the base station is time varying, and the system objective is to maximize the overall data throughput. It is assumed that each transmitter has a limited power budget, to be sequentially divided during the lifetime of the battery. We deviate from the classic work in this area, by considering a realistic scenario where the channel quality of each mobile changes arbitrarily from one transmission to the other. Assuming first that each mobile is aware of the channel quality of all other mobiles, we propose an online power-allocation algorithm, and prove its optimality under mild assumptions. We then indicate how to implement the algorithm when only local state information is available, requiring minimal communication overhead. Notably, the competitive ratio of our algorithm (nearly) matches the bound obtained for the (much simpler) single-transmitter case [2], albeit requiring significantly different algorithmic solutions.