MétaCan
Menu
Back to cohort
Record W2093201673 · doi:10.1109/lcomm.2015.2418780

Fundamental Relations Between Reactive and Proactive Relay-Selection Strategies

2015· article· en· W2093201673 on OpenAlex
Minghua Xia, Sonia Aı̈ssa

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIEEE Communications Letters · 2015
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsInstitut National de la Recherche ScientifiqueUniversité du Québec à Montréal
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsRelaySelection (genetic algorithm)Relay channelComputer scienceEquivalence (formal languages)Additive white Gaussian noiseChannel (broadcasting)Computer networkTelecommunicationsMathematicsArtificial intelligencePower (physics)

Abstract

fetched live from OpenAlex

Two major relay-selection strategies widely applied in cooperative decode-and-forward (DF) relaying networks, namely, reactive relay selection (RRS) and proactive relay selection (PRS), are generally looked upon as independent and studied separately. In this paper, RRS and PRS are proven to be equivalent with respect to the end-to-end outage probability from the first principle, i.e., their respective relay-selection criteria. On the other hand, RRS is shown to be superior to PRS with respect to the end-to-end symbol error rate. Afterwards, a case study of a general DF relaying system, subject to co-channel interferences and additive white Gaussian noise at both the relaying nodes and the destination, is performed to explicitly illustrate the aforementioned outage equivalence. These fundamental relations provide intuitive yet insightful performance benchmarks for comparing various applications of these two relay-selection strategies.

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.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.643
Threshold uncertainty score0.648

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0000.002
Open science0.0010.001
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.106
GPT teacher head0.321
Teacher spread0.215 · 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