Related Experiment Video
Updated: Sep 13, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
Communication-efficient decentralized clustering for dynamical multi-agent systems
Victoria Erofeeva1, Oleg Granichin1, Vikentii Pankov1
1St. Petersburg State University, St. Petersburg, Russia.
None:
The paper presents a decentralized, real-time clustering method designed for large-scale, distributed environments such as the Internet of Things (IoT). The approach combines compressed sensing for dimensionality reduction with a consensus protocol for distributed aggregation, enabling each node to generate compact, consistent summaries of the system's clustering structure with minimal communication overhead. These representations are processed by a pre-trained neural network to reconstruct the global clustering state entirely without centralized coordination. Unlike traditional methods that depend on static topologies and centralized computation, this system adapts to dynamic network changes and supports on-the-fly processing. The system suits IoT applications where data must be processed locally, and immediate results are essential. Experiments on both synthetic and real-world datasets show that the method significantly outperforms baseline approaches in clustering accuracy, making it highly suitable for resource-limited, decentralized IoT scenarios.
Related Concept Videos
Distributed Loads: Problem Solving
Collisions in Multiple Dimensions: Problem Solving
A small car of mass 1,200 kg traveling east at 60 km/h collides at an intersection with a truck of mass 3,000 kg traveling due north at 40 km/h. The two vehicles are locked together. What is the...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Collisions in Multiple Dimensions: Introduction
Cluster Sampling Method
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
Distribution Reliability and Automation

