A Layered and Grid-Based Methodology to Characterize and Simulate IoT Traffic on Advanced Cellular Networks
Bibliographic record
Abstract
With the advent of increasingly large smart-city and IoT deployments, meeting communication requirements in terms of throughput and delay becomes more and more challenging. Network performance analyses must be carefully addressed, usually through simulation software. Because of the large-scale nature of the IoT, traditional simulation methods do not scale well. Thus, in this article, we present two original contributions that provide scalability to network performance simulations. First, we introduce the concept of multi-layered analysis for large-scale networks and, second, we provide a method to quickly associate propagation measures to user equipment. The proposed concept is based on the de-coupling of the access and the user layer and the introduction of a so-called grid layer created by pre-computing propagation measures in the considered area. These propagation data are then ready to be used in the network performance simulation. To show the efficacy of the proposed approach, several realistic use cases are analyzed along with a comparison of the time needed to simulate with and without our grid-based methodology. Numerical results show that a significant reduction of computational time is achieved by employing our approach, especially in large-scale networks. Experiments were also performed to study the trade-off between grid granularity, RSS precision errors and computational time, showing that the method can be flexibly adapted to the planners' requests.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| 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".