Self-Stabilizing Clustering Algorithm for Ad Hoc Networks

An ad hoc network is a local network that is built spontaneously as devices connect. Instead of relying on a base station or the centralized device, to coordinate the flow of messages to each node in the network, the individual network nodes forward packets to and from each other. So finding a route to a destination can be complexe. The clustering problem consists to partition the network into groups of nodes called clusters. In this paper, we present a self-stabilizing clustering algorithm for ad hoc networks. From any configuration, our algorithm guarantees the network is partitioned in at most D + 2 rounds, where D is the diameter of the network.