Computer Science > Information Theory
[Submitted on 13 Aug 2013 (v1), last revised 30 Jan 2017 (this version, v3)]
Title:Asymptotically Optimal Power Allocation for Energy Harvesting Communication Networks
View PDFAbstract:For a general energy harvesting (EH) communication network, i.e., a network where the nodes generate their transmit power through EH, we derive the asymptotically optimal online power allocation solution which optimizes a general utility function when the number of transmit time slots, $N$, and the battery capacities of the EH nodes, $B_{\rm max}$, satisfy $N\to\infty$ and $B_{\rm max}\to\infty$. The considered family of utility functions is general enough to include the most important performance measures in communication theory such as the average data rate, outage probability, average bit error probability, and average signal-to-noise ratio. The proposed power allocation solution is very simple. Namely, the asymptotically optimal power allocation for the EH network is identical to the optimal power allocation for an equivalent non-EH network whose nodes have infinite energy available but their average transmit power is constrained to be equal to the average harvested power and/or the maximum average transmit power of the corresponding nodes in the EH network. Moreover, the maximum average performance of a general EH network converges to the maximum average performance of the corresponding equivalent non-EH network, when $N\to\infty$ and $B_{\rm max}\to\infty$. Although the proposed solution is asymptotic in nature, it is applicable to EH systems transmitting in a large but finite number of time slots and having a battery capacity much larger than the average harvested power and/or the maximum average transmit power.
Submission history
From: Nikola Zlatanov [view email][v1] Tue, 13 Aug 2013 12:04:19 UTC (614 KB)
[v2] Tue, 17 Nov 2015 00:12:43 UTC (505 KB)
[v3] Mon, 30 Jan 2017 22:15:02 UTC (5,602 KB)
Current browse context:
cs.IT
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.