Incentive-Driven Task Allocation for Collaborative Edge Computing in Industrial Internet of Things
Bibliographic record
Abstract
Residing in the proximity of end devices, edge computing (EC) holds great potential to provide low-latency, energy-efficient, and secure services, which has become an essential part of the Industrial Internet of Things (IIoT). To future accelerate task processing and reduce service latency, this work proposes an online incentive-driven task allocation scheme to stimulate collaborative computing among EC servers and IIoT devices. To better serve dynamic and heterogeneous tasks in terms of profiles and importance, EC servers (including neighboring servers) and IIoT devices with available resources can cooperatively process the tasks. Considering the heterogeneity of computing resources in edge servers and industrial IoT devices, we formulate a task allocation problem, which is NP hard. An online incentive-driven task allocation algorithm is proposed to this NP-hard problem, which will optimize task assignment strategies to maximize system utility, promote faster computing, and stimulate collaborative computing. Theoretical analyses show that the online incentive algorithm can satisfy incentive compatibility, individual rationality, computational efficiency, and feasibility. The results demonstrate that the proposed task allocation scheme with collaborative EC achieves superior performance and effectiveness.
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.002 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| 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".