The DOI matches its Crossref record.
Utility Optimal Scheduling in Energy-Harvesting Networks
Abstract
In this paper, we show how to achieve close-to-optimal utility performance in energy-harvesting networks with only finite capacity energy storage devices. In these networks, nodes are capable of harvesting energy from the environment. The amount of energy that can be harvested is time-varying and evolves according to some probability law. We develop an online algorithm, called the Energy-limited Scheduling Algorithm (ESA), which jointly manages the energy and makes power allocation decisions for packet transmissions. ESA only has to keep track of the amount of energy left at the network nodes and does not require any knowledge of the harvestable energy process. We show that ESA achieves a utility that is within O(ε) of the optimal, for any ε > 0, while ensuring that the network congestion and the required capacity of the energy storage devices are deterministically upper-bounded by bounds of size O(1/ε). We then also develop the Modified-ESA (MESA) algorithm to achieve the same O(ε) close-to-utility performance, with the average network congestion and the required capacity of the energy storage devices being only O([log(1/ε)]2), which is close to the theoretical lower bound O(log(1/ε)).
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Dynamic computation offloading for mobile-edge computing with energy harvesting devices
Mao, Y., Zhang, J., & Letaief, K. B. (2016) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2016.2611964 · Cited by 1,705
Advances in Energy Harvesting Communications: Past, Present, and Future Challenges
Ku, M.-L., Li, W., Chen, Y., & Ray Liu, K. J. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2497324 · Cited by 606
User Association in 5G Networks: A Survey and an Outlook
Liu, D., Wang, L., Chen, Y., Elkashlan, M., Wong, K.-K., Schober, R., & Hanzo, L. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2516538 · Cited by 604
A review of technologies and applications on versatile energy storage systems
Zhang, Z., Ding, T., Zhou, Q., Sun, Y., Qu, M., Zeng, Z., Ju, Y., Li, L., Wang, K., & Chi, F. (2021) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2021.111263 · Cited by 489
Energy-Harvesting Wireless Sensor Networks (EH-WSNs): A Review
Adu-Manu, K. S., Adam, N., Tapparello, C., Ayatollahi, H., & Heinzelman, W. (2018) · ACM Transactions on Sensor Networks · doi:10.1145/3183338 · Cited by 360
Deep Reinforcement Learning for Stochastic Computation Offloading in Digital Twin Networks
Dai, Y., Zhang, K., Maharjan, S., & Zhang, Y. (2021) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2020.3016320 · Cited by 296
Spinelli, F., & Mancuso, V. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.3037674 · Cited by 253
Optimal Schedule of Mobile Edge Computing for Internet of Things Using Partial Information
Lyu, X., Ni, W., Tian, H., Liu, R. P., Wang, X., Giannakis, G. B., & Paulraj, A. (2017) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2017.2760186 · Cited by 251
A Utility Optimization Approach to Network Cache Design
Dehghan, M., Massoulie, L., Towsley, D., Menasche, D. S., & Tay, Y. C. (2019) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2019.2913677 · Cited by 81
Movers and shakers: kinetic energy harvesting for the internet of things
Gorlatova, M., Sarik, J., Grebla, G., Cong, M., Kymissis, I., & Zussman, G. (2014) · The 2014 ACM international conference on Measurement and modeling of computer systems · doi:10.1145/2591971.2591986 · Cited by 79
Metadata
- Authors
- Huang, L., & Neely, M. J.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2013-08
- Volume
- 21
- Issue
- 4
- Pages
- 1117-1130
- ISSN
- 1063-6692 (ISSN-L)
- 1558-2566
- OpenAlex
- W2006689319
- Cited by
- 221
- References
- 0
- FWCI
- 17.77
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.