Communication, Computation, and Caching Resource Sharing for the Internet of Things
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The Internet of Things connects a large number of smart mobile devices with the Internet, where these devices are embedded with often limited communication, computation, and caching resources. To address the heterogeneity of these devices and achieve efficient overall system resource utilization, researchers have proposed various device-to-device resource sharing models, enabling mobile devices to form device-todevice connections and to share their resources for cooperative task execution. Most of these existing works, however, considered scenarios where mobile devices can share one or two types of resources, and hence inadequately explore the potential of resource sharing among mobile devices. In this article, we introduce a general framework where mobile devices can share any combination of the three types of resources, and it can generalize many existing deviceto- device resource sharing models. In addition, it can achieve more efficient resource allocation by offering mobile devices more flexibility in terms of resource sharing. Based on the proposed framework, we focus on discussing two issues: the optimization issue, regarding how to schedule resources among devices; and the economic issue, regarding how to motivate the device owners to share their resources. We introduce the challenges and potential solutions to these two issues. We further outline several open issues and future directions for the proposed general resource sharing framework.
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.
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.001 | 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.004 | 0.002 |
| 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 it