Latency Minimization for Movable Relay-Aided D2D-MEC Communication Systems
Bibliographic record
Abstract
Device-to-device (D2D)-aided mobile edge computing (MEC) has emerged as a key enabling technology for future sixth-generation (6G) wireless networks. The goal of D2D-MEC is to reduce system latency for edge user equipments (UEs) by enabling access to cloud computing capabilities at the network edge, thereby supporting high transmission rates. To address the vulnerability of communication signals to physical obstructions, we employ relay techniques to enhance system performance and extend coverage. However, relay nodes and base station (BS) are typically equipped with large-scale antenna arrays, which lead to significant implementation costs and limiting practical deployment. To address this issue in a cost-efficient manner without sacrificing system performance, movable antenna (MA) technology is introduced. The key idea of MA technology lies in dynamically optimizing antenna positions to improve system capacity. Therefore, we propose a novel resource allocation framework for an movable relay-aided D2D-MEC system. The proposed scheme jointly optimizes the MA positions at UEs, relays, and the BS, along with the associated beamforming vectors, MEC server resource allocation, and computational task offloading rates. The objective is to minimize the maximum system latency while satisfying both computation and communication rate constraints. Furthermore, considering that current MA control mechanisms primarily rely on mechanical actuation, MA movement delay is incorporated into the latency model to capture the trade-off between antenna mobility and system delay. The resulting optimization problem is non-convex and involves multiple coupled variables. To solve this problem, we develop a parallel and distributed algorithm based on the penalty dual decomposition (PDD) framework, which is further integrated with the successive convex approximation (SCA) method to obtain a suboptimal solution. Simulation results demonstrate that the proposed algorithm significantly reduces system latency and enhances overall efficiency compared to benchmark schemes employing conventional fixed-position antennas (FPAs) at the relays and BS.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".