MétaCan
Menu
Back to cohort
Record W2169879363 · doi:10.1109/tvt.2010.2096545

Joint Optimal Cooperative Sensing and Resource Allocation in Multichannel Cognitive Radio Networks

2010· article· en· W2169879363 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 Transactions on Vehicular Technology · 2010
Typearticle
Languageen
FieldComputer Science
TopicCognitive Radio Networks and Spectrum Sensing
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsCognitive radioComputer scienceChannel (broadcasting)Optimization problemComputer networkResource allocationBandwidth (computing)StatisticChannel allocation schemesMathematical optimizationJoint (building)Test statisticWidebandWirelessEngineeringTelecommunicationsElectronic engineeringAlgorithmMathematicsStatisticsStatistical hypothesis testing

Abstract

fetched live from OpenAlex

In this paper, the problem of joint multichannel cooperative sensing and resource allocation is investigated. A cognitive radio network with multiple potential channels and multiple secondary users is considered. Each secondary user carries out wideband spectrum sensing to get a test statistic for each channel and transmits the test statistic to a coordinator. After collecting all the test statistics from secondary users, the coordinator makes the estimation as to whether primary users are idle or not in the channels. When a channel is estimated to be free, secondary users can get access to the channel with assigned bandwidth and power. An optimization problem is formulated, which maximizes the weighted sum of secondary users' throughputs while guaranteeing a certain level of protection for the activities of primary users. Although the problem is nonconvex, it is shown that the problem can be solved by bilevel optimization and monotonic programming. This paper is also extended to cases with consideration of proportional and max-min fairness.

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.000
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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.724
Threshold uncertainty score0.973

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
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.221
Teacher spread0.211 · 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