Statistical-QoS Guarantee for IoT Network Driven by Laser-Powered UAV Relay and RF Backscatter Communications
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
Resource optimization is investigated for an unmanned aerial vehicle (UAV)-mounted relay assisted Internet-of-Things (U-IoT) network. A comprehensive network structure is proposed by incorporating laser-driven adaptive wireless-power-transfer at the UAV relay, wirelessly powered backscatter communication in the radio-frequency access links, and modulating retro-reflector based free space optical backhaul link in an optimization framework. Our objective is to maximize the number of the connected IoT devices with the UAV relay for uplink data transmission while satisfying the heterogeneous quality-of-service requirements of the IoT devices. Towards this objective, a novel optimization problem is formulated by considering queueing-overflow probability constraints of the IoT devices with stochastic data arrival, backhaul capacity constraint, and energy causality constraint at the UAV relay. The considered resource optimization is NP-hard, and an iterative solution is proposed by exploiting structure of the optimization problem. Furthermore, a three-stage optimization is devised to solve an NP-complete fractional optimization problem at each iteration of the proposed solution. An algorithm of polynomial computational complexity is developed for joint connectivity maximization and resource allocation, and convergence of the developed algorithm is proved. Using extensive simulations, efficiency of the proposed algorithm is demonstrated for improving the supportable arrival rate per IoT device and the number of the connected IoT devices in uplink of a U-IoT 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.
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.000 | 0.000 |
| 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