CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Self-stabilizing (k,r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths

Andreas Larsson (Institutionen för data- och informationsteknik, Nätverk och system, Datakommunikation och distribuerade system (Chalmers)) ; Philippas Tsigas (Institutionen för data- och informationsteknik, Nätverk och system, Datakommunikation och distribuerade system (Chalmers))
Lecture Notes in Computer Science. 14th International Conference on Principles of Distributed Systems, OPODIS 2010, Tozeur, 14-17 December 2010 (0302-9743). Vol. 6490 (2010), p. 79-82.
[Konferensbidrag, refereegranskat]

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 in many ways like forming backbones, facilitating routing, improving scaling, aggregating information and saving power. A (k,r)-clustering assigns cluster heads so that exists k cluster heads within r communication hops for all nodes in the network while trying to minimize the total number of cluster heads. We present the first self-stabilizing distributed (k,r)-clustering algorithm. The algorithm uses synchronous communication rounds and uses multiple paths to different cluster heads for providing improved security, availability and fault tolerance. From any starting configuration the algorithm quickly assigns enough cluster heads and stabilizes towards a local minimum using a randomized scheme.

Nyckelord: Clustering, Self-Stabilization, Ad-hoc Networks



Denna post skapades 2010-12-22. Senast ändrad 2012-02-15.
CPL Pubid: 131749

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)