MétaCan
Menu
Back to cohort
Record W2325372342 · doi:10.1049/iet-com.2015.0906

Performance study of opportunistic scheduling in dual‐hop multi‐user underlay cognitive network

2016· article· en· W2325372342 on OpenAlexaff
Jamal Ahmed Hussein, Salama Ikki, Said Boussakta, Charalampos C. Tsimenidis

Bibliographic record

VenueIET Communications · 2016
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsLakehead University
Fundersnot available
KeywordsComputer scienceCumulative distribution functionScheduling (production processes)Cognitive radioProbability density functionMathematical optimizationMonte Carlo methodDiversity gainFadingAlgorithmMathematicsTelecommunicationsStatisticsWireless

Abstract

fetched live from OpenAlex

In this study, the authors investigate the performance of opportunistic scheduling for the dual‐hop amplify‐and‐forward multi‐user cognitive relaying network. Expressions are derived for the cumulative distribution function (CDF) and probability density function of the equivalent signal‐to‐noise ratio (SNR). From the derived CDF, the outage performance of the cognitive network is investigated. Then, an expression for average error probability is derived. Furthermore, simple and generic asymptotic expressions for the outage and error probabilities are obtained and discussed. In addition, a closed‐form expression for the system's ergodic capacity is derived. Their asymptotic results show that opportunistic scheduling has no impact on diversity gain. It is confirmed that the array gain determines the SNR advantage of opportunistic scheduling over the single‐user scenario. Moreover, they study adaptive power allocation under the total transmit power constraint in order to minimise the average error probability. As expected, the results show that optimum power allocation improves system performance compared with uniform power allocation. Finally, numerical results and Monte Carlo simulations are also provided to support the correctness of the analytical calculations.

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.001
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: Observational · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.602
Threshold uncertainty score0.500

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0020.002
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.139
GPT teacher head0.346
Teacher spread0.207 · 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 designObservational
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

Citations2
Published2016
Admission routes1
Has abstractyes

Explore more

Same venueIET CommunicationsSame topicCooperative Communication and Network CodingFrench-language works237,207