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

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.

arXiv commentAccepted by Ubicomp 2021 Workshop, Combining Physical and Data-Driven Knowledge in Ubiquitous Computing

References in corpus (9)

• Fast unfolding of communities in large networks
• Community structure in social and biological networks
• Fast algorithm for detecting community structure in networks
• Near linear time algorithm to detect community structures in large-scale networks
• The map equation
• Community detection, link prediction, and layer interdependence in multilayer networks
• Mapping higher-order network flows in memory and multilayer networks with Infomap
• Socially-Aware Congestion Control in Ad-Hoc Networks: Current Status and The Way Forward
• Community detection in multiplex networks using locally adaptive random walks