EUVIMEDEUVIMED entdecken
Crossref

Latency-Optimized Scheduling for Data Aggregation in Distributed Edge Computing

Yunquan Gao, Qiyang Zhang, Ying Li, Praveen Kumar Donta, Lauri Lovén, Schahram Dustdar

ACM Transactions on Internet Technology · 31.05.2026 · 26 (2) · 1-26

DOI: 10.1145/3779433 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Transactions on Internet Technology, online erschienen am 12.02.2026. Verfasst von Yunquan Gao und 5 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 61 Literaturangaben. Gefördert von: Natural Science Research Project of the Anhui Educational Committee, Postdoctoral Funding Program.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In Wireless Sensor Networks (WSNs), relay sensor nodes can aggregate data from edge sensor node into a summary information before sending to the sink. Due to the vast number of sensor nodes in a distributed edge computing (DEC) network, these relay sensor nodes may receive a high number of aggregation requests. This increases the chance of conflicting transmissions, which further leads to unwanted latency. Designing a conflict-free and minimal latency data aggregation schedule remains an open question. Moreover, existing related works have been conducted in traditional WSNs. By leveraging multiple antennas, the Multiple Input Multiple Output (MIMO) and cooperative MIMO called virtual MIMO (V-MIMO) enable broadband wireless communication, thereby improving the performance of WSNs. However, compared with traditional WSNs, MIMO and V-MIMO introduce distinct interference models requiring careful consideration. The work proposes a solution to an NP-hard problem, addressing three challenges: (i) interference; (ii) latency; and (iii) dynamic changes in network topology. Firstly, to counter interference, we propose a model where multiple nodes can simultaneously send data to the same parent by connecting different antennas. Secondly, to minimize latency, we propose a novel distributed heuristic data aggregation scheduling method, which intertwines the construction of an optimal data aggregation tree and conflict-free scheduling. Finally, to handle dynamic network topology changes, we propose lightweight adaptive strategies that do not increase data aggregation latency. Simulation results and theoretical analysis demonstrate superior performance in reducing data aggregation latency. When compared with state-of-the-art solutions, our proposed method decreases data aggregation latency by at least 2.6× on average.

Förderung

  • Natural Science Research Project of the Anhui Educational Committee
  • Postdoctoral Funding Program

Zitieren

APA

Gao, Y., Zhang, Q., Li, Y., Donta, P. K., Lovén, L., & Dustdar, S. (2026). Latency-Optimized Scheduling for Data Aggregation in Distributed Edge Computing. ACM Transactions on Internet Technology, 26(2), 1-26. https://doi.org/10.1145/3779433

Vancouver

Gao Y, Zhang Q, Li Y, Donta PK, Lovén L, Dustdar S. Latency-Optimized Scheduling for Data Aggregation in Distributed Edge Computing. ACM Transactions on Internet Technology. 2026;26(2):1-26. doi:10.1145/3779433

BibTeX
@article{Gao2026,
  author = {Gao, Yunquan and Zhang, Qiyang and Li, Ying and Donta, Praveen Kumar and Lovén, Lauri and Dustdar, Schahram},
  title = {Latency-Optimized Scheduling for Data Aggregation in Distributed Edge Computing},
  journal = {ACM Transactions on Internet Technology},
  year = {2026},
  volume = {26},
  number = {2},
  pages = {1--26},
  doi = {10.1145/3779433}
}
Kostenlos starten →