MétaCan
Menu
Back to cohort
Record W2055617028 · doi:10.1109/icc.2013.6655119

An ant-swarm inspired energy-efficient ad hoc on-demand routing protocol for mobile ad hoc networks

2013· article· en· W2055617028 on OpenAlex
Isaac Woungang, Mohammad S. Obaidat, Alexander Ferworn, Waqas Shah

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
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsComputer scienceAnt colony optimization algorithmsWireless Routing ProtocolComputer networkRouting protocolOptimized Link State Routing ProtocolMobile ad hoc networkWireless ad hoc networkAd hoc wireless distribution serviceDistributed computingRouting (electronic design automation)Energy (signal processing)Protocol (science)WirelessTelecommunicationsArtificial intelligence

Abstract

fetched live from OpenAlex

As the world's economic activities are expanding, the energy comes to the fore to the question of the sustainable growth in all technological areas, including wireless mobile networking. Energy-aware routing schemes for wireless networks have spurred a great deal of recent research towards achieving this goal. Recently, an energy-aware routing protocol for MANETs was proposed by us, in which the energy load among nodes is balanced so that a minimum energy level is maintained and the resulting network lifetime is increased. In this paper, an Ant Colony Optimization (ACO) inspired approach to EEAODR (so-called ACO-EEAODR) is proposed. To the best of our knowledge, no attempts have been made so far in this direction. The obtained simulation results show that the ACO-EEAODR outperforms the EEAODR scheme in terms of energy consumed and network lifetime performance metrics.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.839
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.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
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.016
GPT teacher head0.271
Teacher spread0.256 · 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

Citations29
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207