Self-Stabilizing k-hops Clustering Algorithm for Wireless Ad Hoc Networks.
Most Ad Hoc networks use communications based on dif- fusion that are typically expensive and may cause network saturation. In order to optimize these communications, one approach is to structure networks into clusters. In this pa- per, we present a self-stabilizing asynchronous distributed 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 mes- sages exchange. 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 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. Us- ing the OMNeT++ simulator, we performed an evaluation of the proposed algorithm.
Auteur(s) : Mandicou BA, Olivier Flauzac, Bachar Salim Haggar, Florent Nolot et Ibrahima Niang
Pages : 38 :1–38 :10
Année de publication : 2013
Revue : 7th ACM International Conference on Ubiquitous Information Management and Communication (ACM IMCOM 2013)
Type : Article
Statut Editorial : Abstracté et Indéxé
Mise en ligne par : BA Mandicou