MétaCan
Menu
Back to cohort
Record W2507894885 · doi:10.1109/tvt.2015.2476504

GeoMobCon: A Mobility-Contact-Aware Geocast Scheme for Urban VANETs

2015· article· en· W2507894885 on OpenAlexafffund
Boyang Yu, Jianping Pan

Bibliographic record

VenueIEEE Transactions on Vehicular Technology · 2015
Typearticle
Languageen
FieldComputer Science
TopicOpportunistic and Delay-Tolerant Networks
Canadian institutionsUniversity of Victoria
FundersBritish Columbia Knowledge Development FundNatural Sciences and Engineering Research Council of CanadaCanada Foundation for Innovation
KeywordsScheme (mathematics)Computer networkComputer scienceGeocastWireless ad hoc networkVehicular ad hoc networkTelecommunicationsWireless

Abstract

fetched live from OpenAlex

Geocast, which consists of delivering messages to a specific location, has become an important technique with the accelerated development of the location-based services in mobile networks. Geocast in the automotive domain is of particular interest, enabling many promising applications, such as geographic advertising, location-based traffic alerts, etc. Different from the conventional geocast algorithms focusing on the distance-based approaches, in this paper, we propose a node mobility-aware and node contact-aware geocast algorithm (GeoMobCon) for urban vehicular ad hoc networks from the delay-tolerant network perspective to better deal with the high mobility and transient connectivity issues. Different levels and aspects of vehicle mobility information and self-maintained contact information are employed, making GeoMobCon simple, scalable, and communication and computation effective. Practical issues are well considered by introducing real-world trace analysis, trace-driven simulation, and efficient buffer management. Extensive performance comparisons with other protocols have been conducted to show the advantages of GeoMobCon.

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.000
metaresearch head score (Gemma)0.001
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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.006
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.000
Scholarly communication0.0010.001
Open science0.0020.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.029
GPT teacher head0.250
Teacher spread0.221 · 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

Citations17
Published2015
Admission routes2
Has abstractyes

Explore more

Same venueIEEE Transactions on Vehicular TechnologySame topicOpportunistic and Delay-Tolerant NetworksFrench-language works237,207