Home // ICAS 2013, The Ninth International Conference on Autonomic and Autonomous Systems // View article

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

Authors:
Mandicou Ba
Olivier Flauzac
Rafik Makhloufi
Florent Nolot
Ibrahima Niang

Keywords: ad hoc networks; clustering; distributed algorithms;self-stabilizing; OMNeT++ simulator

Abstract:
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.

Pages: 27 to 32

Copyright: Copyright (c) IARIA, 2013

Publication date: March 24, 2013

Published in: conference

ISSN: 2308-3913

ISBN: 978-1-61208-257-8

Location: Lisbon, Portugal

Dates: from March 24, 2013 to March 29, 2013