Accueil > Résultats de la recherche > Suite de la publication

Comparison Between Self-Stabilizing Clustering Algorithms in Message-Passing Model

Most Ad Hoc networks use diffusion to communicate. This approach requires many messages and may cause network saturation. To optimize these communications, one solution consists in structuring networks into clusters. In this paper, we present a new self-stabilizing asynchronous distributed algorithm based on message-passing model. We compare the proposed algorithm with one of the best existing solutions based on message-passing model. Our approach does not require any initialization and builds non-overlapping k-hops clusters. 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. A legal configuration is reached after at most n + 2 transitions and uses at most n*log(2n+k+3) memory space, where n is the number of network nodes. Using the OMNeT++ simulator, we performed an evaluation of the proposed algorithm to notably show that we use fewer messages and stabilizing time is better.

Auteur(s) : Mandicou BA, Olivier Flauzac, Rafik Makhloufi, Florent Nolot et Ibrahima Niang
Pages : 27–32
Année de publication : 2013
Revue : In Proceedings of the 9th International Conference on Autonomic and Autonomous Systems
Type : Article
Statut Editorial : Abstracté et Indéxé
Mise en ligne par : BA Mandicou