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

  • Authors:
  • Niv Buchbinder;Liane Lewin-Eytan;Ishai Menache;Joseph Naor;Ariel Orda

  • Affiliations:
  • Microsoft Research, New England, Cambridge, MA;IBM Haifa Research Laboratory, Haifa, Israel;Laboratory for Information and Decision Systems, Massachusetts Institute of Technology;Computer Science Department, Technion, Israel Institute of Technology;Department of Electrical Engineering, Technion, Israel Institute of Technology

  • Venue:
  • INFOCOM'10 Proceedings of the 29th conference on Information communications
  • Year:
  • 2010

Quantified Score

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.