MétaCan
Menu
Back to cohort
Record W2082569868 · doi:10.1109/icc.2011.5963403

Trust-Based and Energy-Aware Incentive Routing Protocol for Multi-Hop Wireless Networks

2011· article· en· W2082569868 on OpenAlexafffund
Mohamed Elsalih Mahmoud, Xuemin Shen

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsUniversity of Waterloo
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer networkComputer scienceNetwork packetRouting protocolRelayHop (telecommunications)PaymentZone Routing ProtocolNode (physics)WirelessWireless Routing ProtocolIncentiveRouting (electronic design automation)Wireless networkProtocol (science)TelecommunicationsEngineering

Abstract

fetched live from OpenAlex

Node cooperation in relaying others' packets and route stability are essential for high-performance multi-hop wireless networks and reliable data transmission. In this paper, we propose routing protocol called TETO for stimulating node cooperation and establishing stable routes. TETO uses credits (or micropayment) to stimulate the nodes' cooperation and processes the payment receipts to evaluate the nodes' quality of packet-relay in terms of trust values. Stable routes are established through the highly trusted nodes having sufficient residual energy. Extensive analysis and simulations demonstrate that TETO can secure the payment and trust calculation and significantly improve route stability and thus the packet delivery ratio.

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.001
metaresearch head score (Gemma)0.003
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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.001
Threshold uncertainty score0.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0010.001
Scholarly communication0.0010.002
Open science0.0010.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.044
GPT teacher head0.278
Teacher spread0.234 · 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

Citations16
Published2011
Admission routes2
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207