2013 · 15 citations · 9 references
ComputingComputer ScienceAlgorithmsComputer NetworksDistributed SystemsAd Hoc Mobile NetworksCluster ArchitectureDistributed ComputingMobile Ad Hoc NetworksSelf-stabilizing SystemsAd Hoc NetworkingAd Hoc NetworksMemory SpaceSaturationSelf-stabilizing Distributed AlgorithmsSelf-stabilizing Protocols
Most Ad Hoc networks use communications based on diffusion 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 paper, 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 messages 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. Using the OMNeT++ simulator, we performed an evaluation of the proposed algorithm.
9
Self-stabilizing systems in spite of distributed control
Edsger W. Dijkstra · Communications of the ACM · 1974 · 2.1K citations · Full text
Self-organization in large scale ad hoc networks
Nathalie Mitton, Anthony Busson, Éric Fleury · 2004 · 52 citations · Full text