Energy and Delay Aware General Task Dependent Offloading in UAV-Aided Smart Farms
Bibliographic record
Abstract
Edge computing offers a promising solution to enhance network reliability. In this study, we investigate the integration of mobile edge computing (MEC) technology and unmanned aerial vehicles (UAVs) within the context of smart agriculture. Smart agriculture relies on resource-constrained Internet of Things (IoT) devices for local environmental monitoring and data collection. These IoT devices send the collected data to UAVs for analysis. A central theme of this work is the focus on the applications generated by each UAV and the consideration of their topology to derive our optimization algorithm. To tackle these challenges, we propose harnessing the computational and power resources of UAVs and MEC at the network’s edge to offload and execute resource-intensive tasks in UAV-MEC-assisted networks. Our research focuses on the joint optimization of power allocation and task offloading in these wireless networks. Central to our investigation is the problem of minimizing the energy-time cost (ETC) for the UAVs, considering the interdependencies among tasks. To address this complex problem efficiently, we introduce graph convolutional neural networks (GCNs) and reinforcement learning (RL)-based techniques. We employ a directed acyclic graph (DAG) to model task interdependencies, with GCNs characterizing the DAG. Our approach incorporates an actor-critic method with embedding layers, trained using the compound-action actor-critic (CA2C) algorithm. Our findings reveal a significant improvement in minimizing both delay and energy consumption, with a 27% percent reduction in delay and a 45% reduction in consumed energy for executing complex, interdependent tasks.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".