MétaCan
Menu
Back to cohort
Record W2045423399 · doi:10.1109/glocomw.2011.6162500

Traffic Splitting Protocol for Multipath Routing in Wireless Sensor Networks

2011· article· en· W2045423399 on OpenAlexaff
Mohamed Ebada, Hussein T. Mouftah

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicEnergy Efficient Wireless Sensor Networks
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsComputer networkComputer scienceWireless sensor networkRouting protocolMultipath routingMultipath propagationRouting (electronic design automation)Distributed computingWireless Routing Protocol

Abstract

fetched live from OpenAlex

One of the most important reasons for using Multipath Routing in Wireless Sensor Network (WSN) is increasing the WSN life span. The increase in the WSN life span is a result of evenly distributing the load on all discovered routes. This is because; using a single route in a WSN would deplete the limited energy resources of the involved nodes. This would cause premature death of the most used nodes, fragmentation of the WSN and a non-functional network. As a result, it is of great importance to evenly allocate traffic to all discovered routes in a WSN to increase the network life time expectancy. In this paper, four network factors and the mathematical framework to calculate them is proposed. Also, a Traffic Splitting Protocol integrated with the network factors is introduced.

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 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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.690
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.0000.000
Open science0.0010.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.048
GPT teacher head0.274
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 teacher head, not a consensus.

Study designSimulation or modeling
Domainnot available
GenreMethods

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

Citations4
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicEnergy Efficient Wireless Sensor NetworksFrench-language works237,207