Joint Access Point Assignment and Power Allocation in Multi-Tier Hybrid RF/VLC HetNets
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
This paper investigates the joint problem of access point (AP) assignment and power allocation (PA) in a three-tier hybrid radio frequency/visible light communication (VLC) heterogeneous network (HetNet). The main goal is to maximize the HetNet’s sum-rate under practical constraints such as APs’ power budgets and users’ quality-of-service (QoS) requirements, while maintaining an acceptable level of illumination in the VLC system. When this design problem is formulated mathematically, it turns out to be a combinatorial decision problem that involves non-linear constraints, and hence is NP hard. To efficiently obtain good quality solutions for the formulated problem, a reformulation into the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">college admission model</i> is first performed. Then, a distributed and low-complexity algorithm based on matching theory and an efficient heuristic PA scheme are proposed to obtain a good quality suboptimal solution for the joint problem. Simulation results highlight the robustness of the proposed solution and its significant gain in network sum-rate as compared to different benchmark schemes. The effect of various system parameters such as the minimum QoS and maximum illumination requirements on the performance of the proposed solution is studied. Finally, the theoretical analysis of convergence, stability, and complexity of the proposed technique is performed.
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.001 | 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