Experimental Analysis of Channel Estimation Algorithms in VANETs Considering Doppler Effects and High Mobility
Bibliographic record
Abstract
Vehicular ad-hoc networks (VANETs) face significant challenges in channel estimation, primarily due to the rapidly changing environment and the impact of Doppler frequency shifts caused by high-speed vehicle movement. This paper aims to evaluate the performance of existing channel estimation algorithms under scenarios with Doppler frequency shifts through computational experiments, with the assessment metric being the bit error rate (BER) performance of the algorithms under various signal-to-noise ratio (SNR) conditions. Based on simulation results, this paper systematically compares the effects of the least squares (LS), linear minimum mean square error (LMMSE), radial basis function (RBF), and genetic algorithm-optimized RBF (GA-RBF) in both relay-free and relayed scenarios, assessing their effectiveness in low-speed and high-speed environments. The results show that the LMMSE and GA-RBF algorithms significantly outperform other methods under high SNR conditions and high-speed scenarios, highlighting their robustness to Doppler frequency shifts. These findings provide valuable insights for the optimization of channel estimation technology in VANETs, and also offer key trade-offs for algorithm selection and optimization in dynamic channel environments.
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.008 |
| Meta-epidemiology (narrow) | 0.001 | 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.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".