Jul 2026· International Conference on Edge Computing [Services Society]· pp. 84-90· 0 citations· 17 references
Abstract
Federated distillation (FD) enables collaborative edge learning by exchanging soft predictions rather than model parameters, offering communication efficiency and architectural flexibility. However, deploying FD over heterogeneous wireless networks requires principled methods to schedule device participation and allocate upload volumes under per-round resource constraints. Existing approaches assume uniform participation or rely on heuristic selection, ignoring the coupling among communication cost, computational capability, and privacy posture across devices. This paper proposes KaaS-Edge, a Knowledge-as-a-Service framework that formulates device scheduling as budgeted submodular maximization. We derive an optimal water-filling volume allocation in closed form and present RADS (Resource-Aware Distillation Scheduling), a greedy algorithm with a constant-factor approximation guarantee. Experiments on CIFAR-100 demonstrate that KaaS-Edge achieves accuracy comparable to full-participation baselines while reducing per-round communication by nearly ten times and cumulative bandwidth by over an order of magnitude, with graceful degradation under stringent privacy constraints.
Heterogeneous 6G radio access networks (RANs) must allocate resources reliably under interference, latency limits, imperfect channel state information (CSI), and architectural diversity. We propose a degeneracy-aware resource allocation (DG-RA) framework that casts multi-architecture orchestration as a probabilistic game and, unlike single-solution optimization, deliberately favors allocations realizable by many structurally distinct yet performance-equivalent strategy profiles. Resilience is quantified across three layers through Degeneracy-Weighted Path Robustness (DWPR), Functional Substitution Score (FSS), and an Algorithmic Resilience Quotient (ARQ). Across centralized (C-RAN), open (O-RAN), virtualized (V-RAN), and hybrid RAN architectures, and benchmarked against a fractional-programming optimizer, DG-RA matches the state-of-the-art throughput and outage at the static operating point, then exploits its equivalence set to recover $\sim$$99\%$ of throughput from a resource-unit failure with a single switch, where a single-solution optimizer needs tens of iterations to re-converge. The results recast degeneracy not as a rate booster but as a precomputed resilience reserve for disruption-tolerant 6G orchestration.
: Space-Air-Ground Integrated Networks (SAGIN) provide a multi-layered, wide-coverage computing infrastructure for distributed urban sensing systems. However, their heterogeneity and dynamics pose unprecedented challenges for task offloading and resource allocation. Existing methods struggle to simultaneously address the complexity of cross-layer decision-making and reliability assurance under uncertain conditions. This paper proposes a novel framework, termed DRL-RA, which synergistically integrates Deep Reinforcement Learning (DRL) with reliability-aware optimization. The framework consists of two complementary components: (1) a Dueling Double Deep Q-Network (D3QN) module that learns adaptive policies to make offloading decisions among various options including local execution, terrestrial edge, UAVs, and satellites; (2) a Reliability-Aware Multi-Objective Optimization Framework (RA-MOOF) that introduces explicit reliability guarantees through cross-layer link reliability modeling, node availability estimation, and smooth reliability proxy functions. Addressing the heterogeneous communication characteristics of the SAGIN architecture, this paper establishes a complete cross-layer delay model and composite reliability metrics. The reliability formulation is defined under explicitly stated conditional-independence assumptions, and the proposed smooth constraint terms are treated as surrogate CMDP costs rather than exact hard chance-constraint guarantees. Extensive experiments in a SAGIN simulation environment demonstrate that the proposed method improves the task completion rate by 3.8%, reduces average latency by 11.1%, and increases system reliability by 3.9% compared to state-of-the-art benchmarks. The optimization-only RA-Opt baseline is used as a non-real-time optimization reference for assessing reliability-aware offloading decision quality, while deployment-time decision-latency comparisons are interpreted primarily among learned inference policies. Comprehensive ablation studies and statistical validation across multiple random seeds confirm the contributions of each component, while cross-layer offloading decision analysis verifies the effectiveness of the method across different network layer selections.
Fei-Yan Bu, Zheng Wang, Yong Pan et al.· Computers, Materials & C...· 0 citations
Over-the-air FL with EH MDs under heterogeneous data distributions under heterogeneous data distributions is studied, and the proposed unified framework improves fairness or personalization, depending on the operating mode, while reducing communication overhead.
F. Bagci, Busra Tegin, Mohammad Kazemi et al.· 0 citations
Fluid Computing aims to support distributed applications execution across heterogeneous cloud, edge, and device resources, motivating task execution mechanisms that adapt to dynamic and privacy-sensitive environments under runtime conditions. In this context, current task offloading schemes rarely address privacy risks and information leakage under adversarial execution settings; furthermore, most coded computing proposals focus on straggler mitigation without considering system-level objectives such as energy awareness. This paper proposes a coded task offloading scheme for D2D networks under stochastic task arrivals and queue-based dynamics. The proposal combines task offloading techniques with linear secret sharing schemes, where tasks are encoded into redundant shares to support threshold-based recovery, straggler mitigation, and privacy preservation while enhancing system performance. Then, we formulate a privacy-aware offloading problem that jointly optimizes delay and energy while penalizing the theoretical privacy leakage of coded tasks under noisy leakage observations. The problem is solved using a branch-and-bound solver alongside a lightweight heuristic scheduler, both of which are evaluated through a discrete-event simulator. Results show that coded offloading improves the delay--energy trade-off with respect to classical full and parallel offloading schemes, while the heuristic achieves near-optimal performance, outperforming baseline and state-of-the-art solvers. The results also show how privacy leakage penalties reshape offloading decisions, exposing an inherent delay--energy--privacy trade-off.
Diego Cajaraville-Aboy, Manuel Fernández-Veiga, Ana Fernández-Vilas et al.· 0 citations
This work proposes FLEAT (Federated Learning Energy and Accuracy Tuning), a framework that jointly optimizes energy efficiency and model accuracy via dynamic local update adaptation and gradient-informed layer-wise pruning, offering a scalable solution for energy-accuracy equilibrium in heterogeneous FL deployments.
Javad Dogani, Reza Namvar, Masoumeh Khodarahmi et al.· IEEE Transactions on Mobile...· 0 citations
AF-EdgeRL is proposed, a novel Byzantine-resilient Asynchronous Federated Reinforcement Learning framework tailored for distributed resource allocation and dynamic task offloading and establishes theoretical convergence guarantees under non-convex reinforcement learning objectives.
Daniel Merrow, Tember L. Nair, Lucas Farnandez· International Journal of App...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
