MétaCan
Menu
Back to cohort
Record W2893834508 · doi:10.1109/mnet.2018.1700297

Joint Opportunistic Routing and Intra-Flow Network Coding in Multi-Hop Wireless Networks: A Survey

2018· article· en· W2893834508 on OpenAlexaff
Chen Zhang, Cheng Li, Yuanzhu Chen

Bibliographic record

VenueIEEE Network · 2018
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsMemorial University of Newfoundland
Fundersnot available
KeywordsComputer scienceComputer networkWireless networkRouting protocolLinear network codingWirelessWireless Routing ProtocolDynamic Source RoutingDistributed computingLossy compressionMultiple description codingRouting (electronic design automation)TelecommunicationsNetwork packetArtificial intelligence

Abstract

fetched live from OpenAlex

Opportunistic routing and network coding are two promising techniques that have been proposed for wireless networks. These techniques have significantly improved the performance of multi-hop wireless networks by utilizing the broadcast nature of wireless media and optimizing the capacity of lossy wireless networks. Recent research has shown that the combination of opportunistic routing and network coding in a single joint protocol outperforms each of them individually. This article explains the motivation and interaction effect of the joint protocols. We provide a taxonomy of joint protocols and illustrate the benefit and cost by highlighting their fundamental components and comparing different solutions. We also present a conclusion along with the outline of future research direction.

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.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Review · Consensus signal: Review
Teacher disagreement score0.002
Threshold uncertainty score0.007

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.004
Science and technology studies0.0010.001
Scholarly communication0.0020.003
Open science0.0010.001
Research integrity0.0020.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.102
GPT teacher head0.300
Teacher spread0.197 · 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 designNot applicable
Domainnot available
GenreReview

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

Citations20
Published2018
Admission routes1
Has abstractyes

Explore more

Same venueIEEE NetworkSame topicCooperative Communication and Network CodingFrench-language works237,207