MétaCan
Menu
Back to cohort
Record W3190847021 · doi:10.3390/electronics10161902

Balancing Awareness and Congestion in Vehicular Networks Using Variable Transmission Power

2021· article· en· W3190847021 on OpenAlexafffund
Xiaofeng Liu, Ben St. Amour, Arunita Jaekel

Bibliographic record

VenueElectronics · 2021
Typearticle
Languageen
FieldEngineering
TopicVehicular Ad Hoc Networks (VANETs)
Canadian institutionsUniversity of Windsor
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceRangingComputer networkWireless ad hoc networkVehicular ad hoc networkNetwork congestionBandwidth (computing)Channel (broadcasting)Transmission (telecommunications)Control channelVariable (mathematics)Real-time computingTelecommunicationsWirelessNetwork packet

Abstract

fetched live from OpenAlex

Vehicular ad Hoc networks (VANETs) support a variety of applications ranging from critical safety applications to “infotainment” or “comfort” applications. In North America, 75 MHz of the spectrum in the 5.9 GHz band has been allocated for vehicular communication. Safety applications rely on event-driven “alert” messages as well as the periodic broadcast of Basic Safety Messages (BSMs) containing critical information, e.g., position, speed, and heading from participating vehicles. The limited channel capacity and high message rates needed to ensure an adequate level of awareness make the reliable delivery of BSMs a challenging problem for VANETs. In this paper, we propose a decentralized congestion control algorithm that uses variable transmission power levels to reduce the channel busy ratio while maintaining a high level of awareness for nearby vehicles. The simulation results indicate that the proposed approach is able to achieve a suitable balance between awareness and bandwidth usage.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.006

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.005
GPT teacher head0.204
Teacher spread0.199 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations10
Published2021
Admission routes2
Has abstractyes

Explore more

Same venueElectronicsSame topicVehicular Ad Hoc Networks (VANETs)French-language works237,207