MétaCan
Menu
Back to cohort
Record W2612364459 · doi:10.1109/wcnc.2017.7925681

Relay Selection for Cognitive Massive MIMO Two-Way Relay Networks

2017· article· en· W2612364459 on OpenAlexaff
Shashindra Silva, Masoud Ardakani, Chintha Tellambura

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsRelayMIMOComputer scienceUnderlayInterference (communication)Cognitive radioSelection (genetic algorithm)Relay channelComputer networkSignal-to-noise ratio (imaging)WirelessTopology (electrical circuits)Power (physics)TelecommunicationsEngineeringElectrical engineeringChannel (broadcasting)

Abstract

fetched live from OpenAlex

We analyze relay selection for an underlay cognitive radio (CR) two-way relay network (TWRN) with zero-forcing (ZF) transmission and receiving. The source and the destination nodes are massive multiple-input multiple-output (MIMO) enabled. Relays will perform amplify and forwarding (AF) while the destination and source nodes perform self interference cancellation. We first obtain asymptotic signal-to-interference-plus-noise ratio (SINR) values under the power scaling at the relay and end nodes. Then, we derive optimal power allocation schemes for the end nodes to satisfy the interference constraints at the primary user (PU). Based on these optimal values, we analyze the effect of relay selection on the sum rate. With the use of massive MIMO, the SINR and the sum rate will only depend on the pathloss coefficients of the channels and average noise levels. Thus, the relay selection can be done at the deployment stages of the system and most of the time it simplifies to selection of the relay with the highest number of antennas. Our simulation results validate the analytical asymptotic results and qualify CR massive MIMO TWRNs as a possible candidate for future wireless systems.

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

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.000
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.048
GPT teacher head0.324
Teacher spread0.277 · 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

Citations23
Published2017
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207