NOMA-Aided UAV Data Collection from Time-Constrained IoT Devices
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
Non-orthogonal multiple access (NOMA) is one of the promising access technologies to improve spectral efficiency and serve a higher number of users simultaneously. The latter proves important in time-sensitive services when data has to be collected before a set deadline, otherwise, the data is rendered useless. Therefore, in this paper, we utilize a NOMA-aided unmanned aerial vehicle (UAV) for data collection from time-constrained IoT devices. We optimize the trajectory of the UAV, IoT devices scheduling, and power allocation to maximize the number of served devices while considering the constraints of UAV energy and flight duration, and NOMA clustering. Given the complexity of the problem and the incomplete knowledge about the environment, it is divided into two subproblems. In the first subproblem, the UAV trajectory and the selection of the first device in the NOMA cluster at each time slot are modeled as a Markov Decision Process, and Proximal Policy Optimization is used to solve it. For the second device selection, a heuristic algorithm is used based on prioritizing devices with higher bit rate requirements and strict deadlines. The second subproblem considers power allocation inside the NOMA cluster, where it is formulated as an optimization problem for maximizing the sum rates of the two selected users. Finally, we demonstrate the performance gains of our solution in different scenarios while varying the system parameters as compared with alternative approaches. In particular, our proposed solution achieves a 10% to 30% performance gain compared to the traditional orthogonal multiple access scheme.
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.003 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.005 | 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