Fine-Grained Analysis of Reconfigurable Intelligent Surface-Assisted mmWave Networks
Bibliographic record
Abstract
Reconfigurable intelligent surfaces (RISs) have emerged as a promising technology for millimeter wave (mmWave) networks. In this paper, we utilize tools from stochastic geometry to study the performance of a RIS-assisted mmWave cellular network. Specifically, the locations of the base stations (BSs) and the midpoints of the blockage are modeled as two independent Poisson point processes (PPPs), where the blockages are modeled by a Boolean model and a fraction of the blockages are coated with RISs. The particular characteristics of mmWave communications, i.e., directional beamforming and different path loss laws for line-of-sight (LOS) and non-line-of-sight (NLOS) propagation, are incorporated into our analysis. We derive analytical expressions for the success probability and the area spectral efficiency. The success probability under the special case where the blockage parameter is sufficiently small is also derived. Numerical results demonstrate that better coverage performance and higher energy efficiency can be achieved by a large-scale deployment of RISs. In addition, the tradeoff between the BS and RIS densities is investigated and the results show that the RISs can indeed enable the traditional networks to improve the success probability, especially for the cell-edge region, with limited power consumption.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 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.000 |
| 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".