Learning Aided Joint Sensor Activation and Mobile Charging Vehicle Scheduling for Energy-Efficient WRSN-Based Industrial IoT
Bibliographic record
Abstract
In this paper, the joint sensor activation and mobile charging vehicle scheduling for wireless rechargeable sensor network (WRSN) based industrial Internet of Things (IIoT) is studied. In the proposed framework, an optimal sensor set is selected to collaboratively execute a bundle of heterogeneous industrial tasks (e.g., production-line monitoring), meeting the quality-of-monitoring (QoM) of each individual task, and we consider that a mobile charging vehicle (MCV) is scheduled for recharging sensors before their charging deadlines, i.e., time instants of running out of their batteries, in order to prevent from any potential service interruptions (which is one of the key features of IIoT). Our goal is to jointly optimize the sensor activation and MCV charging scheduling for minimizing the system energy consumption, subject to tasks' QoM requirements, sensor charging deadlines and the energy capacity of the MCV. Unfortunately, solving this problem is nontrivial, because it involves solving two tightly coupled NP-hard optimization problems. To address this issue, we design a novel scheme integrating reinforcement learning and marginal product based approximation algorithms, and prove that it is not only computationally efficient but also theoretically bounded with a guaranteed performance in terms of the approximation ratio. Simulation results show the feasibility of the proposed scheme and demonstrate its superiority over counterparts.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 source (direct Gemma or distilled Codex), 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".