Multicluster, mobile, multimedia radio network
Wireless Networks
K-clustering in wireless ad hoc networks
Proceedings of the second ACM international workshop on Principles of mobile computing
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Self-Stabilization in Self-Organized Multihop Wireless Networks
ICDCSW '05 Proceedings of the Second International Workshop on Wireless Ad Hoc Networking - Volume 09
A Self-stabilizing Link-Cluster Algorithm in Mobile Ad Hoc Networks
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Route preserving stabilization
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
A self-stabilizing minimal dominating set algorithm with safe convergence
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
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
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
A stable clustering algorithm for mobile ad hoc networks based on attractor selection
Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems
| Hi-index | 0.00 |
Ad hoc networks consist of wireless hosts that communicate with each other in the absence of a fixed infrastructure. Such networks cannot rely on centralized and organized network management. The clustering problem consists in partitioning network nodes into groups called clusters, giving a hierarchical organization of the network. A self-stabilizing algorithm, regardless of the initial system configuration, converges to legitimates configurations without external intervention. Due to this property, self-stabilizing algorithms tolerate transient faults. In this paper we present a robust self-stabilizing clustering algorithm for ad hoc network. The robustness property guarantees that, starting from an arbitrary configuration, in one round, network is partitioned into clusters. After that, the network stays partitioned during the convergence phase toward a legitimate configuration where the clusters partition ensures that any neighborhood has at most k clusterheads (k is a given parameter).