3-D Trajectory Optimization and Communication Resources Allocation in UAV-Assisted IoT Networks for Sustainable Industry 5.0
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
Unmanned aerial vehicle (UAV) has been utilized as an efficient data collector for Internet of Things (IoT) networks in sustainable industry 5.0. Whereas, how to sustain a stable power for the energy-constrained IoT devices (IoTDs) and to enhance the data gathering throughput of UAV-aided IoT networks via the wireless power transfer (WPT) or non-orthogonal multiple access (NOMA) is a twofold challenge. Thus, we propose to maximize the minimum UAV data collection throughput from the IoTDs via jointly optimizing the three-dimensional (3D) trajectories of two UAVs, scheduling and transmitting power of the IoTDs subject to the maximum flight velocity and minimum safe distance for the UAVs, as well as the harvested energy causality constraint for each IoTD during a finite UAV flight mission period. To tackle this non-convex problem with the strong interdependence of optimization parameters, we develop a 3D Trajectory Optimization and communication Resources Allocation Algorithm, named as TORAA, via employing the alternating optimization and successive convex approximation approaches, which alternately optimizes the UAVs’ 3D trajectories, the IoTDs’ scheduling and transmitting power sub-problems until the convergence criterion is met by the target function value. Moreover, we analyze the complexity and convergence characteristic of the TORAA. Numerous simulations have been performed to validate that the TORAA is capable of noteworthily enhancing the maximum minimum data collection throughput compared to the benchmark schemes with two-dimensional (2D) trajectories of the UAVs or constant transmitting power of the IoTDs.
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.000 | 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