The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Online Learning for Offloading and Autoscaling in Energy Harvesting Mobile Edge Computing
Open accessAbstract
Mobile edge computing (also known as fog computing) has recently emerged to enablein-situprocessing of delay-sensitive applications at the edge of mobile networks. Providing grid power supply in support of mobile edge computing, however, is costly and even infeasible (in certain rugged or under-developed areas), thus mandating on-site renewable energy as a major or even sole power supply in increasingly many scenarios. Nonetheless, the high intermittency and unpredictability of renewable energy make it very challenging to deliver a high quality of service to users in energy harvesting mobile edge computing systems. In this paper, we address the challenge of incorporating renewables into mobile edge computing and propose an efficient reinforcement learning-based resource management algorithm, which learns on-the-fly the optimal policy of dynamic workload offloading (to the centralized cloud) and edge server provisioning to minimize the long-term system cost (including both service delay and operational cost). Our online learning algorithm uses a decomposition of the (offline) value iteration and (online) reinforcement learning, thus achieving a significant improvement of learning rate and run-time performance when compared to standard reinforcement learning algorithms such as${Q}$-learning. We prove the convergence of the proposed algorithm and analytically show that the learned policy has a simple monotone structure amenable to practical implementation. Our simulation results validate the efficacy of our algorithm, which significantly improves the edge computing performance compared to fixed or myopic optimization schemes and conventional reinforcement learning algorithms.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“At this background, large state and action spaces in the whole offloading problem make the conventional learning algorithms [245] [256] [247] infeasible actually.”
From Convergence of Edge Computing and Deep Learning: A Comprehensive Survey (2020) · cites this paper as [245]
Citations
Cites
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. G. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.712192 · Cited by 27,225 · cited 5×
“The proposed PDS-based learning algorithm is compared with three benchmark schemes: • Q-learning [10]: Q-learning is a famous model-free reinforcement learning technique for solving MDP problems.”
BackgroundMethodInfluentialReinforcement Learning: An Introduction
(2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 24,496
(1995) · Cited by 10,558
Edge computing: Vision and challenges
Shi, W., Cao, J., Zhang, Q., Li, Y., & Xu, L. (2016) · IEEE Internet of Things Journal · doi:10.1109/jiot.2016.2579198 · Cited by 8,733 · cited 4×
“backbone networks [1] but also result in (sometimes intolerable) large transmission latencies that degrade the quality of service [2]–[4].”
BackgroundInfluentialMarkov decision processes: Discrete stochastic dynamic programming
Hazeghi, K., & Puterman, M. L. (1995) · Journal of the American Statistical Association · doi:10.2307/2291177 · Cited by 8,037 · cited 1×
“battery state b and the power demand action a for any given λ,e,h. This is to prove that ∀b ≤ b′ and a ≤ a′, we have C(b,a ′)− C(b,a) ≥ C(b ,a′)− C(b′,a) (32) If the above is true, then we can apply [27] (Section 4.7) to show that π(s) is non-decreasing in b. Equation (32) is equivalent to V∗(b− a ′)− V ∗(b −a) ≥ V∗(b…”
InfluentialA Survey on Mobile Edge Computing: The Communication Perspective
Mao, Y., You, C., Zhang, J., Huang, K., & Letaief, K. B. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2745201 · Cited by 5,607
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Baxter, L. A. (1995) · Technometrics · doi:10.1080/00401706.1995.10484354 · Cited by 2,415
Fog and IoT: An Overview of Research Opportunities
Chiang, M., & Zhang, T. (2016) · IEEE Internet of Things Journal · doi:10.1109/jiot.2016.2584538 · Cited by 2,362 · cited 2×
“Fog computing [5] is a related concept that refers to the same computing paradigm.”
BackgroundStochastic Network Optimization with Application to Communication and Queueing Systems
Neely, M. J. (2010) · Synthesis lectures on communication networks · doi:10.2200/s00271ed1v01y201006cnt007 · Cited by 2,218
Energy Harvesting Sensor Nodes: Survey and Implications
Sudevalayam, S., & Kulkarni, P. (2011) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2011.060710.00094 · Cited by 1,981 · cited 2×
“and/or solar radiation is embraced as a major or even sole power supply for edge systems in the field, thanks to the recent advancements of energy harvesting techniques [8], [9].”
Background
Research works printed but not linked: 4
- reiss, 2011, Google Cluster-usage Traces Format+ Schema, 1
- patel, 2014, Mobile-Edge Computing—Introductory Technical White Paper
- 2017, Elia Power Generation
- rivera, 2014, Gartner Says the Internet of Things Will Transform the Data Center
Cited by
Ensemble deep learning: A review
Ganaie, M. A., Hu, M., Malik, A. K., Tanveer, M., & Suganthan, P. N. (2022) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.105151 · Cited by 2,143
“With the limitation of getting the complete data in real-world problems, online/incremental learning has been applied to various tasks like learning social representations [174], fog computing [175], identifying suspicious URLs [176], etc.”
MethodConvergence of Edge Computing and Deep Learning: A Comprehensive Survey
Wang, X., Han, Y., Leung, V. C. M., Niyato, D., Yan, X., & Chen, X. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2970550 · Cited by 1,498
“At this background, large state and action spaces in the whole offloading problem make the conventional learning algorithms [245], [256], [247] infeasible actually.”
BackgroundPham, Q.-V., Fang, F., Ha, V. N., Piran, M. J., Le, M., Le, L. B., Hwang, W.-J., & Ding, Z. (2020) · IEEE Access · doi:10.1109/access.2020.3001277 · Cited by 870
“The literature [106] jointly studied the offloading and autoscaling policy (i.”
Computation Rate Maximization in UAV-Enabled Wireless-Powered Mobile-Edge Computing Systems
Zhou, F., Wu, Y., Hu, R. Q., & Qian, Y. (2018) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2018.2864426 · Cited by 851
Chen, X., Zhang, H., Wu, C., Mao, S., Ji, Y., & Bennis, M. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2876279 · Cited by 680
Metadata
- Authors
- Xu, J., Chen, L., & Ren, S.
- Affiliations
- University of Miami (US)
- University of California, Riverside (US)
- Venue
- IEEE Transactions on Cognitive Communications and Networking
- Published
- 2017-09
- Volume
- 3
- Issue
- 3
- Pages
- 361-373
- ISSN
- 2332-7731 (ISSN-L)
- OpenAlex
- W2599106590
- Cited by
- 368
- References
- 33
- Citations by year
- 2026: 14 · 2025: 15 · 2024: 32 · 2023: 24 · 2022: 41 · 2021: 55 · 2020: 87 · 2019: 59 · 2018: 34 · 2017: 7
- FWCI
- 34.02
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- IEEE Transactions on Cognitive Communications and Networking (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- U.S. NSF (CNS-1551661, CNS-1565474, ECCS-1610471)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
- Physical Sciences › Computer Science › Hardware and Architecture › Energy Efficiency in Computing
- Physical Sciences › Computer Science › Information Systems › Cloud Computing and Resource Management
- Keywords
- mobile edge computing, fog computing, energy harvesting, renewable energy, workload offloading, auto-scaling, reinforcement learning, online learning, service delay, operating costs, convergence analysis
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Online Learning for Offloading and Autoscaling in Energy Harvesting Mobile Edge Computing. https://app.cochat.ai/papers/10.1109/tccn.2017.2725277
- The paper
- Xu, J., Chen, L., & Ren, S. (2017). Online Learning for Offloading and Autoscaling in Energy Harvesting Mobile Edge Computing. IEEE Transactions on Cognitive Communications and Networking. https://doi.org/10.1109/tccn.2017.2725277
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.