Information Theory Based Traffic Pattern Detection in Mobile Ad Hoc Network of Vehicles
Bibliographic record
Abstract
Prior knowledge of road traffic conditions on the freeways is of prime importance for motorists. With recent developments in technology it is possible for the vehicles to be equipped with communication and GPS systems. The equipped vehicles on the road can act as nodes to form an ad hoc network. These nodes can collect information regarding traffic conditions such as position, speed and direction from other participating nodes. Depending upon the number of participating nodes this collected information can provide useful information of driving conditions to the node collecting this information. With proper analysis this information can be used in detecting and or predicting traffic jam conditions on the freeways. In this paper the traffic information gathered by a node in an ad hoc network is viewed as a snapshot in time of the current traffic condition on the road segment. This snapshot is considered as a pattern in time of the current traffic conditions. The pattern is analyzed using pattern recognition techniques. A weight of evidence based classification algorithm is presented to identify different road traffic conditions. The developed algorithm is tested using data generated by microscopic modelling of traffic flow for simulation of vehicle or node mobility in ad hoc networks. Test results are presented under assumption of different levels of vehicles equipped with communication capability.
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.004 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 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 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".