Uplink Modeling of $K$ -Tier Heterogeneous Networks: A Queuing Theory Approach
Bibliographic record
Abstract
Heterogeneous networks (HetNets) are expected to release enormous capacity beyond what is achievable now. This comes at the price of higher interference that may jeopardize proper network operation if not managed cautiously. In handling this problem, mathematical modeling of HetNets to understand their underlying facts is necessary. As the mathematical theory of waiting lines, queuing theory is exploited in this paper as a powerful tool to model the uplink transmission of a user equipment (UE) in a K-tier HetNet, as an M/G/1 queue with interruption operating at the packet level. By integrating key findings on HetNets (using stochastic geometry) into the queue, a realistic model is obtained. This model enables us to understand what a UE experiences in terms of throughput, an angle that has barely been looked through by others. The modeling framework considers all the essential HetNet parameters, including the transmit power, spatial distribution, service rate, traffic flow intensity, and base station coverage threshold, to obtain the probability generating function and related statistics of the UE queue length.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".