Prevent Deception: On-Demand Data Synchronization for Vehicle Digital Twins
Bibliographic record
Abstract
In digital-twin-enabled heterogeneous vehicular networks (DT-HetVNets), vehicles need to synchronize data to their DTs deployed in the cloud for decision-making. However, for a vehicle which is simultaneously covered by a group of heterogeneous network infrastructures, the DT of the vehicle (DT-V) can connect with the DTs of infrastructures (DT-Is) in different infrastructure groups across regions in the virtual networks so that each DT-V may deceive the DT-Is by interacting with multiple DT-I groups and selecting the optimal one to synchronize data. To this end, we propose an on-demand data synchronization scheme for DT-Vs and DT-Is. In the scheme, infrastructures and vehicles are grouped based on their geographical locations and the arrival time of each vehicle through which the DT-Vs and DT-Is can interact with each other to make decisions in groups. Then, the requirements of DT-Vs (i.e., minimize synchronization cost and maximize synchronization satisfaction) and DT-Is (i.e., maximize profits) are considered to design their utility functions and the decision-making process between the DT-Vs in each group and the DT-Is in each group is formulated as a Stackelberg game to obtain their optimal strategies. After that, considering the deceptive behavior of vehicles, a joint optimization algorithm that integrates the Stackelberg game and the selection of each DT-V is designed to obtain the real equilibrium solution for DT-Vs and DT-Is to maximize their utilities. Simulation results show that our scheme can obtain the highest utilities compared with the traditional schemes.
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.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| 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".