TY - JOUR
T1 - Sum-Rate Optimal Power Policies for Energy Harvesting Transmitters in an Interference Channel
AU - Tutuncuoglu, Kaya
AU - Yener, Aylin
N1 - Funding Information:
Manuscript received October 11, 2011. This work was supported by NSF Grant CNS 0964364. K. Tutuncuoglu is with the Wireless Communications and Networking Laboratory (WCAN), Electrical Engineering Department, Pennsylvania State University, University Park, PA 16802, email: kaya@psu.edu. A. Yener is with the Wireless Communications and Networking Laboratory (WCAN), Electrical Engineering Department, Pennsylvania State University, University Park, PA 16802, email: yener@ee.psu.edu.
PY - 2012/4/12
Y1 - 2012/4/12
N2 - This paper considers a two-user Gaussian interference channel with energy harvesting transmitters. Different than conventional battery powered wireless nodes, energy harvesting transmitters have to adapt transmission to availability of energy at a particular instant. In this setting, the optimal power allocation problem to maximize the sum throughput with a given deadline is formulated. The convergence of the proposed iterative coordinate descent method for the problem is proved and the short-term throughput maximizing offline power allocation policy is found. Examples for interference regions with known sum capacities are given with directional water-filling interpretations. Next, stochastic data arrivals are addressed. Finally, online and/or distributed near-optimal policies are proposed. Performance of the proposed algorithms are demonstrated through simulations.
AB - This paper considers a two-user Gaussian interference channel with energy harvesting transmitters. Different than conventional battery powered wireless nodes, energy harvesting transmitters have to adapt transmission to availability of energy at a particular instant. In this setting, the optimal power allocation problem to maximize the sum throughput with a given deadline is formulated. The convergence of the proposed iterative coordinate descent method for the problem is proved and the short-term throughput maximizing offline power allocation policy is found. Examples for interference regions with known sum capacities are given with directional water-filling interpretations. Next, stochastic data arrivals are addressed. Finally, online and/or distributed near-optimal policies are proposed. Performance of the proposed algorithms are demonstrated through simulations.
UR - http://www.scopus.com/inward/record.url?scp=85008541019&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85008541019&partnerID=8YFLogxK
U2 - 10.1109/JCN.2012.6253063
DO - 10.1109/JCN.2012.6253063
M3 - Article
AN - SCOPUS:85008541019
VL - 14
SP - 151
EP - 161
JO - Journal of Communications and Networks
JF - Journal of Communications and Networks
SN - 1229-2370
IS - 2
ER -