MétaCan
Menu
Back to cohort
Record W1974614319 · doi:10.1504/ijaacs.2013.056823

Cooperative sensing with transmit diversity based on randomised STBC in CR networks

2013· article· en· W1974614319 on OpenAlex

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

VenueInternational Journal of Autonomous and Adaptive Communications Systems · 2013
Typearticle
Languageen
FieldComputer Science
TopicCognitive Radio Networks and Spectrum Sensing
Canadian institutionsUniversity of Manitoba
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsCognitive radioComputer scienceThroughputFadingSpace–time block codeTransmit diversityAntenna diversityChannel (broadcasting)Coding (social sciences)Computer networkCoding gainDiversity gainCooperative diversityOutage probabilityAlgorithmTelecommunicationsDecoding methodsWirelessStatisticsMathematics

Abstract

fetched live from OpenAlex

In this paper, a cognitive radio (CR) network composed of K secondary users (SUs) who cooperatively sense a channel using the k-out-of-K fusion rule to determine the presence of the primary user is studied. The sensing-throughput tradeoff problem is investigated in a realistic environment where both the sensing channels and reporting channels are characterised by fading channels. It is observed that taking into consideration the probability of reporting error in the CR network increases the sensing time and reduces the maximum average throughput of the SUs. To mitigate the effect of the probability of reporting error, a transmit diversity-based cooperative spectrum sensing method using randomised space-time block coding (RSTBC) is proposed. Simulations results show that the spatial diversity gain induced by RSTBC significantly decreases the sensing time and improves the throughput of the SUs.

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

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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
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.019
GPT teacher head0.231
Teacher spread0.212 · 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