Spatiotemporal Non-Uniformity-Aware Online Task Scheduling in Collaborative Edge Computing for Industrial Internet of Things

📅 2025-05-05
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
To address degraded task scheduling performance in industrial IoT (IIoT) collaborative edge computing—caused by spatiotemporally non-uniform user request distributions—this paper proposes a joint optimization framework balancing long-term cost constraints and real-time requirements. The method innovatively integrates a graph model to capture spatial heterogeneity among edge nodes, employs Lyapunov optimization to jointly model temporal dynamics and long-term resource constraints, and introduces a hierarchical heuristic algorithm augmented with imitation learning for acceleration. Theoretical analysis guarantees asymptotic satisfaction of long-term cost constraints and system stability. Extensive experiments demonstrate that, compared to baseline approaches, the proposed framework improves task completion rate by 23.6%, reduces average latency by 31.4%, and achieves 19.8% reduction in total operational cost.

Technology Category

Application Category

📝 Abstract
Mobile edge computing mitigates the shortcomings of cloud computing caused by unpredictable wide-area network latency and serves as a critical enabling technology for the Industrial Internet of Things (IIoT). Unlike cloud computing, mobile edge networks offer limited and distributed computing resources. As a result, collaborative edge computing emerges as a promising technology that enhances edge networks' service capabilities by integrating computational resources across edge nodes. This paper investigates the task scheduling problem in collaborative edge computing for IIoT, aiming to optimize task processing performance under long-term cost constraints. We propose an online task scheduling algorithm to cope with the spatiotemporal non-uniformity of user request distribution in distributed edge networks. For the spatial non-uniformity of user requests across different factories, we introduce a graph model to guide optimal task scheduling decisions. For the time-varying nature of user request distribution and long-term cost constraints, we apply Lyapunov optimization to decompose the long-term optimization problem into a series of real-time subproblems that do not require prior knowledge of future system states. Given the NP-hard nature of the subproblems, we design a heuristic-based hierarchical optimization approach incorporating enhanced discrete particle swarm and harmonic search algorithms. Finally, an imitation learning-based approach is devised to further accelerate the algorithm's operation, building upon the initial two algorithms. Comprehensive theoretical analysis and experimental evaluation demonstrate the effectiveness of the proposed schemes.
Problem

Research questions and friction points this paper is trying to address.

Optimize task scheduling in IIoT edge computing under cost constraints
Address spatiotemporal non-uniformity of user requests in edge networks
Develop heuristic and learning-based algorithms for NP-hard subproblems
Innovation

Methods, ideas, or system contributions that make the work stand out.

Graph model for spatial task scheduling
Lyapunov optimization for real-time subproblems
Heuristic-based hierarchical optimization approach
🔎 Similar Papers
No similar papers found.
Y
Yang Li
School of Information and Communications Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
X
Xing Zhang
School of Information and Communications Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
Y
Yukun Sun
School of Information and Communications Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
W
Wenbo Wang
School of Information and Communications Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
Bo Lei
Bo Lei
Beijing Academy of Artificial Intelligence
NeuroscienceArtificial intelligence