Energy-efficient power allocation in OFDM-based cognitive radio systems: A risk-return model
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.
Bibliographic record
Abstract
Efficient and reliable subcarrier power allocation in orthogonal frequency-division multiplexing (OFDM)-based cognitive radio networks is a challenging problem. Traditional waterfilling approach is inefficient for such networks due to the strict requirements on the interference generated to the primary users (PUs). In this paper, we present a solution to an energy-efficient resource allocation problem which maximizes the cognitive radio (i.e., secondary) link capacity taking into account the availability of the subcarriers (and hence the reliability of transmission by cognitive radios) and the limits on total interference generated to the PUs. We consider an energy-aware capacity expression by taking into account another factor called subcarrier availability. Optimizing such an expression saves valuable resources such as battery life by selectively allocating power to underutilized subcarriers. Based on a risk-return model, we formulate a convex optimization problem which incorporates a linear average rate loss function in the optimization objective to include the effect of subcarrier availability. Due to the complex structure of the optimal solution, we propose three suboptimal schemes, namely, the step-ladder, nulling, and scaling schemes. We compare the performances of optimal and suboptimal algorithms with the performance of a classical waterfilling scheme. We conclude that waterfilling, unable to satisfy the interference criterion, performs the worst amongst all the schemes considered in this paper.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it