MétaCan
Menu
Back to cohort
Record W2111337274 · doi:10.1155/2014/261823

Modeling Enhancements in Routing Protocols under Mobility and Scalability Constraints in VANETs

2014· article· en· W2111337274 on OpenAlexaff
Nadeem Javaid, Mariam Akbar, Zahoor Ali Khan, Turki Ali Alghamdi, Md Nazmus Saqib, M.I. Khan

Bibliographic record

VenueInternational Journal of Distributed Sensor Networks · 2014
Typearticle
Languageen
FieldComputer Science
TopicWireless Networks and Protocols
Canadian institutionsDalhousie University
Fundersnot available
KeywordsComputer scienceComputer networkLink-state routing protocolAd hoc On-Demand Distance Vector RoutingOptimized Link State Routing ProtocolDynamic Source RoutingRouting protocolDestination-Sequenced Distance Vector routingDistance-vector routing protocolThroughputRouting (electronic design automation)Distributed computingWirelessTelecommunications

Abstract

fetched live from OpenAlex

This paper presents mathematical framework for calculating transmission probability in IEEE 802.11 p based networks at Medium access control (MAC) layer, mathematical framework for calculating energy costs of the chosen routing protocols at network layer, and enhancements in optimized link state routing (OLSR), dynamic source routing, (DSR) and fish-eye state routing (FSR) to tackle delay in vehicular ad hoc networks (VANETs). Besides the enhancements, we analyze ad hoc ondemand distance vector (AODV) along with OLSR, DSR, and FSR as well. To evaluate the effect of our proposed transmission probabilities in the selected routing protocols, we choose network throughput, end-to-end delay (E2ED), and normalized routing load (NRL) as performance metrics. We also investigate the effect of different mobilities as well as scalabilities on the overall efficiency of the enhanced and default versions of the selected protocols. Simulations results which are conducted in NS-2 show that overall DSR-mod outperforms rest of the protocols.

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.002
metaresearch head score (Gemma)0.005
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.009

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.005
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.003
Open science0.0020.001
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.019
GPT teacher head0.299
Teacher spread0.280 · 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

Citations3
Published2014
Admission routes1
Has abstractyes

Explore more

Same venueInternational Journal of Distributed Sensor NetworksSame topicWireless Networks and ProtocolsFrench-language works237,207