Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Self-stabilizing distributed spanning tree and leader election algorithm
ACIS International Journal of Computer & Information Science - Special issue on software engineering applied to networking & parallel/distributed computing
A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Self-Stabilization in Self-Organized Multihop Wireless Networks
ICDCSW '05 Proceedings of the Second International Workshop on Wireless Ad Hoc Networking - Volume 09
A Hierarchical Leader Election Protocol for Mobile Ad Hoc Networks
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Self-Stabilizing Leader Election in Optimal Space
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Self-Stabilizing Construction of Bounded Size Clusters
ISPA '08 Proceedings of the 2008 IEEE International Symposium on Parallel and Distributed Processing with Applications
Robust self-stabilizing weight-based clustering algorithm
Theoretical Computer Science
Self-Stabilizing Clustering Algorithm for Ad Hoc Networks
ICWMC '09 Proceedings of the 2009 Fifth International Conference on Wireless and Mobile Communications
A Self-Stabilizing O(n)-Round k-Clustering Algorithm
SRDS '09 Proceedings of the 2009 28th IEEE International Symposium on Reliable Distributed Systems
A self-stabilizing k-clustering algorithm for weighted graphs
Journal of Parallel and Distributed Computing
Self-stabilizing minimum degree spanning tree within one from the optimal degree
Journal of Parallel and Distributed Computing
Self-stabilizing weight-based clustering algorithm for ad hoc sensor networks
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
| Hi-index | 0.00 |
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.