A Self-Stabilizing (k,r)-Clustering Algorithm With Multiple Paths for Wireless Ad-Hoc Networks

Wireless Ad-hoc networks are distributed systems that often reside in error-prone environments. Self-stabilization lets the system recover autonomously from an arbitrary state, making the system recover from errors and temporarily broken assumptions. Clustering nodes within ad-hoc networks can help forming backbones, facilitating routing, improving scaling, aggregating information, saving power and much more. The authors present the first self-stabilizing distributed (k,r)-clustering algorithm. A (k,r)-clustering assigns k cluster heads within r communication hops for all nodes in the network while trying to minimize the total number of cluster heads.

Provided by: Chalmers University of Technology Topic: Mobility Date Added: Nov 2011 Format: PDF

Find By Topic