MétaCan
Menu
Back to cohort

Complexity Reduction for Cooperative Positioning in Vehicular Networks

2025· article· en· W4414647732 on OpenAlexaff
Peyman Hadi, Mustafa Ammous, Shahrokh Valaee

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicWireless Body Area Networks
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsGlobal Positioning SystemScheduling (production processes)Reduction (mathematics)Computational complexity theoryVehicular ad hoc network

Abstract

fetched live from OpenAlex

This paper addresses the limitations of GPS accuracy in vehicular networks, which is often insufficient for safety-critical applications. Cooperative positioning (CP) methods can mitigate GPS errors but encounter challenges in large networks due to high computational and communication complexity. To overcome these issues, we propose a star model CP method that reduces the observation vector size and an adaptive scheduling method that dynamically selects participating vehicles based on a safety-driven cost function, lowering computational and communication demands. This scheduler optimizes positioning frequency while reducing data exchange. Numerical evaluations show that our framework achieves comparable or improved positioning accuracy compared to methods that do not use scheduling, especially under high GPS error conditions.

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 imitation

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

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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.882
Threshold uncertainty score0.382

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
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.013
GPT teacher head0.240
Teacher spread0.227 · 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 teacher head, 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

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicWireless Body Area NetworksFrench-language works237,207