RETRACTED ARTICLE: An efficient quantum based D2D computation and communication approach for the Internet of Things
Post-publication record
OpenAlex flags this work as retracted, but it carries no matching Retraction Watch record in this frame.
Bibliographic record
Abstract
Abstract We can say with some clarity that the Internet of Things (IoT) can be made up of a set of embedded devices such as light detection sensors, ranging (LiDAR) sensors, and millimetre-wave (mmWave) sensors. These sensors generate a massive amount of data in which limited communication capacity is available to share a massive amount of data to Fog-based Roadside Units (RSU) for data process and analysis service. Fog-based RSU has become an emerging paradigm in intelligent transportation but needs research attention to design intelligent decision-making methods for data communication and computation at Fog-based RSU. To address these issues, we design a two-level Quantum based D2D Computation, Communication ($QDC^{2}$) approach. First, design a bandwidth allocation strategy based on spatial importance score factors to resolve embedded devices' data transmission issues. Second, design an adaptive equilibrium service offloading strategy based on device-centric measurements to assess the computation capacity and performance rate for resolving Fog-node computation consistency issues. Additionally, Fog-based RSU is interconnected with LAN helps to optimize service latency. Simulation results show that our approach achieved a high service reliability rate (79.56\%), low error rate (0.9\%), and an execution delay of 22.5s for 15 devices than state-of-art approaches.
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.010 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.002 | 0.002 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.003 | 0.001 |
| Research integrity | 0.005 | 0.005 |
| Insufficient payload (model declined to judge) | 0.022 | 0.011 |
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".