MétaCan
Menu
Back to cohort
Record W2135079382 · doi:10.1109/icc.2007.787

Cooperation and Routing in Multi-Hop Networks

2007· article· en· W2135079382 on OpenAlexaff
Elzbieta Beres, Raviraj Adve

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsComputer scienceComputer networkHop (telecommunications)Routing protocolCooperative diversityBandwidth (computing)Distributed computingDynamic Source RoutingNetwork routingRouting (electronic design automation)Fading

Abstract

fetched live from OpenAlex

We study the cross-layer problem of combining routing and cooperative diversity in multi-hop, bandwidth- constrained networks with dedicated multiple access. Previous work in cooperative diversity nearly always assumes cooperation to be a positive. We show that in a large scale multi-hop network, cooperation must only be used selectively. Our figure of merit is achievable data rate between a source and destination at a fixed probability of outage. We show that enforcing multiple hops is detrimental to performance, since each extra hop requires bandwidth expansion. This performance can be significantly improved by incorporating a selective cooperative diversity scheme on a one-hop link. On the other hand, the simulation results show that cooperative diversity does not improve performance over a dynamic routing protocol which searches for the optimal, non-diversity, route. Including the search for cooperative nodes into the dynamic route search, however, does further increase flow rates by decreasing the average number of hops and thus decreasing the required bandwidth expansion. This paper therefore points to the importance of an integrated approach to routing and the physical layer in cooperative networks.

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.002
metaresearch head score (Gemma)0.005
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: Methods · Consensus signal: Methods
Teacher disagreement score0.002
Threshold uncertainty score0.009

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.005
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0020.002
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.052
GPT teacher head0.307
Teacher spread0.255 · 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
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

Citations42
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207