Energy Efficient Scheduling for Networked IoT Device Software Update
Bibliographic record
Abstract
Software in IoT devices needs to be improved regularly to adapt security issues and new user requirements. In advanced IoT networks, devices employ the component-based software architecture in which components can be updated at run-time, such devices can download software components from neighbors, enabling fast distribution of updates in the entire network. One of the most energy consuming operations in the update process is flash re-writing in which the order of re-writing components into the flash memory is decisive for energy consumption. In this paper, we propose a mechanism that schedules updates in an entire IoT network to minimize the energy consumption, while satisfying the deadline constraint for updating all the devices. We mathematically formulate the problem of energy efficient update scheduling as an optimization problem with a novel energy model of the update process, then propose an algorithm to approximate the optimal schedule for updating all devices in the network. We examine the proposed algorithm in three different network instances including a tree, a partial mesh and a full mesh topology. Simulation results illustrate that our algorithm can obtain a near optimum which is, in the best case, only 3.2% different from the minimum.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".