MétaCan
Menu
Back to cohort

A Comparison Between the Centralized and Distributed Approaches for Spectrum Management

2010· article· en· W2132344484 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.

Bibliographic record

VenueIEEE Communications Surveys & Tutorials · 2010
Typearticle
Languageen
FieldComputer Science
TopicCognitive Radio Networks and Spectrum Sensing
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsComputer scienceDistributed computingSpectrum managementWirelessFrequency allocationBroad spectrumBaseline (sea)Computer networkCognitive radioTelecommunications

Abstract

fetched live from OpenAlex

There is a growing demand for spectrum to accommodate future wireless services and applications. Given the rigidity of current allocations, several spectrum occupancy studies have indicated a low utilization over both space and time. Hence, to satisfy the demands of applications it can be inferred that dynamic spectrum usage is a required necessity. Centralized Dynamic Spectrum Allocation (DSA) and Distributed Dynamic Spectrum Selection (DSS) are two paradigms that aim to address this problem, whereby we use DSS (distributed) as an umbrella term for a range of terminologies for decentralized access, such as Opportunistic Spectrum Access and Dynamic Spectrum Access. This paper presents a survey on these methods, whereby we introduce, discuss, and classify several proposed architectures, techniques and solutions. Corresponding challenges from a technical point of view are also investigated, as are some of the remaining open issues. The final and perhaps most significant contribution of this work is to provide a baseline for systematically comparing the two approaches, revealing the pros and cons of DSA (centralized) and DSS (distributed) as methods of realizing spectrum sharing.

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.004
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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.943
Threshold uncertainty score0.628

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0040.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0020.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.099
GPT teacher head0.324
Teacher spread0.226 · 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