Crowdsensing-Assisted Path Loss Estimation and Management of Dynamic Coverage in 3D Wireless Networks With Dense Small Cells
Bibliographic record
Abstract
Emerging vertical applications enabled by connected devices and smart infrastructures have created an ever-increasing demand for high data rates over 5th-Generation (5G) and beyond wireless networks. Deployment of dense small cells (SCs) and millimeter wave (mmWave) communication systems have become inevitable in future wireless networks. Consequently, it is more accurate to model such networks in the 3D space due to the spatially distributed nature of the SCs, locations of the devices, radio resources and propagation environment. Accurate estimation of location-specific path loss parameters is then essential for efficient utilization of radio resources and management of dynamic coverage in 3D SC networks. In the paper, a framework for location-specific path loss estimation is developed for efficient radio resource management, based on the principle of crowdsensing together with Linear Algebra (LA) and machine learning (ML) techniques considering 2.5 GHz and 28 GHz bands. The corresponding procedure for capturing dynamic coverage of a SC base station (BS) serving to an arbitrary cluster is proposed and examined based on its 3D propagation characteristics. Results show that the accuracy of 3D channel parameter estimation using gradient descent ML techniques is superior compared to LA technique and can achieve over 98% estimation accuracy. It is shown that using the proposed process, parameters can be extrapolated for the slightly extended 3D communication distances from the cluster boundary for the worst-case locations of devices based on already estimated propagation parameters with accuracy over 74% for certain distances. Although numerical results are presented for a single amorphous 3D cell of a wireless network, the framework given in the paper can be extended to any arbitrary 3D wireless cellular network.
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.001 |
| 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.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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".