KHOPCA clustering algorithm

KHOPCA is a clustering algorithm designed for dynamic networks. Although, applicable in a wider range for scenarios, its primary target is to provide a fully distributed and localized approach to group elements according their distance to each other. KHOPCA (k-hop clustering algorithm) operates proactively through a simple set of rules that defines clusters with variable k-hops.

Set of rules

The set of rules

Inspired by Conway’s “Game of Life” [16], we thought on dealing with a spatially organized ad hoc network as a kind of cellular automata, not using a grid but a graph as underlying topology. In order to completely avoid multi-hop broadcasting for cluster formation, the idea was to create a set of rules that describes the transition between the state of a node solely depending on the current state of it neighbors. Each node is continuously involved in the process of ݇-hop cluster formation and cluster maintenance. KHOPCA does not require any predetermined initial configuration. A node can potentially choose any role, i.e. weight ݓூ , in the beginning as well as at any time.

KHOPCA (k-hop clustering algorithm) operates proactively through a simple set of rules that defines clusters with variable k-hops.