Learning-Aided Network Association for Hybrid Indoor LiFi-WiFi Systems
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
Given the scarcity of spectral resources in traditional wireless networks, it has become popular to construct visible light communication (VLC) systems. They exhibit high energy efficiency, wide unlicensed communication bandwidth as well as innate security; hence, they may become part of future wireless systems. However, considering the limited coverage and dense deployment of light-emitting diode (LED) lamps, traditional network association strategies are not readily applicable to VLC networks. Hence, by exploiting the power of online learning algorithms, we focus our attention on sophisticated multi-LED access point selection strategies conceived for hybrid indoor LiFi-WiFi communication systems. We formulate a multi-armed bandit model for supporting the decisions on beneficially selecting LED access points. Moreover, the `exponential weights for exploration and exploitation' algorithm and the `exponentially weighted algorithm with linear programming' algorithm are invoked for updating the decision probability distribution, followed by determining the upper bound of the associated accumulation reward function. Significant throughput gains can be achieved by the proposed network association strategies.
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.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| 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 it