A probing process for dynamic resource allocation in fixed broadband wireless access networks
Bibliographic record
Abstract
The paper deals with the support of both real-time and non-real-time communication services in a broadband fixed wireless access network. It investigates the feasibility of dynamically allocating the bandwidth not utilized by other sectors in the staggered resource allocation method. A new medium-access control (MAC) protocol based on the proposed probing process that does not need information exchange and coordination among base stations is presented to improve data packet transmission. The probing process detects available slots unused by other sectors to provide a higher capacity in sectorized cells. A simplified C-PRMA, referred to as prioritized access with centralized polling command, is adopted to implement the probing process effectively. Simulation results show that the proposed MAC protocol with probing process provides an improvement over C-PRMA. In terms of data traffic, the proposed protocol increases the link capacity to near 100% as opposed to 78% for C-PRMA when the workload of other sectors is 69% of the link capacity. In terms of voice traffic, the probing process provides 23% more user capacity than C-PRMA when there are 20 voice users in other sectors.
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.002 | 0.006 |
| 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.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".