Energy-Efficient Vehicular Task Offloading Using Multi-Mode MEC and RIS-Equipped Aerial Platforms
Bibliographic record
Abstract
Connected and Autonomous Vehicles (CAVs) require ultra-low latency and high computational processing for safety-critical applications, often exceeding their on-board capabilities and facing significant coverage limitations with existing terrestrial infrastructure. To address these challenges, mobile edge computing (MEC)-equipped non-terrestrial networks (NTNs) offer a promising solution for vehicular task offloading. In this context, we introduce here a novel and energy-efficient approach to optimize MEC-equipped NTN operations through the integration of reconfigurable intelligent surfaces (RIS) into NTNs, thus enhancing the performance of CAV task offloading. Our framework leverages a multi-layered cooperative architecture that combines the wide-area coverage of high-altitude platform stations (HAPS) with the flexibility of multi-mode unmanned aerial vehicles (UAVs) equipped with both MEC and RIS capabilities. Specifically, we formulate this as a joint optimization problem of task/sub-task association, RIS phase shift configurations, and power control, to maximize the CAV task offloading success rate while saving energy within the NTN nodes. Given the latter’s NP-hardness, we divide it into three separate sub-problems and solve them iteratively. Specifically, task/sub-task association decisions are addressed by transforming the mixed-integer nonlinear programming (MINLP) sub-problem, and the RIS configurations are optimized using a hybrid solution combining semidefinite programming (SDP) and successive convex approximation (SCA), while a closed-form solution is derived for UAV/HAPS power control. Through extensive experiments, our proposed iterative solution, called joint offloading, phase shift, and power optimization (JOPPO), is proven to be superior to benchmarks in terms of task offloading success rate and across different network conditions while trading-off between energy consumption and task offloading success rate.
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 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".