MétaCan
Menu
Back to cohort
Record W1968750272 · doi:10.1109/vtcfall.2012.6399163

TIEGeR: An Energy-Efficient Multi-Parameter Geographic Routing Algorithm

2012· article· en· W1968750272 on OpenAlexaff
Ishaan Bir Singh, Quang‐Dung Ho, Tho Le‐Ngoc

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsMcGill University
Fundersnot available
KeywordsStatic routingDynamic Source RoutingLink-state routing protocolComputer scienceEqual-cost multi-path routingDestination-Sequenced Distance Vector routingMultipath routingGeographic routingPolicy-based routingComputer networkDistributed computingRouting Information ProtocolRouting (electronic design automation)Routing protocol

Abstract

fetched live from OpenAlex

Geographic routing algorithms conventionally use one-hop greedy forwarding as their primary routing technique, which might lead to routing voids. Secondary routing schemes used to circumnavigate such routing voids are unfortunately not efficient in terms of throughput and energy consumption. Moreover, node residual energy and link quality are not considered during the routing process. This paper presents Two-hop Information based Energy- efficient Geographic Routing (TIEGeR) scheme to achieve effective energy balancing throughout the network, while preventing routing voids by proactively avoiding "local maxima" nodes. Distance to reach destination, node connectivity, link quality, and node residual energy are employed to formulate the routing metric for the TIEGeR. Besides, secondary routing scheme dealing with routing voids is supplemented by the reverse progress mode. Simulations verify the advantages of TIEGeR against conventional geographic routing 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.

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.000
metaresearch head score (Gemma)0.001
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.002
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.000
Scholarly communication0.0010.002
Open science0.0020.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.001

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.018
GPT teacher head0.245
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 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

Citations5
Published2012
Admission routes1
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207