MétaCan
Menu
Back to cohort
Record W2114429354 · doi:10.1504/ijaacs.2009.024284

Energy-efficient routing in mobile ad hoc networks: a cautionary tale

2009· article· en· W2114429354 on OpenAlex

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

VenueInternational Journal of Autonomous and Adaptive Communications Systems · 2009
Typearticle
Languageen
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsCarleton University
Fundersnot available
KeywordsComputer scienceComputer networkRouting protocolOptimized Link State Routing ProtocolWireless Routing ProtocolLink-state routing protocolZone Routing ProtocolDynamic Source RoutingDistributed computingMobile ad hoc networkDestination-Sequenced Distance Vector routingRouting (electronic design automation)

Abstract

fetched live from OpenAlex

Energy consumption is an important metric to consider in designing routing protocols for mobile ad hoc networks (MANET). In this article, we present some results from our work on integrating energy-efficiency aspects into a standard MANET routing protocol, optimised link state routing. We explore a range of protocol modifications and show that such changes can indeed increase the protocol performance in ideal scenarios (i.e. nodes having instantaneous and accurate knowledge of other nodes' residual energy levels) by as much as 30%. We then investigate the impact of nodes having only inaccurate/imprecise knowledge of the residual energy levels of other nodes, learning this information through protocol messages. The article shows that the achievable protocol performance is negatively affected by the imprecise information available. The loss in performance can be as high as 10%, emphasising the need to collect more precise routing-related information.

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.001
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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.976
Threshold uncertainty score0.546

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.0020.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.017
GPT teacher head0.261
Teacher spread0.244 · 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