AI Empowered Computing Resource Allocation in Vehicular Ad-hoc NETworks
Bibliographic record
Abstract
The vehicular ad hoc network (VANET) has emerged as a heterogeneous network with no fixed infrastructure. This paper proposes an AI-empowered task offloading and computing resource allocation model which can manage the computing resources in VANET dynamically. The model is divided into two layers. First, the task offloading layer, where the Random Forest (RF) algorithm is used to determine offloading the vehicle’s computing tasks whether to the Cloud Computing (CC) server or Mobile Edge Computing (MEC) server or to be processed locally (in-vehicle computing). Second, the resource allocation layer, where the Deep Deterministic Policy Gradient (DDPG) algorithm is used to determine the computing platform again when the task is determined to be offloaded to either MEC servers or the cloud servers. To evaluate the performance of the RF classifier, we applied the model to a real-world driving trajectory dataset, and then compared the results with a different set of Machine Learning (ML) algorithms namely, K-nearest neighbour (KNN), Multilayer Perceptron (MLP) and Support Vector Machine (SVM). The results show the RF model outperformed other models in classification accuracy score of 99.83% for task offloading decision, where the KNN, MLP and SVM achieved 9S%, 94.Sl% and 90.94%, respectively. Moreover, the DDPG based resource allocation scheme converges within 150 episodes and reduced the latency cost by 85%.
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.003 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.000 | 0.002 |
| 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".