MétaCan
Menu
Back to cohort
Record W2151271781 · doi:10.1109/aiccsa.2008.4493668

Ant colony-based many-to-one sensory data routing in Wireless Sensor Networks

2008· article· en· W2151271781 on OpenAlexaff
Reza GhasemAghaei, Md. Abdur Rahman, Wail Gueaieb

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicEnergy Efficient Wireless Sensor Networks
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsComputer scienceComputer networkRouting protocolWireless Routing ProtocolEnhanced Interior Gateway Routing ProtocolDynamic Source RoutingZone Routing ProtocolWireless sensor networkPath vector protocolNetwork packetLink-state routing protocolDistributed computingReal-time computing

Abstract

fetched live from OpenAlex

An ant colony-based routing protocol is presented in this paper that is specifically designed to route many-to-one sensory data in a multi-hop Wireless Sensor Network (WSN). Because a many-to-one routing paradigm generates lots of traffic in a multi-hop WSN resulting in greater energy wastage, higher end-to-end delay and packet loss, the proposed routing protocol also comes with a lightweight congestion control mechanism, which is capable of handling both event-based and periodic upstream sensory data flow to the base station. The proposed protocol works in two-phases. During the first phase, the protocol uses ant-based intelligence to find and enforce the shortest path and in the second phase, when the actual many-to-one sensory data transmission takes place, the protocol combines the knowledge gained during the first phase with the congestion control mechanism to avoid packet loss and traffic while routing the sensory data. When compared with the related algorithms, the proposed algorithm shows promising results.

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.001
Threshold uncertainty score0.002

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
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.055
GPT teacher head0.256
Teacher spread0.200 · 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

Citations40
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicEnergy Efficient Wireless Sensor NetworksFrench-language works237,207