Cited by 251IoT and Edge/Fog ComputingAdvanced Wireless Network OptimizationAge of Information Optimization

Optimal Schedule of Mobile Edge Computing for Internet of Things Using Partial Information

Lyu, Xinchen, Ni, Wei, Tian, Hui, Liu, Ren Ping, Wang, Xin, Giannakis, Georgios B., Paulraj, Arogyaswami·2017·IEEE Journal on Selected Areas in Communications

Abstract

Mobile edge computing is of particular interest to Internet of Things (IoT), where inexpensive simple devices can get complex tasks offloaded to and processed at powerful infrastructure. Scheduling is challenging due to stochastic task arrivals and wireless channels, congested air interface, and more prominently, prohibitive feedbacks from thousands of devices. In this paper, we generate asymptotically optimal schedules tolerant to out-of-date network knowledge, thereby relieving stringent requirements on feedbacks. A perturbed Lyapunov function is designed to stochastically maximize a network utility balancing throughput and fairness. A knapsack problem is solved per slot for the optimal schedule, provided up-to-date knowledge on the data and energy backlogs of all devices. The knapsack problem is relaxed to accommodate out-of-date network states. Encapsulating the optimal schedule under up-to-date network knowledge, the solution under partial out-of-date knowledge preserves asymptotic optimality, and allows devices to self-nominate for feedback. Corroborated by simulations, our approach is able to dramatically reduce feedbacks at no cost of optimality. The number of devices that need to feed back is reduced to less than 60 out of a total of 5000 IoT devices.

Integrity signals

Registry

Crossref · 10.1109/jsac.2017.2760186

Cites

30 of 30 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Lyu, X., Ni, W., Tian, H., Liu, R. P., Wang, X., Giannakis, G. B., & Paulraj, A.
Affiliations
  • University of Technology Sydney (AU)
  • Commonwealth Scientific and Industrial Research Organisation (AU)
  • Beijing University of Posts and Telecommunications (CN)
  • Fudan University (CN)
  • University of Minnesota (US)
  • Stanford University (US)
Venue
IEEE Journal on Selected Areas in Communications
Published
2017-11
Volume
35
Issue
11
Pages
2606-2615
ISSN
0733-8716 (ISSN-L)
OpenAlex
W2762586323
Cited by
251
References
30
Citations by year
2026: 5 · 2025: 10 · 2024: 18 · 2023: 17 · 2022: 36 · 2021: 39 · 2020: 53 · 2019: 45 · 2018: 27 · 2017: 1
FWCI
22.95
Type
journal article
Language
en
Open access
closed
Locations
  • IEEE Journal on Selected Areas in Communications (publishedVersion)
  • UTS ePRESS (University of Technology Sydney) (submittedVersion)
Funders
National Natural Science Foundation of China (61471060, 61421061)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Wireless Network Optimization
  • Physical Sciences › Computer Science › Computer Networks and Communications › Age of Information Optimization
Keywords
mobile edge computing, Internet of Things, task offloading, scheduling, incomplete information, feedback reduction, Lyapunov optimization, knapsack problem, throughput-fairness tradeoff, stochastic task arrivals

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