.png){kind=icon}
.png){kind=icon}
Return
Competition-Driven Coalition Formation Enabling Collaborative DAG Task Scheduling in Edge Computing
.png){kind=icon}
PRE
AI
DOI：10.1109/JIOT.2026.3678950.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Collaborative edge computing enables multiple edge servers to cooperate by sharing information and computing resources, achieving resource complementarity and task collaborative processing. In areas with dense mobile users, edge servers are often deployed and managed by different business entities. Therefore, in a heterogeneous edge environment with multiple business entities, the collaborative relationship between edge servers is often constrained by their respective management strategies and profit considerations. Resource sharing is no longer unconditional but instead involves a certain degree of competition and self-interested behavior. Existing works often assume unconditional collaboration, overlooking the rational and self-interested behavior of edge servers belonging to different business entities in practice. This article proposes a coalition-based collaborative scheduling framework tailored for directed acyclic graph (DAG) tasks with intertask dependencies. It designs a coalition formation algorithm for edge servers and a multi-DAG task scheduling (MDTS) algorithm within the coalition to achieve optimal resource collaboration and edge server utility. Extensive experiments are conducted to evaluate the performance of the proposed algorithms. Experimental results show that the proposed algorithms consistently outperform all baselines across different network scales, achieving at least a 46.34% improvement in cooperative utility.
Keywords:
Coalition formation
collaborative edge computing
offloading scheduling
Journal
IF:
8.9
Papers:
1.4W
Citations:
7.8W