Stochastic Geometry Analysis of Sojourn Time in RF/VLC Hybrid 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
The spectrum scarcity in the radio frequency (RF) communication in indoor environments motivates the integration of an alternative technology like visible light communication (VLC) with the existing RF architecture that results in a hybrid RF/VLC network. While VLC helps offloading the congested RF spectrum by offering capacity-per-area improvements, the resulting heterogeneity and narrow coverage areas of optical base stations (BSs) impose several challenges for user mobility such as unnecessary handovers. To help addressing these challenges, in this paper, we derive the mean and the distribution of sojourn time in RF/VLC hybrid networks. The mathematical analysis conducted in this paper makes use of the tools from stochastic geometry and abstracting the BSs’ locations via two independent homogeneous Poisson point processes (PPPs). Since PPP modeling is yet to be well established for RF/VLC hybrid networks, we compare the PPP based analytical results to those obtained for an actual deployment, a Matérn hard-core point process (MHCPP) based deployment, and a deterministic square lattice deployment of VLC luminaries. Furthermore, we utilize the sojourn time distribution to calculate the unnecessary handover probability. Our numerical results show the interplay between the sojourn time and the receiver field of view as a function of BS density and they highlight the cost of BS densification in terms of unnecessary handovers.
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.001 | 0.000 |
| Bibliometrics | 0.002 | 0.004 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.002 | 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