Dynamic power allocation under arbitrary varying channels-anonline approach

IEEE/ACM Transactions on Networking

Volumn 20, Issue 2, 2012, Pages 477-487

  Buchbinder, Niv ^a   Lewin Eytan, Liane ^b   Menache, Ishai ^c   Naor, Joseph ^d   Orda, Ariel ^d  

^a OPEN UNIVERSITY OF ISRAEL   (Israel)

^b IBM HAIFA RESEARCH LAB   (Israel)

^c MICROSOFT RESEARCH   (United States)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Channel fading; competitive ratio; dynamic power allocation; online algorithms

Indexed keywords

CHANNEL CONDITIONS; CHANNEL STATE; COMPETITIVE ANALYSIS; COMPETITIVE RATIO; DATA THROUGHPUT; DYNAMIC NATURE; DYNAMIC POWER ALLOCATION; LOWER BOUNDS; ON-LINE ALGORITHMS; POWER ALLOCATIONS; POWER ASSIGNMENT; POWER BUDGETS; POWER LEVELS; QUALITY CHANGE; REALISTIC SCENARIO; TIME VARYING CHANNEL; WATERFILLING; WORST-CASE PERFORMANCE;

ALGORITHMS; FADING CHANNELS; TRANSMITTERS;

ELECTRIC POWER TRANSMISSION;

EID: 84859942601     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2011.2170092     Document Type: Article

References (11)

1. E. Altman, K. Avrachenkov, and A. Garnaev, "A jamming game in wireless networks with transmission cost," in Proc. 1st EuroFGI NETCOOP, 2007, pp. 1-12. (Pubitemid 350259792)
2. A. Ben-Tal and A. Nemirovski, "Robust convex optimization," Math. Oper. Res., vol. 23, no. 2, pp. 769-805, 2000. (Pubitemid 128508557)
3. A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis. Cambridge, U.K.: Cambridge Univ. Press, 1998.
4. A. Borodin, R. El-Yaniv, and V. Gogan, "On the competitive theory and practice of portfolio selection," in Proc. 4th Latin Amer. Symp. Theoret. Informatics, 2000, pp. 173-196.
5. E. Biglieri, J. Proakis, and S. Shamai, "Fading channels: Informationtheoretic and communications aspects," IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 2619-2692, Oct. 1998. (Pubitemid 128741903)
6. N. Buchbinder, L. Lewin-Eytan, I. Menache, J. Naor, and A. Orda, "Dynamic power allocation under arbitrary varying channels-The multi-user case," in Proc. IEEE INFOCOM, 2010, pp. 2402-2410.
7. N. Buchbinder and J. Naor, "Online primal-dual algorithms for covering and packing problems," in Proc. 13th Annu. Eur. Symp. Algor., 2005, pp. 689-701. (Pubitemid 41491567)
8. A. Goldsmith and P. P. Varaiya, "Capacity of fading channels with channel side information," IEEE Trans. Inf. Theory, vol. 43, no. 6, pp. 1986-1992, Nov. 1997. (Pubitemid 127826488)
9. A. Lapidoth and P. Narayan, "Reliable communication under channel uncertainty," IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 2148-2177, Oct. 1998. (Pubitemid 128741887)
10. I. Menache and E. Altman, "Battery-state dependent power control as a dynamic game," in Proc. WiOpt, 2008, pp. 242-250.
11. Y. Zhou, D. Chakrabarty, and R. Lukose, "Budget constrained bidding in keyword auctions and online knapsack problems," in Proc. WWW, 2008, pp. 1243-1244.