Skip to Main content Skip to Navigation
Journal articles

Vers une structuration auto-stabilisante des réseaux Ad Hoc

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [32 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Friday, April 8, 2016 - 5:11:08 PM
Last modification on : Thursday, October 14, 2021 - 1:10:05 PM
Long-term archiving on: : Tuesday, November 15, 2016 - 12:15:19 AM


Publisher files allowed on an open archive




Mandicou Ba, Olivier Flauzac, Bachar Salim Haggar, Rafik Makhloufi, Florent Nolot, et al.. Vers une structuration auto-stabilisante des réseaux Ad Hoc. Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées, INRIA, 2014, Volume 17 - 2014 - Special issue CARI'12, pp.119-140. ⟨10.46298/arima.1970⟩. ⟨tel-01128279v2⟩



Record views


Files downloads