MétaCan
Menu
Back to cohort
Record W2151609990 · doi:10.1109/icon.2002.1033322

Protection and restoration in ad hoc wireless networks

2003· article· en· W2151609990 on OpenAlexaff
Chi‐Hsiang Yeh

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsQueen's University
Fundersnot available
KeywordsComputer networkWireless ad hoc networkMobile ad hoc networkComputer scienceQuality of serviceAd hoc wireless distribution serviceVehicular ad hoc networkReliability (semiconductor)Wireless networkAdaptive quality of service multi-hop routingWirelessOptimized Link State Routing ProtocolTelecommunications

Abstract

fetched live from OpenAlex

Protection has been among the most important issues for optical networks due to the requirements of reliability and quality-of-service (QoS). In this paper, we advocate applying protection and restoration to wireless networks. Due to the mobility of mobile users/routers and the interference and high error-rates for radio communications, protection and restoration can considerably enhance the capability for QoS provisioning in mobile ad hoc networks (MANET) and ad hoc cellular network (ACENET). We propose several strategies to transform previous protection techniques for optical networks to obtain geographical wireless protection techniques for wireless networks. We also present several backbone-sharing protection and weaved protection techniques that are particularly developed for MANET and ACENET.

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.007

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0010.003
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.040
GPT teacher head0.261
Teacher spread0.220 · 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

Citations4
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207