TY - GEN
T1 - Dynamic power allocation under arbitrary varying channels - The multi-user case
AU - Buchbinder, Niv
AU - Lewin-Eytan, Liane
AU - Menache, Ishai
AU - Naor, Joseph
AU - Orda, Ariel
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=77953316892&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2010.5462067
DO - 10.1109/INFCOM.2010.5462067
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:77953316892
SN - 9781424458363
T3 - Proceedings - IEEE INFOCOM
BT - 2010 Proceedings IEEE INFOCOM
Y2 - 14 March 2010 through 19 March 2010
ER -