Exploiting Vehicular Social Networks and Dynamic Clustering to Enhance Urban Mobility Management
Bibliographic record
Abstract
Transport authorities are employing advanced traffic management system (ATMS) to improve vehicular traffic management efficiency. ATMS currently uses intelligent traffic lights and sensors distributed along the roads to achieve its goals. Furthermore, there are other promising technologies that can be applied more efficiently in place of the abovementioned ones, such as vehicular networks and 5G. In ATMS, the centralized approach to detect congestion and calculate alternative routes is one of the most adopted because of the difficulty of selecting the most appropriate vehicles in highly dynamic networks. The advantage of this approach is that it takes into consideration the scenario to its full extent at every execution. On the other hand, the distributed solution needs to previously segment the entire scenario to select the vehicles. Additionally, such solutions suggest alternative routes in a selfish fashion, which can lead to secondary congestions. These open issues have inspired the proposal of a distributed system of urban mobility management based on a collaborative approach in vehicular social networks (VSNs), named SOPHIA. The VSN paradigm has emerged from the integration of mobile communication devices and their social relationships in the vehicular environment. Therefore, social network analysis (SNA) and social network concepts (SNC) are two approaches that can be explored in VSNs. Our proposed solution adopts both SNA and SNC approaches for alternative route-planning in a collaborative way. Additionally, we used dynamic clustering to select the most appropriate vehicles in a distributed manner. Simulation results confirmed that the combined use of SNA, SNC, and dynamic clustering, in the vehicular environment, have great potential in increasing system scalability as well as improving urban mobility management efficiency.
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".