Elastic and Predictive Allocation of Computing Tasks in Energy Harvesting IoT Edge Networks

We consider a distributed IoT edge network whose end nodes generate computation jobs that can be processed locally or be offloaded, in full or in part, to other IoT nodes and/or edge servers having the necessary computation and energy resources. That is, jobs can either be partitioned and executed a...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on network science and engineering Vol. 8; no. 2; pp. 1772 - 1788
Main Authors Cecchinato, Davide, Erseghe, Tomaso, Rossi, Michele
Format Journal Article
LanguageEnglish
Published Piscataway IEEE 01.04.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Algorithms
Computational modeling
Delays
Edge computing
Elastic resource allocation
Energy
Energy harvesting
Energy sources
IoT networks
Nodes
Online algorithms
Optimization
Predictive control
Resource management
Servers
Task analysis
Online AccessGet full text

Cover

More Information
Summary:We consider a distributed IoT edge network whose end nodes generate computation jobs that can be processed locally or be offloaded, in full or in part, to other IoT nodes and/or edge servers having the necessary computation and energy resources. That is, jobs can either be partitioned and executed at multiple nodes (including the originating node) or be atomically executed at the designate server. IoT nodes and servers harvest ambient energy and jobs have a completion deadline . For this setup, we are concerned with the temporal allocation of jobs that maximizes the minimum level among all energy buffers in the network while meeting all the deadlines, i.e., that makes the network as much as possible energy neutral . Jobs continuously and asynchronously arrive at the IoT nodes, and computing resources are allocated dynamically at runtime, automatically adapting the processing load across nodes and servers. To achieve this, we present a Model Predictive Control based algorithm, where the job scheduler solves a sequence of low complexity convex problems and exploits future job and energy arrival estimates. The proposed technique is numerically evaluated, showing excellent adaptation capabilities, and performance close to that of an offline optimal scheduler with perfect information of all processes.
ISSN:2327-4697
2334-329X
DOI:10.1109/TNSE.2021.3072968