MétaCan
Menu
Back to cohort
Record W2082834794 · doi:10.1109/icc.2012.6363839

A fuzzy-logic-based cluster head selection algorithm in VANETs

2012· article· en· W2082834794 on OpenAlex
Khalid Abdel Hafeez, Lian Zhao, Zaiyi Liao, Bobby Ngok-Wah

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicVehicular Ad Hoc Networks (VANETs)
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsComputer scienceCluster analysisCluster (spacecraft)Selection (genetic algorithm)Fuzzy logicSelection algorithmNetwork topologyWireless ad hoc networkComputer networkTopology controlAlgorithmTopology (electrical circuits)Distributed computingArtificial intelligenceEngineeringWirelessWireless networkTelecommunications

Abstract

fetched live from OpenAlex

Due to vehicles high mobility, there have been many clustering-based MAC protocols proposed to control Vehicular Ad hoc Network topology more effectively. Cluster head (CH) selection and cluster formation is of paramount importance in a highly dynamic environment such as VANETs. In this paper, we propose a novel cluster head selection criteria where cluster heads are selected based on their relative speed and distance from vehicles within their neighborhood. The maintenance phase in the proposed algorithm is adaptable to drivers' behavior on the road and has a learning mechanism for predicting the future speed and position of all cluster members using fuzzy logic inference system. The simulation results show that the proposed algorithm has a high average cluster head lifetime and more stable cluster topology with less communication and coordination between cluster members compared to other schemes.

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.

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.573
Threshold uncertainty score0.715

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.011
GPT teacher head0.230
Teacher spread0.219 · 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

Quick stats

Citations94
Published2012
Admission routes1
Has abstractyes

Explore more

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