Robust self-stabilizing weight-based clustering algorithm

DOI10.1016/j.tcs.2008.10.009zbMath1157.68072MaRDI QIDQ1004321

Colette Johnen, Le Huy Nguyen

Publication date: 2 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.10.009

zbMATH Keywords

robustness; distributed algorithm; self-stabilization; ad hoc networking; weight-based clustering

Mathematics Subject Classification ID

68W20: Randomized algorithms

68W15: Distributed algorithms

Related Items

AN ADAPTIVE RANDOM WALK BASED DISTRIBUTED CLUSTERING ALGORITHM, RANDOMIZED SELF-STABILIZING LEADER ELECTION IN PREFERENCE-BASED ANONYMOUS TREES, A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs, A self-stabilizing \(k\)-clustering algorithm for weighted graphs, An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs, Timer-based composition of fault-containing self-stabilizing protocols, Self-stabilizing distributed algorithm for local mutual inclusion, A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs

Cites Work

• Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
• Distributed Computing - IWDC 2003
• Unnamed Item