This paper provides an implementation of the Cmeans algorithm in an asynchronous and distributed fashion; specifically, we consider a network of agents, each provided with a piece of information (e.g., data acquired via sensors) and we partition the agents in not mutually exclusive sets such that agents in the same set have similar information; moreover, each set of agents calculates a representative value for the group. Previous distributed algorithms that aimed at accomplishing this task have nontrivial demands, in that they require point-topoint communication capabilities among the agents, which may need to exchange large amounts of data in order to execute their computations. Within the proposed approach, instead, the agents need no prior knowledge about their neighbors and can simply communicate using broadcasts. The proposed solution consists in organizing data transmission following a token-passing approach, thus limiting communication effort with respect to synchronous distributed implementations; furthermore, the tokenpassing phase is implemented via broadcast-only communication, thus avoiding the requirements of point-to-point communication. As shown via simulations, the latter feature is obtained at the cost of a modest increase in data transmission with respect to a traditional point-to-point token-passing scheme.

Distributed C-Means Clustering via Broadcast-Only Token-Passing

Faramondi L;Oliva G;Setola R;
2020-01-01

Abstract

This paper provides an implementation of the Cmeans algorithm in an asynchronous and distributed fashion; specifically, we consider a network of agents, each provided with a piece of information (e.g., data acquired via sensors) and we partition the agents in not mutually exclusive sets such that agents in the same set have similar information; moreover, each set of agents calculates a representative value for the group. Previous distributed algorithms that aimed at accomplishing this task have nontrivial demands, in that they require point-topoint communication capabilities among the agents, which may need to exchange large amounts of data in order to execute their computations. Within the proposed approach, instead, the agents need no prior knowledge about their neighbors and can simply communicate using broadcasts. The proposed solution consists in organizing data transmission following a token-passing approach, thus limiting communication effort with respect to synchronous distributed implementations; furthermore, the tokenpassing phase is implemented via broadcast-only communication, thus avoiding the requirements of point-to-point communication. As shown via simulations, the latter feature is obtained at the cost of a modest increase in data transmission with respect to a traditional point-to-point token-passing scheme.
2020
Asynchronous communication; clustering algorithms; distributed algorithms; token networks
File in questo prodotto:
File Dimensione Formato  
20.500.12610-10239.pdf

non disponibili

Tipologia: Versione Editoriale (PDF)
Licenza: Copyright dell'editore
Dimensione 1.73 MB
Formato Adobe PDF
1.73 MB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.12610/10239
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 6
  • ???jsp.display-item.citation.isi??? 4
social impact