Green cell association for multimedia transmission in cognitive heterogeneous networks
Bibliographic record
Abstract
SUMMARY With the introduction of low‐powered pico/femto‐base stations and relay nodes into the macro‐cell, recent heterogeneous networks provide an attractive approach for future wireless communication. Although it may achieve better coverage and higher capacity, several problems remain unsolved before practical deployment. For example, how to select the proper cell from neighbor low‐powered cells and then occupy the radio resource without interference on macro‐users is both important and challenging, especially for rigorous multimedia applications. The traditional cell access algorithms and quality‐control parameters such as delay or throughput no longer suit well in this complex environment. An effective approach should be pursued. In this paper, we investigate this interesting cell association problem and propose a complete green resolution on the basis of thorough discussions about the multimedia transmission under these concerns. Cognitive radio is introduced to share spectrum between macro‐cell and low‐powered cells while securing the transmission of authorized macro‐users. We also bring forth the concept of ‘interference balance’ to better manage the overall interference and energy consumption in the network. Restless bandit model is formulated on the basis of channel state, data rate, interference control, and the carefully chosen intra‐refreshing rate for multimedia traffic. Then the cell association scheme is designed to be efficient and practical because of the simple index property of our model output. Simulation results have proven the performance of our proposed resolution compared with existing algorithms on interference constraint, multimedia distortion, and overall network energy consumption balance. Copyright © 2013 John Wiley & Sons, Ltd.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".