Clustering problem in self-organising communication networks on the example of smart vehicle transportation system
Przegląd Statystyczny. Statistical Review · 23.03.2026 · 2025 (4) · 1-24
DOI: 10.59139/ps.2025.04.1 ↗Kurz gefasst
Fachartikel in der Zeitschrift Przegląd Statystyczny. Statistical Review, online erschienen am 23.03.2026. Verfasst von Marek Antosiewicz und 5 weiteren Autor:innen.
Abstract (Originalsprache)
Efficient communication in many types of dynamic networks depends critically on how nodes are clustered into subnetworks. As such networks grow and evolve rapidly, there is a need for fast and robust clustering algorithms that account for communication cost structures induced by different node partitions. In this paper, we evaluate how classic community detection algorithms (CDAs), i.e. the Louvain and Ensemble Clustering for Graphs (ECG), adapted to incorporate a flexible family of cost functions, perform relative to standard heuristic and metaheuristic approaches. Using simulations on l-nearest neighbour graphs of varying sizes, we find that especially the Louvain algorithm consistently delivers high quality solutions at a substantially lower computational cost. In contrast, metaheuristic methods fail to scale effectively, and the ECG algorithm does not provide performance improvements in our setting, despite its reported stabilising effect in traditional community detection tasks. Overall, our results indicate that classic CDAs are well suited for real time clustering in dynamic communication networks and constitute a strong basis for developing scalable communication optimisation strategies.
Zitieren
APA
Antosiewicz, M., Szufel, P., Kamiński, B., Skorupka, A., Prałat, P., & Mashatan, A. (2026). Clustering problem in self-organising communication networks on the example of smart vehicle transportation system. Przegląd Statystyczny. Statistical Review, 2025(4), 1-24. https://doi.org/10.59139/ps.2025.04.1
Vancouver
Antosiewicz M, Szufel P, Kamiński B, Skorupka A, Prałat P, Mashatan A. Clustering problem in self-organising communication networks on the example of smart vehicle transportation system. Przegląd Statystyczny. Statistical Review. 2026;2025(4):1-24. doi:10.59139/ps.2025.04.1
BibTeX
@article{Antosiewicz2026,
author = {Antosiewicz, Marek and Szufel, Przemysław and Kamiński, Bogumił and Skorupka, Agata and Prałat, Paweł and Mashatan, Atefeh},
title = {Clustering problem in self-organising communication networks on the example of smart vehicle transportation system},
journal = {Przegląd Statystyczny. Statistical Review},
year = {2026},
volume = {2025},
number = {4},
pages = {1--24},
doi = {10.59139/ps.2025.04.1}
}
EUVIMED