Data Transmission Control of Vehicle Ad Hoc Network in Intelligent Transportation Systems for Smart Cities
Bibliographic record
Abstract
The superposition of various application data streams in smart cities can intensify the load of vehicular networks in intelligent transportation systems, which can have an impact on the popularity of smart cities. To improve the performance of large amount of data transmission in telematics, this study proposes a scheme to determine the network state using congestion parameters and routing parameters and matches different data transmission amounts according to different states of the network. The scheme first considers the possibility of the network congestion state. Once congestion is judged to occur, the amount of data sent is reduced, and reducing the data backlog can further mitigate the possibility of congestion formation on the network. Secondly, after rejecting the possibility of congestion, the routing situation of the network needs to be judged, in such cases, whether a change in vehicles in the multi-hop path leads to a path change or an interruption of the data transmission path. Congestion parameters and routing parameters evaluate the state of the network, and the size of the congestion window is appropriately limited by the routing parameters to prevent excessive data volume from causing backlogs in the vehicular network. Experimental simulations show that the proposed scheme exhibits good performance in both linear and crossover vehicular networking scenarios. The research results provide a useful reference for the data transmission of telematics in smart cities.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 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.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".