World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.
Special Issue – Advances in Parallel and Distributed Computational ModelsNo Access

AN ADAPTIVE RANDOM WALK BASED DISTRIBUTED CLUSTERING ALGORITHM

    https://doi.org/10.1142/S0129054112400370Cited by:3 (Source: Crossref)

    In this paper, we present a fully distributed random walk based clustering algorithm intended to work on dynamic networks of arbitrary topologies.

    A bounded-size core is built through a random walks based procedure. Its neighboring nodes that do not belong to any cluster are recruited by the core as ordinary nodes. Using cores allow us to formulate constraints on the clustering and fulfill them on any topology.

    The correctness and termination of our algorithm are proven. We also prove that when two clusters are adjacent, at least one of them has a complete core (i.e. a core with the maximum size allowed by the parameter).

    One of the important advantages of our mobility-adaptive algorithm is that the re-clustering is local: the management of the connections or disconnections of links and reorganization of nodes affect only the clusters in which they are, possibly adjacent clusters, and at worst, the ordinary nodes of the clusters adjacent to the neighboring clusters. This allows us to bound the diameter of the portion of the network that is affected by a topological change.