MétaCan
Menu
Back to cohort

Learning-Based Opportunistic Spectrum Access with Adaptive Hopping Transmission Strategy

2012· article· en· W2052132788 on OpenAlexaff
Mahsa Derakhshani, Tho Le‐Ngoc

Bibliographic record

VenueIEEE Transactions on Wireless Communications · 2012
Typearticle
Languageen
FieldComputer Science
TopicCognitive Radio Networks and Spectrum Sensing
Canadian institutionsMcGill University
Fundersnot available
KeywordsComputer scienceFrequency-hopping spread spectrumConvergence (economics)Transmission (telecommunications)ThroughputIdleMathematical optimizationRandom accessWirelessComputer networkTelecommunicationsMathematics

Abstract

fetched live from OpenAlex

This paper presents an adaptive hopping transmission strategy for secondary users (SUs) to access temporarily idle frequency-slots of a licensed frequency band in consideration of the random return of primary users (PUs), aiming to maximize the overall SU throughput. A SU dynamically hops over multiple idle frequency-slots, each with an adaptive activity factor to avoid high-risk data loss due to possible PU return. SU activity factor optimization problems are formulated to develop the optimal opportunistic spectrum access (OSA) algorithms for SUs based on the Lagrange dual decomposition method. Subsequently, a fully distributed learning-based OSA algorithm is developed in which each SU independently adapts its activity factors to the optimal values over time by learning other SUs' behavior from locally available information. The convergence and convergence rate that characterize its asymptotic behavior and efficiency are analyzed. It is shown that the proposed learning-based OSA algorithm converges with probability of 1 to the optimal solution. Illustrative results confirm its effectiveness and performance gain as compared to existing OSA schemes.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.987
Threshold uncertainty score1.000

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.001
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.001
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.055
GPT teacher head0.287
Teacher spread0.232 · 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.

Study designSimulation or modeling
Domainnot available
GenreMethods

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

Citations13
Published2012
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Wireless CommunicationsSame topicCognitive Radio Networks and Spectrum SensingFrench-language works237,207