Authors: Mandicou Ba ¹; Olivier Flauzac ¹; Bachar Salim Haggar ¹; Rafik MAKHLOUFI ; Florent Nolot ¹; Ibrahima Niang ²

• 1 Centre de Recherche en Sciences et Technologies de l'Information et de la Communication - EA 3804 [CRESTIC]
• 2 Laboratoire d'Informatique de Dakar

In this paper, we present a self-stabilizing asynchronous distributed clustering algorithm that builds non-overlapping k-hops clusters. Our approach does not require any initialization. It is based only on information from neighboring nodes with periodic messages exchange. Starting from an arbitrary configuration, the network converges to a stable state after a finite number of steps. Firstly, we prove that the stabilization is reached after at most n+2 transitions and requires (u+1)* log(2n+k+3) bits per node, whereΔu represents node's degree, n is the number of network nodes and k represents the maximum hops number. Secondly, using OMNet++ simulator, we performed an evaluation of our proposed algorithm.