MétaCan
Menu
Back to cohort
Record W1965760658 · doi:10.1145/2386958.2386966

Congestion control in vehicular ad hoc networks using meta-heuristic techniques

2012· article· en· W1965760658 on OpenAlexaff
Nasrin Taherkhani, Samuel Pierre

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicVehicular Ad Hoc Networks (VANETs)
Canadian institutionsPolytechnique Montréal
Fundersnot available
KeywordsComputer scienceNetwork congestionHeuristicVehicular ad hoc networkComputer networkQuality of serviceThroughputPacket lossReliability (semiconductor)Network packetWireless ad hoc networkPower (physics)WirelessTelecommunications

Abstract

fetched live from OpenAlex

In VANET, various limitations such as high mobility, high rate of topology changes, limitation of bandwidth, etc, play a significant role for reducing performance in these networks. Qualities of Service policies have been used to improve the performance of VANET. One of the significant parameters in Quality of Service is Congestion Control. The congestion control is used to ensure safe and reliable communication architecture. Three types of strategies are available for congestion control which consists of transmission power control, packet transmission frequently control and packet duration. Heuristic techniques can be used to define heuristic rules and finding feasible and good enough solution to some problems in reasonable time. According to heuristic's benefits, we are motivated to use these techniques in congestion control to generate efficient VANET. This work is aimed to improve congestion control with heuristic techniques to reduce the traffic communication channels while considering reliability requirements of applications in VANETs. The simulation results have demonstrated that meta-heuristic techniques features significantly better performance in terms of packet loss, throughput and delay compared with other congestion control algorithm within VANETs.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
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.825
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.020
GPT teacher head0.230
Teacher spread0.210 · 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.

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

Citations30
Published2012
Admission routes1
Has abstractyes

Explore more

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