Skip to Main content Skip to Navigation
Conference papers

Clustering auto-stabilisant à k sauts dans les réseaux Ad Hoc

Abstract : Ad hoc networks offer many applications areas because of their easy of deployment. Communication that takes place by diffusion is typically expensive and may cause network saturation. To optimize these communications, one approach is to structure the network into clusters. In this paper, we present a self-stabilizing asynchronous distributed algorithm that builds k-hops clusters. Our approach does not require any initialization. It is based only on information from neighboring nodes with periodic exchange of messages. Starting from an arbitrary configuration, the network converges to a stable state after a finite number of steps. We prove that the stabilization is reached at most n + 2 transitions and uses at most n ∗ log(2n + k + 3) space, where n is the number of network nodes. Using the Omnet++ simulator, we performed an evaluation of our approach.
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
Contributor : Nicolas Gouvy Connect in order to contact the contributor
Submitted on : Wednesday, January 23, 2013 - 3:16:04 PM
Last modification on : Thursday, October 14, 2021 - 1:10:05 PM
Long-term archiving on: : Wednesday, April 24, 2013 - 3:56:19 AM


Files produced by the author(s)


  • HAL Id : hal-00780227, version 1



Mandicou Ba, Olivier Flauzac, Haggar Bachar Salim, Florent Nolot, Ibrahima Niang. Clustering auto-stabilisant à k sauts dans les réseaux Ad Hoc. 9ème édition de la conférence MAnifestation des JEunes Chercheurs en Sciences et Technologies de l'Information et de la Communication - MajecSTIC 2012 (2012), Nicolas Gouvy, Oct 2012, Villeneuve d'Ascq, France. ⟨hal-00780227⟩



Record views


Files downloads