Resource Allocation in Heterogeneous Buffered Cognitive Radio Networks
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
Resources available for operation in cognitive radio networks (CRN) are generally limited, making it imperative for efficient resource allocation (RA) models to be designed for them. However, in most RA designs, a significant limiting factor to the RA’s productivity has hitherto been mostly ignored, the fact that different users or user categories do have different delay tolerance profiles. To address this, in this paper, an appropriate RA model for heterogeneous CRN with delay considerations is developed and analysed. In the model, the demands of users are first categorised and then, based on the distances of users from the controlling secondary user base station and with the assumption that the users are mobile, the user demands are placed in different queues having different service capacities and the resulting network is analysed using queueing theory. Furthermore, to achieve optimality in the RA process, an important concept is introduced whereby some demands from one queue are moved to another queue where they have a better chance of enhanced service, thereby giving rise to the possibility of an improvement in the overall performance of the network. The performance results obtained from the analysis, particularly the blocking probability and network throughput, show that the queueing model incorporated into the RA process can help in achieving optimality for the heterogeneous CRN with buffered data.
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.000 |
| Science and technology studies | 0.002 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.002 |
| 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