Multiple-Association Supporting HTC/MTC in Limited-Backhaul Capacity Ultra-Dense Networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Coexistence of Human-Type Communications (HTCs) and Machine-Type Communications (MTCs) is inevitable. Ultra-Dense Networks (UDNs) will be efficacious in supporting both types of communications. In a UDN, a massive number of low-power and low-cost Small Cells (SCs) are deployed with density higher than that of the HTC users. In such a scenario, the backhaul capacities constitute an intrinsic bottleneck for the system. Hence, we propose a multiple association scheme where each HTC user associates to and activates multiple SCs to overcome the backhaul capacity constraints mainly encountered in the downlink. In addition, having more active cells allows for more MTC devices to be supported by the network. Using tools from stochastic geometry, we formulate a novel mathematical framework investigating the performance of HTC in both downlink and uplink as well as the uplink MTC. Stretched Exponential Path Loss (SEPL) model is considered to practically reflect the UDN environment. Extensive simulations were conducted to verify the accuracy of the mathematical analysis under different system parameters. Results show the existence of an optimum number of SCs to which an HTC user may connect under backhaul capacity constraints. Besides, the proposed multiple-association scheme improves the performance of MTC in terms of both ASE and density of supported devices.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 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 it