IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0327396.html
   My bibliography  Save this article

Communication-efficient decentralized clustering for dynamical multi-agent systems

Author

Listed:
  • Victoria Erofeeva
  • Oleg Granichin
  • Vikentii Pankov
  • Zeev Volkovich

Abstract

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.

Suggested Citation

  • Victoria Erofeeva & Oleg Granichin & Vikentii Pankov & Zeev Volkovich, 2025. "Communication-efficient decentralized clustering for dynamical multi-agent systems," PLOS ONE, Public Library of Science, vol. 20(7), pages 1-32, July.
  • Handle: RePEc:plo:pone00:0327396
    DOI: 10.1371/journal.pone.0327396
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0327396
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0327396&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0327396?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0327396. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.