This paper forms a privacy-aware offloading problem that jointly optimizes delay and energy while penalizing the theoretical privacy leakage of coded tasks under noisy leakage observations, and proposes a coded task offloading scheme for D2D networks under stochastic task arrivals and queue-based dynamics.
Abstract
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.
Vehicular edge computing (VEC) faces critical challenges regarding limited onboard computational capacity and the potential for location privacy leakage. To address these issues, this paper proposes a novel, privacy-aware task offloading framework driven by deep reinforcement learning (DRL). First, we design a dynamic...
A Threat-Aware Joint Optimization (TAGO) framework is designed by combining proximal policy optimization for adaptive task offloading and a gradient-based caching update derived from the Frank-Wolfe algorithm to capture spatiotemporal service popularity.
Task offloading in vehicular edge networks must satisfy strict latency limits. At the same time, it must resist security threats such as replay attacks. Existing offloading models treat cryptographic settings as fixed, separate from the scheduling decision. This is a gap, and it exists in part because jointly choosing...
While distributed speculative decoding can offer efficient acceleration for Large Language Model (LLM) inference in cloud-edge environments, unleashing its full potential confronts significant challenges, including complex token draft-length management, uncertain prompt arrivals and system conditions, and joint edge ba...
Heng-Di Wang, Lei Jiao, Kong-Lin Zhu et al.· Proceedings of the Internati...· 0 citations
The exponential growth of edge devices and growing demand for low-latency, high-throughput applications have established edge computing as essential infrastructure. Edge computing enables near-data computation to alleviate device burdens, yet task offloading optimization remains challenging due to the heterogeneous, dy...
Zhao Tong, Shi-Zhen Xiao, Xi Zhang et al.· IEEE Transactions on Mobile...· 0 citations
The Zero-Knowledge random range proof based scheduling data protection algorithm (ZKRRP-SDPA) is introduced, which employs an enhanced zero-knowledge range proof for real-valued ranges together with digital signatures, guaranteeing the security of node attribute data against any adversary except the node itself.