Aggregate Interference Distribution From Large Wireless Networks With Correlated Shadowing: An Analytical–Numerical–Simulation Approach
Bibliographic record
Abstract
As the number and variety of wireless devices sharing spectrum increases, it becomes increasingly important to characterize the sum interference that is produced by a large number of interferers. We show that, in the case of several interferers, the assumption of independent shadowing paths is very inaccurate and must be replaced by an appropriate correlation model. We choose one such model, which has desirable mathematical and physical properties, is tunable, and is particularly well suited for simulation, although our approach can also be used with other correlation models. In addition, we allow a very versatile channel and system model. The simulation cost of such systems quickly grows for large numbers of interferers due to the time and memory constraints of the Monte Carlo simulation algorithm using the classic matrix factorization (e.g., Cholesky) approach. We show how an alternative simulation approach using shadowing fields can significantly reduce the order of the computational cost. In addition, we show how judicious random sample reuse and extrapolation based on a numerical analysis of moments can be used to further simplify the simulation. Through the combination of these three approaches, using a mixture of simulation, numerical, and analytical techniques, we can obtain accurate approximations of the distribution of the total interference power while reducing computational time by factors of more than 1000. We can also make some mathematical statements about the problem, which may be useful for further developments. We argue that our model is complex enough to accommodate a good degree of realism and that our approach is a viable alternative to the pure analysis of such a complex and versatile problem.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 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".