MétaCan
Menu
Back to cohort
Record W2076897967 · doi:10.1109/wcnc.2013.6555181

Power allocation in decode and forward relaying for green cooperative cognitive radio systems

2013· article· en· W2076897967 on OpenAlexaff
Muhammad Naeem, Kandasamy Illanko, Ashok Karmokar, Alagan Anpalagan, Muhammad Jaseemuddin

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsComputer scienceMathematical optimizationCognitive radioTelecommunications linkFractional programmingConvergence (economics)Iterative methodConstraint (computer-aided design)Power (physics)RelayNonlinear programmingWirelessTelecommunicationsNonlinear systemAlgorithmMathematics

Abstract

fetched live from OpenAlex

In this paper, we investigate the optimal allocation of the power in the downlink cooperative cognitive radio network using decode and forward (DF) relaying techniques. The power allocation in DF relaying for green cognitive radio with objective of maximizing energy efficiency is a constraint nonlinear nonconvex fractional programming (CNNFP) problem. We present the optimal power allocation in DF relaying by transforming the CNNFP power allocation problem into a concave fractional program by using Charnes-Cooper transformation. We also present an iterative ε-optimal solution for the CNNFP problem using Dinkelbach algorithm. The convergence of the iterative algorithm is proved and numerical solutions obtained using simulations for DF cooperative communications are presented.

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.981
Threshold uncertainty score0.369

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.031
GPT teacher head0.278
Teacher spread0.247 · 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

Citations13
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207