Dynamic power allocation under arbitrary varying channels - An online approach
Name
Buchbinder-2009-Dynamic power allocation under arbitrary varying channels - An online approach.pdf
Size
199.54 KB
Format
Adobe PDF
Checksum (MD5)
84a1bf45b0e308cf343f69d58b221c5d
Author(s)
Menache, Ishai
Orda, Ariel
Naor, Joseph (Seffi)
Lewin-Eytan, Liane
Buchbinder, Niv
Date Issued
June 2009
Journal
IEEE INFOCOM 2009
Publisher
Institute of Electrical and Electronics Engineers
Citation
Buchbinder, N. et al. “Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach.” INFOCOM 2009, IEEE. 2009. 145-153. © 2009 IEEE
Version
Final published version
Abstract
A major problem in wireless networks is coping with limited resources, such as bandwidth and energy. These issues become a major algorithmic challenge in view of the dynamic nature of the wireless domain. We consider in this paper the single-transmitter power assignment problem under time-varying channels, with the objective of maximizing the data throughput. It is assumed that the 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, which leads to explicit "water-filling" solutions, by considering a realistic scenario where the channel state quality changes arbitrarily from one transmission to the other. The problem is accordingly tackled within the framework of competitive analysis, which allows for worst case performance guarantees in setups with arbitrarily varying channel conditions. We address both a "discrete" case, where the transmitter can transmit only at a fixed power level, and a "continuous" case, where the transmitter can choose any power level out of a bounded interval. For both cases, we propose online power-allocation algorithms with proven worst-case performance bounds. In addition, we establish lower bounds on the worst-case performance of any online algorithm, and show that our proposed algorithms are optimal.
MIT Department
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
http://dx.doi.org/10.1109/INFCOM.2009.5061916
