Data-driven Clustering in Ad-hoc Networks based on Community Detection

TL;DR

This paper introduces a community detection-based clustering approach for ad-hoc networks, improving stability and communication quality in time-evolving and multi-channel scenarios through graph modeling and multiplex community detection.

Contribution

It presents a novel community detection framework tailored for dynamic and multi-channel ad-hoc networks, enhancing clustering stability and performance.

Findings

Outperforms baseline methods in stability and quality

Effective in time-evolving network scenarios

Applicable to multi-channel ad-hoc networks

Abstract

High demands for industrial networks lead to increasingly large sensor networks. However, the complexity of networks and demands for accurate data require better stability and communication quality. Conventional clustering methods for ad-hoc networks are based on topology and connectivity, leading to unstable clustering results and low communication quality. In this paper, we focus on two situations: time-evolving networks, and multi-channel ad-hoc networks. We model ad-hoc networks as graphs and introduce community detection methods to both situations. Particularly, in time-evolving networks, our method utilizes the results of community detection to ensure stability. By using similarity or human-in-the-loop measures, we construct a new weighted graph for final clustering. In multi-channel networks, we perform allocations from the results of multiplex community detection. Experiments on real-world datasets show that our method outperforms baselines in both stability and quality.