A Centralized and Dynamic Network Congestion Classification Approach for Heterogeneous Vehicular Networks
Bibliographic record
Abstract
Network congestion-related studies consist mainly of two parts: congestion detection and congestion control. Several researchers have proposed different mechanisms to control congestion and used channel loads or other factors to detect congestion. However, the number of studies concerning congestion detection and going beyond into congestion prediction is low. On this basis, we decide to propose a method for congestion prediction using supervised machine learning. In this paper, we propose a Naive Bayesian network congestion warning classification method for Heterogeneous Vehicular Networks (HetVNETs) using simulated data that can be locally applied in a fog device in a HetVNET. In addition, we propose a centralized and dynamic cloud-fog-based architecture for HetVNET. The Naive Bayesian network congestion warning classification method can be applied in this architecture. Support Vector Machine (SVM), K Nearest Neighbor (KNN) and Random Forest classifiers, which are popular methods in classification problems, are considered to generate congestion warning prediction models. Numerical results show that the proposed Naive Bayesian classifier is more reliable and stable and can accurately predict the data flow warning state in HetVNET. Moreover, based on the obtained simulation results, applying the proposed congestion classification approach can improve the network’s performance in terms of the packet loss ratio, average delay and average throughput, especially in the dense vehicular environments of HetVNET.
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.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 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".