Reinforcement Learning-based Time-Dependable Modelling of Fog Connectivity for Software-Defined Vehicular Networks
Bibliographic record
Abstract
Connected vehicles are crucial in strengthening vehicular and Intelligent Transport Systems (ITS) by enabling autonomous and dynamic data sharing across the vehicular network. Extensive research has been conducted to predict connectivity, alongside thedevelopment of diverse techniques to manage this essential aspect. In recent times, learning methodologies have become increasingly popular for their ability to effec-tively handle sophisticated models adaptively. Various machine learning algorithms have been demonstrated as convincing methods for rendering any system flexible andpredictive. We thus propose a Learning based Adaptive Connectivity Estimation Model LACM. This model calculates and enhances the connectivity among differentstates and actions, monitoring their changes over time. The purpose of this model is to accurately depict the current connectivity status and predict potential fluctuations in fog connectivity. This model will utilize networking and vehicular characteristics to make the accuracy of its predictions. The design of this model aims to tackle the complexity of the problem by incorporating detailed data into a large state space representation, thereby enhancing adaptability. The second part of our work proposes a Time Dependent Connectivity Estimation Model, TDCM. Incorporating time dependency in the model helps to forecast the alterations in cluster lifestyles. It shows the progression of cluster evolution, significantly contributing towards achieving a stable and reliable network. Utilizing Long Short-Term Memory within an RL-based framework enables the system to enhance decision-making accuracy through predictions related to connectivity and network maintenance. Extensive analysis conducted through realistic simulations demonstrated that both LACM and TDCM strongly support estimating and maintaining stable connectivity over time. Our evaluation compared a previous state-of-the-art approach, showing that LACM and TDCM consistently enhanced the connectivity within the network.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| 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".