MétaCan
Menu
Back to cohort
Record W2041862624 · doi:10.1109/pimrc.2013.6666641

A new connectivity metric for cognitive radio networks

2013· article· en· W2041862624 on OpenAlexaff
Mahmoud Gad, Ahmed A. Farid, Hussein T. Mouftah

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced MIMO Systems Optimization
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsMetric (unit)Cognitive radioAlgebraic connectivityComputer scienceMetricsSet (abstract data type)Measure (data warehouse)GraphMathematicsTheoretical computer scienceComputer networkData miningRouting protocolWirelessTelecommunications

Abstract

fetched live from OpenAlex

A new connectivity metric is proposed for cognitive radio networks. The analysis is developed based on a generalized model for cognitive radio networks where multiple primary users with independent activity factors are considered. The adjacent matrix elements, representing the weights associated to the network graph edges, are set proportional to the activity factors of primary users. It is shown that the proposed connectivity metric is a monotonically decreasing measure with the primary users activity factors. Furthermore, the metric efficiently determines the network connectivity under different primary users activities. The proposed connectivity metric is compared to the probability of finding a route metric which is commonly used as a measure for network connectivity. It is shown that the proposed metric captures the behavior of the probability of finding a route method with significant complexity reduction. Compared to the algebraic connectivity metric, the proposed metric is more robust in the presence of isolated nodes. Finally, the proposed metric can be utilized to analytically study and design cognitive radio networks.

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.005
Version: metacan-v3-hybrid-931329e0061cValidation 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.002
Threshold uncertainty score0.009

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.005
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0000.001
Scholarly communication0.0010.004
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.009
GPT teacher head0.219
Teacher spread0.210 · 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 designTheoretical or conceptual
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

Citations3
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced MIMO Systems OptimizationFrench-language works237,207