Managing clusters among distributed dynamic environments

We propose a fully decentralized algorithm that constructs and maintains clusters over a network. This algorithm maintains a stable size within the clusters among a network subject to frequent connection and disconnection. We use the notion of a circulating token that collects data (called a circulating word). This token moves according to a random walk scheme. The aim of the algorithm is to adapt solutions that use random walks and circulating words to large scale networks.