MétaCan
Menu
Back to cohort
Record W2897411018 · doi:10.1109/tnse.2018.2877441

Learning-Theoretic Multi-Channel Spectrum Sensing and Access in Full-Duplex Cognitive Radio Networks with Unknown Primary User Activities

2018· article· en· W2897411018 on OpenAlexafffund
Mohamed Hammouda, Rong Zheng, Timothy N. Davidson

Bibliographic record

VenueIEEE Transactions on Network Science and Engineering · 2018
Typearticle
Languageen
FieldComputer Science
TopicCognitive Radio Networks and Spectrum Sensing
Canadian institutionsMcMaster University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsCognitive radioComputer scienceOptimization problemConvex optimizationWirelessThroughputChannel (broadcasting)Computer networkRobust optimizationMathematical optimizationRegular polygonAlgorithmMathematicsTelecommunications

Abstract

fetched live from OpenAlex

The majority of the opportunistic spectrum access schemes in cognitive radio networks (CRNs) rely on the Listen-Before-Talk (LBT) model due to the half-duplex nature of conventional wireless radios. In this paper, we consider the problem of optimal opportunistic multi-channel spectrum sensing and access using full-duplex (FD) radios in the presence of uncertain primary user (PU) activity statistics. A joint learning and spectrum access scheme is proposed. To optimize its throughput, the SU sensing period has to be carefully tuned. However, in absence of exact knowledge of the PU activity statistics, the PU's performance may be adversely affected. To address this problem, we formulate a robust optimization problem. Our analysis shows that under some non-restrictive simplifying assumptions, the robust optimization problem is convex. We analyze the impact of the sensing period on the PU collision probability and the SU throughput, and find the optimal sensing period via convex optimization. We show that sublinear regrets can be attained by the proposed estimation and robust optimization strategy. Simulation studies also demonstrate that the resulting robust solution provides a good trade-off between optimizing the SU's throughput and protecting the PU.

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 categoriesMeta-epidemiology (narrow)
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.702
Threshold uncertainty score1.000

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.002
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0000.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.009
GPT teacher head0.214
Teacher spread0.205 · 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
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

Citations5
Published2018
Admission routes2
Has abstractyes

Explore more

Same venueIEEE Transactions on Network Science and EngineeringSame topicCognitive Radio Networks and Spectrum SensingFrench-language works237,207