MétaCan
Menu
Back to cohort
Record W1989341961 · doi:10.1109/glocom.2012.6503635

Cross-layer dynamic rate adaptations for green cognitive radio networks

2012· article· en· W1989341961 on OpenAlexaff
Ashok Karmokar, Alagan Anpalagan

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCognitive Radio Networks and Spectrum Sensing
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsCognitive radioPartially observable Markov decision processComputer scienceFadingIndependent and identically distributed random variablesTransmitterMarkov processMarkov decision processEnergy consumptionQuality of serviceHidden Markov modelHeuristicMathematical optimizationChannel (broadcasting)AlgorithmComputer networkMathematicsTelecommunicationsWirelessStatisticsSpeech recognitionArtificial intelligenceEngineering

Abstract

fetched live from OpenAlex

We investigate cross-layer rate adaptation techniques for a secondary user (SU) equipped with a finite buffer in green cognitive radio networks. We assume that the activity statistics of the licensed primary users (PUs) channels are independent and identically distributed, and a SU detects their states using a spectrum sensing method. We formulate the problem as an infinite-horizon partially observable Markov decision process (POMDP). The policy is obtained using maximum-likelihood heuristic policy (MLHP) technique. We assume that the transition probabilities of the PUs and the fading channel between the SU's transmitter and receiver are known, but the exact PU's states are hidden. By tracking belief of the hidden states, the SU takes decision on the rate and corresponding power to minimize energy consumption with constraints on delay and bit error rate. Numerical results are given to show the performance of the proposed MLHP, which is found to perform very close to fully observable optimal policy. We also show pointer to choose design parameter so that the scheduler becomes the most energy-efficient for given quality of service requirements of the application.

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 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.952
Threshold uncertainty score0.699

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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.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.026
GPT teacher head0.291
Teacher spread0.265 · 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.

The models applied no category: nothing in the taxonomy fit this work.
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

Citations1
Published2012
Admission routes1
Has abstractyes

Explore more

Same topicCognitive Radio Networks and Spectrum SensingFrench-language works237,207