MétaCan
Menu
Back to cohort
Record W2088880144 · doi:10.1109/infcom.2010.5461995

Throughput Analysis of Multiple Access Relay Channel under Collision Model

2010· article· en· W2088880144 on OpenAlexaff
Seyed Amir Hejazi, Ben Liang

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsComputer scienceRelayThroughputComputer networkTelecommunications linkChannel (broadcasting)CollisionWirelessWireless networkPhysical layerInterference (communication)Relay channelPower (physics)Distributed computingTelecommunications

Abstract

fetched live from OpenAlex

Despite much research on the throughput of relaying networks under idealized interference models, many practical wireless networks rely on physical-layer protocols that preclude the concurrent reception of multiple transmissions. In this work, we develop analytical frameworks for the uplink of a multi- source single-channel relay-aided wireless system where transmissions are scheduled to avoid collisions. We study amplify-and-forward and decode-and-forward strategies, in both time-sharing and network-coded variants, and provide mathematical models to investigate their achievable rate regions. Both general and optimal power allocations are considered. We also find the cut-set outer bounds for the rate regions. Moreover, we present a comparison between these methods with the simple time sharing scheme. Our numerical results reveal that optimizing power allocation favors the time sharing scheme significantly more than it does the relaying schemes, so that time sharing under some circumstances can provide higher maximum sum rates, even if the links to the relay have strong channel gains. The proposed analysis provides a means to quantitatively evaluate the efficacy of relaying under the collision model, leading to pragmatic design guidelines.

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.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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.875
Threshold uncertainty score0.273

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.002
Science and technology studies0.0000.000
Scholarly communication0.0000.001
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.086
GPT teacher head0.343
Teacher spread0.257 · 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.

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

Citations5
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207