Precision-Adaptive Task Offloading and Resource Allocation for Efficient Positioning and Sensing in Near-Field IoV Systems
Bibliographic record
Abstract
With the rapid advancement of sixth-generation (6G) network communication technology, improvements in data transmission rates, latency, and reliability have driven substantial growth in Internet of Vehicles (IoV) applications. Among these, the integration of 6G-enabled extremely large-scale antenna arrays (ELAAs) has extended the range of near-field (NF) communication, enabling their application in IoV to facilitate efficient and accurate environmental sensing. Through NF communication, vehicles can achieve high-accuracy localization and perception by analyzing the signal phase, channel state information, and beamforming calculations. However, positioning and sensing tasks place substantial computational and energy demands on edge devices, often exceeding traditional capacity limits. To address this challenge, task offloading has emerged as a solution, with mobile edge computing (MEC) offering a lower-latency alternative to centralized cloud computing by processing tasks at the network edge. Despite these advantages, MEC’s limited resources present challenges as the number of connected vehicles increases. Existing approaches to resource allocation often overlook the varied accuracy requirements of IoV tasks, where high-accuracy tasks like indoor navigation require stringent performance standards, while lower-accuracy tasks may tolerate reduced precision to save resources. Motivated by this, we propose an accuracy-based classification scheme for IoV positioning and sensing tasks, which dynamically adjusts accuracy requirements to reduce delay and energy consumption. Our approach maps total energy, accuracy loss, and delay to an overall quality of service (QoS) metric, and employs an optimization algorithm that leverages gradient descent and greedy strategies to balance resource allocation and accuracy selection. Extensive simulations demonstrate the effectiveness of the proposed scheme in reducing delay and energy consumption while maintaining high accuracy, significantly outperforming benchmark strategies.
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.001 | 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.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 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".