Dynamic power allocation under arbitrary varying channels - The multi-user case

Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publication2010 Proceedings IEEE INFOCOM
DOIs
StatePublished - 2010
Externally publishedYes
EventIEEE INFOCOM 2010 - San Diego, CA, United States
Duration: 14 Mar 201019 Mar 2010

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X

Conference

ConferenceIEEE INFOCOM 2010
Country/TerritoryUnited States
CitySan Diego, CA
Period14/03/1019/03/10

Fingerprint

Dive into the research topics of 'Dynamic power allocation under arbitrary varying channels - The multi-user case'. Together they form a unique fingerprint.

Cite this